On the public citation graph

Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science

https://doi.org/10.1145/3373718
0 signed · 17 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 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-52482-1_9openalex-snapshot
A Tutorial Introduction to Quantum Circuit Programming in Dependently Typed Proto-Quipper
inferred← citeshttps://doi.org/10.1007/s11704-023-3208-4openalex-snapshot
An extension of process calculus for asynchronous communications between agents with epistemic states
inferred← citeshttps://doi.org/10.1016/j.aim.2022.108712openalex-snapshot
Polyadic sets and homomorphism counting
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103666openalex-snapshot
A counter abstraction technique for verifying properties of probabilistic swarm systems
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105229openalex-snapshot
Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions
inferred← citeshttps://doi.org/10.1016/j.jcta.2025.106099openalex-snapshot
The Weisfeiler-Leman stabilization of a tree
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100893openalex-snapshot
Fundamentals of compositional rewriting theory
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.10.025openalex-snapshot
A proof system for disjoint parallel quantum programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.038openalex-snapshot
A computation model with automatic functions and relations as primitive operations
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.027openalex-snapshot
Radical theory of Scott-open filters
inferred← citeshttps://doi.org/10.1093/jigpal/jzaf068openalex-snapshot
A constructive proof of the Craig’s interpolation theorem for QCiore
inferred← citeshttps://doi.org/10.1145/3547655openalex-snapshot
A reasonably gradual type theory
inferred← citeshttps://doi.org/10.1145/3636501.3636945openalex-snapshot
Formalizing the ∞-Categorical Yoneda Lemma
inferred← citeshttps://doi.org/10.1145/3661814.3662130openalex-snapshot
Effectful semantics in bicategories: strong, commutative, and concurrent pseudomonads
inferred← citeshttps://doi.org/10.32920/ryerson.14649945.v1openalex-snapshot
Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:42)2022openalex-snapshot
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:3)2022openalex-snapshot
Modules over monads and operational semantics (expanded version)
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.