Heather Woll

According to our database, Heather Woll authored at least 6 papers between 1987 and 1997.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1997

Algorithms for the Certified Write-All Problem.

Richard J. Anderson, Heather Woll

SIAM J. Comput., 1997

1991

Wait-free Parallel Algorithms for the Union-Find Problem

Richard J. Anderson, Heather Woll

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice.

Michael E. Saks, Nir Shavit, Heather Woll

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1988

How to Share a Secret with Cheaters.

Martin Tompa, Heather Woll

J. Cryptol., 1988

1987

Reductions among Number Theoretic Problems

Heather Woll

Inf. Comput., March, 1987

Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information

Martin Tompa, Heather Woll

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987