default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Amir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Dmitry Rabinovich, Michael Amir, Alfred M. Bruckstein:
Optimally reordering mobile agents on parallel rows. Theor. Comput. Sci. 985: 114330 (2024)- [i9]Michael Amir, Alfred M. Bruckstein:
Time, Travel, and Energy in the Uniform Dispersion Problem. CoRR abs/2404.19564 (2024) - 2023
- [c6]Ori Rappel, Michael Amir, Alfred M. Bruckstein:
Stigmergy-based, Dual-Layer Coverage of Unknown Regions. AAMAS 2023: 1439-1447 - [c5]Michael Amir, Yigal Koifman, Yakov Bloch, Ariel Barel, Alfred M. Bruckstein:
Multi-Agent Distributed and Decentralized Geometric Task Allocation. CDC 2023: 8355-8362 - [c4]Alon Shats, Michael Amir, Noa Agmon:
Competitive Ant Coverage: The Value of Pursuit. IROS 2023: 6733-6740 - [i8]Michael Amir, Dmitry Rabinovich, Alfred M. Bruckstein:
Patrolling Grids with a Bit of Memory. CoRR abs/2307.09214 (2023) - 2022
- [j2]Michael Amir
, Noa Agmon, Alfred M. Bruckstein:
A Locust-Inspired Model of Collective Marching on Rings. Entropy 24(7): 918 (2022) - [i7]Ori Rappel, Michael Amir, Alfred M. Bruckstein:
Stigmergy-based, Dual-Layer Coverage of Unknown Indoor Regions. CoRR abs/2209.08573 (2022) - [i6]Michael Amir, Yigal Koifman, Yakov Bloch, Ariel Barel, Alfred M. Bruckstein:
Multi-Agent Distributed and Decentralized Geometric Task Allocation. CoRR abs/2210.05552 (2022) - 2021
- [c3]Michael Amir, Noa Agmon, Alfred M. Bruckstein:
A Discrete Model of Collective Marching on Rings. DARS 2021: 320-334 - [i5]Dmitry Rabinovich, Michael Amir:
"What to Do With Two Lanes?": Optimal Physical Sorting of Mobile Vehicles. CoRR abs/2111.06284 (2021) - 2020
- [c2]Michael Amir, Freddy M. Bruckstein:
Fast Uniform Dispersion of a Crash-prone Swarm. Robotics: Science and Systems 2020 - [i4]Michael Amir, Noa Agmon, Alfred M. Bruckstein:
A Discrete Model of Collective Marching on Rings. CoRR abs/2012.04980 (2020)
2010 – 2019
- 2019
- [j1]Michael Amir, Alfred M. Bruckstein:
Probabilistic pursuits on graphs. Theor. Comput. Sci. 795: 459-477 (2019) - [c1]Michael Amir, Alfred M. Bruckstein:
Minimizing Travel in the Uniform Dispersal Problem for Robotic Sensors. AAMAS 2019: 113-121 - [i3]Michael Amir, Alfred M. Bruckstein:
Minimizing Travel in the Uniform Dispersal Problem for Robotic Sensors. CoRR abs/1903.03259 (2019) - [i2]Michael Amir, Alfred M. Bruckstein:
Fast and Reliable Dispersal of Crash-Prone Agents on Graphs. CoRR abs/1907.00956 (2019) - 2017
- [i1]Michael Amir, Alfred M. Bruckstein:
Probabilistic Pursuits on Graphs. CoRR abs/1710.08107 (2017)
Coauthor Index
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-28 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
