Amos Korman - RankMe

141 papers A* 28A 10B 11Misc 6Journal 82Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes. CoRR Matteo Stromieri, Emanuele Natale, Amos Korman
2025	A*	`conf`	Brief Announcement: Fast and Robust Information Spreading in the Noisy PULL Model. PODC Niccolò D'Archivio, Amos Korman, Emanuele Natale, Robin Vacus
2025	Misc	`ed.`	Proceedings of the 26th International Conference on Distributed Computing and Networking, ICDCN 2025, Hyderabad, India, January 4-7, 2025 ICDCN Amos Korman, Sandip Chakraborty, Sathya Peri, Chiara Boldrini, Peter Robinson
2025	J	`jnl`	The Query Complexity of Searching Trees with Permanently Noisy Advice. ACM Trans. Algorithms Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh
2024	J	`jnl`	Early adapting to trends: self-stabilizing information spread using passive communication. Distributed Comput. Amos Korman, Robin Vacus
2024	J	`jnl`	Fast and Robust Information Spreading in the Noisy PULL Model. CoRR Niccolò D'Archivio, Amos Korman, Emanuele Natale, Robin Vacus
2023	J	`jnl`	Distributed Alignment Processes With Samples of Group Average. IEEE Trans. Control. Netw. Syst. Amos Korman, Robin Vacus
2023	J	`jnl`	Enhanced Food Availability can Deteriorate Fitness through Excessive Scrounging. CoRR Robin Vacus, Amos Korman
2023	A*	`conf`	On the Role of Memory in Robust Opinion Dynamics. IJCAI Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus
2023	J	`jnl`	On the Role of Memory in Robust Opinion Dynamics. CoRR Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus
2022	A*	`conf`	Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication. PODC Amos Korman, Robin Vacus
2022	J	`jnl`	Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication. CoRR Amos Korman, Robin Vacus
2021	J	`jnl`	Navigating in Trees with Permanently Noisy Advice. ACM Trans. Algorithms Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh
2021	J	`jnl`	On the Role of Hypocrisy in Escaping the Tragedy of the Commons. CoRR Amos Korman, Robin Vacus
2021	J	`jnl`	Public Communication can Facilitate Low-Risk Coordination under Surveillance. CoRR Amos Korman, Pierluigi Crescenzi
2021	J	`jnl`	Sequential Decision-Making in Ants and Implications to the Evidence Accumulation Decision Model. Frontiers Appl. Math. Stat. Oran Ayalon, Yigal Sternklar, Ehud Fonio, Amos Korman, Nir S. Gov, Ofer Feinerman
2021	J	`jnl`	Stochastic Alignment Processes. CoRR Amos Korman, Robin Vacus
2020	J	`jnl`	Exploitation of Multiple Replenishing Resources with Uncertainty. CoRR Amos Korman, Yuval Emek, Simon Collet, Aya Goldshtein, Yossi Yovel
2020	J	`jnl`	Multi-round cooperative search games with multiple players. J. Comput. Syst. Sci. Amos Korman, Yoav Rodeh
2020	J	`jnl`	The Search Efficiency of Intermittent Lévy walks Optimally Scales with Target Size. CoRR Brieuc Guinard, Amos Korman
2020	A	`conf`	Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. STACS Brieuc Guinard, Amos Korman
2020	J	`jnl`	Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. CoRR Brieuc Guinard, Amos Korman
2019	J	`jnl`	Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits. Distributed Comput. Lucas Boczkowski, Amos Korman, Emanuele Natale
2019	A*	`conf`	Multi-Round Cooperative Search Games with Multiple Players. ICALP Amos Korman, Yoav Rodeh
2019	J	`jnl`	Parallel Bayesian Search with No Coordination. J. ACM Pierre Fraigniaud, Amos Korman, Yoav Rodeh
2018	J	`jnl`	Cooperative Search Games: Symmetric Equilibria, Robustness, and Price of Anarchy. CoRR Amos Korman, Yoav Rodeh
2018	B	`conf`	Intense Competition can Drive Selfish Explorers to Optimize Coverage. SPAA Simon Collet, Amos Korman
2018	J	`jnl`	Intense Competition can Drive Selfish Explorers to Optimize Coverage. CoRR Simon Collet, Amos Korman
2018	A	`conf`	Limits for Rumor Spreading in Stochastic Populations. ITCS Lucas Boczkowski, Ofer Feinerman, Amos Korman, Emanuele Natale
2018	J	`jnl`	Limits on reliable information flows through stochastic populations. PLoS Comput. Biol. Lucas Boczkowski, Emanuele Natale, Ofer Feinerman, Amos Korman
2018	B	`conf`	Random Walks with Multiple Step Lengths. LATIN Lucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker, Marc P. Renault
2018	A	`conf`	Searching a Tree with Permanently Noisy Advice. ESA Lucas Boczkowski, Amos Korman, Yoav Rodeh
2018	J	`jnl`	The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. ACM Trans. Algorithms Amos Korman, Yoav Rodeh
2017	J	`jnl`	Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. Distributed Comput. Ofer Feinerman, Bernhard Haeupler, Amos Korman
2017	J	`jnl`	Fast rendezvous on a cycle by agents with different speeds. Theor. Comput. Sci. Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh
2017	J	`jnl`	Individual versus collective cognition in social insects. CoRR Ofer Feinerman, Amos Korman
2017	J	`jnl`	Limits for Rumor Spreading in stochastic populations. CoRR Lucas Boczkowski, Ofer Feinerman, Amos Korman, Emanuele Natale
2017	A*	`conf`	Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits. SODA Lucas Boczkowski, Amos Korman, Emanuele Natale
2017	B	`conf`	Parallel Search with No Coordination. SIROCCO Amos Korman, Yoav Rodeh
2017	J	`jnl`	Parallel Search with no Coordination. CoRR Amos Korman, Yoav Rodeh
2017	J	`jnl`	The ANTS problem. CoRR Ofer Feinerman, Amos Korman
2017	J	`jnl`	The ANTS problem. Distributed Comput. Ofer Feinerman, Amos Korman
2017	A*	`conf`	The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. ICALP Amos Korman, Yoav Rodeh
2017	J	`jnl`	The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. CoRR Amos Korman, Yoav Rodeh
2016	J	`jnl`	An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. CoRR Pierre Fraigniaud, Amos Korman
2016	J	`jnl`	An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. J. ACM Pierre Fraigniaud, Amos Korman
2016	A*	`conf`	Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit Messages. PODC Lucas Boczkowski, Amos Korman, Emanuele Natale
2016	J	`jnl`	Notions of Connectivity in Overlay Networks. CoRR Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg, Yuval Emek
2016	J	`jnl`	Parallel Linear Search with no Coordination for a Randomly Placed Treasure. CoRR Amos Korman, Yoav Rodeh
2016	A*	`conf`	Parallel exhaustive search without coordination. STOC Pierre Fraigniaud, Amos Korman, Yoav Rodeh
2016	J	`jnl`	Searching on Trees with Noisy Memory. CoRR Lucas Boczkowski, Amos Korman, Yoav Rodeh
2016	J	`jnl`	Self-Stabilizing Clock Synchronization with 3-bit messages. CoRR Lucas Boczkowski, Amos Korman, Emanuele Natale
2015	J	`jnl`	Clock Synchronization and Distributed Estimation in Highly Dynamic Networks: An Information Theoretic Approach. CoRR Ofer Feinerman, Amos Korman
2015	B	`conf`	Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach. SIROCCO Ofer Feinerman, Amos Korman
2015	J	`jnl`	Fast and compact self-stabilizing verification, computation, and fault detection of an MST. CoRR Amos Korman, Shay Kutten, Toshimitsu Masuzawa
2015	J	`jnl`	Fast and compact self-stabilizing verification, computation, and fault detection of an MST. Distributed Comput. Amos Korman, Shay Kutten, Toshimitsu Masuzawa
2015	J	`jnl`	On the Impact of Identifiers on Local Decision. CoRR Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman
2015	J	`jnl`	Parallel Exhaustive Search without Coordination. CoRR Pierre Fraigniaud, Amos Korman, Yoav Rodeh
2015	Misc	`ed.`	Proceedings of the 2015 International Conference on Distributed Computing and Networking, ICDCN 2015, Goa, India, January 4-7, 2015 ICDCN Sajal K. Das, Dilip Krishnaswamy, Santonu Karkar, Amos Korman, Mohan J. Kumar, Marius Portmann, Srikanth Sastry
2015	J	`jnl`	Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. CoRR Liah Kor, Amos Korman, David Peleg
2015	J	`jnl`	Toward more localized local algorithms: removing assumptions concerning global knowledge. CoRR Amos Korman, Jean-Sébastien Sereni, Laurent Viennot
2014	A*	`conf`	Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. PODC Ofer Feinerman, Bernhard Haeupler, Amos Korman
2014	J	`jnl`	Confidence Sharing: An Economic Strategy for Efficient Information Flows in Animal Groups. PLoS Comput. Biol. Amos Korman, Efrat Greenwald, Ofer Feinerman
2014	Misc	`conf`	Fast Rendezvous on a Cycle by Agents with Different Speeds. ICDCN Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh
2014	J	`jnl`	Randomized distributed decision. Distributed Comput. Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg
2013	J	`jnl`	Controller and estimator for dynamic networks. Inf. Comput. Amos Korman, Shay Kutten
2013	J	`jnl`	Efficient and Noise-Resilient rumor-spreading in Large, Anonymous Populations. CoRR Ofer Feinerman, Bernhard Haeupler, Amos Korman
2013	Misc	`conf`	Theoretical Distributed Computing Meets Biology: A Review. ICDCIT Ofer Feinerman, Amos Korman
2013	J	`jnl`	Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. Theory Comput. Syst. Liah Kor, Amos Korman, David Peleg
2013	J	`jnl`	Toward more localized local algorithms: removing assumptions concerning global knowledge. Distributed Comput. Amos Korman, Jean-Sébastien Sereni, Laurent Viennot
2013	J	`jnl`	Towards a complexity theory for local distributed computing. J. ACM Pierre Fraigniaud, Amos Korman, David Peleg
2013	A*	`conf`	What can be decided locally without identifiers? PODC Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela
2013	J	`jnl`	What can be decided locally without identifiers? CoRR Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela
2012	J	`jnl`	Collaborative Search on the Plane without Communication CoRR Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni
2012	A*	`conf`	Collaborative search on the plane without communication. PODC Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni
2012	J	`jnl`	Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer
2012	J	`jnl`	Memory Lower Bounds for Randomized Collaborative Search and Applications to Biology CoRR Ofer Feinerman, Amos Korman
2012	A	`conf`	Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology. DISC Ofer Feinerman, Amos Korman
2012	B	`conf`	Notions of Connectivity in Overlay Networks. SIROCCO Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg
2012	B	`conf`	On the Impact of Identifiers on Local Decision. OPODIS Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman
2012	J	`jnl`	Randomized Distributed Decision CoRR Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg
2012	A	`conf`	Randomized Distributed Decision. DISC Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg
2012	J	`jnl`	Rendezvous of Agents with Different Speeds CoRR Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh
2012	—	`conf`	Theoretical distributed computing meets biology. TADDS Amos Korman
2011	A*	`conf`	Approximating the Statistics of various Properties in Randomly Weighted Graphs. SODA Yuval Emek, Amos Korman, Yuval Shavitt
2011	A*	`conf`	Distributed verification and hardness of distributed approximation. STOC Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer
2011	A*	`conf`	Fast and compact self stabilizing verification, computation, and fault detection of an MST. PODC Amos Korman, Shay Kutten, Toshimitsu Masuzawa
2011	A*	`conf`	Local Distributed Decision. FOCS Pierre Fraigniaud, Amos Korman, David Peleg
2011	J	`jnl`	New bounds for the controller problem. Distributed Comput. Yuval Emek, Amos Korman
2011	J	`jnl`	Online computation with advice. Theor. Comput. Sci. Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
2011	A	`conf`	Tight Bounds For Distributed MST Verification. STACS Liah Kor, Amos Korman, David Peleg
2011	A*	`conf`	Toward more localized local algorithms: removing assumptions concerning global knowledge. PODC Amos Korman, Jean-Sébastien Sereni, Laurent Viennot
2010	A*	`conf`	An optimal ancestry scheme and small universal posets. STOC Pierre Fraigniaud, Amos Korman
2010	A*	`conf`	Compact Ancestry Labeling Schemes for XML Trees. SODA Pierre Fraigniaud, Amos Korman
2010	J	`jnl`	Constructing Labeling Schemes through Universal Matrices. Algorithmica Amos Korman, David Peleg, Yoav Rodeh
2010	J	`jnl`	Distributed Verification and Hardness of Distributed Approximation CoRR Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer
2010	A*	`conf`	Efficient threshold detection in a distributed environment: extended abstract. PODC Yuval Emek, Amos Korman
2010	J	`jnl`	Labeling schemes for vertex connectivity. ACM Trans. Algorithms Amos Korman
2010	J	`jnl`	Local Distributed Decision CoRR Pierre Fraigniaud, Amos Korman, David Peleg
2010	J	`jnl`	Local MST Computation with Short Advice. Theory Comput. Syst. Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
2010	J	`jnl`	On the additive constant of the k-server Work Function Algorithm. Inf. Process. Lett. Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
2010	J	`jnl`	Proof labeling schemes. Distributed Comput. Amos Korman, Shay Kutten, David Peleg
2009	J	`jnl`	A note on models for graph representations. Theor. Comput. Sci. Amos Korman, Shay Kutten
2009	J	`jnl`	An Optimal Labeling Scheme for Ancestry Queries CoRR Pierre Fraigniaud, Amos Korman
2009	A*	`conf`	Brief announcement: new bounds for the controller problem. PODC Yuval Emek, Amos Korman
2009	J	`jnl`	Compact Ancestry Labeling Schemes for Trees of Small Depth CoRR Pierre Fraigniaud, Amos Korman
2009	Misc	`conf`	Compact Routing Schemes for Dynamic Trees in the Fixed Port Model. ICDCN Amos Korman
2009	J	`jnl`	Computing the Expected Values of some Properties of Randomly Weighted Graphs CoRR Yuval Emek, Amos Korman, Yuval Shavitt
2009	J	`jnl`	Labeling Schemes for Tree Representation. Algorithmica Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2009	A	`conf`	New Bounds for the Controller Problem. DISC Yuval Emek, Amos Korman
2009	B	`conf`	On randomized representations of graphs using short labels. SPAA Pierre Fraigniaud, Amos Korman
2009	B	`conf`	On the Additive Constant of the WAOA Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
2009	J	`jnl`	On the Additive Constant of the k-server Work Function Algorithm CoRR Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
2009	—	`conf`	Online Computation with Advice. ICALP (1) Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
2008	J	`jnl`	Compact separator decompositions in dynamic trees and applications to labeling schemes. Distributed Comput. Amos Korman, David Peleg
2008	J	`jnl`	Dynamic routing schemes for graphs with low local density. ACM Trans. Algorithms Amos Korman, David Peleg
2008	A*	`conf`	Improved compact routing schemes for dynamic trees. PODC Amos Korman
2008	J	`jnl`	Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2007	A	`conf`	Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes. DISC Amos Korman, David Peleg
2007	A*	`conf`	Controller and estimator for dynamic networks. PODC Amos Korman, Shay Kutten
2007	J	`jnl`	Distributed verification of minimum spanning trees. Distributed Comput. Amos Korman, Shay Kutten
2007	J	`jnl`	General compact labeling schemes for dynamic trees. Distributed Comput. Amos Korman
2007	A*	`conf`	Labeling Schemes for Vertex Connectivity. ICALP Amos Korman
2007	B	`conf`	Labeling Schemes with Queries. SIROCCO Amos Korman, Shay Kutten
2007	J	`jnl`	Labeling schemes for weighted dynamic trees. Inf. Comput. Amos Korman, David Peleg
2007	B	`conf`	Local MST computation with short advice. SPAA Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
2006	B	`conf`	Constructing Labeling Schemes Through Universal Matrices. ISAAC Amos Korman, David Peleg, Yoav Rodeh
2006	A*	`conf`	Distributed verification of minimum spanning trees. PODC Amos Korman, Shay Kutten
2006	—	`conf`	Dynamic Routing Schemes for General Graphs. ICALP (1) Amos Korman, David Peleg
2006	J	`jnl`	General Compact Labeling Schemes for Dynamic Trees CoRR Amos Korman
2006	J	`jnl`	Labeling Schemes with Queries CoRR Amos Korman, Shay Kutten
2006	Misc	`conf`	On Distributed Verification. ICDCN Amos Korman, Shay Kutten
2005	A	`conf`	General Compact Labeling Schemes for Dynamic Trees. DISC Amos Korman
2005	A*	`conf`	Label-Guided Graph Exploration by a Finite Automaton. ICALP Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2005	—	`conf`	Labeling Schemes for Tree Representation. IWDC Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2005	A*	`conf`	Proof labeling schemes. PODC Amos Korman, Shay Kutten, David Peleg
2004	J	`jnl`	Labeling Schemes for Dynamic Tree Networks. Theory Comput. Syst. Amos Korman, David Peleg, Yoav Rodeh
2004	J	`jnl`	Labeling Schemes for Flow and Connectivity. SIAM J. Comput. Michal Katz, Nir A. Katz, Amos Korman, David Peleg
2003	A*	`conf`	Labeling Schemes for Weighted Dynamic Trees. ICALP Amos Korman, David Peleg
2002	A	`conf`	Labeling Schemes for Dynamic Tree Networks. STACS Amos Korman, David Peleg, Yoav Rodeh
2002	A*	`conf`	Labeling schemes for flow and connectivity. SODA Michal Katz, Nir A. Katz, Amos Korman, David Peleg