Journal Papers

1. Compiler techniques for code compaction, S. Debray, W. Evans, R. Muth, and B. de Sutter, Transactions on Programming Languages and Systems (TOPLAS), 22(2), 2000, pp. 378--415. Preliminary version appeared as Compiler techniques for code compression, S. Debray, W. Evans, and R. Muth, in Workshop on Compiler Support for System Software (WCSSS), 1999.
   paper (gzipped postscript)

2. Right-triangulated irregular networks, W. Evans, D. Kirkpatrick, and G. Townsend, Algorithmica: Special Issue on Algorithms for Geographical Information, (accepted June 1999).
   paper (gzipped pdf)

3. Efficiently supporting temporal granularities, C. Dyreson, W. Evans, H. Lin, and R. Snodgrass, IEEE Transactions on Knowledge and Data Engineering, 12(4), July/August 2000, pp. 568--587.
   paper (gzipped postscript)

4. Broadcasting on trees and the Ising model, W. Evans, C. Kenyon, Y. Peres, and L. J. Schulman, Annals of Applied Probability, 10(2), 2000, pp. 410--433.
   paper (gzipped postscript)

5. Signal propagation and noisy circuits, W. Evans and L. J. Schulman, IEEE Transactions on Information Theory, 45(7), November 1999, pp. 2367--2373.
   paper (gzipped postscript)

6. Average-case lower bounds for noisy boolean decision trees, W. Evans and N. Pippenger, SIAM Journal of Computation, 28(2), July 1998, pp. 433--446. Preliminary version appeared in 28th Symposium on the Theory of Computation (STOC), 1996.
   paper (gzipped postscript)

7. On the maximum tolerable noise for reliable computation by formulas, W. Evans and N. Pippenger, IEEE Transactions on Information Theory, 44(3), May 1998, pp. 1299--1305.
   paper (gzipped postscript)

8. Checking the correctness of memories, M. Blum, W. Evans, P. Gemmell, S. Kannan, and M. Naor, Algorithmica 12, 1994, pp. 225--244. Extended abstract appeared in 32nd Symposium on Foundations of Computer Science (FOCS), 1991.
   paper (gzipped postscript)

Conference Papers

1. Restructuring binary search trees, W. Evans and D. Kirkpatrick, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), (to appear January 2000).
   paper (gzipped postscript)

2. Recovering lines with fixed linear probes, M. de Berg, P. Bose, D. Bremner, W. Evans, and Lata Narayanan, Proceedings of the Tenth Canadian Conference on Computational Geometry (CCCG), August 1998.
   paper (gzipped postscript)

3. Compression via guided parsing, W. Evans, Proceedings of the 1998 Data Compression Conference (poster session), March 1998.
   paper (gzipped postscript)

4. A glossary of time granularity concepts, C. Bettini, C. E. Dyreson, W. Evans, R. T. Snodgrass, and X. S. Wang, in Temporal Databases: Research and Practice, O. Etzion, S. Jajodia, and S. Sripada (eds.), Springer, pp. 406--413, 1998.
   

5. Code compression, J. Ernst, W. Evans, C. W. Fraser, S. Lucco, and T. Proebsting, Proceedings SIGPLAN '97 Conference on Programming Language Design and Implementation (PLDI), 1997.
   paper (gzipped pdf)

6. Approximating shortest paths in arrangements of lines, P. Bose, W. Evans, D. Kirkpatrick, M. McAllister, and J. Snoeyink, Proceedings of the Eighth Canadian Conference on Computational Geometry (CCCG), 1996.
   paper (gzipped postscript)

7. Regular polygons are most tolerant, W. Evans, Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG), 1995.
   paper (gzipped postscript)

8. Signal propagation, with application to a lower bound on the depth of noisy formulas, W. Evans and L. J. Schulman, 34th Symposium on Foundations of Computer Science (FOCS), 1993.
   paper (gzipped postscript)

9. Choosing a reliable hypothesis, W. Evans, S. Rajagopalan, and U. Vazirani, Proceedings of the 6th Workshop on Computational Learning Theory (COLT), 1993.
   paper (gzipped postscript)

10. Parallel random number generation, W. Evans and B. Sugla, Proceedings of the Fourth Conference on Hypercubes, Concurrent Computers and Applications, 1989.
    

Submitted Papers

1. On the spanning ratio of Gabriel graphs and beta-skeletons, P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, submitted to SIAM Journal on Discrete Mathematics.
   paper (gzipped postscript)

2. Diamonds are not a minimum weight triangulation's best friend, P. Bose, L. Devroye, and W. Evans, Univ. of British Columbia Tech. Report 96-01, 1996, submitted to International Journal of Computational Geometry and Applications.
   paper (gzipped postscript)

Thesis

• Information Theory and Noisy Computation, W. Evans, PhD Thesis, University of California at Berkeley, 1994.
  paper (gzipped postscript)