On the public citation graph

Time vs. Information Tradeoffs for Leader Election in Anonymous Trees

https://doi.org/10.1145/3039870
0 signed · 63 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.1007/3-540-51687-5_52openalex-snapshot
Electing a leader when processor identity numbers are not distinct (extended abstract)
inferredcites →https://doi.org/10.1007/978-3-642-10631-6_35openalex-snapshot
On the Advice Complexity of Online Problems
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/bfb0022433openalex-snapshot
Distributed Algorithms
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.1007/s00446-013-0196-xopenalex-snapshot
Leader election for anonymous asynchronous agents in arbitrary networks
inferredcites →https://doi.org/10.1007/s00446-014-0237-0openalex-snapshot
Knowledge, level of symmetry, and time of leader election
inferredcites →https://doi.org/10.1007/s00453-009-9361-9openalex-snapshot
Trade-offs Between the Size of Advice and Broadcasting Time in Trees
inferredcites →https://doi.org/10.1016/0196-6774(91)90002-gopenalex-snapshot
Better computing on the anonymous ring
inferredcites →https://doi.org/10.1016/j.ic.2008.07.005openalex-snapshot
Tree exploration with advice
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.jcss.2013.04.003openalex-snapshot
Leader election in ad hoc radio networks: A keen ear helps
inferredcites →https://doi.org/10.1016/j.jpdc.2003.11.007openalex-snapshot
Sorting and election in anonymous asynchronous rings
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.1051/ita/2009012openalex-snapshot
Measuring the problem-relevant information in input
inferredcites →https://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferredcites →https://doi.org/10.1109/aiccsa.2008.4493575openalex-snapshot
Electing a leader in the local computation model using mobile agents
inferredcites →https://doi.org/10.1109/tpds.2002.1003864openalex-snapshot
Uniform leader election protocols for radio networks
inferredcites →https://doi.org/10.1137/0215032openalex-snapshot
Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/s0097539703433912openalex-snapshot
Labeling Schemes for Flow and Connectivity
inferredcites →https://doi.org/10.1137/s0097539703437211openalex-snapshot
Compact Labeling Scheme for Ancestor Queries
inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1145/1044731.1044732openalex-snapshot
Approximate distance oracles
inferredcites →https://doi.org/10.1145/2935764.2935772openalex-snapshot
Election vs. Selection
inferredcites →https://doi.org/10.1145/301308.301355openalex-snapshot
Computing anonymously with arbitrary knowledge
inferredcites →https://doi.org/10.1145/359024.359029openalex-snapshot
Decentralized extrema-finding in circular configurations of processors
inferredcites →https://doi.org/10.1145/48014.48247openalex-snapshot
Computing on an anonymous ring
inferredcites →https://doi.org/10.1145/571825.571833openalex-snapshot
Efficient algorithms for leader election in radio networks
inferredcites →https://doi.org/10.1145/69622.357194openalex-snapshot
An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
inferredcites →https://doi.org/10.1145/7531.7919openalex-snapshot
Electing a leader in a synchronous ring
inferredcites →https://doi.org/10.1145/800141.804655openalex-snapshot
Local and global properties in networks of processors (Extended Abstract)

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-39442-4_29openalex-snapshot
Naming Anonymous Processes Using an Optimal Number of Test-and-Set Registers
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_10openalex-snapshot
Wireless Broadcast with Short Labels
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_47openalex-snapshot
Optimal-Length Labeling Schemes and Fast Algorithms for k-Gathering and k-Broadcasting
inferred← citeshttps://doi.org/10.1007/s00446-023-00451-3openalex-snapshot
Four shades of deterministic leader election in anonymous networks
inferred← citeshttps://doi.org/10.1007/s00453-018-0444-3openalex-snapshot
Impact of Knowledge on Election Time in Anonymous Networks
inferred← citeshttps://doi.org/10.1007/s00453-018-0517-3openalex-snapshot
Deterministic Leader Election Takes $$\Theta (D + \log n)$$ Θ ( D + log n ) Bit Rounds
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105010openalex-snapshot
Deterministic size discovery and topology recognition in radio networks with short labels
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.037openalex-snapshot
Topology recognition and leader election in colored networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.004openalex-snapshot
Finding the size and the diameter of a radio network using short labels
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.008openalex-snapshot
Short labeling schemes for topology recognition in wireless tree networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113775openalex-snapshot
Lower and upper bounds for deterministic convergecast with labeling schemes
inferred← citeshttps://doi.org/10.1109/acsos55765.2022.00026openalex-snapshot
Self-stabilising Priority-Based Multi-Leader Election and Network Partitioning
inferred← citeshttps://doi.org/10.1145/3154273.3154298openalex-snapshot
Finding the Size of a Radio Network with Short Labels
inferred← citeshttps://doi.org/10.1145/3280823openalex-snapshot
Deterministic Graph Exploration with Advice
inferred← citeshttps://doi.org/10.1145/3323165.3323194openalex-snapshot
Constant-Length Labeling Schemes for Deterministic Radio Broadcast
inferred← citeshttps://doi.org/10.1145/3350755.3400276openalex-snapshot
Deterministic Leader Election in Anonymous Radio Networks
inferred← citeshttps://doi.org/10.1145/3386164.3386182openalex-snapshot
Naming Anonymous Processes with Test-and-Set Registers
inferred← citeshttps://doi.org/10.1145/3409964.3461794openalex-snapshot
Four Shades of Deterministic Leader Election in Anonymous Networks
inferred← citeshttps://doi.org/10.1145/3409964.3461821openalex-snapshot
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels
inferred← citeshttps://doi.org/10.1145/3527171openalex-snapshot
Deterministic Leader Election in Anonymous Radio Networks
inferred← citeshttps://doi.org/10.1145/3662158.3662805openalex-snapshot
Brief Announcement: Local Advice and Local Decompression
inferred← citeshttps://doi.org/10.2139/ssrn.5533231openalex-snapshot
Leader Election for Anonymous Mobile Agents with Footprints
inferred← citeshttps://doi.org/10.48550/arxiv.1604.05023openalex-snapshot
Impact of Knowledge on Election Time in Anonymous Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1702.03534openalex-snapshot
Leader Election in Trees with Customized Advice
inferred← citeshttps://doi.org/10.48550/arxiv.1902.06090openalex-snapshot
Cost vs. Information Tradeoffs for Treasure Hunt in the Plane
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.