On the public citation graph

Tree Exploration with an Oracle

https://doi.org/10.1007/11821069_2
0 signed · 53 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/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.3.co;2-#openalex-snapshot
Exploring an unknown graph
inferredcites →https://doi.org/10.1002/1097-0037(200009)36:2<96::aid-net4>3.0.co;2-nopenalex-snapshot
Impact of topographic information on graph exploration efficiency
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.1007/11561071_4openalex-snapshot
Exploring an Unknown Graph Efficiently
inferredcites →https://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferredcites →https://doi.org/10.1007/s00446-006-0007-8openalex-snapshot
Optimal Deterministic Broadcasting in Known Topology Radio Networks
inferredcites →https://doi.org/10.1016/0304-3975(91)90263-2openalex-snapshot
Shortest paths without a map
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.08.001openalex-snapshot
Broadcasting algorithms in radio networks with unknown topology
inferredcites →https://doi.org/10.1016/j.tcs.2004.07.031openalex-snapshot
Optimal graph exploration without good maps
inferredcites →https://doi.org/10.1109/70.105395openalex-snapshot
Robotic exploration as graph construction
inferredcites →https://doi.org/10.1109/70.508436openalex-snapshot
Competitive robot mapping with homogeneous markers
inferredcites →https://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
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.1109/sfcs.2003.1238222openalex-snapshot
Broadcasting algorithms in radio networks with unknown topology
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.1145/1073814.1073840openalex-snapshot
Faster communication in known topology radio networks
inferredcites →https://doi.org/10.1145/1146381.1146410openalex-snapshot
Oracle size
inferredcites →https://doi.org/10.1145/168304.168352openalex-snapshot
Piecemeal learning of an unknown environment
inferredcites →https://doi.org/10.1145/225298.225337openalex-snapshot
Piecemeal graph exploration by a mobile robot (extended abstract)
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/383962.384040openalex-snapshot
Distributed multi-broadcast in unknown radio networks
inferredcites →https://doi.org/10.1145/72981.72982openalex-snapshot
A hundred impossibility proofs for distributed computing
inferredcites →https://doi.org/10.5555/313852.313890openalex-snapshot
Randomized robot navigation algorithms
inferredcites →https://doi.org/10.5555/365411.365756openalex-snapshot
Selective families, superimposed codes, and broadcasting on unknown radio networks
inferredcites →https://doi.org/10.5555/365411.365780openalex-snapshot
On validating planar worlds
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.1002/net.21453openalex-snapshot
Deterministic rendezvous in networks: A comprehensive survey
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_24openalex-snapshot
Fast Radio Broadcasting with Advice
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_6openalex-snapshot
Graph Searching with Advice
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_22openalex-snapshot
Distributed Computing with Advice: Information Sensitivity of Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_10openalex-snapshot
r3: Resilient Random Regular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_9openalex-snapshot
Local Maps: New Insights into Mobile Agent Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_36openalex-snapshot
Online Computation with Advice
inferred← citeshttps://doi.org/10.1007/s00224-010-9280-9openalex-snapshot
Local MST Computation with Short Advice
inferred← citeshttps://doi.org/10.1007/s00446-008-0076-yopenalex-snapshot
Distributed computing with advice: information sensitivity of graph coloring
inferred← citeshttps://doi.org/10.1007/s00446-010-0095-3openalex-snapshot
Proof labeling schemes
inferred← citeshttps://doi.org/10.1007/s00453-009-9361-9openalex-snapshot
Trade-offs Between the Size of Advice and Broadcasting Time in Trees
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.07.002openalex-snapshot
Communication algorithms with advice
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.10.004openalex-snapshot
Drawing maps with advice
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.020openalex-snapshot
Graph searching with advice
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.004openalex-snapshot
Fast radio broadcasting with advice
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.007openalex-snapshot
Online computation with advice
inferred← citeshttps://doi.org/10.1051/ita/2009012openalex-snapshot
Measuring the problem-relevant information in input
inferred← citeshttps://doi.org/10.1145/1073814.1073817openalex-snapshot
Proof labeling schemes
inferred← citeshttps://doi.org/10.1145/1248377.1248402openalex-snapshot
Local MST computation with short advice
inferred← citeshttps://doi.org/10.1145/1378533.1378545openalex-snapshot
Trade-offs between the size of advice and broadcasting time in trees
inferred← citeshttps://doi.org/10.20381/ruor-5411openalex-snapshot
Black Hole Search in the Network and Subway Models
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.