default search action
Amos Korman
- > Home > Persons > Amos Korman
Publications
- 2019
- [j32]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel Bayesian Search with No Coordination. J. ACM 66(3): 17:1-17:28 (2019) - 2016
- [j26]Pierre Fraigniaud, Amos Korman:
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. J. ACM 63(1): 6:1-6:31 (2016) - [c44]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel exhaustive search without coordination. STOC 2016: 312-323 - [i25]Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg, Yuval Emek:
Notions of Connectivity in Overlay Networks. CoRR abs/1601.01104 (2016) - [i21]Pierre Fraigniaud, Amos Korman:
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. CoRR abs/1611.02589 (2016) - 2015
- [i19]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel Exhaustive Search without Coordination. CoRR abs/1511.00486 (2015) - [i16]Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman:
On the Impact of Identifiers on Local Decision. CoRR abs/1512.06989 (2015) - 2014
- [j24]Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg:
Randomized distributed decision. Distributed Comput. 27(6): 419-434 (2014) - 2013
- [j20]Pierre Fraigniaud, Amos Korman, David Peleg:
Towards a complexity theory for local distributed computing. J. ACM 60(5): 35:1-35:26 (2013) - [c39]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela:
What can be decided locally without identifiers? PODC 2013: 157-165 - [i14]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela:
What can be decided locally without identifiers? CoRR abs/1302.2570 (2013) - 2012
- [c38]Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman:
On the Impact of Identifiers on Local Decision. OPODIS 2012: 224-238 - [c36]Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg:
Notions of Connectivity in Overlay Networks. SIROCCO 2012: 25-35 - [c33]Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg:
Randomized Distributed Decision. DISC 2012: 371-385 - [i10]Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg:
Randomized Distributed Decision. CoRR abs/1207.0252 (2012) - 2011
- [j16]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
Online computation with advice. Theor. Comput. Sci. 412(24): 2642-2656 (2011) - [c32]Pierre Fraigniaud, Amos Korman, David Peleg:
Local Distributed Decision. FOCS 2011: 708-717 - 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) - [c25]Pierre Fraigniaud, Amos Korman:
Compact Ancestry Labeling Schemes for XML Trees. SODA 2010: 458-466 - [c24]Pierre Fraigniaud, Amos Korman:
An optimal ancestry scheme and small universal posets. STOC 2010: 611-620 - [i8]Pierre Fraigniaud, Amos Korman, David Peleg:
Local Distributed Decision. CoRR abs/1011.2152 (2010) - 2009
- [j10]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009) - [c23]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
Online Computation with Advice. ICALP (1) 2009: 427-438 - [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 - [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) - [i3]Pierre Fraigniaud, Amos Korman:
An Optimal Labeling Scheme for Ancestry Queries. CoRR abs/0909.2733 (2009) - 2008
- [j6]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms 4(4): 42:1-42:18 (2008) - 2007
- [c13]Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar:
Local MST computation with short advice. SPAA 2007: 154-160 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint