On the public citation graph
The Complexity of Quantitative Information Flow Problems
0 signed · 32 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-3-642-00596-1_21openalex-snapshot
On the Foundations of Quantitative Information Flow
inferredcites →https://doi.org/10.1007/978-3-642-15497-3_22openalex-snapshot
On Bounding Problems of Quantitative Information Flow
inferredcites →https://doi.org/10.1016/0022-0000(84)90034-5openalex-snapshot
The complexity of two-player games of incomplete information
inferredcites →https://doi.org/10.1016/j.entcs.2004.01.018openalex-snapshot
Quantified Interference for a While Language
inferredcites →https://doi.org/10.1109/csf.2010.9openalex-snapshot
Quantitative Information Flow - Verification Hardness and Possibilities
inferredcites →https://doi.org/10.1109/csfw.2005.15openalex-snapshot
Dimensions and Principles of Declassification
inferredcites →https://doi.org/10.1109/csit.1975.6498831openalex-snapshot
Protection of information in computer systems
inferredcites →https://doi.org/10.1109/jsac.2002.806121openalex-snapshot
Language-based information-flow security
inferredcites →https://doi.org/10.1109/proc.1975.9939openalex-snapshot
The protection of information in computer systems
inferredcites →https://doi.org/10.1145/1064978.1065045openalex-snapshot
Programming by sketching for bit-streaming programs
inferredcites →https://doi.org/10.1145/1065010.1065045openalex-snapshot
Programming by sketching for bit-streaming programs
inferredcites →https://doi.org/10.1145/1290958.1290991openalex-snapshot
Toward a safer and more secure cyberspace
inferredcites →https://doi.org/10.1145/1375581.1375599openalex-snapshot
Sketching concurrent data structures
inferredcites →https://doi.org/10.1145/1706299.1706338openalex-snapshot
Abstraction-guided synthesis of synchronization
inferredcites →https://doi.org/10.17226/11925openalex-snapshot
Toward a Safer and More Secure Cyberspace
inferredcites →https://doi.org/10.3233/jcs-2007-15302openalex-snapshot
A static analysis for quantifying information flow in a simple imperative language
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-031-13185-1_18openalex-snapshot
A Scalable Shannon Entropy Estimator
inferred← citeshttps://doi.org/10.1007/978-3-642-38874-3_1openalex-snapshot
Automation of Quantitative Information-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_6openalex-snapshot
Quantitative Information Flow in Boolean Programs
inferred← citeshttps://doi.org/10.1007/s10703-024-00467-wopenalex-snapshot
A scalable entropy estimator
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.031openalex-snapshot
Quantitative information flow as safety and liveness hyperproperties
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.011openalex-snapshot
The complexity of synchronous notions of information flow security
inferred← citeshttps://doi.org/10.1109/eurosp.2016.15openalex-snapshot
Precisely Measuring Quantitative Information Flow: 10K Lines of Code and Beyond
inferred← citeshttps://doi.org/10.1145/2038642.2038666openalex-snapshot
From boolean to quantitative synthesis
inferred← citeshttps://doi.org/10.4204/eptcs.85.6openalex-snapshot
Quantitative Information Flow as Safety and Liveness Hyperproperties
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.534openalex-snapshot
The Complexity of Quantitative Information Flow in Recursive Programs
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2014.505openalex-snapshot
Computing Information Flow Using Symbolic Model-Checking
inferred← citeshttps://doi.org/10.48550/arxiv.1504.02796openalex-snapshot
Model Counting Modulo Theories
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.