| Publication | Date of Publication | Type |
|---|
Space-efficient algorithms for longest increasing subsequence
(available as arXiv preprint) | 2020-08-05 | Paper |
Space-efficient algorithms for longest increasing subsequence
Theory of Computing Systems | 2020-04-15 | Paper |
Depth-First Search Using O(n) Bits
Algorithms and Computation | 2015-09-11 | Paper |
Learning Boolean functions in AC^0on attribute and classification noise -- estimating an upper bound on attribute and classification noise
Theoretical Computer Science | 2011-09-12 | Paper |
A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds
Theoretical Computer Science | 2011-04-05 | Paper |
On the sample size of <i>k</i> -restricted min-wise independent permutations and other <i>k</i> -wise distributions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| Monotone Boolean functions with s zeros farthest from threshold functions | 2010-07-30 | Paper |
| On the minimum number of completely 3-scrambling permutations | 2010-07-30 | Paper |
Smallest formulas for the parity of \(2^k\) variables are essentially unique
Theoretical Computer Science | 2010-06-07 | Paper |
A nearly linear size \(4\)-min-wise independent permutation family by finite geometries
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Negation-limited complexity of parity and inverters
Algorithmica | 2009-06-22 | Paper |
Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences
Theoretical Computer Science | 2009-03-20 | Paper |
Reductions for monotone Boolean circuits
Theoretical Computer Science | 2008-12-12 | Paper |
Smallest Formulas for Parity of 2 k Variables Are Essentially Unique
Lecture Notes in Computer Science | 2008-07-10 | Paper |
A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Negation-Limited Complexity of Parity and Inverters
Algorithms and Computation | 2008-04-24 | Paper |
On the minimum number of completely 3-scrambling permutations
Discrete Mathematics | 2008-03-18 | Paper |
Linear-Size Log-Depth Negation-Limited Inverter for k-Tonic Binary Sequences
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Finding a Duplicate and a Missing Item in a Stream
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
On the negation-limited circuit complexity of merging
Discrete Applied Mathematics | 2003-03-09 | Paper |
| scientific article; zbMATH DE number 1256659 (Why is no real title available?) | 2002-01-17 | Paper |
| scientific article; zbMATH DE number 1445297 (Why is no real title available?) | 2001-01-29 | Paper |
| scientific article; zbMATH DE number 1511696 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1453048 (Why is no real title available?) | 2000-07-24 | Paper |
| scientific article; zbMATH DE number 1405675 (Why is no real title available?) | 2000-07-20 | Paper |
| scientific article; zbMATH DE number 1405685 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1379125 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1301088 (Why is no real title available?) | 1999-06-15 | Paper |
The asymptotic complexity of merging networks
Journal of the ACM | 1998-01-19 | Paper |
The asymptotic complexity of merging networks
Journal of the ACM | 1998-01-19 | Paper |
On ACC
Computational Complexity | 1995-04-06 | Paper |
| scientific article; zbMATH DE number 512859 (Why is no real title available?) | 1994-03-10 | Paper |
Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy
Theoretical Computer Science | 1993-10-17 | Paper |
| scientific article; zbMATH DE number 176508 (Why is no real title available?) | 1993-05-18 | Paper |
