| Publication | Date of Publication | Type |
|---|
A Useful Inequality for the Binary Entropy Function
| 2023-01-23 | Paper |
Approximating maximum independent sets by excluding subgraphs
SWAT 90 | 2022-12-09 | Paper |
The tree search game for two players
| 2022-05-31 | Paper |
Tomaszewski's problem on randomly signed sums, revisited
The Electronic Journal of Combinatorics | 2021-06-07 | Paper |
Simple and local independent set approximation
Theoretical Computer Science | 2020-11-06 | Paper |
Convergence of a sinusoidal infinite series from Borwein, Bailey, and Girgensohn
| 2020-07-21 | Paper |
Bounded independence versus symmetric tests
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Brief announcement: Simple and local independent set approximation
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Simple and local independent set approximation
Structural Information and Communication Complexity | 2019-01-30 | Paper |
Bounded independence vs. moduli
| 2018-04-19 | Paper |
Tomaszewski's problem on randomly signed sums: breaking the 3/8 barrier
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
The average sensitivity of bounded-depth circuits
Information Processing Letters | 2016-06-01 | Paper |
The biased coin problem
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Perfect-Information Leader Election with Optimal Resilience
SIAM Journal on Computing | 2000-03-19 | Paper |
An asymptotic isoperimetric inequality
Geometric and Functional Analysis. GAFA | 1999-03-02 | Paper |
scientific article; zbMATH DE number 1142303 (Why is no real title available?)
| 1998-05-04 | Paper |
scientific article; zbMATH DE number 1072412 (Why is no real title available?)
| 1997-01-01 | Paper |
The Biased Coin Problem
SIAM Journal on Discrete Mathematics | 1996-07-02 | Paper |
The decision-tree complexity of element distinctness
Information Processing Letters | 1995-02-09 | Paper |
Approximating maximum independent sets by excluding subgraphs
BIT | 1992-12-14 | Paper |
The average-case parallel complexity of sorting
Information Processing Letters | 1989-01-01 | Paper |
The monotone circuit complexity of Boolean functions
Combinatorica | 1987-01-01 | Paper |
Does co-NP have short interactive proofs ?
Information Processing Letters | 1987-01-01 | Paper |
One-way functions and circuit complexity
Information and Computation | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3990863 (Why is no real title available?)
| 1986-01-01 | Paper |
Threshold functions and bounded depth monotone circuits
Journal of Computer and System Sciences | 1986-01-01 | Paper |
Some properties of Hueckel-type edge operators
Pattern Recognition Letters | 1982-01-01 | Paper |
