On the public citation graph
Perfect Information Leader Election in log*n+O(1) Rounds
0 signed · 61 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)1098-2418(199712)11:4<345::aid-rsa4>3.0.co;2-zopenalex-snapshot
Randomness-optimal oblivious sampling
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/bf01200907openalex-snapshot
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
inferredcites →https://doi.org/10.1007/bf01299739openalex-snapshot
Fast perfect-information leader-election protocols with linear immunity
inferredcites →https://doi.org/10.1016/b978-0-12-804291-5.00009-xopenalex-snapshot
Probabilistic methods
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1109/csac.2004openalex-snapshot
20th Annual Computer Security Applications Conference
inferredcites →https://doi.org/10.1109/sfcs.1989openalex-snapshot
30th Annual Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1109/sfcs.1991.185405openalex-snapshot
Fault-tolerant computation in the full information model
inferredcites →https://doi.org/10.1137/0222030openalex-snapshot
Coin-Flipping Games Immune against Linear-Sized Coalitions
inferredcites →https://doi.org/10.1137/0402020openalex-snapshot
A Robust Noncryptographic Protocol for Collective Coin Flipping
inferredcites →https://doi.org/10.1137/s0097539790187084openalex-snapshot
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
inferredcites →https://doi.org/10.1137/s0097539796307182openalex-snapshot
Perfect-Information Leader Election with Optimal Resilience
inferredcites →https://doi.org/10.1145/195058.195141openalex-snapshot
Simple and efficient leader election in the full information model
inferredcites →https://doi.org/10.2748/tmj/1178243286openalex-snapshot
Weighted sums of certain dependent random variables
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.10104openalex-snapshot
Randomization helps to perform independent tasks reliably
inferred← citeshttps://doi.org/10.1007/11745853_27openalex-snapshot
The Twist-AUgmented Technique for Key Exchange
inferred← citeshttps://doi.org/10.1007/11818175_25openalex-snapshot
Random Selection with an Adversarial Majority
inferred← citeshttps://doi.org/10.1007/11944836_12openalex-snapshot
On Obtaining Pseudorandomness from Error-Correcting Codes
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_25openalex-snapshot
New Imperfect Random Source with Applications to Coin-Flipping
inferred← citeshttps://doi.org/10.1007/978-3-031-15982-4_14openalex-snapshot
$$\log ^*$$-Round Game-Theoretically-Fair Leader Election
inferred← citeshttps://doi.org/10.1007/978-3-031-68397-8_7openalex-snapshot
Game-Theoretically Fair Distributed Sampling
inferred← citeshttps://doi.org/10.1007/978-3-032-25324-8_17openalex-snapshot
Game Theory Does Not Always Help: The Case of Statistical Multi-party Coin Tossing
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_1openalex-snapshot
An Optimally Fair Coin Toss
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_24openalex-snapshot
Rationality in the Full-Information Model
inferred← citeshttps://doi.org/10.1007/978-3-642-35668-1_13openalex-snapshot
Democratic Elections in Faulty Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-53357-4_10openalex-snapshot
Cryptocurrencies Without Proof of Work
inferred← citeshttps://doi.org/10.1007/s00037-010-0001-1openalex-snapshot
Parameterized Proof Complexity
inferred← citeshttps://doi.org/10.1007/s00145-015-9199-zopenalex-snapshot
An Optimally Fair Coin Toss
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.05.010openalex-snapshot
Extractors from Reed–Muller codes
inferred← citeshttps://doi.org/10.1080/17445760.2021.1879067openalex-snapshot
A synod based deterministic and indulgent leader election protocol for asynchronous large groups
inferred← citeshttps://doi.org/10.1109/aero.2010.5446905openalex-snapshot
Assessment and mitigation of cyber exploits in future aircraft surveillance
inferred← citeshttps://doi.org/10.1109/focs.2006.30openalex-snapshot
Fault-Tolerant Distributed Computing in Full-Information Networks
inferred← citeshttps://doi.org/10.1109/focs.2007.52openalex-snapshot
Minimizing Average Flow-time : Upper and Lower Bounds
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238184openalex-snapshot
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography
inferred← citeshttps://doi.org/10.1137/050641715openalex-snapshot
The Round Complexity of Two-Party Random Selection
inferred← citeshttps://doi.org/10.1137/s0097539700376007openalex-snapshot
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
inferred← citeshttps://doi.org/10.1137/s0097539705446846openalex-snapshot
Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
inferred← citeshttps://doi.org/10.1142/9789812562494_0013openalex-snapshot
RECENT DEVELOPMENTS IN EXPLICIT CONSTRUCTIONS OF EXTRACTORS
inferred← citeshttps://doi.org/10.1145/1059513.1059516openalex-snapshot
Simple extractors for all min-entropies and a new pseudorandom generator
inferred← citeshttps://doi.org/10.1145/1060590.1060641openalex-snapshot
The round complexity of two-party random selection
inferred← citeshttps://doi.org/10.1145/1132516.1132543openalex-snapshot
Byzantine agreement in the full-information model in O(log n) rounds
inferred← citeshttps://doi.org/10.1145/1132516.1132544openalex-snapshot
Fast leader-election protocols with bounded cheaters' edge
inferred← citeshttps://doi.org/10.1145/2488608.2488708openalex-snapshot
New independent source extractors with exponential improvement
inferred← citeshttps://doi.org/10.1145/2897518.2897528openalex-snapshot
Explicit two-source extractors and resilient functions
inferred← citeshttps://doi.org/10.1145/3212734.3212767openalex-snapshot
Fair Leader Election for Rational Agents in Asynchronous Rings and Networks
inferred← citeshttps://doi.org/10.1145/3369740.3369770openalex-snapshot
Attack resistant Leader Election in Social Overlay Networks by Leveraging Local Voting
inferred← citeshttps://doi.org/10.1145/3796701.3815915openalex-snapshot
Distributed Renaming with Subquadratic Bits via Scalable Committee Election
inferred← citeshttps://doi.org/10.1214/11-aap832openalex-snapshot
Stochastic coalescence in logarithmic time
inferred← citeshttps://doi.org/10.3233/ica-2006-13102openalex-snapshot
An autonomic election algorithm based on emergence in natural systems
inferred← citeshttps://doi.org/10.3390/electronics12030546openalex-snapshot
Blockchain Technology: Security Issues, Healthcare Applications, Challenges and Future Trends
inferred← citeshttps://doi.org/10.4108/icst.collaboratecom.2011.247094openalex-snapshot
m-Privacy for Collaborative Data Publishing
inferred← citeshttps://doi.org/10.48550/arxiv.1406.5694openalex-snapshot
Cryptocurrencies without Proof of Work
inferred← citeshttps://doi.org/10.48550/arxiv.1801.07965openalex-snapshot
Winning the Caucus Race: Continuous Leader Election via Public Randomness
inferred← citeshttps://doi.org/10.48550/arxiv.1805.06786openalex-snapshot
Betting on Blockchain Consensus with Fantomette
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4767openalex-snapshot
Applications of Derandomization Theory in Coding
inferred← citeshttps://doi.org/10.5555/2095116.2095162openalex-snapshot
Stochastic coalescence in logarithmic time
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.