| Publication | Date of Publication | Type |
|---|
| A Quantized Analogue of the Markov–Krein Correspondence | 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 | 2020-11-21 | Paper |
| On revenue monotonicity in combinatorial auctions | 2018-11-08 | Paper |
| An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications | 2017-10-05 | Paper |
| Decision tree complexity and Betti numbers | 2016-09-01 | Paper |
| Concurrent knowledge extraction in public-key models | 2016-04-07 | Paper |
| Classical physics and the Church--Turing Thesis | 2015-12-07 | Paper |
| Quantum bit escrow | 2014-09-26 | Paper |
| On revenue maximization for selling multiple independently distributed items | 2014-07-25 | Paper |
| Graph coloring applied to secure computation in non-abelian groups | 2013-01-04 | Paper |
| Computationally-Fair Group and Identity-Based Key-Exchange | 2012-07-16 | Paper |
| Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem | 2011-03-30 | Paper |
| Concurrent Knowledge Extraction in the Public-Key Model | 2010-09-07 | Paper |
| On the power of quantum fingerprinting | 2010-08-16 | Paper |
| Graph entropy and quantum sorting problems | 2010-08-15 | Paper |
| Deniable Internet Key Exchange | 2010-07-06 | Paper |
| On the quantum query complexity of local search in two and three dimensions | 2009-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3626604 | 2009-05-22 | Paper |
| A note on the feasibility of generalised universal composability | 2009-03-24 | Paper |
| A note on universal composable zero-knowledge in the common reference string model | 2009-03-20 | Paper |
| Graph Design for Secure Multiparty Computation over Non-Abelian Groups | 2009-02-10 | Paper |
| Some Perspectives on Complexity-Based Cryptography | 2009-02-10 | Paper |
| A Note on Universal Composable Zero Knowledge in Common Reference String Model | 2007-11-13 | Paper |
| A Note on the Feasibility of Generalized Universal Composability | 2007-11-13 | Paper |
| Oblivious and adaptive strategies for the majority and plurality problems | 2007-10-10 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus | 2003-12-14 | Paper |
| \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230349 | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527043 | 2001-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234052 | 1999-07-26 | Paper |
| An exponential lower bound on the size of algebraic decision trees for MAX | 1999-02-02 | Paper |
| Dictionary Look-Up with One Error | 1998-06-01 | Paper |
| Decision tree complexity and Betti numbers | 1997-10-28 | Paper |
| On the shrinkage exponent for read-once formulae | 1997-09-29 | Paper |
| Algebraic decision trees and Euler characteristics | 1997-02-28 | Paper |
| On Computing Algebraic Functions Using Logarithms and Exponentials | 1996-03-18 | Paper |
| Minimean optimal key arrangements in hash tables | 1995-10-25 | Paper |
| Near-Optimal Time-Space Tradeoff for Element Distinctness | 1995-08-27 | Paper |
| A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests | 1994-03-22 | Paper |
| A circuit-based proof of Toda's theorem | 1993-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036561 | 1993-05-18 | Paper |
| Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains | 1992-06-25 | Paper |
| Lower bounds to randomized algorithms for graph properties | 1991-01-01 | Paper |
| ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS | 1990-01-01 | Paper |
| On selecting the k largest with median tests | 1989-01-01 | Paper |
| On the Complexity of Partial Order Productions | 1989-01-01 | Paper |
| Monotone Bipartite Graph Properties are Evasive | 1988-01-01 | Paper |
| On Fault-Tolerant Networks for Sorting | 1985-01-01 | Paper |
| On the Expected Performance of Path Compression Algorithms | 1985-01-01 | Paper |
| On the Complexity of Maintaining Partial Sums | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696515 | 1985-01-01 | Paper |
| On optimal arrangements of keys with double hashing | 1985-01-01 | Paper |
| Uniform hashing is optimal | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3657300 | 1983-01-01 | Paper |
| On the security of public key protocols | 1983-01-01 | Paper |
| On the time-space tradeoff for sorting with linear queries | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3664859 | 1982-01-01 | Paper |
| Lower bounds for algebraic decision trees | 1982-01-01 | Paper |
| The Complexity of Finding Cycles in Periodic Functions | 1982-01-01 | Paper |
| On Parallel Computation for the Knapsack Problem | 1982-01-01 | Paper |
| On the Average-Case Complexity of Selecting the kth Best | 1982-01-01 | Paper |
| On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems | 1982-01-01 | Paper |
| Rearrangeable Networks with Limited Depth | 1982-01-01 | Paper |
| Efficient searching using partial ordering | 1981-01-01 | Paper |
| An Analysis of a Memory Allocation Scheme for Implementing Stacks | 1981-01-01 | Paper |
| Should Tables Be Sorted? | 1981-01-01 | Paper |
| A Lower Bound to Finding Convex Hulls | 1981-01-01 | Paper |
| A note on the analysis of extendible hashing | 1980-01-01 | Paper |
| External Hashing Schemes for Collections of Data Structures | 1980-01-01 | Paper |
| New Algorithms for Bin Packing | 1980-01-01 | Paper |
| An analysis of (h, k, 1)-Shellsort | 1980-01-01 | Paper |
| Optimal Expected-Time Algorithms for Closest Point Problems | 1980-01-01 | Paper |
| Bounds on Selection Networks | 1980-01-01 | Paper |
| On the Polyhedral Decision Problem | 1980-01-01 | Paper |
| Information Bounds Are Weak in the Shortest Distance Problem | 1980-01-01 | Paper |
| A note on a conjecture of Kam and Ullman concerning statistical databases | 1979-01-01 | Paper |
| Storing a sparse table | 1979-01-01 | Paper |
| The Complexity of Pattern Matching for a Random String | 1979-01-01 | Paper |
| On random 2-3 trees | 1978-01-01 | Paper |
| k + 1 Heads Are Better than k | 1978-01-01 | Paper |
| On the Loop Switching Addressing Problem | 1978-01-01 | Paper |
| On a problem of Katona on minimal separating systems | 1976-01-01 | Paper |
| An almost optimal algorithm for unbounded searching | 1976-01-01 | Paper |
| Resource constrained scheduling as generalized bin packing | 1976-01-01 | Paper |
| On the Evaluation of Powers | 1976-01-01 | Paper |
| Lower Bounds on Merging Networks | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131233 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140369 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4178385 | 1976-01-01 | Paper |
| An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4057624 | 1975-01-01 | Paper |
| Analysis of the subtractive algorithm for greatest common divisors | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131545 | 1975-01-01 | Paper |
