On the public citation graph

One-bit algorithms

https://doi.org/10.1007/bf01783661
0 signed · 18 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/bfb0040405openalex-snapshot
Families of consensus algorithms
inferredcites →https://doi.org/10.1109/sfcs.1987.20openalex-snapshot
Distributive graph algorithms Global solutions from local data
inferredcites →https://doi.org/10.1137/0401044openalex-snapshot
Parallel Symmetry-Breaking in Sparse Graphs
inferredcites →https://doi.org/10.1145/12130.12151openalex-snapshot
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/800057.808667openalex-snapshot
Tight bounds on the complexity of parallel sorting

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0113openalex-snapshot
Finding the Extrema of a Distributed Multiset
inferred← citeshttps://doi.org/10.1007/978-3-319-46376-6_5openalex-snapshot
On the Microscopic View of Time and Messages
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_2openalex-snapshot
Deterministic Leader Election in $$O(D+\log n)$$ Time with Messages of Size O(1)
inferred← citeshttps://doi.org/10.1007/bfb0020432openalex-snapshot
Finding the extrema of a distributed multiset
inferred← citeshttps://doi.org/10.1007/s00446-020-00373-4openalex-snapshot
Fooling views: a new lower bound technique for distributed computations under congestion
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.2013.10.005openalex-snapshot
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.004openalex-snapshot
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter…
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00240-8openalex-snapshot
Tight bounds for synchronous communication of information using bits and silence
inferred← citeshttps://doi.org/10.1109/edcc.2010.35openalex-snapshot
How to Speed-Up Fault-Tolerant Clock Generation in VLSI Systems-on-Chip via Pipelining
inferred← citeshttps://doi.org/10.1137/0404036openalex-snapshot
A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
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.