| Publication | Date of Publication | Type |
|---|
Sorting and selection with imprecise comparisons
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Determinism versus non-determinism for linear time RAMs (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
The independence of the modulo \(p\) counting principles
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Compactly encoding unstructured inputs with differential compression
Journal of the ACM | 2015-12-07 | Paper |
A sieve algorithm for the shortest lattice vector problem
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Oblivious RAMs without cryptogarphic assumptions
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Lower bounds for RAMs and quantifier elimination
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Secure computation with information leaking to an adversary
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Determinism versus nondeterminism with arithmetic tests and computation
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
scientific article; zbMATH DE number 6292594 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
scientific article; zbMATH DE number 5899238 (Why is no real title available?)
Theory of Computing | 2011-05-24 | Paper |
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector problem
Theory of Computing | 2011-05-24 | Paper |
The worst-case behavior of Schnorr's algorithm approximating the shortest nonzero vector in a lattice
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Representing hard lattices with \(O(n\log n)\) bits (extended abstract)
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
A conjecture about polynomial time computable lattice-lattice functions
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Approximate counting of inversions in a data stream
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
The invasiveness of off-line memory checking
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Sorting and selection with imprecise comparisons
Lecture Notes in Computer Science | 2009-07-14 | Paper |
An Architecture for Provably Secure Computation
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures
Lecture Notes in Computer Science | 2007-11-13 | Paper |
scientific article; zbMATH DE number 2196508 (Why is no real title available?)
| 2005-08-22 | Paper |
Determinism versus nondeterminism for linear time RAMs with memory restrictions
Journal of Computer and System Sciences | 2003-05-04 | Paper |
scientific article; zbMATH DE number 1852132 (Why is no real title available?)
| 2003-01-09 | Paper |
scientific article; zbMATH DE number 1775383 (Why is no real title available?)
| 2002-09-17 | Paper |
scientific article; zbMATH DE number 1775416 (Why is no real title available?)
| 2002-08-01 | Paper |
scientific article; zbMATH DE number 1405637 (Why is no real title available?)
| 2002-06-23 | Paper |
scientific article; zbMATH DE number 1256707 (Why is no real title available?)
| 2002-01-20 | Paper |
scientific article; zbMATH DE number 1256708 (Why is no real title available?)
| 2002-01-20 | Paper |
Improved algorithms and analysis for secretary problems and generalizations
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1559544 (Why is no real title available?)
| 2001-02-28 | Paper |
The closure of monadic NP
Journal of Computer and System Sciences | 2000-08-27 | Paper |
scientific article; zbMATH DE number 1306880 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1256724 (Why is no real title available?)
| 1999-05-18 | Paper |
Fairness in Scheduling
Journal of Algorithms | 1999-01-17 | Paper |
Worst-case complexity, average-case complexity and lattice problems
Documenta Mathematica | 1998-08-05 | Paper |
A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
SIAM Journal on Computing | 1997-02-06 | Paper |
scientific article; zbMATH DE number 861349 (Why is no real title available?)
| 1996-08-18 | Paper |
scientific article; zbMATH DE number 910905 (Why is no real title available?)
| 1996-07-28 | Paper |
scientific article; zbMATH DE number 806742 (Why is no real title available?)
| 1996-03-31 | Paper |
The complexity of the pigeonhole principle
Combinatorica | 1995-02-01 | Paper |
Recursive construction for 3-regular expanders
Combinatorica | 1995-02-01 | Paper |
Datalog vs first-order logic
Journal of Computer and System Sciences | 1995-01-15 | Paper |
scientific article; zbMATH DE number 549850 (Why is no real title available?)
| 1994-04-12 | Paper |
scientific article; zbMATH DE number 524117 (Why is no real title available?)
| 1994-03-24 | Paper |
The influence of large coalitions
Combinatorica | 1993-09-15 | Paper |
scientific article; zbMATH DE number 176875 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176196 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 15662 (Why is no real title available?)
| 1992-06-25 | Paper |
Reachability is harder for directed than for undirected finite graphs
Journal of Symbolic Logic | 1990-01-01 | Paper |
Construction of a Thin Set with small Fourier Coefficients
Bulletin of the London Mathematical Society | 1990-01-01 | Paper |
Optimal parallel selection has complexity O(log log N)
Journal of Computer and System Sciences | 1989-01-01 | Paper |
First-order definability on finite structures
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
Sorting in Average Time $o(\log \,n)$
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
A lower bound for finding predecessors in Yao's cell probe model
Combinatorica | 1988-01-01 | Paper |
Monotone versus positive
Journal of the ACM | 1987-01-01 | Paper |
The Set of Continuous Functions with the Everywhere Convergent Fourier Series
Transactions of the American Mathematical Society | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3922707 (Why is no real title available?)
| 1985-01-01 | Paper |
On optimal matchings
Combinatorica | 1984-01-01 | Paper |
Hash functions for priority queues
Information and Control | 1984-01-01 | Paper |
\(\Sigma_ 1^ 1\)-formulae on finite structures
Annals of Pure and Applied Logic | 1983-01-01 | Paper |
Sorting in \(c \log n\) parallel steps
Combinatorica | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3849506 (Why is no real title available?)
| 1983-01-01 | Paper |
Extremal uncrowded hypergraphs
Journal of Combinatorial Theory. Series A | 1982-01-01 | Paper |
Largest random component of a k-cube
Combinatorica | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3777556 (Why is no real title available?)
| 1982-01-01 | Paper |
A dense infinite Sidon sequence
European Journal of Combinatorics | 1981-01-01 | Paper |
On Turan's theorem for sparse graphs
Combinatorica | 1981-01-01 | Paper |
The longest path in a random graph
Combinatorica | 1981-01-01 | Paper |
A note on Ramsey numbers
Journal of Combinatorial Theory. Series A | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3769674 (Why is no real title available?)
| 1979-01-01 | Paper |
Isomorphism and higher order equivalence
Annals of Mathematical Logic | 1979-01-01 | Paper |
There is no fast single hashing algorithm
Information Processing Letters | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3716228 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3473781 (Why is no real title available?)
| 1975-01-01 | Paper |
On the boundedness of definable linear operators
Periodica Mathematica Hungarica | 1974-01-01 | Paper |
On a class of finite lattices
Periodica Mathematica Hungarica | 1973-01-01 | Paper |
scientific article; zbMATH DE number 3408456 (Why is no real title available?)
| 1973-01-01 | Paper |
scientific article; zbMATH DE number 3497950 (Why is no real title available?)
| 1971-01-01 | Paper |
scientific article; zbMATH DE number 3293012 (Why is no real title available?)
| 1969-01-01 | Paper |
