The SCEAS System
| |||||||

## Search the dblp DataBase
Amos Korman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - Amos Korman, David Peleg
**Labeling Schemes for Weighted Dynamic Trees.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:369-383 [Conf] - Amos Korman, David Peleg
**Dynamic Routing Schemes for General Graphs.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:619-630 [Conf] - Amos Korman, David Peleg, Yoav Rodeh
**Constructing Labeling Schemes Through Universal Matrices.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:409-418 [Conf] - 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] - Amos Korman, Shay Kutten
**Distributed verification of minimum spanning trees.**[Citation Graph (0, 0)][DBLP] PODC, 2006, pp:26-34 [Conf] - Amos Korman, Shay Kutten, David Peleg
**Proof labeling schemes.**[Citation Graph (0, 0)][DBLP] PODC, 2005, pp:9-18 [Conf] - 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] - Amos Korman, David Peleg, Yoav Rodeh
**Labeling Schemes for Dynamic Tree Networks.**[Citation Graph (0, 0)][DBLP] STACS, 2002, pp:76-87 [Conf] - Amos Korman
**General Compact Labeling Schemes for Dynamic Trees.**[Citation Graph (0, 0)][DBLP] DISC, 2005, pp:457-471 [Conf] - Amos Korman, Shay Kutten
**On Distributed Verification.**[Citation Graph (0, 0)][DBLP] ICDCN, 2006, pp:100-114 [Conf] - 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] - 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] - Amos Korman
**Labeling Schemes for Vertex Connectivity.**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:102-109 [Conf] - Amos Korman, Shay Kutten
**Controller and estimator for dynamic networks.**[Citation Graph (0, 0)][DBLP] PODC, 2007, pp:175-184 [Conf] - Amos Korman, Shay Kutten
**Labeling Schemes with Queries.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2007, pp:109-123 [Conf] - Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
**Local MST computation with short advice.**[Citation Graph (0, 0)][DBLP] SPAA, 2007, pp:154-160 [Conf] - 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] - Amos Korman, Shay Kutten
**Labeling Schemes with Queries**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Amos Korman
**General Compact Labeling Schemes for Dynamic Trees**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **Online Computation with Advice.**[Citation Graph (, )][DBLP]**Improved compact routing schemes for dynamic trees.**[Citation Graph (, )][DBLP]**Brief announcement: new bounds for the controller problem.**[Citation Graph (, )][DBLP]**Efficient threshold detection in a distributed environment: extended abstract.**[Citation Graph (, )][DBLP]**Compact Ancestry Labeling Schemes for XML Trees.**[Citation Graph (, )][DBLP]**On randomized representations of graphs using short labels.**[Citation Graph (, )][DBLP]**An optimal ancestry scheme and small universal posets.**[Citation Graph (, )][DBLP]**On the Additive Constant of the**[Citation Graph (, )][DBLP]*k*-Server Work Function Algorithm.**New Bounds for the Controller Problem.**[Citation Graph (, )][DBLP]**Compact Routing Schemes for Dynamic Trees in the Fixed Port Model.**[Citation Graph (, )][DBLP]**Labeling Schemes for Tree Representation.**[Citation Graph (, )][DBLP]**On the Additive Constant of the k-server Work Function Algorithm**[Citation Graph (, )][DBLP]**Compact Ancestry Labeling Schemes for Trees of Small Depth**[Citation Graph (, )][DBLP]**Computing the Expected Values of some Properties of Randomly Weighted Graphs**[Citation Graph (, )][DBLP]**An Optimal Labeling Scheme for Ancestry Queries**[Citation Graph (, )][DBLP]**General compact labeling schemes for dynamic trees.**[Citation Graph (, )][DBLP]**Distributed verification of minimum spanning trees.**[Citation Graph (, )][DBLP]**Compact separator decompositions in dynamic trees and applications to labeling schemes.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |