Hal Wasserman

According to our database, Hal Wasserman authored at least 8 papers between 1994 and 2000.

Collaborative distances:

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

2000

Noise-tolerant learning, the parity problem, and the statistical query model.

Avrim Blum, Adam Kalai, Hal Wasserman

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999

List Decoding of Algebraic-Geometric Codes.

Mohammad Amin Shokrollahi, Hal Wasserman

IEEE Trans. Inf. Theory, 1999

1998

Decoding Algebraic-Geometric Codes Beyond the Error-Correction Bound.

Mohammad Amin Shokrollahi, Hal Wasserman

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Reconstructing Randomly Sampled Multivariate Polynomials from Highly Noisy Data.

Hal Wasserman

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Software reliability via run-time result-checking.

Hal Wasserman, Manuel Blum

J. ACM, 1997

1996

Reflections on the Pentium Bug.

Manuel Blum, Hal Wasserman

IEEE Trans. Computers, 1996

1995

Comparing Algorithm for Dynamic Speed-Setting of a Low-Power CPU.

Kinshuk Govil, Edwin Chan, Hal Wasserman

Proceedings of the MOBICOM '95, 1995

1994

Program Result-Checking: A Theory of Testing Meets a Test of Theory

Manuel Blum, Hal Wasserman

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