 | 1994 |
|---|
| 9 |       | Mihir Bellare,
John Rompel:
Randomness-Efficient Oblivious Sampling
FOCS 1994: 276-287 |
| 8 | | Bonnie Berger,
John Rompel,
Peter W. Shor:
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry.
J. Comput. Syst. Sci. 49(3): 454-477 (1994) |
| 7 | | Lance Fortnow,
John Rompel,
Michael Sipser:
On the Power of Multi-Prover Interactive Protocols.
Theor. Comput. Sci. 134(2): 545-557 (1994) |
| 1991 |
|---|
| 6 |  | Bonnie Berger,
John Rompel:
Simulating (log c n)-Wise Independence in NC.
J. ACM 38(4): 1026-1046 (1991) |
| 1990 |
|---|
| 5 | | John Rompel:
One-Way Functions are Necessary and Sufficient for Secure Signatures
STOC 1990: 387-394 |
| 4 | | Lance Fortnow,
John Rompel,
Michael Sipser:
Errata for On the Power of Multi-Prover Interactive Protocols.
Structure in Complexity Theory Conference 1990: 318-319 |
| 3 | | Bonnie Berger,
John Rompel:
A Better Performance Guarantee for Approximate Graph Coloring.
Algorithmica 5(3): 459-466 (1990) |
| 1989 |
|---|
| 2 | | Bonnie Berger,
John Rompel:
Simulating (log ^c n)-wise Independence in NC
FOCS 1989: 2-7 |
| 1 | | Bonnie Berger,
John Rompel,
Peter W. Shor:
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry
FOCS 1989: 54-59 |
