Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Borodin, Allan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
Norman Huang
,
Allan Borodin
Lecture Notes in Computer Science
8889
, 2014, pp. 528-539
On sum coloring and sum multi-coloring for restricted families of graphs
Allan Borodin
,
Ioana Ivan
,
Yuli Ye
,
Bryce Zimny
Theoretical Computer Science
418
, 2012, pp. 1-13
Randomized priority algorithms
Spyros Angelopoulos
,
Allan Borodin
Theoretical Computer Science
411
(26-28), 2010, pp. 2542-2558
Priority algorithms for graph optimization problems
Allan Borodin
,
Joan Boyar
,
Kim S. Larsen
,
Nazanin Mirmohammadi
Theoretical Computer Science
411
(1), 2010, pp. 239-258
On the limitations of greedy mechanism design for truthful combinatorial auctions
Allan Borodin
,
Brendan Lucier
Lecture Notes in Computer Science
6198
, 2010, pp. 90-101
Elimination graphs
Yuli Ye
,
Allan Borodin
Lecture Notes in Computer Science
5555
, 2009, pp. 774-785
Priority algorithms for the subset-sum problem
Yuli Ye
,
Allan Borodin
Lecture Notes in Computer Science
4598
, 2007, pp. 504-514
Priority algorithms for graph optimization problems
Allan Borodin
,
Joan Boyar
,
Kim S. Larsen
Lecture Notes in Computer Science
3351
, 2005, pp. 126-139
How well can primal-dual and local-ratio algorithms perform?
Allan Borodin
,
David Cashman
,
Avner Magen
Lecture Notes in Computer Science
3580
, 2005, pp. 943-955
Towards a theory of algorithms
Allan Borodin
Lecture Notes in Computer Science
3608
, 2005, pp. 1-1
The power of priority algorithms for facility location and set cover
Spyros Angelopoulos
,
Allan Borodin
Algorithmica
40
(4), 2004, pp. 271-291
(Incremental) priority algorithms
Allan Borodin
,
Morten N. Nielsen
,
Charles Rackoff
Algorithmica
37
(4), 2003, pp. 295-326
Perturbation of the hyper-linked environment
Hyun Chul Lee
,
Allan Borodin
Lecture Notes in Computer Science
2697
, 2003, pp. 272-283
Adversarial queuing theory
Allan Borodin
,
Jon Kleinberg
,
Prabhakar Raghavan
,
Madhu Sudan
,
David P. Williamson
Journal of the ACM
48
(1), 2001, pp. 13-38
On randomization in on-line computation
Allan Borodin
,
Ran El-Yaniv
Information and Computation
150
(2), 1999, pp. 244-267
Lower bounds for high dimensional nearest neigbor search and related problems
Allan Borodin
,
Rafail Ostrovsky
,
Yuval Rabani
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 312-321
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
Allan Borodin
,
Rafail Ostrovsky
,
Yuval Rabani
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 435-444
A time-space tradeoff for undirected graph traversal by walking automata
Paul Beame
,
Allan Borodin
,
Prabhakar Raghavan
,
Walter L. Ruzzo
,
Martin Tompa
SIAM Journal on Computing
28
(3), 1998-1999, pp. 1051-1072
Online computation and competitive analysis
Allan Borodin
,
Ran El-Yaniv
Buch, 1998, pp. xviii, 414
On randomization in online computation
Allan Borodin
,
Ran El-Yaniv
Proceedings of the 12th Annual IEEE Conference on Computational Complexity (Ulm, Germany, June 24-27, 1997)
, 1997, pp. 226-238
Deterministic many-to-many hot potato routing
Allan Borodin
,
Yuval Rabani
,
Baruch Schieber
IEEE Transactions on Parallel and Distributed Systems
8
(6), 1997, pp. 587-596
How much can hardware help routing?
Allan Borodin
,
Prabhakar Raghavan
,
Baruch Schieber
,
Eli Upfal
Journal of the ACM
44
(5), 1997, pp. 726-741
Time-space tradeoffs for undirected graph traversal by graph automata
Paul Beame
,
Allan Borodin
,
Prabhakar Raghavan
,
Walter L. Ruzzo
,
Martin Tompa
Information and Computation
130
(2), 1996, pp. 101-129
Adversarial queueing theory
Allan Borodin
,
Jon Kleinberg
,
Prabhakar Raghavan
,
Madhu Sudan
,
David P. Williamson
Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 376-385
Competitive paging with locality of reference
Allan Borodin
,
Sandy Irani
,
Prabhakar Raghavan
,
Baruch Schieber
Journal of Computer and System Sciences
50
(2), 1995, pp. 244-258
Seiten 1
2
>