- On the Maximum Tolerable Noise of kinput Gates for Reliable Computation by Formulas
- RightTriangulated Irregular Networks William Evans \Lambda
- Choosing a Reliable Hypothesis (Extended Abstract)
- ProfileGuided Code Compression Saumya Debray
- International Journal of Computational Geometry and Applications World Scienti c Publishing Company
- Predicated Instructions for Code Compaction # Warren Cheung, William Evans, and Jeremy Moses
- On the Spanning Ratio of Gabriel Graphs and fiSkeletons Prosenjit Bose \Lambda Luc Devroye y William Evans z David Kirkpatrick x
- Broadcasting on Trees and the Ising Model William Evans Claire Kenyon Yuval Peres Leonard J. Schulman y
- Information Theory and Noisy Computation
- Compression via Guided Parsing William S. Evans
- On the Maximum Tolerable Noise of k-input Gates for Reliable Computation by Formulas
- Predicated Instructions for Code Compaction Warren Cheung, William Evans, and Jeremy Moses
- Bytecode Compression via Profiled Grammar Rewriting
- Recovering lines with fixed linear probes Mark de Berg Jit Bose David Bremner William Evans
- Compiler Techniques for Code Compression Saumya Debray William Evans Robert Muth
- Bytecode Compression via Profiled Grammar Rewriting
- Optimally Scheduling VideoonDemand to Minimize Delay When Server and Receiver Bandwidth May Di#er #
- On the Maximum Tolerable Noise for Reliable Computation by Formulas
- Checking the Correctness of Memories \Lambda Manuel Blum y Will Evans y Peter Gemmell y Sampath Kannan z
- Regular Polygons are Most Tolerant William Evans \Lambda
- Approximating shortest paths in arrangements of lines Prosenjit Bose William Evans David Kirkpatrick
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 7, NOVEMBER, 1999 1 Signal Propagation and Noisy Circuits
- Optimally Scheduling Video-on-Demand to Minimize Delay When Server and Receiver Bandwidth May Differ
- Restructuring Ordered Binary Trees William Evans y David Kirkpatrick y
- Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas
- Triangle Guarding # Jocelyn Smith and William Evans
- Information Theory and Noisy Computation
- Eciently Supporting Temporal Granularities Curtis E. Dyreson , William S. Evans, Hong Lin, and Richard T. Snodgrass
- AverageCase Lower Bounds for Noisy Boolean Decision Trees
- Triangle Guarding Jocelyn Smith and William Evans
- Code Compression Jens Ernst University of Arizona
