On the public citation graph

Exploration of Convex Terrains by a Deterministic Automaton with Pebbles

https://doi.org/10.2139/ssrn.5380470
0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.0.co;2-8openalex-snapshot
Exploring an unknown graph
inferredcites →https://doi.org/10.1002/mana.19780860120openalex-snapshot
Automata and Labyrinths
inferredcites →https://doi.org/10.1006/inco.1999.2795openalex-snapshot
Piecemeal Graph Exploration by a Mobile Robot
inferredcites →https://doi.org/10.1006/inco.2001.3081openalex-snapshot
The Power of a Pebble: Exploring and Mapping Directed Graphs
inferredcites →https://doi.org/10.1006/jagm.1999.1043openalex-snapshot
Exploring Unknown Undirected Graphs
inferredcites →https://doi.org/10.1007/978-3-322-94560-0openalex-snapshot
Labyrinth Problems
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_23openalex-snapshot
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
inferredcites →https://doi.org/10.1007/978-3-642-15763-9_26openalex-snapshot
Leader Election Problem versus Pattern Formation Problem
inferredcites →https://doi.org/10.1007/978-3-642-17653-1_10openalex-snapshot
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences
inferredcites →https://doi.org/10.1007/bf00288647openalex-snapshot
Automaten in planaren Graphen
inferredcites →https://doi.org/10.1007/s00453-001-0067-xopenalex-snapshot
Exploring Unknown Environments with Obstacles
inferredcites →https://doi.org/10.1016/j.ic.2010.09.005openalex-snapshot
Optimality and competitiveness of exploring polygons by mobile robots
inferredcites →https://doi.org/10.1016/j.ic.2013.02.001openalex-snapshot
Worst-case optimal exploration of terrains with obstacles
inferredcites →https://doi.org/10.1016/j.jalgor.2003.10.002openalex-snapshot
Tree exploration with little memory
inferredcites →https://doi.org/10.1016/j.jcss.2025.103696openalex-snapshot
Exploring wedges of an oriented grid by an automaton with pebbles
inferredcites →https://doi.org/10.1016/j.tcs.2015.05.054openalex-snapshot
How many ants does it take to find the food?
inferredcites →https://doi.org/10.1023/a:1022803514157openalex-snapshot
Piecemeal Learning of an Unknown Environment
inferredcites →https://doi.org/10.1109/70.105395openalex-snapshot
Robotic exploration as graph construction
inferredcites →https://doi.org/10.1109/sfcs.1978.30openalex-snapshot
On the power of the compass (or, why mazes are easier to search than graphs)
inferredcites →https://doi.org/10.1109/sfcs.1994.365703openalex-snapshot
The power of team exploration: two robots can learn unlabeled directed graphs
inferredcites →https://doi.org/10.1137/1.9781611973075.1openalex-snapshot
On the Optimality of Spiral Search
inferredcites →https://doi.org/10.1137/1.9781611974331.ch3openalex-snapshot
Undirected Graph Exploration with ⊝(log log n) Pebbles
inferredcites →https://doi.org/10.1137/1.9781611974782.14openalex-snapshot
Exploring an Infinite Space with Finite Memory Scouts
inferredcites →https://doi.org/10.1137/s009753979628292xopenalex-snapshot
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
inferredcites →https://doi.org/10.1137/s009753979732428xopenalex-snapshot
Exploring Unknown Environments
inferredcites →https://doi.org/10.1137/s0097539799348670openalex-snapshot
The Polygon Exploration Problem
inferredcites →https://doi.org/10.1145/274787.274788openalex-snapshot
How to learn an unknown environment. I
inferredcites →https://doi.org/10.2172/10180101openalex-snapshot
Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms
inferredcites →https://doi.org/10.4230/lipics.disc.2018.13openalex-snapshot
A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration
inferredcites →https://doi.org/10.5555/365411.365786openalex-snapshot
Optimal constrained graph exploration
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.