The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On some central problems in computational complexity.
On some central problems in computational complexity.
A note on efficient zero-knowledge proofs and arguments (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
ACM SIGACT News
A taxonomy of proof systems (part 2)
ACM SIGACT News
Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
A sublinear bipartiteness tester for bounded degree graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On the efficiency of local decoding procedures for error-correcting codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Secure Internet programming
Some optimal inapproximability results
Journal of the ACM (JACM)
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
Certification of Computational Results
IEEE Transactions on Computers
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Many-Valued Logics and Holographic Proofs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Low Communication 2-Prover Zero-Knowledge Proofs for NP
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Improved Efficient Arguments (Preliminary Version)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Property testing in massive graphs
Handbook of massive data sets
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algebraic testing and weight distributions of codes
Theoretical Computer Science
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
SIA: secure information aggregation in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On interactive proofs with a laconic prover
Computational Complexity
Fast approximate probabilistically checkable proofs
Information and Computation
Robust pcps of proximity, shorter pcps and applications to coding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Fast approximate PCPs for multidimensional bin-packing problems
Information and Computation
Simple PCPs with poly-log rate and query complexity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Almost Orthogonal Linear Codes are Locally Testable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Robust locally testable codes and products of codes
Random Structures & Algorithms
An optimal lower bound for 2-query locally decodable linear codes
Information Processing Letters
SIGACT news complexity theory column 51
ACM SIGACT News
Lower bounds for adaptive locally decodable codes
Random Structures & Algorithms
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Locally testable codes and PCPs of almost-linear length
Journal of the ACM (JACM)
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Towards 3-query locally decodable codes of subexponential length
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer Science
Towards 3-query locally decodable codes of subexponential length
Journal of the ACM (JACM)
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
SIA: Secure information aggregation in sensor networks
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
ACM Transactions on Computation Theory (TOCT)
Fast approximate PCPs for multidimensional bin-packing problems
Information and Computation
An optimal lower bound for 2-query locally decodable linear codes
Information Processing Letters
Communications of the ACM
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Short PCPPs verifiable in polylogarithmic time with O(1) queries
Annals of Mathematics and Artificial Intelligence
Two-query PCP with subconstant error
Journal of the ACM (JACM)
Error correcting codes over algebraic surfaces
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Improved delegation of computation using fully homomorphic encryption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Local Monotonicity Reconstruction
SIAM Journal on Computing
Limitation on the rate of families of locally testable codes
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Invariance in property testing
Property testing
Optimal Testing of Reed-Muller Code
Property testing
Local property reconstruction and monotonicity
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Invariance in property testing
Property testing
Optimal Testing of Reed-Muller Code
Property testing
Local property reconstruction and monotonicity
Property testing
Toward practical and unconditional verification of remote computations
HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems
Separating succinct non-interactive arguments from all falsifiable assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing
NP-hardness of approximately solving linear equations over reals
Proceedings of the forty-third annual ACM symposium on Theory of computing
Short locally testable codes and proofs
Studies in complexity and cryptography
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
On obfuscating programs with tamper-proof hardware
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Limits on the rate of locally testable affine-invariant codes
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Public key locally decodable codes with short keys
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Practical delegation of computation using multiple servers
Proceedings of the 18th ACM conference on Computer and communications security
Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length
ACM Transactions on Computation Theory (TOCT)
SIAM Journal on Computing
Improved lower bounds for locally decodable codes and private information retrieval
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Gap amplification in PCPs using lazy random walks
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Quantum online memory checking
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
Secure two-party computation with low communication
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On efficient zero-knowledge PCPs
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Survey: A survey on the structure of approximation classes
Computer Science Review
SIAM Journal on Discrete Mathematics
Integrity verification of cloud-hosted data analytics computations
Proceedings of the 1st International Workshop on Cloud Intelligence
Taking proof-based verified computation a few steps closer to practicality
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Private locally decodable codes
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Succinct non-interactive arguments via linear interactive proofs
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Resolving the conflict between generality and plausibility in verified computation
Proceedings of the 8th ACM European Conference on Computer Systems
Delegation of computation with verification outsourcing: curious verifiers
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Every locally characterized affine-invariant property is testable
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the concrete efficiency of probabilistically-checkable proofs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Local correctability of expander codes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Locally testable codes and cayley graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.02 |