Journal Papers

  1. On the maximum tolerable noise of k-input gates for reliable computation by formulas, W. Evans and L. Schulman, IEEE Transactions on Information Theory, (scheduled to appear November 2003).
    (gzipped postscript) (pdf)

  2. Restructuring binary search trees, W. Evans and D. Kirkpatrick, Journal of Algorithms, (invited submission accepted April 2001). Preliminary version appeared in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2000.
    (gzipped postscript) (pdf)

  3. Cold code decompression at runtime, S. Debray and W. Evans, Communications of the ACM (special issue on program compaction), 46(8), August 2003, p. 54-60.

  4. Grammar-based compression of interpreted code, W. Evans and C. W. Fraser, Communications of the ACM (special issue on program compaction), 46(8), August 2003, p. 61-66.

  5. Diamonds are not a minimum weight triangulation's best friend, P. Bose, L. Devroye, and W. Evans, International Journal of Computational Geometry and Applications, 12(6), 2002, p. 445-453. Preliminary version appeared as Univ. of British Columbia Tech. Report 96-01, 1996.
    (gzipped postscript) (pdf)

  6. Right-triangulated irregular networks, W. Evans, D. Kirkpatrick, and G. Townsend, Algorithmica: Special Issue on Algorithms for Geographical Information, 30(2), 2001, p. 264-286. Preliminary version appeared as Right triangular irregular networks, Univ. of Arizona, Dept. of C.S., Tech. Report 97-09, 1997.
    (gzipped postscript) (pdf)

  7. 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, p. 378-415.
    (gzipped postscript) (pdf)
    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.
    (gzipped postscript) (pdf)

  8. 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, p. 568-587.
    (gzipped postscript) (pdf)

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

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

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

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

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

Conference Papers

  1. Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ, W. Evans and D. Kirkpatrick, To appear: 14h Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
    (gzipped postscript) (pdf)

  2. Predicated instructions for code compaction, W. Cheung, W. Evans, and J. Moses, Proceedings of the 7th International Workshop on Software and Compilers for Embedded Systems (SCOPES), LNCS 2826, p.~17--32, 2003.
    (gzipped postscript) (pdf)

  3. Triangle guarding, J. Smith and W. Evans, Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG), p. 76-80, 2003.
    (gzipped postscript) (pdf)

  4. Profile-guided code compression, S. Debray and W. Evans, Proceedings SIGPLAN '02 Conference on Programming Language Design and Implementation (PLDI), p. 95-105, 2002.
    (gzipped postscript) (pdf)

  5. On the spanning ratio of Gabriel graphs and beta-skeletons, P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, Proceedings of the Fifth Latin American Symposium on Theoretical Informatics (LATIN), LNCS 2286, p. 479-493, April 2002. Submitted to SIAM Journal on Discrete Mathematics.
    (gzipped postscript) (pdf)

  6. Bytecode compression via profiled grammar rewriting, W. Evans and C. W. Fraser, Proceedings SIGPLAN '01 Conference on Programming Language Design and Implementation (PLDI), 2001.
    (gzipped postscript) (pdf)
    (slides from PLDI'01)

  7. 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.
    (gzipped postscript) (pdf)

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

  9. 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, p. 406-413, 1998.

  10. 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.
    (pdf)

  11. 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.
    (gzipped postscript) (pdf)

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

  13. 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.
    (gzipped postscript) (pdf)

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

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

Thesis