Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
Real-Time Simulation of Multihead Tape Units
Journal of the ACM (JACM)
Computational Work and Time on Finite Machines
Journal of the ACM (JACM)
New real-time simulations of multihead tape units
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Towards a theory of software protection and simulation by oblivious RAMs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Towards a theory of software protection
Proceedings on Advances in cryptology---CRYPTO '86
Journal of the ACM (JACM)
Efficient computation on oblivious RAMs
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the concrete complexity of zero-knowledge proofs
CRYPTO '89 Proceedings on Advances in cryptology
An efficient software protection scheme
CRYPTO '89 Proceedings on Advances in cryptology
Machine models and linear time complexity
ACM SIGACT News
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Shifting Graphs and Their Applications
Journal of the ACM (JACM)
Encoding Data Structures in Trees
Journal of the ACM (JACM)
An overview of computational complexity
Communications of the ACM
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Multi-head finite automata: data-independent versus data-dependent computations
Theoretical Computer Science
Polynomially bounded minimization problems that are hard to approximate
Nordic Journal of Computing
Explanation by Computer Simulation in Cognitive Science
Minds and Machines
The Inapproximability of Non NP-hard Optimization Problems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Bounded size dictionary compression: SCk -completeness and NC algorithms
Information and Computation
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Probabilistic simulations (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Real-time simulation of multicounters by oblivious one-tape turing machines (Preliminary Draft)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Bandwidth constrained NP-Complete problems
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An information-theoretic approach to time bounds for on-line computation (preliminary version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the simulation of quantum Turing machines
Theoretical Computer Science
On the computational complexity of qualitative coalitional games
Artificial Intelligence
The complexity of contract negotiation
Artificial Intelligence
Energy Aware Computing through Probabilistic Switching: A Study of Limits
IEEE Transactions on Computers
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Determination of equivalence between quantum sequential machines
Theoretical Computer Science
The complexity of depth-3 circuits computing symmetric Boolean functions
Information Processing Letters
Inductive Time-Space Lower Bounds for Sat and Related Problems
Computational Complexity
An overview of computational complexity
ACM Turing award lectures
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Neural Computation
The complexity of deciding reachability properties of distributed negotiation schemes
Theoretical Computer Science
The complexity of contract negotiation
Artificial Intelligence
Multi-party indirect indexing and applications
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Oblivious RAMs without cryptogrpahic assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Brief announcement: swarming secrets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Algorithms and theory of computation handbook
Improved simulation of nondeterministic turing machines
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
The size and depth of layered Boolean circuits
Information Processing Letters
Secure computation with information leaking to an adversary
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the (in)security of hash-based oblivious RAM and a new balancing scheme
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Privacy-preserving group data access via stateless oblivious RAM simulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved simulation of nondeterministic Turing machines
Theoretical Computer Science
The size and depth of layered boolean circuits
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Proceedings of the second ACM conference on Data and Application Security and Privacy
Time complexity of tape reduction for reversible turing machines
RC'11 Proceedings of the Third international conference on Reversible Computation
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On constant-round precise zero-knowledge
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Distributed oblivious RAM for secure two-party computation
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
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Privacy-preserving matrix factorization
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.03 |