dblp.uni-trier.dewww.uni-trier.de

Amos Korman Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
38EEYuval Emek, Amos Korman: New Bounds for the Controller Problem. DISC 2009: 22-34
37EEYuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: Online Computation with Advice. ICALP (1) 2009: 427-438
36EEAmos Korman: Compact Routing Schemes for Dynamic Trees in the Fixed Port Model. ICDCN 2009: 218-229
35EEYuval Emek, Amos Korman: Brief announcement: new bounds for the controller problem. PODC 2009: 340-341
34EEPierre Fraigniaud, Amos Korman: On randomized representations of graphs using short labels. SPAA 2009: 131-137
33EEReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009)
32EEYuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: On the Additive Constant of the k-server Work Function Algorithm CoRR abs/0902.1378: (2009)
31EEPierre Fraigniaud, Amos Korman: Compact Ancestry Labeling Schemes for Trees of Small Depth CoRR abs/0902.3081: (2009)
30EEYuval Emek, Amos Korman, Yuval Shavitt: Computing the Expected Values of some Properties of Randomly Weighted Graphs CoRR abs/0908.0968: (2009)
29EEPierre Fraigniaud, Amos Korman: An Optimal Labeling Scheme for Ancestry Queries CoRR abs/0909.2733: (2009)
28EEAmos Korman, Shay Kutten: A note on models for graph representations. Theor. Comput. Sci. 410(14): 1401-1412 (2009)
2008
27EEAmos Korman: Improved compact routing schemes for dynamic trees. PODC 2008: 185-194
26EEAmos Korman, David Peleg: Dynamic routing schemes for graphs with low local density. ACM Transactions on Algorithms 4(4): (2008)
25EEReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms 4(4): (2008)
24EEAmos Korman, David Peleg: Compact separator decompositions in dynamic trees and applications to labeling schemes. Distributed Computing 21(2): 141-161 (2008)
2007
23EEAmos Korman, David Peleg: Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes. DISC 2007: 313-327
22EEAmos Korman: Labeling Schemes for Vertex Connectivity. ICALP 2007: 102-109
21EEAmos Korman, Shay Kutten: Controller and estimator for dynamic networks. PODC 2007: 175-184
20EEAmos Korman, Shay Kutten: Labeling Schemes with Queries. SIROCCO 2007: 109-123
19EEPierre Fraigniaud, Amos Korman, Emmanuelle Lebhar: Local MST computation with short advice. SPAA 2007: 154-160
18EEAmos Korman: General compact labeling schemes for dynamic trees. Distributed Computing 20(3): 179-193 (2007)
17EEAmos Korman, Shay Kutten: Distributed verification of minimum spanning trees. Distributed Computing 20(4): 253-266 (2007)
16EEAmos Korman, David Peleg: Labeling schemes for weighted dynamic trees. Inf. Comput. 205(12): 1721-1740 (2007)
2006
15EEAmos Korman, David Peleg: Dynamic Routing Schemes for General Graphs. ICALP (1) 2006: 619-630
14EEAmos Korman, Shay Kutten: On Distributed Verification. ICDCN 2006: 100-114
13EEAmos Korman, David Peleg, Yoav Rodeh: Constructing Labeling Schemes Through Universal Matrices. ISAAC 2006: 409-418
12EEAmos Korman, Shay Kutten: Distributed verification of minimum spanning trees. PODC 2006: 26-34
11EEAmos Korman: General Compact Labeling Schemes for Dynamic Trees CoRR abs/cs/0605141: (2006)
10EEAmos Korman, Shay Kutten: Labeling Schemes with Queries CoRR abs/cs/0609163: (2006)
2005
9EEAmos Korman: General Compact Labeling Schemes for Dynamic Trees. DISC 2005: 457-471
8EEReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Label-Guided Graph Exploration by a Finite Automaton. ICALP 2005: 335-346
7EEReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. IWDC 2005: 13-24
6EEAmos Korman, Shay Kutten, David Peleg: Proof labeling schemes. PODC 2005: 9-18
2004
5EEMichal Katz, Nir A. Katz, Amos Korman, David Peleg: Labeling Schemes for Flow and Connectivity. SIAM J. Comput. 34(1): 23-40 (2004)
4EEAmos Korman, David Peleg, Yoav Rodeh: Labeling Schemes for Dynamic Tree Networks. Theory Comput. Syst. 37(1): 49-75 (2004)
2003
3EEAmos Korman, David Peleg: Labeling Schemes for Weighted Dynamic Trees. ICALP 2003: 369-383
2002
2EEMichal Katz, Nir A. Katz, Amos Korman, David Peleg: Labeling schemes for flow and connectivity. SODA 2002: 927-936
1EEAmos Korman, David Peleg, Yoav Rodeh: Labeling Schemes for Dynamic Tree Networks. STACS 2002: 76-87

Coauthor Index

1Reuven Cohen [7] [8] [25] [33]
2Yuval Emek [30] [32] [35] [37] [38]
3Pierre Fraigniaud [7] [8] [19] [25] [29] [31] [32] [33] [34] [37]
4David Ilcinkas [7] [8] [25] [33]
5Michal Katz [2] [5]
6Nir A. Katz [2] [5]
7Shay Kutten [6] [10] [12] [14] [17] [20] [21] [28]
8Emmanuelle Lebhar [19]
9David Peleg [1] [2] [3] [4] [5] [6] [7] [8] [13] [15] [16] [23] [24] [25] [26] [33]
10Yoav Rodeh [1] [4] [13]
11Adi Rosén [32] [37]
12Yuval Shavitt [30]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)