On the public citation graph
Tree exploration with logarithmic memory
0 signed · 82 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.1002/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.3.co;2-#openalex-snapshot
Exploring an unknown graph
inferredcites →https://doi.org/10.1006/inco.1995.1117openalex-snapshot
Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five
inferredcites →https://doi.org/10.1006/jagm.1999.1043openalex-snapshot
Exploring Unknown Undirected Graphs
inferredcites →https://doi.org/10.1007/11429647_13openalex-snapshot
Space Lower Bounds for Graph Exploration via Reduced Automata
inferredcites →https://doi.org/10.1007/3-540-44679-6_2openalex-snapshot
Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n 4.03)
inferredcites →https://doi.org/10.1007/978-3-540-24749-4_22openalex-snapshot
Digraphs Exploration with Little Memory
inferredcites →https://doi.org/10.1007/bf00993411openalex-snapshot
Piecemeal learning of an unknown environment
inferredcites →https://doi.org/10.1007/bf01305237openalex-snapshot
Pseudorandom generators for space-bounded computation
inferredcites →https://doi.org/10.1016/0020-0190(88)90197-4openalex-snapshot
Universal traversal sequences of length nO(log n) for cliques
inferredcites →https://doi.org/10.1016/0020-0190(93)90199-jopenalex-snapshot
Universal traversal sequences for expander graphs
inferredcites →https://doi.org/10.1016/0166-218x(90)90125-vopenalex-snapshot
Universal sequences for complete graphs
inferredcites →https://doi.org/10.1016/0196-6774(87)90019-8openalex-snapshot
Universal traversal sequences for paths and cycles
inferredcites →https://doi.org/10.1016/j.jalgor.2003.10.002openalex-snapshot
Tree exploration with little memory
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.014openalex-snapshot
Graph exploration by a finite automaton
inferredcites →https://doi.org/10.1016/s0022-0000(02)00023-5openalex-snapshot
Universal traversal sequences with backtracking
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
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/s0097539797324874openalex-snapshot
Better Bounds for Online Scheduling
inferredcites →https://doi.org/10.1145/1159892.1159897openalex-snapshot
Optimal constrained graph exploration
inferredcites →https://doi.org/10.1145/1383369.1383373openalex-snapshot
Label-guided graph exploration by a finite automaton
inferredcites →https://doi.org/10.1145/1391289.1391291openalex-snapshot
Undirected connectivity in log-space
inferredcites →https://doi.org/10.1145/168304.168352openalex-snapshot
Piecemeal learning of an unknown environment
inferredcites →https://doi.org/10.1145/195058.195190openalex-snapshot
Pseudorandomness for network algorithms
inferredcites →https://doi.org/10.1145/225298.225337openalex-snapshot
Piecemeal graph exploration by a mobile robot (extended abstract)
inferredcites →https://doi.org/10.1145/62212.62260openalex-snapshot
Polynomial universal traversing sequences for cycles are constructible
inferredcites →https://doi.org/10.1145/73007.73008openalex-snapshot
Multiparty protocols and logspace-hard pseudorandom sequences
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_30openalex-snapshot
Dispersion of Mobile Robots: The Power of Randomness
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-21017-4_2openalex-snapshot
Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles
inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_8openalex-snapshot
A General Lower Bound for Collaborative Tree Exploration
inferred← citeshttps://doi.org/10.1007/978-3-319-72751-6_8openalex-snapshot
Energy-Optimal Broadcast in a Tree with Mobile Agents
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-642-33651-5_5openalex-snapshot
Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_8openalex-snapshot
Anonymous Graph Exploration with Binoculars
inferred← citeshttps://doi.org/10.1007/s00446-011-0138-4openalex-snapshot
Derandomizing random walks in undirected graphs using locally fair exploration strategies
inferred← citeshttps://doi.org/10.1007/s00446-011-0141-9openalex-snapshot
How to meet when you forget: log-space rendezvous in arbitrary graphs
inferred← citeshttps://doi.org/10.1007/s00446-013-0196-xopenalex-snapshot
Leader election for anonymous asynchronous agents in arbitrary networks
inferred← citeshttps://doi.org/10.1007/s00446-013-0201-4openalex-snapshot
Time versus space trade-offs for rendezvous in trees
inferred← citeshttps://doi.org/10.1007/s00446-014-0236-1openalex-snapshot
Distributed graph searching with a sense of direction
inferred← citeshttps://doi.org/10.1007/s00446-015-0253-8openalex-snapshot
Time versus cost tradeoffs for deterministic rendezvous in networks
inferred← citeshttps://doi.org/10.1007/s00446-016-0283-xopenalex-snapshot
Searching without communicating: tradeoffs between performance and selection complexity
inferred← citeshttps://doi.org/10.1007/s00453-011-9611-5openalex-snapshot
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
inferred← citeshttps://doi.org/10.1007/s00453-014-9892-6openalex-snapshot
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks
inferred← citeshttps://doi.org/10.1007/s00453-016-0179-yopenalex-snapshot
Robustness of the Rotor–Router Mechanism
inferred← citeshttps://doi.org/10.1007/s00453-022-00995-zopenalex-snapshot
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots
inferred← citeshttps://doi.org/10.1007/s00453-024-01275-8openalex-snapshot
Energy Constrained Depth First Search
inferred← citeshttps://doi.org/10.1016/j.ic.2018.03.003openalex-snapshot
On mobile agent verifiable problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.03.017openalex-snapshot
Deterministic network exploration by a single agent with Byzantine tokens
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.jpdc.2017.04.003openalex-snapshot
Decidability classes for mobile agents computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.01.022openalex-snapshot
Linear time and space gathering of anonymous mobile agents in asynchronous trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.006openalex-snapshot
A general lower bound for collaborative tree exploration
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.018openalex-snapshot
Energy-optimal broadcast and exploration in a tree using mobile agents
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.042openalex-snapshot
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115272openalex-snapshot
Dispersion of mobile robots on graphs in the asynchronous model
inferred← citeshttps://doi.org/10.1109/aike.2018.00025openalex-snapshot
Fast Graph Exploration by a Mobile Robot
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.89openalex-snapshot
A unified approach for different tasks on rings in robot-based computing systems
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch3openalex-snapshot
Undirected Graph Exploration with ⊝(log log n) Pebbles
inferred← citeshttps://doi.org/10.1142/s0129054112500104openalex-snapshot
LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS
inferred← citeshttps://doi.org/10.1142/s0129054114500129openalex-snapshot
EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN
inferred← citeshttps://doi.org/10.1145/2312005.2312007openalex-snapshot
Time vs. space trade-offs for rendezvous in trees
inferred← citeshttps://doi.org/10.1145/2332432.2332444openalex-snapshot
Collaborative search on the plane without communication
inferred← citeshttps://doi.org/10.1145/2594581openalex-snapshot
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
inferred← citeshttps://doi.org/10.1145/2611462.2611473openalex-snapshot
Time versus cost tradeoffs for deterministic rendezvous in networks
inferred← citeshttps://doi.org/10.1145/3288599.3288610openalex-snapshot
Efficient dispersion of mobile robots on graphs
inferred← citeshttps://doi.org/10.1145/3356883openalex-snapshot
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
inferred← citeshttps://doi.org/10.1587/transfun.e98.a.2117openalex-snapshot
A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards
inferred← citeshttps://doi.org/10.20381/ruor-3182openalex-snapshot
Efficient Mechanisms for Exploration of Dangerous Graphs and for Inter-agent Communication
inferred← citeshttps://doi.org/10.20381/ruor-5411openalex-snapshot
Black Hole Search in the Network and Subway Models
inferred← citeshttps://doi.org/10.3929/ethz-b-000221434openalex-snapshot
A general lower bound for collaborative tree exploration
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.1508.02471openalex-snapshot
Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1802.06636openalex-snapshot
Maximal Exploration of Trees with Energy-Constrained Agents
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/60c156c7zec1bz41adza07bz14e290635419openalex-snapshot
Distributed algorithms for energy constrained mobile agents
inferred← citeshttps://doi.org/10.70675/fb8e31eazf399z402az94cczd303d6bf24dfopenalex-snapshot
Impact des connaissances initiales sur la calculabilité distribuée
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.