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