On the public citation graph
Indistinguishability
0 signed · 38 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.1007/978-0-387-09766-4_517openalex-snapshot
Behavioral Equivalences
inferredcites →https://doi.org/10.1007/978-3-031-02010-0openalex-snapshot
Impossibility Results for Distributed Computing
inferredcites →https://doi.org/10.1007/978-3-319-11164-3_26openalex-snapshot
The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_26openalex-snapshot
A Grand Challenge for Computing: Towards Full Reactive Modeling of a Multi-cellular Animal
inferredcites →https://doi.org/10.1007/bf00993409openalex-snapshot
Learning Fallible Deterministic Finite Automata
inferredcites →https://doi.org/10.1007/s00446-009-0092-6openalex-snapshot
Model checking transactional memories
inferredcites →https://doi.org/10.1007/s10992-018-9463-4openalex-snapshot
A Topological Approach to Full Belief
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0885-064x(85)90010-xopenalex-snapshot
Optimal precision in the presence of uncertainty
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/s0304-3975(97)00014-5openalex-snapshot
Recent advances of grammatical inference
inferredcites →https://doi.org/10.1137/s0097539794266328openalex-snapshot
Optimal Clock Synchronization under Different Delay Assumptions
inferredcites →https://doi.org/10.1145/1706299.1706305openalex-snapshot
Sequential verification of serializability
inferredcites →https://doi.org/10.1145/195058.195466openalex-snapshot
A theory of clock synchronization (extended abstract)
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/360363.360369openalex-snapshot
The notions of consistency and predicate locks in a database system
inferredcites →https://doi.org/10.1209/0295-5075/119/48001openalex-snapshot
Distinguishing humans from computers in the game of go: A complex network approach
inferredcites →https://doi.org/10.4204/eptcs.277.6openalex-snapshot
A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability
inferredcites →https://doi.org/10.5860/choice.38-2789openalex-snapshot
A course in model theory: an introduction to contemporary mathematical logic
inferredcites →https://doi.org/10.5860/choice.39-2844openalex-snapshot
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
inferredcites →https://doi.org/10.5860/choice.51-2716openalex-snapshot
Probably approximately correct: nature's algorithms for learning and prospering in a complex world
inferredcites →https://doi.org/10.5962/bhl.title.5851openalex-snapshot
An introduction to cybernetics
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-79527-6_16openalex-snapshot
A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_25openalex-snapshot
Information Exchange in the Russian Cards Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_3openalex-snapshot
A Short Visit to Distributed Computing Where Simplicity Is Considered a First Class Property
inferred← citeshttps://doi.org/10.1007/978-3-031-81404-4_3openalex-snapshot
Invited Paper: Distributed Computability: A Few Results Masters Students Should Know
inferred← citeshttps://doi.org/10.1007/s00446-025-00480-0openalex-snapshot
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113761openalex-snapshot
A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
inferred← citeshttps://doi.org/10.1145/3519270.3538422openalex-snapshot
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
inferred← citeshttps://doi.org/10.1145/3519270.3538445openalex-snapshot
Parameterized Verification under Release Acquire is PSPACE-complete
inferred← citeshttps://doi.org/10.13053/cys-26-2-4234openalex-snapshot
Two-Agent Approximate Agreement from an Epistemic Logic Perspective
inferred← citeshttps://doi.org/10.20868/upm.thesis.36255openalex-snapshot
Time-multiscale methods for the simulation of slow transport problems in atomistic systems
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4125819/v1openalex-snapshot
Wait-free Algorithms: the Burden of the Past
inferred← citeshttps://doi.org/10.62019/z0jsj813openalex-snapshot
A Unified Complexity Theory Analyzing Medical and Chemical Algorithms
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.