default search action
Anissa Lamani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Quentin Bramas
, Sayaka Kamei
Stand-up indulgent gathering on lines. Theor. Comput. Sci. 1016: 114796 (2024) - [c31]Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. AINA (2) 2024: 110-121 - [c30]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Rings. SIROCCO 2024: 119-137 - [c29]Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani:
Optimal Asynchronous Perpetual Grid Exploration. SSS 2024: 89-105 - [i18]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Rings. CoRR abs/2402.14233 (2024) - 2023
- [j8]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand up indulgent gathering. Theor. Comput. Sci. 939: 63-77 (2023) - [j7]Quentin Bramas
The agreement power of disagreement. Theor. Comput. Sci. 954: 113772 (2023) - [j6]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas
Perpetual torus exploration by myopic luminous robots. Theor. Comput. Sci. 976: 114143 (2023) - [c28]Quentin Bramas
Stand-Up Indulgent Gathering on Lines. SSS 2023: 451-465 - [i17]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand Up Indulgent Gathering. CoRR abs/2302.03466 (2023) - [i16]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Lines. CoRR abs/2304.05722 (2023) - [i15]Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. CoRR abs/2312.12698 (2023) - 2022
- [j5]Sébastien Bouchard, Yoann Dieudonné
Byzantine gathering in polynomial time. Distributed Comput. 35(3): 235-263 (2022) - [c27]Quentin Bramas, Stéphane Devismes, Anaïs Durand
Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World? FUN 2022: 7:1-7:21 - [c26]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas, Anissa Lamani, Anaïs Durand, Pascal Lafourcade:
Perpetual Torus Exploration by Myopic Luminous Robots. SSS 2022: 164-177 - [d4]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas
Perpetual Torus Exploration by Myopic Luminous Robots: The Animations. Zenodo, 2022 - [d3]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas
Perpetual Torus Exploration by Myopic Luminous Robots: The Animations. Zenodo, 2022 - [d2]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas
Perpetual Torus Exploration by Myopic Luminous Robots: The Animations. Zenodo, 2022 - 2021
- [j4]Stéphane Devismes
Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. Comput. J. 64(1): 132-154 (2021) - [c25]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand up Indulgent Gathering. ALGOSENSORS 2021: 17-28 - [c24]Arthur Rauch
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Robots Without Common Chirality. NETYS 2021: 95-110 - [c23]Sayaka Kamei
Asynchronous Gathering in a Torus. OPODIS 2021: 9:1-9:17 - [c22]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
The Agreement Power of Disagreement. SSS 2021: 273-288 - [d1]Quentin Bramas
The agreement power of disagreement: graph generation. Zenodo, 2021 - [i14]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Asynchronous Gathering in a Torus. CoRR abs/2101.05421 (2021) - 2020
- [c21]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand Up Indulgent Rendezvous. SSS 2020: 45-59 - [i13]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand Up Indulgent Rendezvous. CoRR abs/2010.04400 (2020)
2010 – 2019
- 2019
- [j3]Stéphane Devismes
Optimal torus exploration by oblivious robots. Computing 101(9): 1241-1264 (2019) - [c20]Sayaka Kamei
Gathering on Rings for Myopic Asynchronous Robots With Lights. OPODIS 2019: 27:1-27:17 - [i12]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Gathering on Rings for Myopic Asynchronous Robots with Lights. CoRR abs/1911.04757 (2019) - 2018
- [c19]Sébastien Bouchard
Byzantine Gathering in Polynomial Time. ICALP 2018: 147:1-147:15 - [i11]Sébastien Bouchard, Yoann Dieudonné, Anissa Lamani:
Byzantine Gathering in Polynomial Time. CoRR abs/1801.07656 (2018) - 2017
- [j2]Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi:
Constructing self-stabilizing oscillators in population protocols. Inf. Comput. 255: 336-351 (2017) - 2016
- [c18]Anissa Lamani, Masafumi Yamashita:
Realization of Periodic Functions by Self-stabilizing Population Protocols with Synchronous Handshakes. TPNC 2016: 21-33 - 2015
- [c17]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Enabling Ring Exploration with Myopic Oblivious Robots. IPDPS Workshops 2015: 490-499 - [c16]Stéphane Devismes
Optimal Torus Exploration by Oblivious Robots. NETYS 2015: 183-199 - [c15]Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi:
Constructing Self-stabilizing Oscillators in Population Protocols. SSS 2015: 187-200 - 2014
- [c14]Sayaka Kamei
Asynchronous Ring Gathering by Oblivious Robots with Limited Vision. SRDS Workshops 2014: 46-49 - 2013
- [j1]Alain Cournier, Swan Dubois
The snap-stabilizing message forwarding algorithm on tree topologies. Theor. Comput. Sci. 496: 89-112 (2013) - [c13]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Ring Exploration by Oblivious Agents with Local Vision. ICDCS 2013: 347-356 - [c12]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Ring Exploration with Oblivious Myopic Robots. ASCoMS@SAFECOMP 2013 - [c11]Evangelos Bampas
Self-stabilizing Balancing Algorithm for Containment-Based Trees. SSS 2013: 191-205 - [c10]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit:
Ring Exploration by Oblivious Robots with Vision Limited to 2 or 3. SSS 2013: 363-366 - 2012
- [c9]Alain Cournier, Swan Dubois
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies. ICDCN 2012: 46-60 - [c8]Sayaka Kamei
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection. MFCS 2012: 542-553 - [c7]Stéphane Devismes
Optimal Grid Exploration by Asynchronous Oblivious Robots. SSS 2012: 64-76 - [c6]Eddy Caron, Florent Chuffart, Anissa Lamani, Franck Petit:
Optimization in a Self-stabilizing Service Discovery Framework for Large Scale Systems. SSS 2012: 239-252 - [i10]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit:
Ring Exploration with Oblivious Myopic Robots. CoRR abs/1205.5003 (2012) - [i9]Eddy Caron, Florent Chuffart, Anissa Lamani, Franck Petit:
Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems. CoRR abs/1207.1337 (2012) - [i8]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil:
Gathering an even number of robots in an odd ring without global multiplicity detection. CoRR abs/1207.7241 (2012) - [i7]Evangelos Bampas, Anissa Lamani, Franck Petit, Mathieu Valero:
Self-Stabilizing Balancing Algorithm for Containment-Based Trees. CoRR abs/1212.3418 (2012) - 2011
- [c5]Eddy Caron, Florent Chuffart, Haiwu He, Anissa Lamani, Philippe Le Brouster, Olivier Richard
Large scale P2P discovery middleware demonstration. Peer-to-Peer Computing 2011: 152-153 - [c4]Sayaka Kamei
Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection. SIROCCO 2011: 150-161 - [c3]Zohir Bouzid, Anissa Lamani:
Robot Networks with Homonyms: The Case of Patterns Formation. SSS 2011: 92-107 - [i6]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil:
Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. CoRR abs/1104.5660 (2011) - [i5]Stéphane Devismes
Optimal grid exploration by asynchronous oblivious robots. CoRR abs/1105.2461 (2011) - [i4]Zohir Bouzid, Anissa Lamani:
Robot Networks with Homonyms: The Case of Patterns Formation. CoRR abs/1105.5817 (2011) - [i3]Alain Cournier, Swan Dubois
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies. CoRR abs/1107.6014 (2011) - 2010
- [c2]Anissa Lamani, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots. SIROCCO 2010: 183-196 - [c1]Alain Cournier, Swan Dubois
Snap-Stabilizing Linear Message Forwarding. SSS 2010: 546-559 - [i2]Anissa Lamani, Alain Cournier, Swan Dubois
Snap-Stabilizing Linear Message Forwarding. CoRR abs/1006.3432 (2010)
2000 – 2009
- 2009
- [i1]Anissa Lamani, Maria Potop-Butucaru, Sébastien Tixeuil:
Optimal deterministic ring exploration with oblivious asynchronous robots. CoRR abs/0910.0832 (2009)
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-11-05 21:02 CET 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: