default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmos Korman
Person information
- affiliation: French-Israeli Laboratory on Foundations of Computer Science (FILOFOCS), Tel-Aviv, Israel
- affiliation (PhD 2005): Weizmann Institute of Science, Rehovot, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j38]Amos Korman
, Robin Vacus:
Early adapting to trends: self-stabilizing information spread using passive communication. Distributed Comput. 37(4): 335-362 (2024)- 2023
- [j37]Amos Korman, Robin Vacus:
Distributed Alignment Processes With Samples of Group Average. IEEE Trans. Control. Netw. Syst. 10(2): 960-971 (2023) - [c56]Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus:
On the Role of Memory in Robust Opinion Dynamics. IJCAI 2023: 29-37 - [i41]Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus:
On the Role of Memory in Robust Opinion Dynamics. CoRR abs/2302.08600 (2023) - [i40]Robin Vacus, Amos Korman:
Enhanced Food Availability can Deteriorate Fitness through Excessive Scrounging. CoRR abs/2307.04920 (2023) - 2022
- [c55]Amos Korman, Robin Vacus:
Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication. PODC 2022: 235-245 - [i39]Amos Korman, Robin Vacus:
Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication. CoRR abs/2203.11522 (2022) - 2021
- [j36]Oran Ayalon, Yigal Sternklar, Ehud Fonio, Amos Korman, Nir S. Gov, Ofer Feinerman:
Sequential Decision-Making in Ants and Implications to the Evidence Accumulation Decision Model. Frontiers Appl. Math. Stat. 7: 672773 (2021) - [j35]Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh:
Navigating in Trees with Permanently Noisy Advice. ACM Trans. Algorithms 17(2): 15:1-15:27 (2021) - [i38]Amos Korman, Robin Vacus:
Stochastic Alignment Processes. CoRR abs/2102.00710 (2021) - [i37]Amos Korman, Pierluigi Crescenzi:
Public Communication can Facilitate Low-Risk Coordination under Surveillance. CoRR abs/2105.02093 (2021) - [i36]Amos Korman, Robin Vacus:
On the Role of Hypocrisy in Escaping the Tragedy of the Commons. CoRR abs/2106.15942 (2021) - 2020
- [j34]Amos Korman, Yoav Rodeh:
Multi-round cooperative search games with multiple players. J. Comput. Syst. Sci. 113: 125-149 (2020) - [c54]Brieuc Guinard, Amos Korman:
Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. STACS 2020: 28:1-28:14 - [i35]Brieuc Guinard, Amos Korman:
Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. CoRR abs/2002.05443 (2020) - [i34]Brieuc Guinard, Amos Korman:
The Search Efficiency of Intermittent Lévy walks Optimally Scales with Target Size. CoRR abs/2003.13041 (2020) - [i33]Amos Korman, Yuval Emek, Simon Collet, Aya Goldshtein, Yossi Yovel:
Exploitation of Multiple Replenishing Resources with Uncertainty. CoRR abs/2007.09640 (2020)
2010 – 2019
- 2019
- [j33]Lucas Boczkowski, Amos Korman, Emanuele Natale:
Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits. Distributed Comput. 32(3): 173-191 (2019) - [j32]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel Bayesian Search with No Coordination. J. ACM 66(3): 17:1-17:28 (2019) - [c53]Amos Korman, Yoav Rodeh:
Multi-Round Cooperative Search Games with Multiple Players. ICALP 2019: 146:1-146:14 - 2018
- [j31]Lucas Boczkowski, Emanuele Natale, Ofer Feinerman, Amos Korman:
Limits on reliable information flows through stochastic populations. PLoS Comput. Biol. 14(6) (2018) - [j30]Amos Korman, Yoav Rodeh:
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. ACM Trans. Algorithms 14(4): 43:1-43:23 (2018) - [c52]Lucas Boczkowski, Amos Korman, Yoav Rodeh:
Searching a Tree with Permanently Noisy Advice. ESA 2018: 54:1-54:13 - [c51]Lucas Boczkowski, Ofer Feinerman, Amos Korman, Emanuele Natale:
Limits for Rumor Spreading in Stochastic Populations. ITCS 2018: 49:1-49:21 - [c50]Lucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker, Marc P. Renault:
Random Walks with Multiple Step Lengths. LATIN 2018: 174-186 - [c49]Simon Collet, Amos Korman:
Intense Competition can Drive Selfish Explorers to Optimize Coverage. SPAA 2018: 183-192 - [i32]Simon Collet, Amos Korman:
Intense Competition can Drive Selfish Explorers to Optimize Coverage. CoRR abs/1805.01319 (2018) - [i31]Amos Korman, Yoav Rodeh:
Cooperative Search Games: Symmetric Equilibria, Robustness, and Price of Anarchy. CoRR abs/1811.01270 (2018) - 2017
- [j29]Ofer Feinerman, Amos Korman:
The ANTS problem. Distributed Comput. 30(3): 149-168 (2017) - [j28]Ofer Feinerman, Bernhard Haeupler, Amos Korman:
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. Distributed Comput. 30(5): 339-355 (2017) - [j27]Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh:
Fast rendezvous on a cycle by agents with different speeds. Theor. Comput. Sci. 688: 77-85 (2017) - [c48]Amos Korman, Yoav Rodeh:
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. ICALP 2017: 81:1-81:13 - [c47]Amos Korman, Yoav Rodeh:
Parallel Search with No Coordination. SIROCCO 2017: 195-211 - [c46]Lucas Boczkowski, Amos Korman, Emanuele Natale:
Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits. SODA 2017: 2540-2559 - [i30]Ofer Feinerman, Amos Korman:
The ANTS problem. CoRR abs/1701.02555 (2017) - [i29]Ofer Feinerman, Amos Korman:
Individual versus collective cognition in social insects. CoRR abs/1701.05080 (2017) - [i28]Amos Korman, Yoav Rodeh:
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. CoRR abs/1704.06096 (2017) - [i27]Amos Korman, Yoav Rodeh:
Parallel Search with no Coordination. CoRR abs/1705.05704 (2017) - [i26]Lucas Boczkowski, Ofer Feinerman, Amos Korman, Emanuele Natale:
Limits for Rumor Spreading in stochastic populations. CoRR abs/1712.08507 (2017) - 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) - [c45]Lucas Boczkowski, Amos Korman, Emanuele Natale:
Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit Messages. PODC 2016: 207-209 - [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) - [i24]Lucas Boczkowski, Amos Korman, Emanuele Natale:
Self-Stabilizing Clock Synchronization with 3-bit messages. CoRR abs/1602.04419 (2016) - [i23]Amos Korman, Yoav Rodeh:
Parallel Linear Search with no Coordination for a Randomly Placed Treasure. CoRR abs/1602.04952 (2016) - [i22]Lucas Boczkowski, Amos Korman, Yoav Rodeh:
Searching on Trees with Noisy Memory. CoRR abs/1611.01403 (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
- [j25]Amos Korman, Shay Kutten, Toshimitsu Masuzawa:
Fast and compact self-stabilizing verification, computation, and fault detection of an MST. Distributed Comput. 28(4): 253-295 (2015) - [c43]Ofer Feinerman, Amos Korman:
Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach. SIROCCO 2015: 16-30 - [e1]Sajal K. Das, Dilip Krishnaswamy, Santonu Karkar, Amos Korman, Mohan J. Kumar, Marius Portmann, Srikanth Sastry:
Proceedings of the 2015 International Conference on Distributed Computing and Networking, ICDCN 2015, Goa, India, January 4-7, 2015. ACM 2015, ISBN 978-1-4503-2928-6 [contents] - [i20]Ofer Feinerman, Amos Korman:
Clock Synchronization and Distributed Estimation in Highly Dynamic Networks: An Information Theoretic Approach. CoRR abs/1504.08247 (2015) - [i19]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel Exhaustive Search without Coordination. CoRR abs/1511.00486 (2015) - [i18]Amos Korman, Jean-Sébastien Sereni, Laurent Viennot:
Toward more localized local algorithms: removing assumptions concerning global knowledge. CoRR abs/1512.03306 (2015) - [i17]Liah Kor, Amos Korman, David Peleg:
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. CoRR abs/1512.04832 (2015) - [i16]Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman:
On the Impact of Identifiers on Local Decision. CoRR abs/1512.06989 (2015) - [i15]Amos Korman, Shay Kutten, Toshimitsu Masuzawa:
Fast and compact self-stabilizing verification, computation, and fault detection of an MST. CoRR abs/1512.07800 (2015) - 2014
- [j24]Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg:
Randomized distributed decision. Distributed Comput. 27(6): 419-434 (2014) - [j23]Amos Korman, Efrat Greenwald, Ofer Feinerman:
Confidence Sharing: An Economic Strategy for Efficient Information Flows in Animal Groups. PLoS Comput. Biol. 10(10) (2014) - [c42]Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh:
Fast Rendezvous on a Cycle by Agents with Different Speeds. ICDCN 2014: 1-13 - [c41]Ofer Feinerman, Bernhard Haeupler, Amos Korman:
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. PODC 2014: 114-123 - 2013
- [j22]Amos Korman, Jean-Sébastien Sereni, Laurent Viennot:
Toward more localized local algorithms: removing assumptions concerning global knowledge. Distributed Comput. 26(5-6): 289-308 (2013) - [j21]Amos Korman, Shay Kutten:
Controller and estimator for dynamic networks. Inf. Comput. 223: 43-66 (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) - [j19]Liah Kor, Amos Korman, David Peleg:
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. Theory Comput. Syst. 53(2): 318-340 (2013) - [c40]Ofer Feinerman, Amos Korman:
Theoretical Distributed Computing Meets Biology: A Review. ICDCIT 2013: 1-18 - [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) - [i13]Ofer Feinerman, Bernhard Haeupler, Amos Korman:
Efficient and Noise-Resilient rumor-spreading in Large, Anonymous Populations. CoRR abs/1311.3425 (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]Amos Korman:
Theoretical distributed computing meets biology. TADDS 2012: 7 - [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 Comput. 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]Pierre Fraigniaud, Amos Korman, David Peleg:
Local Distributed Decision. FOCS 2011: 708-717 - [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 Comput. 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]Amos Korman:
Labeling schemes for vertex connectivity. ACM Trans. Algorithms 6(2): 39:1-39:10 (2010) - [c26]Yuval Emek, Amos Korman:
Efficient threshold detection in a distributed environment: extended abstract. PODC 2010: 183-191 - [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) - [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]Amos Korman:
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model. ICDCN 2009: 218-229 - [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]Yuval Emek, Amos Korman:
New Bounds for the Controller Problem. DISC 2009: 22-34 - [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 Comput. 21(2): 141-161 (2008) - [j7]Amos Korman, David Peleg:
Dynamic routing schemes for graphs with low local density. ACM Trans. Algorithms 4(4): 41:1-41:18 (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) - [c17]Amos Korman:
Improved compact routing schemes for dynamic trees. PODC 2008: 185-194 - 2007
- [j5]Amos Korman:
General compact labeling schemes for dynamic trees. Distributed Comput. 20(3): 179-193 (2007) - [j4]Amos Korman, Shay Kutten:
Distributed verification of minimum spanning trees. Distributed Comput. 20(4): 253-266 (2007) - [j3]Amos Korman, David Peleg:
Labeling schemes for weighted dynamic trees. Inf. Comput. 205(12): 1721-1740 (2007) - [c16]Amos Korman:
Labeling Schemes for Vertex Connectivity. ICALP 2007: 102-109 - [c15]Amos Korman, Shay Kutten:
Controller and estimator for dynamic networks. PODC 2007: 175-184 - [c14]Amos Korman, Shay Kutten:
Labeling Schemes with Queries. SIROCCO 2007: 109-123 - [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]Amos Korman, David Peleg:
Dynamic Routing Schemes for General Graphs. ICALP (1) 2006: 619-630 - [c10]Amos Korman, Shay Kutten:
On Distributed Verification. ICDCN 2006: 100-114 - [c9]Amos Korman, David Peleg, Yoav Rodeh:
Constructing Labeling Schemes Through Universal Matrices. ISAAC 2006: 409-418 - [c8]Amos Korman, Shay Kutten:
Distributed verification of minimum spanning trees. PODC 2006: 26-34 - [i2]Amos Korman:
General Compact Labeling Schemes for Dynamic Trees. CoRR abs/cs/0605141 (2006) - [i1]Amos Korman, Shay Kutten:
Labeling Schemes with Queries. CoRR abs/cs/0609163 (2006) - 2005
- [c7]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Label-Guided Graph Exploration by a Finite Automaton. ICALP 2005: 335-346