Search the dblp DataBase

Publications of Author

1. Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
   Label-Guided Graph Exploration by a Finite Automaton. [Citation Graph (0, 0)][DBLP]
   ICALP, 2005, pp:335-346 [Conf]
   
2. Amos Korman, David Peleg
   Labeling Schemes for Weighted Dynamic Trees. [Citation Graph (0, 0)][DBLP]
   ICALP, 2003, pp:369-383 [Conf]
   
3. Amos Korman, David Peleg
   Dynamic Routing Schemes for General Graphs. [Citation Graph (0, 0)][DBLP]
   ICALP (1), 2006, pp:619-630 [Conf]
   
4. Amos Korman, David Peleg, Yoav Rodeh
   Constructing Labeling Schemes Through Universal Matrices. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2006, pp:409-418 [Conf]
   
5. Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
   Labeling Schemes for Tree Representation. [Citation Graph (0, 0)][DBLP]
   IWDC, 2005, pp:13-24 [Conf]
   
6. Amos Korman, Shay Kutten
   Distributed verification of minimum spanning trees. [Citation Graph (0, 0)][DBLP]
   PODC, 2006, pp:26-34 [Conf]
   
7. Amos Korman, Shay Kutten, David Peleg
   Proof labeling schemes. [Citation Graph (0, 0)][DBLP]
   PODC, 2005, pp:9-18 [Conf]
   
8. Michal Katz, Nir A. Katz, Amos Korman, David Peleg
   Labeling schemes for flow and connectivity. [Citation Graph (0, 0)][DBLP]
   SODA, 2002, pp:927-936 [Conf]
   
9. Amos Korman, David Peleg, Yoav Rodeh
   Labeling Schemes for Dynamic Tree Networks. [Citation Graph (0, 0)][DBLP]
   STACS, 2002, pp:76-87 [Conf]
   
10. Amos Korman
    General Compact Labeling Schemes for Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:457-471 [Conf]
    
11. Amos Korman, Shay Kutten
    On Distributed Verification. [Citation Graph (0, 0)][DBLP]
    ICDCN, 2006, pp:100-114 [Conf]
    
12. Amos Korman, David Peleg, Yoav Rodeh
    Labeling Schemes for Dynamic Tree Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:49-75 [Journal]
    
13. Michal Katz, Nir A. Katz, Amos Korman, David Peleg
    Labeling Schemes for Flow and Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:23-40 [Journal]
    
14. Amos Korman
    Labeling Schemes for Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:102-109 [Conf]
    
15. Amos Korman, Shay Kutten
    Controller and estimator for dynamic networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:175-184 [Conf]
    
16. Amos Korman, Shay Kutten
    Labeling Schemes with Queries. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:109-123 [Conf]
    
17. Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
    Local MST computation with short advice. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:154-160 [Conf]
    
18. Amos Korman, David Peleg
    Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:313-327 [Conf]
    
19. Amos Korman, Shay Kutten
    Labeling Schemes with Queries [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
20. Amos Korman
    General Compact Labeling Schemes for Dynamic Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
21. 
    Online Computation with Advice. [Citation Graph (, )][DBLP]
    
    
22. 
    Improved compact routing schemes for dynamic trees. [Citation Graph (, )][DBLP]
    
    
23. 
    Brief announcement: new bounds for the controller problem. [Citation Graph (, )][DBLP]
    
    
24. 
    Efficient threshold detection in a distributed environment: extended abstract. [Citation Graph (, )][DBLP]
    
    
25. 
    Compact Ancestry Labeling Schemes for XML Trees. [Citation Graph (, )][DBLP]
    
    
26. 
    On randomized representations of graphs using short labels. [Citation Graph (, )][DBLP]
    
    
27. 
    An optimal ancestry scheme and small universal posets. [Citation Graph (, )][DBLP]
    
    
28. 
    On the Additive Constant of the k-Server Work Function Algorithm. [Citation Graph (, )][DBLP]
    
    
29. 
    New Bounds for the Controller Problem. [Citation Graph (, )][DBLP]
    
    
30. 
    Compact Routing Schemes for Dynamic Trees in the Fixed Port Model. [Citation Graph (, )][DBLP]
    
    
31. 
    Labeling Schemes for Tree Representation. [Citation Graph (, )][DBLP]
    
    
32. 
    On the Additive Constant of the k-server Work Function Algorithm [Citation Graph (, )][DBLP]
    
    
33. 
    Compact Ancestry Labeling Schemes for Trees of Small Depth [Citation Graph (, )][DBLP]
    
    
34. 
    Computing the Expected Values of some Properties of Randomly Weighted Graphs [Citation Graph (, )][DBLP]
    
    
35. 
    An Optimal Labeling Scheme for Ancestry Queries [Citation Graph (, )][DBLP]
    
    
36. 
    General compact labeling schemes for dynamic trees. [Citation Graph (, )][DBLP]
    
    
37. 
    Distributed verification of minimum spanning trees. [Citation Graph (, )][DBLP]
    
    
38. 
    Compact separator decompositions in dynamic trees and applications to labeling schemes. [Citation Graph (, )][DBLP]