2007 |
38 | EE | William S. Evans,
Christopher W. Fraser,
Fei Ma:
Clone Detection via Structural Abstraction.
WCRE 2007: 150-159 |
2006 |
37 | EE | Andrew Walenstein,
James R. Cordy,
William S. Evans,
Ahmed E. Hassan,
Toshihiro Kamiya,
Cory Kapser,
Ettore Merlo:
06301 Working Session Summary: Presentation and Visualization of Redundant Code.
Duplication, Redundancy, and Similarity in Software 2006 |
36 | EE | William S. Evans:
Program Compression.
Duplication, Redundancy, and Similarity in Software 2006 |
35 | EE | Andrew Walenstein,
Mohammad El-Ramly,
James R. Cordy,
William S. Evans,
Kiarash Mahdavi,
Markus Pizka,
Ganesan Ramalingam,
Jürgen Wolff von Gudenberg:
Similarity in Programs.
Duplication, Redundancy, and Similarity in Software 2006 |
34 | EE | William S. Evans,
David G. Kirkpatrick:
Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ.
ACM Transactions on Algorithms 2(4): 661-678 (2006) |
33 | EE | Prosenjit Bose,
Luc Devroye,
William S. Evans,
David G. Kirkpatrick:
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons.
SIAM J. Discrete Math. 20(2): 412-427 (2006) |
2005 |
32 | EE | Daniel Archambault,
William S. Evans,
David G. Kirkpatrick:
Computing the Set of all the Distant Horizons of a Terrain.
Int. J. Comput. Geometry Appl. 15(6): 547-564 (2005) |
2004 |
31 | EE | William S. Evans,
Daniel Archambault,
David G. Kirkpatrick:
Computing the set of all distant horizons of a terrain.
CCCG 2004: 76-79 |
30 | EE | Ritesh Shah,
Norman C. Hutchinson,
William S. Evans:
Voilà: Delivering Messages Across Partitioned Ad-Hoc Networks.
LCN 2004: 610-617 |
29 | EE | William S. Evans,
David G. Kirkpatrick:
Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ.
SODA 2004: 1041-1049 |
28 | EE | William S. Evans,
David G. Kirkpatrick:
Restructuring ordered binary trees.
J. Algorithms 50(2): 168-193 (2004) |
2003 |
27 | | Jocelyn Smith,
William S. Evans:
Triangle Guarding.
CCCG 2003: 76-80 |
26 | EE | Warren Cheung,
William S. Evans,
Jeremy Moses:
Predicated Instructions for Code Compaction.
SCOPES 2003: 17-32 |
25 | EE | Saumya K. Debray,
William S. Evans:
Cold code decompression at runtime.
Commun. ACM 46(8): 54-60 (2003) |
24 | EE | William S. Evans,
Christopher W. Fraser:
Grammar-based compression of interpreted code.
Commun. ACM 46(8): 61-66 (2003) |
23 | | William S. Evans,
Leonard J. Schulman:
On the maximum tolerable noise of k-input gates for reliable computation by formulas.
IEEE Transactions on Information Theory 49(11): 3094-3098 (2003) |
2002 |
22 | EE | Prosenjit Bose,
Luc Devroye,
William S. Evans,
David G. Kirkpatrick:
On the Spanning Ratio of Gabriel Graphs and beta-skeletons.
LATIN 2002: 479-493 |
21 | EE | Saumya K. Debray,
William S. Evans:
Profile-Guided Code Compression.
PLDI 2002: 95-105 |
20 | EE | Prosenjit Bose,
Luc Devroye,
William S. Evans:
Diamonds are Not a Minimum Weight Triangulation's Best Friend.
Int. J. Comput. Geometry Appl. 12(6): 445-454 (2002) |
2001 |
19 | | William S. Evans,
Christopher W. Fraser:
Bytecode Compression via Profiled Grammar Rewriting.
PLDI 2001: 148-155 |
18 | EE | William S. Evans,
David G. Kirkpatrick,
G. Townsend:
Right-Triangulated Irregular Networks.
Algorithmica 30(2): 264-286 (2001) |
2000 |
17 | EE | William S. Evans,
David G. Kirkpatrick:
Restructuring ordered binary trees.
SODA 2000: 477-486 |
16 | EE | Saumya K. Debray,
William S. Evans,
Robert Muth,
Bjorn De Sutter:
Compiler techniques for code compaction.
ACM Trans. Program. Lang. Syst. 22(2): 378-415 (2000) |
15 | EE | Curtis E. Dyreson,
William S. Evans,
Hong Lin,
Richard T. Snodgrass:
Efficiently Supported Temporal Granularities.
IEEE Trans. Knowl. Data Eng. 12(4): 568-587 (2000) |
1999 |
14 | | William S. Evans,
Leonard J. Schulman:
Signal propagation and noisy circuits.
IEEE Transactions on Information Theory 45(7): 2367-2373 (1999) |
1998 |
13 | EE | Mark de Berg,
Prosenjit Bose,
David Bremner,
William S. Evans,
Lata Narayanan:
Recovering lines with fixed linear probes.
CCCG 1998 |
12 | EE | William S. Evans:
Compression via Guided Parsing.
Data Compression Conference 1998: 544 |
11 | | William S. Evans,
Nicholas Pippenger:
On the Maximum Tolerable Noise for Reliable Computation by Formulas.
IEEE Transactions on Information Theory 44(3): 1299-1305 (1998) |
10 | | William S. Evans,
Nicholas Pippenger:
Average-Case Lower Bounds for Noisy Boolean Decision Trees.
SIAM J. Comput. 28(2): 433-446 (1998) |
1997 |
9 | | Jens Ernst,
William S. Evans,
Christopher W. Fraser,
Steven Lucco,
Todd A. Proebsting:
Code Compression.
PLDI 1997: 358-365 |
8 | EE | Claudio Bettini,
Curtis E. Dyreson,
William S. Evans,
Richard T. Snodgrass,
Xiaoyang Sean Wang:
A Glossary of Time Granularity Concepts.
Temporal Databases, Dagstuhl 1997: 406-413 |
1996 |
7 | | Prosenjit Bose,
William S. Evans,
David G. Kirkpatrick,
Michael McAllister,
Jack Snoeyink:
Approximating Shortest Paths in Arrangements of Lines.
CCCG 1996: 143-148 |
6 | | Prosenjit Bose,
Luc Devroye,
William S. Evans:
Diamonds Are Not a Minimum Weight Triangulation's Best Friend.
CCCG 1996: 68-73 |
5 | EE | William S. Evans,
Nicholas Pippenger:
Lower Bounds for Noisy Boolean Decision Trees.
STOC 1996: 620-628 |
1994 |
4 | | Manuel Blum,
William S. Evans,
Peter Gemmell,
Sampath Kannan,
Moni Naor:
Checking the Correctness of Memories.
Algorithmica 12(2/3): 225-244 (1994) |
1993 |
3 | EE | William S. Evans,
Sridhar Rajagopalan,
Umesh V. Vazirani:
Choosing a Reliable Hypothesis.
COLT 1993: 269-276 |
2 | | William S. Evans,
Leonard J. Schulman:
Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas
FOCS 1993: 594-603 |
1991 |
1 | | Manuel Blum,
William S. Evans,
Peter Gemmell,
Sampath Kannan,
Moni Naor:
Checking the Correctness of Memories
FOCS 1991: 90-99 |