On the public citation graph

Proceedings 16th Annual IEEE Conference on Computational Complexity

https://doi.org/10.1109/ccc.2001

0 signed · 46 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.1006/jcss.1999.1678openalex-snapshot

Undecidability Results for Low Complexity Time Classes

inferred← citeshttps://doi.org/10.1006/jcss.2000.1732openalex-snapshot

Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity

inferred← citeshttps://doi.org/10.1006/jcss.2001.1762openalex-snapshot

Branching Program Size Is Almost Linear in Formula Size

inferred← citeshttps://doi.org/10.1006/jcss.2001.1815openalex-snapshot

Reducing the Number of Solutions of NP Functions

inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_21openalex-snapshot

One-Way Permutations and Self-Witnessing Languages

inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_3openalex-snapshot

Sparse Sets versus Complexity Classes

inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_42openalex-snapshot

On Finding Frequent Elements in a Data Stream

inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_46openalex-snapshot

A Separation between Divergence and Holevo Information for Ensembles

inferred← citeshttps://doi.org/10.1007/s00224-011-9332-9openalex-snapshot

On the Correlation Between Parity and Modular Polynomials

inferred← citeshttps://doi.org/10.1007/s00233-008-9060-xopenalex-snapshot

Partially commutative inverse monoids

inferred← citeshttps://doi.org/10.1007/s00453-012-9633-7openalex-snapshot

Donation Center Location Problem

inferred← citeshttps://doi.org/10.1016/b978-155860872-6/50030-5openalex-snapshot

BIBLIOGRAPHY

inferred← citeshttps://doi.org/10.1016/j.aim.2025.110460openalex-snapshot

An invariance principle for the multi-slice, with applications

inferred← citeshttps://doi.org/10.1016/j.apal.2005.06.011openalex-snapshot

Kolmogorov–Loveland randomness and stochasticity

inferred← citeshttps://doi.org/10.1016/j.apal.2019.102722openalex-snapshot

Resolution over linear equations modulo two

inferred← citeshttps://doi.org/10.1016/j.future.2020.10.021openalex-snapshot

Cryptographic Framework for Role Control Remedy: A Secure Role Engineering mechanism for Single Authority Organizations

inferred← citeshttps://doi.org/10.1016/j.ic.2007.01.002openalex-snapshot

Inverse monoids: Decidability and complexity of algebraic questions

inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.013openalex-snapshot

Local correctability of expander codes

inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.012openalex-snapshot

An algorithm for the satisfiability problem of formulas in conjunctive normal form

inferred← citeshttps://doi.org/10.1016/j.jcss.2006.01.002openalex-snapshot

LWPP and WPP are not uniformly gap-definable

inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.006openalex-snapshot

Approximate CVP in time 20.802

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.046openalex-snapshot

Parallelizing quantum circuits

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.022openalex-snapshot

Hard constraint satisfaction problems have hard gaps at location 1

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.030openalex-snapshot

Shorter arithmetization of nondeterministic computations

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.005openalex-snapshot

Correlation bounds and #SAT algorithms for small linear-size circuits

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.008openalex-snapshot

Gate elimination: Circuit size lower bounds and #SAT upper bounds

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.032openalex-snapshot

Public vs. private randomness in simultaneous multi-party communication complexity

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.038openalex-snapshot

Circuit lower bounds from learning-theoretic approaches

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.015openalex-snapshot

Alternation, sparsity and sensitivity: Bounds and exponential gaps

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.017openalex-snapshot

Message lower bounds via efficient network synchronization

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.048openalex-snapshot

Sensitivity, affine transforms and quantum communication complexity

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.013openalex-snapshot

Being a permutation is also orthogonal to one-wayness in quantum world: Impossibilities of quantum one-way permutations from one-wayness primitives

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.032openalex-snapshot

On group-characterizability of homomorphic secret sharing schemes

inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00269-1openalex-snapshot

On characterizing the existence of partial one-way permutations

inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00454-4openalex-snapshot

Gales suffice for constructive dimension

inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00229-1openalex-snapshot

Exact complexity of Exact-Four-Colorability

inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00058-3openalex-snapshot

On the computational power of DNA

inferred← citeshttps://doi.org/10.1080/09720529.2020.1729506openalex-snapshot

QuantQueryEXP : A novel strategic approach for query expansion based on quantum computing principles

inferred← citeshttps://doi.org/10.1103/physreva.104.l060602openalex-snapshot

Ability of unbounded pairs of observers to achieve quantum advantage in random access codes with a single pair of qubits

inferred← citeshttps://doi.org/10.1103/physreva.106.022405openalex-snapshot

Process-optimized phase-covariant quantum cloning

inferred← citeshttps://doi.org/10.1103/physreva.71.012310openalex-snapshot

Quantum fingerprinting with a single particle

inferred← citeshttps://doi.org/10.1103/physreva.79.024307openalex-snapshot

Faster transport with a directed quantum walk

inferred← citeshttps://doi.org/10.1103/physreva.90.042308openalex-snapshot

Entanglement of π –locally-maximally-entangleable states and the satisfiability problem

inferred← citeshttps://doi.org/10.1103/physreva.99.062331openalex-snapshot

Quantum sketching protocols for Hamming distance and beyond

inferred← citeshttps://doi.org/10.1145/261124.261126openalex-snapshot

Disjunctive datalog

inferred← citeshttps://doi.org/10.1145/2699415openalex-snapshot

Programming the quantum future

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.