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
[2]
Hilfe
Suche: Author="Korman, Amos"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Towards a complexity theory for local distributed computing
Pierre Fraigniaud
,
Amos Korman
,
David Peleg
Journal of the ACM
60
(5), 2013, pp. 35: 1-26
Tight bounds for distributed minimum-weight spanning tree verification
Liah Kor
,
Amos Korman
,
David Peleg
Theory of Computing Systems
53
(2), 2013, pp. 318-340
Controller and estimator for dynamic networks
Amos Korman
,
Shay Kutten
Information and Computation
223
, 2013, pp. 43-66
Distributed verification and hardness of distributed approximation
Atish Das Sarma
,
Stephan Holzer
,
Liah Kor
,
Amos Korman
,
Danupon Nanongkai
,
Gopal Pandurangan
,
David Peleg
,
Roger Wattenhofer
SIAM Journal on Computing
41
(5), 2012, pp. 1235-1265
Online computation with advice
Yuval Emek
,
Pierre Fraigniaud
,
Amos Korman
,
Adi Rosén
Theoretical Computer Science
412
(24), 2011, pp. 2642-2656
Tight bounds for distributed MST verification
Liah Kor
,
Amos Korman
,
David Peleg
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 69-80
Distributed verification and hardness of distributed approximation
Atish Das Sarma
,
Stephan Holzer
,
Liah Kor
,
Amos Korman
,
Danupon Nanongkai
,
Gopal Pandurangan
,
David Peleg
,
Roger Wattenhofer
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 363-372
On the additive constant of the
k
-server Work Function Algorithm
Yuval Emek
,
Pierre Fraigniaud
,
Amos Korman
,
Adi Rosén
Information Processing Letters
110
(24), 2010, pp. 1120-1123
Local MST computation with short advice
Pierre Fraigniaud
,
Amos Korman
,
Emmanuelle Lebhar
Theory of Computing Systems
47
(4), 2010, pp. 920-933
An optimal ancestry scheme and small universal posets
Pierre Fraigniaud
,
Amos Korman
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 611-619
Constructing labeling schemes through universal matrices
Amos Korman
,
David Peleg
,
Yoav Rodeh
Algorithmica
57
(4), 2010, pp. 641-652
Labeling schemes for tree representation
Reuven Cohen
,
Pierre Fraigniaud
,
David Ilcinkas
,
Amos Korman
,
David Peleg
Algorithmica
53
(1), 2009, pp. 1-15
Online computation with advice
Yuval Emek
,
Pierre Fraigniaud
,
Amos Korman
,
Adi Rosén
Lecture Notes in Computer Science
5555
, 2009, pp. 427-438
On randomized representations of graphs using short labels
Pierre Fraigniaud
,
Amos Korman
Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2009 (Calgary, Alberta, Canada, August 11-13, 2009)
, 2009, pp. 131-137
A note on models for graph representations
Amos Korman
,
Shay Kutten
Theoretical Computer Science
410
(14), 2009, pp. 1401-1412
Local MST computation with short advice
Pierre Fraigniaud
,
Amos Korman
,
Emmanuelle Lebhar
Proceedings of the 19th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2007 (San Diego, CA, USA, June 9-11, 2007)
, 2007, pp. 154-160
Labeling schemes for weighted dynamic trees
Amos Korman
,
David Peleg
Information and Computation
205
(12), 2007, pp. 1721-1740
Labeling schemes for vertex connectivity
Amos Korman
Lecture Notes in Computer Science
4596
, 2007, pp. 102-109
Constructing labeling schemes through universal matrices
Amos Korman
,
David Peleg
,
Yoav Rodeh
Lecture Notes in Computer Science
4288
, 2006, pp. 409-418
Dynamic routing schemes for general graphs
Amos Korman
,
David Peleg
Lecture Notes in Computer Science
4051
, 2006, pp. 619-630
Label-guided graph exploration by a finite automaton
Reuven Cohen
,
Pierre Fraigniaud
,
David Ilcinkas
,
Amos Korman
,
David Peleg
Lecture Notes in Computer Science
3580
, 2005, pp. 335-346
Labeling schemes for flow and connectivity
Michal Katz
,
Nir A. Katz
,
Amos Korman
,
David Peleg
SIAM Journal on Computing
34
(1), 2004, pp. 23-40
Labeling schemes for dynamic tree networks
Amos Korman
,
David Peleg
,
Yoav Rodeh
Theory of Computing Systems
37
(1), 2004, pp. 49-75
Labeling schemes for weighted dynamic trees
Amos Korman
,
David Peleg
Lecture Notes in Computer Science
2719
, 2003, pp. 369-383
Labeling schemes for dynamic tree networks
Amos Korman
,
David Peleg
,
Yoav Rodeh
Lecture Notes in Computer Science
2285
, 2002, pp. 76-87