On the public citation graph

On being incoherent without being very hard

0 signed · 69 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/bf01200056openalex-snapshot

Non-deterministic exponential time has two-prover interactive protocols

inferredcites →https://doi.org/10.1007/bf01200430openalex-snapshot

Non-deterministic exponential time has two-prover interactive protocols

inferredcites →https://doi.org/10.1016/0022-0000(89)90018-4openalex-snapshot

On hiding information from an oracle

inferredcites →https://doi.org/10.1016/0304-3975(85)90158-6openalex-snapshot

Robust algorithms: A different approach to oracles

inferredcites →https://doi.org/10.1016/0304-3975(87)90078-8openalex-snapshot

On helping by robust oracle machines

inferredcites →https://doi.org/10.1016/s0019-9958(74)90473-2openalex-snapshot

Tally languages and complexity classes

inferredcites →https://doi.org/10.1090/dimacs/002/06openalex-snapshot

Program result checking against adaptive programs and in cryptographic settings

inferredcites →https://doi.org/10.1090/dimacs/002/13openalex-snapshot

New directions in testing

inferredcites →https://doi.org/10.1090/s0002-9947-1976-0403933-6openalex-snapshot

Relativization of the theory of computational complexity

inferredcites →https://doi.org/10.1109/fscs.1990.89518openalex-snapshot

Algebraic methods for interactive proof systems

inferredcites →https://doi.org/10.1109/fscs.1990.89520openalex-snapshot

Nondeterministic exponential time has two-prover interactive protocols

inferredcites →https://doi.org/10.1109/sct.1988.5275openalex-snapshot

On the power of multi-power interactive protocols

inferredcites →https://doi.org/10.1109/sct.1990.113959openalex-snapshot

Lower bounds on random-self-reducibility

inferredcites →https://doi.org/10.1109/sct.1991.160252openalex-snapshot

On the random-self-reducibility of complete sets

inferredcites →https://doi.org/10.1109/sfcs.1978.37openalex-snapshot

Two theorems on random polynomial time

inferredcites →https://doi.org/10.1109/sfcs.1987.49openalex-snapshot

Random self-reducibility and zero knowledge interactive proofs of possession of information

inferredcites →https://doi.org/10.1109/sfcs.1991.185343openalex-snapshot

Languages that are easier than their proofs

inferredcites →https://doi.org/10.1137/0218012openalex-snapshot

The Knowledge Complexity of Interactive Proof Systems

inferredcites →https://doi.org/10.1137/s0097539792228289openalex-snapshot

The Complexity of Decision Versus Search

inferredcites →https://doi.org/10.1145/100216.100225openalex-snapshot

Self-testing/correcting with applications to numerical problems

inferredcites →https://doi.org/10.1145/100216.100226openalex-snapshot

Coherent functions and program checkers

inferredcites →https://doi.org/10.1145/146585.146609openalex-snapshot

IP = PSPACE

inferredcites →https://doi.org/10.1145/73007.73015openalex-snapshot

Designing programs that check their work

inferredcites →https://doi.org/10.1145/800061.808769openalex-snapshot

Sparse sets in NP-P

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.1996.0062openalex-snapshot

P-Selective Self-Reducible Sets: A New Characterization of P

inferred← citeshttps://doi.org/10.1007/11549345_27openalex-snapshot

Separating the Notions of Self- and Autoreducibility

inferred← citeshttps://doi.org/10.1007/11549345_34openalex-snapshot

Autoreducibility, Mitoticity, and Immunity

inferred← citeshttps://doi.org/10.1007/11672142_36openalex-snapshot

Redundancy in Complete Sets

inferred← citeshttps://doi.org/10.1007/11750321_4openalex-snapshot

Mitosis in Computational Complexity

inferred← citeshttps://doi.org/10.1007/3-540-48329-2_6openalex-snapshot

A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity

inferred← citeshttps://doi.org/10.1007/3-540-49730-7_6openalex-snapshot

Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions

inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_5openalex-snapshot

Introduction to Autoreducibility and Mitoticity

inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_65openalex-snapshot

An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation

inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_12openalex-snapshot

Non-mitotic Sets

inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_1openalex-snapshot

From Logic to Theoretical Computer Science – An Update

inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_40openalex-snapshot

Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions

inferred← citeshttps://doi.org/10.1007/978-3-662-22110-5_2openalex-snapshot

Complete Sets and Structure in Subrecursive Classes

inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_27openalex-snapshot

Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes

inferred← citeshttps://doi.org/10.1007/978-3-662-49192-8_34openalex-snapshot

Probabilistic Autoreductions

inferred← citeshttps://doi.org/10.1007/bf00190804openalex-snapshot

A low communication competitive interactive proof system for promised quadratic residuosity

inferred← citeshttps://doi.org/10.1007/s00037-017-0157-zopenalex-snapshot

Autoreducibility of NP-Complete Sets under Strong Hypotheses

inferred← citeshttps://doi.org/10.1007/s00224-008-9127-9openalex-snapshot

On the Autoreducibility of Functions

inferred← citeshttps://doi.org/10.1007/s00224-011-9365-0openalex-snapshot

Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses

inferred← citeshttps://doi.org/10.1007/s11245-023-09942-1openalex-snapshot

Towards a Typology of Narrative Frustration

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

Autoreducibility and mitoticity of logspace-complete sets for NP and other classes

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

Autoreducibility, mitoticity, and immunity

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

Non-mitotic sets

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00271-1openalex-snapshot

Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions

inferred← citeshttps://doi.org/10.1017/9781316716816.003openalex-snapshot

Complete Sets and Structure in Subrecursive Classes

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

A Behavioral Analysis of Incivility in the Virtual Workplace

inferred← citeshttps://doi.org/10.1109/ccc.1996.507668openalex-snapshot

On coherence, random-self-reducibility, and self-correction

inferred← citeshttps://doi.org/10.1109/ccc.1999.766261openalex-snapshot

Proofs, codes, and polynomial-time reducibilities

inferred← citeshttps://doi.org/10.1109/ccc.1999.766268openalex-snapshot

Stronger separations for random-self-reducibility, rounds, and advice

inferred← citeshttps://doi.org/10.1109/sct.1993.336542openalex-snapshot

P-selective self-reducibles sets: a new characterization of P

inferred← citeshttps://doi.org/10.1109/sct.1994.315811openalex-snapshot

On the structure of complete sets

inferred← citeshttps://doi.org/10.1109/sfcs.1994.365678openalex-snapshot

Program result-checking: a theory of testing meets a test of theory

inferred← citeshttps://doi.org/10.1109/sfcs.1995.492582openalex-snapshot

Using autoreducibility to separate complexity classes

inferred← citeshttps://doi.org/10.1137/060673886openalex-snapshot

Splitting NP-Complete Sets

inferred← citeshttps://doi.org/10.1137/s0097539798334736openalex-snapshot

Separating Complexity Classes Using Autoreducibility

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

SIGACT news complexity theory column 64

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

Designing programs that check their work

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

Software reliability via run-time result-checking

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

Structural Properties of Nonautoreducible Sets

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

SIGACT News complexity theory column 32

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

SIGACT news complexity theory column 34

inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2462openalex-snapshot

Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses

inferred← citeshttps://doi.org/10.4230/lipics.stacs.2014.590openalex-snapshot

Non-autoreducible Sets for NEXP

inferred← citeshttps://doi.org/10.4230/lipics.stacs.2016.42openalex-snapshot

Autoreducibility of NP-Complete Sets

inferred← citeshttps://doi.org/10.48550/arxiv.1001.0117openalex-snapshot

Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses

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.