Amos Korman

Distributed Comput., December, 2024

2023

Distributed Alignment Processes With Samples of Group Average.

[BibT_eX]

[DOI]

IEEE Trans. Control. Netw. Syst., June, 2023

Enhanced Food Availability can Deteriorate Fitness through Excessive Scrounging.

[BibT_eX]

[DOI]

CoRR, 2023

On the Role of Memory in Robust Opinion Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2021

Navigating in Trees with Permanently Noisy Advice.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Sequential Decision-Making in Ants and Implications to the Evidence Accumulation Decision Model.

[BibT_eX]

[DOI]

Frontiers Appl. Math. Stat., 2021

On the Role of Hypocrisy in Escaping the Tragedy of the Commons.

[BibT_eX]

[DOI]

CoRR, 2021

Public Communication can Facilitate Low-Risk Coordination under Surveillance.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

CoRR, 2021

Stochastic Alignment Processes.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Multi-round cooperative search games with multiple players.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Exploitation of Multiple Replenishing Resources with Uncertainty.

[BibT_eX]

[DOI]

CoRR, 2020

The Search Efficiency of Intermittent Lévy walks Optimally Scales with Target Size.

[BibT_eX]

[DOI]

Brieuc Guinard

CoRR, 2020

Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths.

[BibT_eX]

[DOI]

Brieuc Guinard

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019

Parallel Bayesian Search with No Coordination.

[BibT_eX]

[DOI]

J. ACM, 2019

Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits.

[BibT_eX]

[DOI]

Emanuele Natale

Distributed Comput., 2019

2018

The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Limits on reliable information flows through stochastic populations.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2018

Cooperative Search Games: Symmetric Equilibria, Robustness, and Price of Anarchy.

[BibT_eX]

[DOI]

CoRR, 2018

Intense Competition can Drive Selfish Explorers to Optimize Coverage.

[BibT_eX]

[DOI]

Simon Collet

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Random Walks with Multiple Step Lengths.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Limits for Rumor Spreading in Stochastic Populations.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Searching a Tree with Permanently Noisy Advice.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Fast rendezvous on a cycle by agents with different speeds.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The ANTS problem.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication.

[BibT_eX]

[DOI]

Bernhard Haeupler

Distributed Comput., 2017

Individual versus collective cognition in social insects.

[BibT_eX]

[DOI]

CoRR, 2017

Parallel Search with No Coordination.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2017

2016

An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets.

[BibT_eX]

[DOI]

J. ACM, 2016

Parallel Linear Search with no Coordination for a Randomly Placed Treasure.

[BibT_eX]

[DOI]

CoRR, 2016

Searching on Trees with Noisy Memory.

[BibT_eX]

[DOI]

CoRR, 2016

Self-Stabilizing Clock Synchronization with 3-bit messages.

[BibT_eX]

[DOI]

Emanuele Natale

CoRR, 2016

Parallel exhaustive search without coordination.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit Messages.

[BibT_eX]

[DOI]

Emanuele Natale

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015

Fast and compact self-stabilizing verification, computation, and fault detection of an MST.

[BibT_eX]

[DOI]

Toshimitsu Masuzawa

Distributed Comput., 2015

Clock Synchronization and Distributed Estimation in Highly Dynamic Networks: An Information Theoretic Approach.

[BibT_eX]

[DOI]

CoRR, 2015

Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

2014

Confidence Sharing: An Economic Strategy for Efficient Information Flows in Animal Groups.

[BibT_eX]

[DOI]

Efrat Greenwald

PLoS Comput. Biol., 2014

Randomized distributed decision.

[BibT_eX]

[DOI]

Distributed Comput., 2014

2013

Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification.

[BibT_eX]

[DOI]

Liah Kor

Theory Comput. Syst., 2013

Towards a complexity theory for local distributed computing.

[BibT_eX]

[DOI]

J. ACM, 2013

Controller and estimator for dynamic networks.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Toward more localized local algorithms: removing assumptions concerning global knowledge.

[BibT_eX]

[DOI]

Jean-Sébastien Sereni

Laurent Viennot

Distributed Comput., 2013

Efficient and Noise-Resilient rumor-spreading in Large, Anonymous Populations.

[BibT_eX]

[DOI]

Bernhard Haeupler

CoRR, 2013

What can be decided locally without identifiers?

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Theoretical Distributed Computing Meets Biology: A Review.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Internet Technology, 2013

2012

Distributed Verification and Hardness of Distributed Approximation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Rendezvous of Agents with Different Speeds

[BibT_eX]

[DOI]

CoRR, 2012

Memory Lower Bounds for Randomized Collaborative Search and Applications to Biology

[BibT_eX]

[DOI]

CoRR, 2012

Randomized Distributed Decision.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Theoretical distributed computing meets biology.

[BibT_eX]

[DOI]

Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, 2012

Notions of Connectivity in Overlay Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

Collaborative search on the plane without communication.

[BibT_eX]

[DOI]

Zvi Lotker

Jean-Sébastien Sereni

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

On the Impact of Identifiers on Local Decision.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011

Online computation with advice.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

New bounds for the controller problem.

[BibT_eX]

[DOI]

Distributed Comput., 2011

Tight Bounds For Distributed MST Verification.

[BibT_eX]

[DOI]

Liah Kor

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Approximating the Statistics of various Properties in Randomly Weighted Graphs.

[BibT_eX]

[DOI]

Yuval Shavitt

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Local Distributed Decision.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Labeling schemes for vertex connectivity.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Local MST Computation with Short Advice.

[BibT_eX]

[DOI]

Emmanuelle Lebhar

Theory Comput. Syst., 2010

On the additive constant of the k-server Work Function Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Proof labeling schemes.

[BibT_eX]

[DOI]

Distributed Comput., 2010

Constructing Labeling Schemes through Universal Matrices.

[BibT_eX]

[DOI]

Algorithmica, 2010

An optimal ancestry scheme and small universal posets.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Compact Ancestry Labeling Schemes for XML Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Efficient threshold detection in a distributed environment: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

A note on models for graph representations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

An Optimal Labeling Scheme for Ancestry Queries

[BibT_eX]

[DOI]

CoRR, 2009

Computing the Expected Values of some Properties of Randomly Weighted Graphs

[BibT_eX]

[DOI]

Yuval Shavitt

CoRR, 2009

Compact Ancestry Labeling Schemes for Trees of Small Depth

[BibT_eX]

[DOI]

CoRR, 2009

Labeling Schemes for Tree Representation.

[BibT_eX]

[DOI]

Algorithmica, 2009

On the Additive Constant of the <i>k</i>-Server Work Function Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

On randomized representations of graphs using short labels.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Brief announcement: new bounds for the controller problem.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Compact Routing Schemes for Dynamic Trees in the Fixed Port Model.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2008

Dynamic routing schemes for graphs with low local density.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Label-guided graph exploration by a finite automaton.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Compact separator decompositions in dynamic trees and applications to labeling schemes.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Improved compact routing schemes for dynamic trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007

Labeling schemes for weighted dynamic trees.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Distributed verification of minimum spanning trees.

[BibT_eX]

[DOI]

Distributed Comput., 2007

General compact labeling schemes for dynamic trees.

[BibT_eX]

[DOI]

Distributed Comput., 2007

Labeling Schemes with Queries.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2007

2006

On Distributed Verification.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

Dynamic Routing Schemes for General Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2004

Labeling Schemes for Flow and Connectivity.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Labeling Schemes for Dynamic Tree Networks.

[BibT_eX]

[DOI]