On the public citation graph
Automaten in planaren Graphen
0 signed · 61 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/sfcs.1977.20openalex-snapshot
On the capability of finite automata in 2 and 3 dimensional space
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)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11429647_12openalex-snapshot
Finding Short Right-Hand-on-the-Wall Walks in Graphs
inferred← citeshttps://doi.org/10.1007/11429647_13openalex-snapshot
Space Lower Bounds for Graph Exploration via Reduced Automata
inferred← citeshttps://doi.org/10.1007/11523468_28openalex-snapshot
Label-Guided Graph Exploration by a Finite Automaton
inferred← citeshttps://doi.org/10.1007/11685654_1openalex-snapshot
The Reduced Automata Technique for Graph Exploration Space Lower Bounds
inferred← citeshttps://doi.org/10.1007/11780823_6openalex-snapshot
Setting Port Numbers for Fast Graph Exploration
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_42openalex-snapshot
Three-dimensional traps and barrages for cooperating automata
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_16openalex-snapshot
Graph Explorations with Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_2openalex-snapshot
Moving and Computing Models: Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-23679-3_2openalex-snapshot
Graph-Walking Automata: From Whence They Come, and Whither They are Bound
inferred← citeshttps://doi.org/10.1007/978-3-030-54921-3_9openalex-snapshot
Exploration of Time-Varying Connected Graphs with Silent Agents
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_8openalex-snapshot
The Space Complexity of Undirected Graph Exploration
inferred← citeshttps://doi.org/10.1007/978-3-031-40247-0_18openalex-snapshot
A Time to Cast Away Stones
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_5openalex-snapshot
Exploration of Convex Terrains by a Deterministic Automaton with Pebbles
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_22openalex-snapshot
Digraphs Exploration with Little Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_14openalex-snapshot
On the Power of Local Orientations
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_4openalex-snapshot
Fast Periodic Graph Exploration with Constant Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_27openalex-snapshot
On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_2openalex-snapshot
Memory Efficient Anonymous Graph Exploration
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_43openalex-snapshot
Graph Decomposition for Improving Memoryless Periodic Exploration
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_14openalex-snapshot
More Efficient Periodic Traversal in Anonymous Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_5openalex-snapshot
Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_17openalex-snapshot
Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata
inferred← citeshttps://doi.org/10.1007/s00446-006-0154-yopenalex-snapshot
Searching for a black hole in arbitrary networks: optimal mobile agents protocols
inferred← citeshttps://doi.org/10.1007/s00453-011-9518-1openalex-snapshot
Graph Decomposition for Memoryless Periodic Exploration
inferred← citeshttps://doi.org/10.1007/s00453-020-00752-0openalex-snapshot
Building a Nest by an Automaton
inferred← citeshttps://doi.org/10.1016/j.dam.2007.11.001openalex-snapshot
Impact of memory size on graph exploration capability
inferred← citeshttps://doi.org/10.1016/j.dam.2024.05.024openalex-snapshot
Graph exploration by a deterministic memoryless automaton with pebbles
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105127openalex-snapshot
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.08.011openalex-snapshot
Anonymous graph exploration without collision by mobile robots
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.06.010openalex-snapshot
Time and space optimality of rotor-router graph exploration
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.09.004openalex-snapshot
Fast periodic graph exploration with constant memory
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103696openalex-snapshot
Exploring wedges of an oriented grid by an automaton with pebbles
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.014openalex-snapshot
Graph exploration by a finite automaton
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.004openalex-snapshot
Distributed chasing of network intruders
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.035openalex-snapshot
Setting port numbers for fast graph exploration
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.035openalex-snapshot
More efficient periodic traversal in anonymous undirected graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115844openalex-snapshot
Exploration of convex terrains by a deterministic automaton with pebbles
inferred← citeshttps://doi.org/10.1142/s0129054112500104openalex-snapshot
LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS
inferred← citeshttps://doi.org/10.1142/s0129054125410023openalex-snapshot
A Time to Cast Away Stones: On a Family of Pebble Automata
inferred← citeshttps://doi.org/10.1145/1383369.1383373openalex-snapshot
Label-guided graph exploration by a finite automaton
inferred← citeshttps://doi.org/10.1145/2603088.2603118openalex-snapshot
Logical characterization of weighted pebble walking automata
inferred← citeshttps://doi.org/10.1145/3356883openalex-snapshot
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
inferred← citeshttps://doi.org/10.1145/571825.571853openalex-snapshot
Searching for a black hole in arbitrary networks
inferred← citeshttps://doi.org/10.1515/156939203322694736openalex-snapshot
Collectives of automata in labyrinths
inferred← citeshttps://doi.org/10.2139/ssrn.5380470openalex-snapshot
Exploration of Convex Terrains by a Deterministic Automaton with Pebbles
inferred← citeshttps://doi.org/10.2168/lmcs-3(2:3)2007openalex-snapshot
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
inferred← citeshttps://doi.org/10.22215/etd/2007-06571openalex-snapshot
Using mobile agents for black hole search with tokens in multi networks
inferred← citeshttps://doi.org/10.22405/2226-8383-2019-20-3-165-192openalex-snapshot
Поведение конечных автоматов в лабиринтах
inferred← citeshttps://doi.org/10.4230/lipics.esa.2019.35openalex-snapshot
Building a Nest by an Automaton
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.137openalex-snapshot
Energy Consumption of Group Search on a Line
inferred← citeshttps://doi.org/10.48550/arxiv.1204.2955openalex-snapshot
Label-Guided Graph Exploration with Adjustable Ratio of Labels
inferred← citeshttps://doi.org/10.48550/arxiv.1205.4545openalex-snapshot
Memory Lower Bounds for Randomized Collaborative Search and Applications to Biology
inferred← citeshttps://doi.org/10.5555/2884435.2884438openalex-snapshot
Undirected graph exploration with Θ(log log n) pebbles
inferred← citeshttps://doi.org/10.70675/58e2747az6a79z40dezb604zbcda2fb26d19openalex-snapshot
Algorithms for deterministic parallel graph exploration
inferred← citeshttps://doi.org/10.70675/9ec2dc59zadb1z414fz949fz0fd1afaab001openalex-snapshot
Specification and verification of quantitative properties : expressions, logics, and automata
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.