On the public citation graph

Deterministic Graph Exploration with Advice

https://doi.org/10.1145/3280823
0 signed · 55 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.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.1994.1039openalex-snapshot
Online Navigation in a Room
inferredcites →https://doi.org/10.1006/jagm.1999.1043openalex-snapshot
Exploring Unknown Undirected Graphs
inferredcites →https://doi.org/10.1006/jpdc.2000.1625openalex-snapshot
Optimal Broadcasting in Faulty Trees
inferredcites →https://doi.org/10.1007/978-3-319-25258-2_23openalex-snapshot
Treasure Hunt with Advice
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/978-3-642-31104-8_23openalex-snapshot
Online Graph Exploration with Advice
inferredcites →https://doi.org/10.1007/978-3-642-41527-2_3openalex-snapshot
Use Knowledge to Learn Faster: Topology Recognition with Advice
inferredcites →https://doi.org/10.1007/bf00993411openalex-snapshot
Piecemeal learning of an unknown environment
inferredcites →https://doi.org/10.1007/s00224-010-9280-9openalex-snapshot
Local MST Computation with Short Advice
inferredcites →https://doi.org/10.1007/s00446-008-0076-yopenalex-snapshot
Distributed computing with advice: information sensitivity of graph coloring
inferredcites →https://doi.org/10.1007/s00446-010-0095-3openalex-snapshot
Proof labeling schemes
inferredcites →https://doi.org/10.1016/0022-0000(92)90046-lopenalex-snapshot
Lower bounds on the length of universal traversal sequences
inferredcites →https://doi.org/10.1016/j.ic.2008.07.005openalex-snapshot
Tree exploration with advice
inferredcites →https://doi.org/10.1016/j.ic.2016.01.005openalex-snapshot
Topology recognition with advice
inferredcites →https://doi.org/10.1016/j.jalgor.2003.10.002openalex-snapshot
Tree exploration with little memory
inferredcites →https://doi.org/10.1016/j.jalgor.2004.05.002openalex-snapshot
Distance labeling in graphs
inferredcites →https://doi.org/10.1016/j.jcss.2009.07.002openalex-snapshot
Communication algorithms with advice
inferredcites →https://doi.org/10.1016/j.jpdc.2011.10.004openalex-snapshot
Drawing maps with advice
inferredcites →https://doi.org/10.1016/j.tcs.2008.08.020openalex-snapshot
Graph searching with advice
inferredcites →https://doi.org/10.1016/j.tcs.2010.01.004openalex-snapshot
Fast radio broadcasting with advice
inferredcites →https://doi.org/10.1016/j.tcs.2010.08.007openalex-snapshot
Online computation with advice
inferredcites →https://doi.org/10.1016/j.tcs.2012.06.034openalex-snapshot
Online graph exploration: New results on old and new algorithms
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/s0097539703437211openalex-snapshot
Compact Labeling Scheme for Ancestor Queries
inferredcites →https://doi.org/10.1137/s0097539791194931openalex-snapshot
Navigating in Unfamiliar Geometric Terrain
inferredcites →https://doi.org/10.1137/s009753979732428xopenalex-snapshot
Exploring Unknown Environments
inferredcites →https://doi.org/10.1142/s0129054114500129openalex-snapshot
EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN
inferredcites →https://doi.org/10.1145/1159892.1159897openalex-snapshot
Optimal constrained graph exploration
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/274787.274788openalex-snapshot
How to learn an unknown environment. I
inferredcites →https://doi.org/10.1145/276698.276759openalex-snapshot
The power of a pebble
inferredcites →https://doi.org/10.1145/3039870openalex-snapshot
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
inferredcites →https://doi.org/10.1145/3056461openalex-snapshot
Online Algorithms with Advice
inferredcites →https://doi.org/10.1145/3087556.3087563openalex-snapshot
Impact of Knowledge on Election Time in Anonymous Networks
inferredcites →https://doi.org/10.48550/arxiv.1604.05023openalex-snapshot
Impact of Knowledge on Election Time in Anonymous Networks
inferredcites →https://doi.org/10.5555/365411.365529openalex-snapshot
Compact labeling schemes for ancestor queries
inferredcites →https://doi.org/10.5555/365411.365786openalex-snapshot
Optimal constrained graph exploration

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-11072-7_2openalex-snapshot
Moving and Computing Models: Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-36412-0_12openalex-snapshot
Edge Exploration of a Graph by Mobile Agent
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_13openalex-snapshot
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_32openalex-snapshot
Graph Covering Using Bounded Size Subgraphs
inferred← citeshttps://doi.org/10.1007/s00224-025-10215-0openalex-snapshot
Online Unbounded Knapsack
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105091openalex-snapshot
Online search with a hint
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.003openalex-snapshot
An improved lower bound for competitive graph exploration
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.011openalex-snapshot
Pebble guided optimal treasure hunt in anonymous graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114318openalex-snapshot
Advice complexity of adaptive priority algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116073openalex-snapshot
Pebble guided rendezvous despite fault
inferred← citeshttps://doi.org/10.1145/3056461openalex-snapshot
Online Algorithms with Advice
inferred← citeshttps://doi.org/10.1145/3662158.3662805openalex-snapshot
Brief Announcement: Local Advice and Local Decompression
inferred← citeshttps://doi.org/10.1145/3700838.3700858openalex-snapshot
Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
inferred← citeshttps://doi.org/10.17760/d20323930openalex-snapshot
Algorithms for asymmetrically constrained rendezvous on networks
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.