On the public citation graph

https://doi.org/10.4086/cjtcs.2016.008

0 signed · 28 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/11523468_105openalex-snapshot
All Quantum Adversary Methods Are Equivalent
inferredcites →https://doi.org/10.1007/11750321_32openalex-snapshot
Block Sensitivity of Weakly Symmetric Functions
inferredcites →https://doi.org/10.1016/0304-3975(76)90053-0openalex-snapshot
On recognizing graph properties from adjacency matrices
inferredcites →https://doi.org/10.1016/j.ipl.2011.09.008openalex-snapshot
Minterm-transitive functions with asymptotically smallest block sensitivity
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.006openalex-snapshot
Polynomial degree vs. quantum query complexity
inferredcites →https://doi.org/10.1016/j.jcss.2007.06.020openalex-snapshot
Quantum certificate complexity
inferredcites →https://doi.org/10.1016/j.tcs.2011.06.025openalex-snapshot
Block sensitivity of minterm-transitive functions
inferredcites →https://doi.org/10.1016/s0020-0190(99)00079-4openalex-snapshot
A note on quantum black-box complexity of almost all Boolean functions
inferredcites →https://doi.org/10.1016/s0304-3975(01)00144-xopenalex-snapshot
Complexity measures and decision tree complexity: a survey
inferredcites →https://doi.org/10.1109/ccc.2004.1313851openalex-snapshot
Graph properties and circular functions: how low can quantum query complexity go?
inferredcites →https://doi.org/10.1109/ccc.2013.27openalex-snapshot
Composition Limits and Separating Examples for Some Boolean Function Complexity Measures
inferredcites →https://doi.org/10.1109/ccc30504.2013openalex-snapshot
2013 IEEE Conference on Computational Complexity
inferredcites →https://doi.org/10.1145/129712.129757openalex-snapshot
On the degree of Boolean functions as real polynomials
inferredcites →https://doi.org/10.1145/2213977.2214044openalex-snapshot
Making polynomials robust to noise
inferredcites →https://doi.org/10.1145/2422436.2422485openalex-snapshot
Properties and applications of boolean function composition
inferredcites →https://doi.org/10.1145/73007.73038openalex-snapshot
CREW PRAMS and decision trees
inferredcites →https://doi.org/10.4230/lipics.mfcs.2026.61openalex-snapshot
Nearly Tight Bounds on the Block Number of Boolean Functions in Terms of Sensitivity
inferredcites →https://doi.org/10.46298/dmtcs.552openalex-snapshot
On the sensitivity of cyclically-invariant Boolean functions

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-319-90530-3_18openalex-snapshot
Quadratically Tight Relations for Randomized Query Complexity
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_11openalex-snapshot
Relations Between Monotone Complexity Measures Based on Decision Tree Complexity
inferred← citeshttps://doi.org/10.1007/s00224-019-09935-xopenalex-snapshot
Quadratically Tight Relations for Randomized Query Complexity
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00031openalex-snapshot
A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract
inferred← citeshttps://doi.org/10.1134/s1995080218070041openalex-snapshot
On Block Sensitivity and Fractional Block Sensitivity
inferred← citeshttps://doi.org/10.1145/3106234openalex-snapshot
Separations in Query Complexity Based on Pointer Functions
inferred← citeshttps://doi.org/10.1145/3406325.3451047openalex-snapshot
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
inferred← citeshttps://doi.org/10.1145/3442357openalex-snapshot
All Classical Adversary Methods Are Equivalent for Total Functions
inferred← citeshttps://doi.org/10.1145/3448643openalex-snapshot
On the Sensitivity Complexity of k -Uniform Hypergraph Properties
inferred← citeshttps://doi.org/10.4086/toc.2018.v014a005openalex-snapshot
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.