Distributed Biological Algorithms

Publications

Peer reviewed articles (16)

Intermittent inverse-square Lévy walks are optimal for finding targets of all sizes

Author(s): Brieuc Guinard, Amos Korman
Published in: Science Advances, 7/15, 2021, Page(s) eabe8211, ISSN 2375-2548
Publisher: American Association for the Advancement of Science
DOI: 10.1126/sciadv.abe8211

Reinforcement Learning Enables Resource Partitioning in Foraging Bats

Author(s): Aya Goldshtein, Michal Handel, Ofri Eitan, Afrine Bonstein, Talia Shaler, Simon Collet, Stefan Greif, Rodrigo A. Medellín, Yuval Emek, Amos Korman, Yossi Yovel
Published in: Current Biology, 30/20, 2020, Page(s) 4096-4102.e6, ISSN 0960-9822
Publisher: Cell Press
DOI: 10.1016/j.cub.2020.07.079

Navigating in Trees with Permanently Noisy Advice

Author(s): Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh
Published in: ACM Transactions on Algorithms, 17/2, 2021, Page(s) 1-27, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3448305

Ant collective cognition allows for efficient navigation through disordered environments

Author(s): Aviram Gelblum, Ehud Fonio, Yoav Rodeh, Amos Korman, Ofer Feinerman
Published in: eLife, 9, 2020, ISSN 2050-084X
Publisher: eLife Sciences Publications
DOI: 10.7554/elife.55195

Emergent oscillations assist obstacle negotiation during ant cooperative transport

Author(s): Aviram Gelblum, Itai Pinkoviezky, Ehud Fonio, Nir S. Gov, Ofer Feinerman
Published in: Proceedings of the National Academy of Sciences, 113/51, 2016, Page(s) 14615-14620, ISSN 0027-8424
Publisher: National Academy of Sciences
DOI: 10.1073/pnas.1611509113

Limits on reliable information flows through stochastic populations

Author(s): Lucas Boczkowski, Emanuele Natale, Ofer Feinerman, Amos Korman
Published in: PLOS Computational Biology, 14/6, 2018, Page(s) e1006195, ISSN 1553-7358
Publisher: Public Library of Science (United States)
DOI: 10.1371/journal.pcbi.1006195

Individual crop loads provide local control for collective food intake in ant colonies

Author(s): Efrat Esther Greenwald, Lior Baltiansky, Ofer Feinerman
Published in: eLife, 7, 2018, ISSN 2050-084X
Publisher: eLife Sciences Publications
DOI: 10.7554/eLife.31730

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

Author(s): Lucas Boczkowski, Amos Korman, Emanuele Natale
Published in: Distributed Computing, 2018, ISSN 0178-2770
Publisher: Springer Verlag
DOI: 10.1007/s00446-018-0330-x

Parallel Bayesian Search with No Coordination

Author(s): Pierre Fraigniaud, Amos Korman, Yoav Rodeh
Published in: Journal of the ACM, 66/3, 2019, Page(s) 1-28, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3304111

The Dependent Doors Problem

Author(s): Amos Korman, Yoav Rodeh
Published in: ACM Transactions on Algorithms, 14/4, 2018, Page(s) 1-23, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3218819

The ANTS problem

Author(s): Ofer Feinerman, Amos Korman
Published in: Distributed Computing, 2017, ISSN 0178-2770
Publisher: Springer Verlag
DOI: 10.1007/s00446-016-0285-8

Fast rendezvous on a cycle by agents with different speeds

Author(s): Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh
Published in: Theoretical Computer Science, 2016, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2015.12.035

A locally-blazed ant trail achieves efficient collective navigation despite limited information

Author(s): Ehud Fonio, Yael Heyman, Lucas Boczkowski, Aviram Gelblum, Adrian Kosowski, Amos Korman, Ofer Feinerman
Published in: eLife, 5, 2016, ISSN 2050-084X
Publisher: eLife Sciences Publications
DOI: 10.7554/eLife.20185

Individual versus collective cognition in social insects

Author(s): Ofer Feinerman, Amos Korman
Published in: The Journal of Experimental Biology, 220/1, 2017, Page(s) 73-82, ISSN 0022-0949
Publisher: The Company of Biologists Ltd.
DOI: 10.1242/jeb.143891

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

Author(s): Ofer Feinerman, Bernhard Haeupler, Amos Korman
Published in: Distributed Computing, 2015, ISSN 0178-2770
Publisher: Springer Verlag
DOI: 10.1007/s00446-015-0249-4

Multi-round cooperative search games with multiple players

Author(s): Amos Korman, Yoav Rodeh
Published in: Journal of Computer and System Sciences, 113, 2020, Page(s) 125-149, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2020.05.003

Conference proceedings (12)

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

Author(s): Korman, Amos; Rodeh, Yoav
Published in: The 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2, 2017
Publisher: Leibniz International Proceedings in Informatics
DOI: 10.4230/LIPIcs.ICALP.2017.81

Limits for Rumor Spreading in stochastic populations

Author(s): Lucas Boczkowski, Ofer Feinerman, Emanuele Natale, Amos Korman
Published in: The 9th Innovations in Theoretical Computer Science (ITCS), 2018
Publisher: The 9th Innovations in Theoretical Computer Science (ITCS)
DOI: 10.4230/LIPIcs.ITCS.2018.49

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

Author(s): Lucas Boczkowski, Amos Korman, Emanuele Natale
Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing - PODC '16, 2016, Page(s) 207-209, ISBN 9781-450339643
Publisher: ACM Press
DOI: 10.1145/2933057.2933075

Parallel exhaustive search without coordination

Author(s): Pierre Fraigniaud, Amos Korman, Yoav Rodeh
Published in: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016, 2016, Page(s) 312-323, ISBN 9781-450341325
Publisher: ACM Press
DOI: 10.1145/2897518.2897541

Intense Competition can Drive Selfish Explorers to Optimize Coverage

Author(s): Simon Collet, Amos Korman
Published in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18, 2018, Page(s) 183-192, ISBN 9781-450357999
Publisher: ACM Press
DOI: 10.1145/3210377.3210405

Random Walks with Multiple Step Lengths

Author(s): Lucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker, Marc Renault
Published in: LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings, 2018, Page(s) 174-186
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-77404-6_14

Multi-Round Cooperative Search Games with Multiple Players

Author(s): Amos Korman, Yoav Rodeh
Published in: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Searching a Tree with Permanently Noisy Advice

Author(s): Lucas Boczkowski, Amos Korman, Yoav Rodeh
Published in: 26th Annual European Symposium on Algorithms (ESA 2018), 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits

Author(s): Lucas Boczkowski, Amos Korman, Emanuele Natale
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017, Page(s) 2540-2559, ISBN 978-1-61197-478-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611974782.168

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

Author(s): Ofer Feinerman, Amos Korman
Published in: Structural Information and Communication Complexity, 2015, Page(s) 16-30, ISBN 978-3-319-25258-2
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-25258-2_2

Parallel Search with No Coordination

Author(s): Amos Korman, Yoav Rodeh
Published in: Structural Information and Communication Complexity, 10641, 2017, Page(s) 195-211, ISBN 978-3-319-72049-4
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-72050-0_12

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

Author(s): Brieuc Guinard, Amos Korman
Published in: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), 2020
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.stacs.2020.28