John Rompel

According to our database, John Rompel authored at least 9 papers between 1988 and 1994.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1994

On the Power of Multi-Prover Interactive Protocols.

Lance Fortnow, John Rompel, Michael Sipser

Theor. Comput. Sci., 1994

Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry.

Bonnie Berger, John Rompel, Peter W. Shor

J. Comput. Syst. Sci., 1994

Randomness-Efficient Oblivious Sampling

Mihir Bellare, John Rompel

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1991

Simulating (log c n)-Wise Independence in NC.

Bonnie Berger, John Rompel

J. ACM, 1991

1990

Techniques for computing with low-independence randomness.

John Rompel

PhD thesis, 1990

A Better Performance Guarantee for Approximate Graph Coloring.

Bonnie Berger, John Rompel

Algorithmica, 1990

One-Way Functions are Necessary and Sufficient for Secure Signatures

John Rompel

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Errata for On the Power of Multi-Prover Interactive Protocols.

Lance Fortnow, John Rompel, Michael Sipser

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1988

On the power of multi-power interactive protocols.

Lance Fortnow, John Rompel, Michael Sipser

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988