| Publication | Date of Publication | Type |
|---|
Harmonic analysis, real approximation, and the communication complexity of Boolean functions
Lecture Notes in Computer Science | 2024-01-29 | Paper |
A weight-size trade-off for circuits with MOD \(m\) gates
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
A lower bound for depth-3 circuits with MOD \(m\) gates
Information Processing Letters | 2016-06-09 | Paper |
A note on the PageRank of undirected graphs
Information Processing Letters | 2015-05-21 | Paper |
The Erdős Webgraph Server
Discrete Applied Mathematics | 2014-03-27 | Paper |
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
scientific article; zbMATH DE number 5158504 (Why is no real title available?)
| 2007-05-29 | Paper |
Pairs of codes with prescribed Hamming distances and coincidences
Designs, Codes and Cryptography | 2006-11-22 | Paper |
Co-orthogonal codes
Designs, Codes and Cryptography | 2006-05-29 | Paper |
A Note on Explicit Ramsey Graphs and Modular Sieves
Combinatorics, Probability and Computing | 2005-03-08 | Paper |
scientific article; zbMATH DE number 2089969 (Why is no real title available?)
| 2004-08-12 | Paper |
Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications
SIAM Journal on Computing | 2003-09-28 | Paper |
A note on non-deterministic communication complexity with few witnesses
Theory of Computing Systems | 2003-08-26 | Paper |
scientific article; zbMATH DE number 1919511 (Why is no real title available?)
| 2003-05-27 | Paper |
Constructing set systems with prescribed intersection sizes
Journal of Algorithms | 2003-05-14 | Paper |
On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
Journal of Combinatorial Theory. Series A | 2003-03-26 | Paper |
Set-systems with restricted multiple intersections
The Electronic Journal of Combinatorics | 2002-03-04 | Paper |
scientific article; zbMATH DE number 1256663 (Why is no real title available?)
| 2002-01-21 | Paper |
A degree-decreasing lemma for \((\text{MOD}_q - \text{MOD}_p)\) circuits
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-01-07 | Paper |
Constructive upper bounds for intersecting set systems
| 2001-10-24 | Paper |
Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
Combinatorica | 2000-11-13 | Paper |
Low rank co-diagonal matrices and Ramsey graphs
The Electronic Journal of Combinatorics | 2000-04-16 | Paper |
Lower Bounds for (MODp - MODm) Circuits
SIAM Journal on Computing | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1332656 (Why is no real title available?)
| 1999-09-07 | Paper |
Harmonic analysis, real approximation, and the communication complexity of Boolean functions
Algorithmica | 1999-08-08 | Paper |
scientific article; zbMATH DE number 1223714 (Why is no real title available?)
| 1998-12-13 | Paper |
Circuits and multi-party protocols
Computational Complexity | 1998-11-19 | Paper |
On the power of circuits with gates of low \(L_{1}\) norms.
Theoretical Computer Science | 1998-06-30 | Paper |
scientific article; zbMATH DE number 1088263 (Why is no real title available?)
| 1998-06-01 | Paper |
The BNS lower bound for multi-party protocols is nearly optimal
Information and Computation | 1994-06-19 | Paper |
On a Ramsey-theoretic property of orders
Journal of Combinatorial Theory. Series A | 1993-01-17 | Paper |
Large parallel machines can be extremely slow for small problems
Algorithmica | 1991-01-01 | Paper |
Incomparability in parallel computation
Discrete Applied Mathematics | 1990-01-01 | Paper |
