| Publication | Date of Publication | Type |
|---|
| An incentive analysis of some bitcoin fee designs (invited talk) | 2026-03-18 | Paper |
A Quantized Analogue of the Markov–Krein Correspondence
IMRN. International Mathematics Research Notices | 2023-04-05 | Paper |
| Densities for Elliptic Curves over Global Function Fields | 2023-01-26 | Paper |
| Limits of Probability Measures With General Coefficients | 2021-09-28 | Paper |
A Quantized Analogue of the Markov-Krein Correspondence
(available as arXiv preprint) | 2020-11-21 | Paper |
On revenue monotonicity in combinatorial auctions
(available as arXiv preprint) | 2018-11-08 | Paper |
An \(n\)-to-\(1\) bidder reduction for multi-item auctions and its applications
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Decision tree complexity and Betti numbers
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Concurrent knowledge extraction in public-key models
Journal of Cryptology | 2016-04-07 | Paper |
Classical physics and the Church--Turing Thesis
Journal of the ACM | 2015-12-07 | Paper |
Quantum bit escrow
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
On revenue maximization for selling multiple independently distributed items
Proceedings of the National Academy of Sciences | 2014-07-25 | Paper |
Graph coloring applied to secure computation in non-abelian groups
Journal of Cryptology | 2013-01-04 | Paper |
Computationally-fair group and identity-based key-exchange
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
Algorithmica | 2011-03-30 | Paper |
Concurrent knowledge extraction in the public-key model
Automata, Languages and Programming | 2010-09-07 | Paper |
On the power of quantum fingerprinting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Graph entropy and quantum sorting problems
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Deniable internet key exchange
Applied Cryptography and Network Security | 2010-07-06 | Paper |
On the quantum query complexity of local search in two and three dimensions
Algorithmica | 2009-08-31 | Paper |
| scientific article; zbMATH DE number 5556642 (Why is no real title available?) | 2009-05-22 | Paper |
A note on the feasibility of generalised universal composability
Mathematical Structures in Computer Science | 2009-03-24 | Paper |
A note on universal composable zero-knowledge in the common reference string model
Theoretical Computer Science | 2009-03-20 | Paper |
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
Some Perspectives on Complexity-Based Cryptography
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
A Note on the Feasibility of Generalized Universal Composability
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Oblivious and adaptive strategies for the majority and plurality problems
Algorithmica | 2007-10-10 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus
Combinatorica | 2003-12-14 | Paper |
\(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1256662 (Why is no real title available?) | 2002-01-21 | Paper |
| scientific article; zbMATH DE number 1559594 (Why is no real title available?) | 2001-03-01 | Paper |
| scientific article; zbMATH DE number 1263182 (Why is no real title available?) | 1999-07-26 | Paper |
An exponential lower bound on the size of algebraic decision trees for MAX
Computational Complexity | 1999-02-02 | Paper |
Dictionary Look-Up with One Error
Journal of Algorithms | 1998-06-01 | Paper |
Decision tree complexity and Betti numbers
Journal of Computer and System Sciences | 1997-10-28 | Paper |
On the shrinkage exponent for read-once formulae
Theoretical Computer Science | 1997-09-29 | Paper |
Algebraic decision trees and Euler characteristics
Theoretical Computer Science | 1997-02-28 | Paper |
On Computing Algebraic Functions Using Logarithms and Exponentials
SIAM Journal on Computing | 1996-03-18 | Paper |
Minimean optimal key arrangements in hash tables
Algorithmica | 1995-10-25 | Paper |
Near-Optimal Time-Space Tradeoff for Element Distinctness
SIAM Journal on Computing | 1995-08-27 | Paper |
A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests
Information Processing Letters | 1994-03-22 | Paper |
A circuit-based proof of Toda's theorem
Information and Computation | 1993-08-30 | Paper |
| scientific article; zbMATH DE number 176732 (Why is no real title available?) | 1993-05-18 | Paper |
Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
SIAM Journal on Computing | 1992-06-25 | Paper |
Lower bounds to randomized algorithms for graph properties
Journal of Computer and System Sciences | 1991-01-01 | Paper |
ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
On the Complexity of Partial Order Productions
SIAM Journal on Computing | 1989-01-01 | Paper |
On selecting the k largest with median tests
Algorithmica | 1989-01-01 | Paper |
Monotone Bipartite Graph Properties are Evasive
SIAM Journal on Computing | 1988-01-01 | Paper |
On the Complexity of Maintaining Partial Sums
SIAM Journal on Computing | 1985-01-01 | Paper |
On Fault-Tolerant Networks for Sorting
SIAM Journal on Computing | 1985-01-01 | Paper |
On the Expected Performance of Path Compression Algorithms
SIAM Journal on Computing | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3921975 (Why is no real title available?) | 1985-01-01 | Paper |
On optimal arrangements of keys with double hashing
Journal of Algorithms | 1985-01-01 | Paper |
Uniform hashing is optimal
Journal of the ACM | 1985-01-01 | Paper |
On the security of public key protocols
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3808822 (Why is no real title available?) | 1983-01-01 | Paper |
On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
SIAM Journal on Computing | 1982-01-01 | Paper |
The Complexity of Finding Cycles in Periodic Functions
SIAM Journal on Computing | 1982-01-01 | Paper |
On Parallel Computation for the Knapsack Problem
Journal of the ACM | 1982-01-01 | Paper |
Lower bounds for algebraic decision trees
Journal of Algorithms | 1982-01-01 | Paper |
Rearrangeable Networks with Limited Depth
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
On the time-space tradeoff for sorting with linear queries
Theoretical Computer Science | 1982-01-01 | Paper |
On the Average-Case Complexity of Selecting the kth Best
SIAM Journal on Computing | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3817450 (Why is no real title available?) | 1982-01-01 | Paper |
Should Tables Be Sorted?
Journal of the ACM | 1981-01-01 | Paper |
A Lower Bound to Finding Convex Hulls
Journal of the ACM | 1981-01-01 | Paper |
An Analysis of a Memory Allocation Scheme for Implementing Stacks
SIAM Journal on Computing | 1981-01-01 | Paper |
Efficient searching using partial ordering
Information Processing Letters | 1981-01-01 | Paper |
New Algorithms for Bin Packing
Journal of the ACM | 1980-01-01 | Paper |
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software | 1980-01-01 | Paper |
On the Polyhedral Decision Problem
SIAM Journal on Computing | 1980-01-01 | Paper |
A note on the analysis of extendible hashing
Information Processing Letters | 1980-01-01 | Paper |
Bounds on Selection Networks
SIAM Journal on Computing | 1980-01-01 | Paper |
Information Bounds Are Weak in the Shortest Distance Problem
Journal of the ACM | 1980-01-01 | Paper |
An analysis of (h, k, 1)-Shellsort
Journal of Algorithms | 1980-01-01 | Paper |
External Hashing Schemes for Collections of Data Structures
Journal of the ACM | 1980-01-01 | Paper |
The Complexity of Pattern Matching for a Random String
SIAM Journal on Computing | 1979-01-01 | Paper |
Storing a sparse table
Communications of the ACM | 1979-01-01 | Paper |
A note on a conjecture of Kam and Ullman concerning statistical databases
Information Processing Letters | 1979-01-01 | Paper |
On random 2-3 trees
Acta Informatica | 1978-01-01 | Paper |
k + 1 Heads Are Better than k
Journal of the ACM | 1978-01-01 | Paper |
On the Loop Switching Addressing Problem
SIAM Journal on Computing | 1978-01-01 | Paper |
Resource constrained scheduling as generalized bin packing
Journal of Combinatorial Theory. Series A | 1976-01-01 | Paper |
An almost optimal algorithm for unbounded searching
Information Processing Letters | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3614066 (Why is no real title available?) | 1976-01-01 | Paper |
On the Evaluation of Powers
SIAM Journal on Computing | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3569817 (Why is no real title available?) | 1976-01-01 | Paper |
Lower Bounds on Merging Networks
Journal of the ACM | 1976-01-01 | Paper |
On a problem of Katona on minimal separating systems
Discrete Mathematics | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3560263 (Why is no real title available?) | 1976-01-01 | Paper |
An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
Information Processing Letters | 1975-01-01 | Paper |
Analysis of the subtractive algorithm for greatest common divisors
Proceedings of the National Academy of Sciences | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3473339 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3560634 (Why is no real title available?) | 1975-01-01 | Paper |
