OpenAlex
PricingAboutJobs
Log inGet started
Work

Tight Bounds for Scattered Black Hole Search in a Ring

HTML

Year: 2011
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Structural Information and Communication Complexity: 18th International Colloquium, SIROCCO 2011, Gdańsk, Poland, June 26-29, 2011. Proceedings
DOI: 10.1007/978-3-642-22212-2_17
Authors: Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Institutions: Centre National de la Recherche Scientifique, Aix-Marseille Université, Laboratoire d’Informatique Fondamentale de Marseille
Language: English

Topic: Optimization and Search Problems
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: black hole search, mobile agents, upper and lower bounds, deterministic search, resource minimization

Open Access status: closed
OpenAlex ID: W4408731
FWCI: 2.537
Cites: 22
Cited by: 18
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security