Machine models and linear time complexity
ACM SIGACT News
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
The quasilinear isomorphism challenge
ACM SIGACT News
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The cost of the missing bit: communication complexity with help
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
CNN Algorithms for Video Authentication and Copyright Protection
Journal of VLSI Signal Processing Systems - Special issue on spatiotemporal signal processing with analog CNN visual microprocessors
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Spectral Bounds on General Hard Core Predicates
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Tabulation based 4-universal hashing with applications to second moment estimation
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Foundations of Security for Hash Chains in Ad Hoc Networks
Cluster Computing
Bounds on the OBDD-size of integer multiplication via universal hashing
Journal of Computer and System Sciences
Theoretical Computer Science - Computing and combinatorics
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
New hash functions for message authentication
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Cryptographic primitives enforcing communication and storage complexity
FC'02 Proceedings of the 6th international conference on Financial cryptography
Input locality and hardness amplification
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Separating deterministic from nondeterministic nof multiparty communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Sparse extractor families for all the entropy
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
A real-time privacy amplification scheme in quantum key distribution
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
A scalable and nearly uniform generator of SAT witnesses
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
Proceedings of the 5th conference on Innovations in theoretical computer science
Isolating an Odd Number of Elements and Applications in Complexity Theory
Theory of Computing Systems
| Hi-index | 0.00 |