Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity | 51 | 2.97 | 1995 |
| On ultrafilters and NP | 2 | 0.48 | 1994 |
| On span programs | 230 | 13.60 | 1993 |
| Non-deterministic communication complexity with few witnesses | 13 | 0.74 | 1992 |
| Fractional Covers and Communication Complexity | 34 | 3.09 | 1992 |
| Linear circuits over GF(2) | 14 | 0.74 | 1990 |
| Bounds on universal sequences | 24 | 2.65 | 1989 |
| Monotone circuits for connectivity require super-logarithmic depth | 181 | 27.05 | 1988 |
| A fast parallel algorithm to color graph with &Dgr; colors | 5 | 1.05 | 1988 |
| Two time-space tradeoffs for element distinctness | 17 | 1.94 | 1986 |