Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Amos Korman
2010 – today
- 2013
[j20]Amos Korman, Shay Kutten: Controller and estimator for dynamic networks. Inf. Comput. 223: 43-66 (2013)- [j19]Liah Kor, Amos Korman, David Peleg: Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. Theory Comput. Syst. 53(2): 318-340 (2013)
- [c39]Ofer Feinerman, Amos Korman: Theoretical Distributed Computing Meets Biology: A Review. ICDCIT 2013: 1-18
- [i13]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela: What can be decided locally without identifiers? CoRR abs/1302.2570 (2013)
- 2012
- [j18]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer: Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. 41(5): 1235-1265 (2012)
- [c38]Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman: On the Impact of Identifiers on Local Decision. OPODIS 2012: 224-238
- [c37]Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni: Collaborative search on the plane without communication. PODC 2012: 77-86
- [c36]Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg: Notions of Connectivity in Overlay Networks. SIROCCO 2012: 25-35
- [c35]
- [c34]Ofer Feinerman, Amos Korman: Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology. DISC 2012: 61-75
- [c33]Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg: Randomized Distributed Decision. DISC 2012: 371-385
- [i12]Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni: Collaborative Search on the Plane without Communication. CoRR abs/1205.2170 (2012)
- [i11]Ofer Feinerman, Amos Korman: Memory Lower Bounds for Randomized Collaborative Search and Applications to Biology. CoRR abs/1205.4545 (2012)
- [i10]Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg: Randomized Distributed Decision. CoRR abs/1207.0252 (2012)
- [i9]Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh: Rendezvous of Agents with Different Speeds. CoRR abs/1211.5787 (2012)
- 2011
- [j17]Yuval Emek, Amos Korman: New bounds for the controller problem. Distributed Computing 24(3-4): 177-186 (2011)
- [j16]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: Online computation with advice. Theor. Comput. Sci. 412(24): 2642-2656 (2011)
- [c32]
- [c31]Amos Korman, Jean-Sébastien Sereni, Laurent Viennot: Toward more localized local algorithms: removing assumptions concerning global knowledge. PODC 2011: 49-58
- [c30]Amos Korman, Shay Kutten, Toshimitsu Masuzawa: Fast and compact self stabilizing verification, computation, and fault detection of an MST. PODC 2011: 311-320
- [c29]Yuval Emek, Amos Korman, Yuval Shavitt: Approximating the Statistics of various Properties in Randomly Weighted Graphs. SODA 2011: 1455-1467
- [c28]Liah Kor, Amos Korman, David Peleg: Tight Bounds For Distributed MST Verification. STACS 2011: 69-80
- [c27]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: 363-372
- 2010
- [j15]Amos Korman, David Peleg, Yoav Rodeh: Constructing Labeling Schemes through Universal Matrices. Algorithmica 57(4): 641-652 (2010)
- [j14]Amos Korman, Shay Kutten, David Peleg: Proof labeling schemes. Distributed Computing 22(4): 215-233 (2010)
- [j13]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: On the additive constant of the k-server Work Function Algorithm. Inf. Process. Lett. 110(24): 1120-1123 (2010)
- [j12]Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar: Local MST Computation with Short Advice. Theory Comput. Syst. 47(4): 920-933 (2010)
- [j11]
- [c26]Yuval Emek, Amos Korman: Efficient threshold detection in a distributed environment: extended abstract. PODC 2010: 183-191
- [c25]
- [c24]Pierre Fraigniaud, Amos Korman: An optimal ancestry scheme and small universal posets. STOC 2010: 611-620
- [i8]
- [i7]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 abs/1011.3049 (2010)
2000 – 2009
- 2009
- [j10]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009)
- [j9]Amos Korman, Shay Kutten: A note on models for graph representations. Theor. Comput. Sci. 410(14): 1401-1412 (2009)
- [c23]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: Online Computation with Advice. ICALP (1) 2009: 427-438
- [c22]
- [c21]Yuval Emek, Amos Korman: Brief announcement: new bounds for the controller problem. PODC 2009: 340-341
- [c20]Pierre Fraigniaud, Amos Korman: On randomized representations of graphs using short labels. SPAA 2009: 131-137
- [c19]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: On the Additive Constant of the k-Server Work Function Algorithm. WAOA 2009: 128-134
- [c18]
- [i6]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)
- [i5]Pierre Fraigniaud, Amos Korman: Compact Ancestry Labeling Schemes for Trees of Small Depth. CoRR abs/0902.3081 (2009)
- [i4]Yuval Emek, Amos Korman, Yuval Shavitt: Computing the Expected Values of some Properties of Randomly Weighted Graphs. CoRR abs/0908.0968 (2009)
- [i3]Pierre Fraigniaud, Amos Korman: An Optimal Labeling Scheme for Ancestry Queries. CoRR abs/0909.2733 (2009)
- 2008
- [j8]Amos Korman, David Peleg: Compact separator decompositions in dynamic trees and applications to labeling schemes. Distributed Computing 21(2): 141-161 (2008)
- [j7]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)
- [j6]Amos Korman, David Peleg: Dynamic routing schemes for graphs with low local density. ACM Transactions on Algorithms 4(4) (2008)
- [c17]
- 2007
- [j5]Amos Korman: General compact labeling schemes for dynamic trees. Distributed Computing 20(3): 179-193 (2007)
- [j4]Amos Korman, Shay Kutten: Distributed verification of minimum spanning trees. Distributed Computing 20(4): 253-266 (2007)
- [j3]Amos Korman, David Peleg: Labeling schemes for weighted dynamic trees. Inf. Comput. 205(12): 1721-1740 (2007)
- [c16]
- [c15]
- [c14]
- [c13]Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar: Local MST computation with short advice. SPAA 2007: 154-160
- [c12]Amos Korman, David Peleg: Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes. DISC 2007: 313-327
- 2006
- [c11]
- [c10]
- [c9]Amos Korman, David Peleg, Yoav Rodeh: Constructing Labeling Schemes Through Universal Matrices. ISAAC 2006: 409-418
- [c8]
- [i2]
- [i1]
- 2005
- [c7]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Label-Guided Graph Exploration by a Finite Automaton. ICALP 2005: 335-346
- [c6]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. IWDC 2005: 13-24
- [c5]
- [c4]
- 2004
- [j2]Amos Korman, David Peleg, Yoav Rodeh: Labeling Schemes for Dynamic Tree Networks. Theory Comput. Syst. 37(1): 49-75 (2004)
- [j1]Michal Katz, Nir A. Katz, Amos Korman, David Peleg: Labeling Schemes for Flow and Connectivity. SIAM J. Comput. 34(1): 23-40 (2004)
- 2003
- [c3]
- 2002
- [c2]Michal Katz, Nir A. Katz, Amos Korman, David Peleg: Labeling schemes for flow and connectivity. SODA 2002: 927-936
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 09:46 CEST by the dblp team