|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 50 occurrences of 21 keywords
|
|
|
|
|
Results
Found 57 publication records. Showing 57 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
Online computation with advice.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, Amos Korman |
New bounds for the controller problem.  |
Distributed Computing  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, Amos Korman, Yuval Shavitt |
Approximating the Statistics of various Properties in Randomly Weighted Graphs.  |
SODA  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Liah Kor, Amos Korman, David Peleg |
Tight Bounds For Distributed MST Verification.  |
STACS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, Jean-Sébastien Sereni, Laurent Viennot |
Toward more localized local algorithms: removing assumptions concerning global knowledge.  |
PODC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, Shay Kutten, Toshimitsu Masuzawa |
Fast and compact self stabilizing verification, computation, and fault detection of an MST.  |
PODC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman, David Peleg |
Local Distributed Decision.  |
FOCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer |
Distributed verification and hardness of distributed approximation.  |
STOC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
On the additive constant of the k-server Work Function Algorithm.  |
Inf. Process. Lett.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, David Peleg, Yoav Rodeh |
Constructing Labeling Schemes through Universal Matrices.  |
Algorithmica  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman |
Labeling schemes for vertex connectivity.  |
ACM Transactions on Algorithms  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer |
Distributed Verification and Hardness of Distributed Approximation  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman, David Peleg |
Local Distributed Decision  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar |
Local MST Computation with Short Advice.  |
Theory Comput. Syst.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, Shay Kutten, David Peleg |
Proof labeling schemes.  |
Distributed Computing  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman |
Compact Ancestry Labeling Schemes for XML Trees.  |
SODA  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yuval Emek, Amos Korman |
Efficient threshold detection in a distributed environment: extended abstract.  |
PODC  |
2010 |
DBLP DOI BibTeX RDF |
threshold detection, transmission complexity, message complexity |
| 1 | Pierre Fraigniaud, Amos Korman |
An optimal ancestry scheme and small universal posets.  |
STOC  |
2010 |
DBLP DOI BibTeX RDF |
informative labeling schemes, XML, partially ordered sets |
| 1 | Amos Korman, Shay Kutten |
A note on models for graph representations.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
Labeling Schemes for Tree Representation.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Spanning tree, Labeling scheme, Tree representation |
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
On the Additive Constant of the k-server Work Function Algorithm  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman |
An Optimal Labeling Scheme for Ancestry Queries  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yuval Emek, Amos Korman, Yuval Shavitt |
Computing the Expected Values of some Properties of Randomly Weighted Graphs  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman |
Compact Ancestry Labeling Schemes for Trees of Small Depth  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Amos Korman |
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model.  |
ICDCN  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
Online Computation with Advice.  |
ICALP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, Amos Korman |
New Bounds for the Controller Problem.  |
DISC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Amos Korman |
On randomized representations of graphs using short labels.  |
SPAA  |
2009 |
DBLP DOI BibTeX RDF |
adjacency labeling schemes, ancestry labeling schemes, probabilistic embeddings, universal graphs, distributed algorithms |
| 1 | Yuval Emek, Amos Korman |
Brief announcement: new bounds for the controller problem.  |
PODC  |
2009 |
DBLP DOI BibTeX RDF |
controller, dynamic networks |
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
On the Additive Constant of the k-Server Work Function Algorithm.  |
WAOA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, David Peleg |
Dynamic routing schemes for graphs with low local density.  |
ACM Transactions on Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
distributed algorithms, dynamic networks, Routing schemes |
| 1 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
Label-guided graph exploration by a finite automaton.  |
ACM Transactions on Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
Distributed algorithms, labeling schemes, graph exploration |
| 1 | Amos Korman, David Peleg |
Compact separator decompositions in dynamic trees and applications to labeling schemes.  |
Distributed Computing  |
2008 |
DBLP DOI BibTeX RDF |
Informative labeling schemes, Distributed algorithms, Dynamic networks, Graph decompositions, Routing schemes |
| 1 | Amos Korman |
Improved compact routing schemes for dynamic trees.  |
PODC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, David Peleg |
Labeling schemes for weighted dynamic trees.  |
Inf. Comput.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman |
General compact labeling schemes for dynamic trees.  |
Distributed Computing  |
2007 |
DBLP DOI BibTeX RDF |
Distributed algorithms, Dynamic networks, Labeling schemes, Routing schemes |
| 1 | Amos Korman, Shay Kutten |
Distributed verification of minimum spanning trees.  |
Distributed Computing  |
2007 |
DBLP DOI BibTeX RDF |
Graph property verification, Proof labeling schemes, Self stabilization, Minimum spanning tree, Labeling schemes, Network algorithms |
| 1 | Amos Korman |
Labeling Schemes for Vertex Connectivity.  |
ICALP  |
2007 |
DBLP DOI BibTeX RDF |
Graph algorithms, labeling schemes, vertex-connectivity |
| 1 | Amos Korman, Shay Kutten |
Labeling Schemes with Queries.  |
SIROCCO  |
2007 |
DBLP DOI BibTeX RDF |
distance queries, Labeling schemes, routing schemes |
| 1 | Amos Korman, David Peleg |
Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes.  |
DISC  |
2007 |
DBLP DOI BibTeX RDF |
informative labeling schemes, Distributed algorithms, dynamic networks, graph decompositions, routing schemes |
| 1 | Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar |
Local MST computation with short advice.  |
SPAA  |
2007 |
DBLP DOI BibTeX RDF |
distributed algorithm, minimum spanning tree, local computation |
| 1 | Amos Korman, Shay Kutten |
Controller and estimator for dynamic networks.  |
PODC  |
2007 |
DBLP DOI BibTeX RDF |
distributed algorithms, labeling schemes, asynchronous protocols |
| 1 | Amos Korman |
General Compact Labeling Schemes for Dynamic Trees  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Amos Korman, Shay Kutten |
Labeling Schemes with Queries  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Amos Korman, Shay Kutten |
On Distributed Verification.  |
ICDCN  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, David Peleg |
Dynamic Routing Schemes for General Graphs.  |
ICALP  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, Shay Kutten |
Distributed verification of minimum spanning trees.  |
PODC  |
2006 |
DBLP DOI BibTeX RDF |
graph property verification, proof labeling, distributed algorithms, self stabilization, minimum spanning tree, labeling schemes, network algorithms |
| 1 | Amos Korman, David Peleg, Yoav Rodeh |
Constructing Labeling Schemes Through Universal Matrices.  |
ISAAC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
Labeling Schemes for Tree Representation.  |
IWDC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
Label-Guided Graph Exploration by a Finite Automaton.  |
ICALP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman |
General Compact Labeling Schemes for Dynamic Trees.  |
DISC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, Shay Kutten, David Peleg |
Proof labeling schemes.  |
PODC  |
2005 |
DBLP DOI BibTeX RDF |
proof labels, self stabilization, distributed networks, property verification |
| 1 | Amos Korman, David Peleg, Yoav Rodeh |
Labeling Schemes for Dynamic Tree Networks.  |
Theory Comput. Syst.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Katz, Nir A. Katz, Amos Korman, David Peleg |
Labeling Schemes for Flow and Connectivity.  |
SIAM J. Comput.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, David Peleg |
Labeling Schemes for Weighted Dynamic Trees.  |
ICALP  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Katz, Nir A. Katz, Amos Korman, David Peleg |
Labeling schemes for flow and connectivity.  |
SODA  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Korman, David Peleg, Yoav Rodeh |
Labeling Schemes for Dynamic Tree Networks.  |
STACS  |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #57 of 57 (100 per page; Change: )
|
|