|
Search the dblp DataBase
William S. Evans:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Claudio Bettini, Curtis E. Dyreson, William S. Evans, Richard T. Snodgrass, Xiaoyang Sean Wang
A Glossary of Time Granularity Concepts. [Citation Graph (2, 0)][DBLP] Temporal Databases, Dagstuhl, 1997, pp:406-413 [Conf]
- Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan
Recovering lines with fixed linear probes. [Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf]
- Prosenjit Bose, Luc Devroye, William S. Evans
Diamonds Are Not a Minimum Weight Triangulation's Best Friend. [Citation Graph (0, 0)][DBLP] CCCG, 1996, pp:68-73 [Conf]
- Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink
Approximating Shortest Paths in Arrangements of Lines. [Citation Graph (0, 0)][DBLP] CCCG, 1996, pp:143-148 [Conf]
- William S. Evans, Daniel Archambault, David G. Kirkpatrick
Computing the set of all distant horizons of a terrain. [Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:76-79 [Conf]
- Jocelyn Smith, William S. Evans
Triangle Guarding. [Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:76-80 [Conf]
- William S. Evans, Sridhar Rajagopalan, Umesh V. Vazirani
Choosing a Reliable Hypothesis. [Citation Graph (0, 0)][DBLP] COLT, 1993, pp:269-276 [Conf]
- William S. Evans
Compression via Guided Parsing. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1998, pp:544- [Conf]
- Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
Checking the Correctness of Memories [Citation Graph (0, 0)][DBLP] FOCS, 1991, pp:90-99 [Conf]
- William S. Evans, Leonard J. Schulman
Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas [Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:594-603 [Conf]
- Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick
On the Spanning Ratio of Gabriel Graphs and beta-skeletons. [Citation Graph (0, 0)][DBLP] LATIN, 2002, pp:479-493 [Conf]
- Ritesh Shah, Norman C. Hutchinson, William S. Evans
Voilà: Delivering Messages Across Partitioned Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP] LCN, 2004, pp:610-617 [Conf]
- Saumya K. Debray, William S. Evans
Profile-Guided Code Compression. [Citation Graph (0, 0)][DBLP] PLDI, 2002, pp:95-105 [Conf]
- Jens Ernst, William S. Evans, Christopher W. Fraser, Steven Lucco, Todd A. Proebsting
Code Compression. [Citation Graph (0, 0)][DBLP] PLDI, 1997, pp:358-365 [Conf]
- William S. Evans, Christopher W. Fraser
Bytecode Compression via Profiled Grammar Rewriting. [Citation Graph (0, 0)][DBLP] PLDI, 2001, pp:148-155 [Conf]
- Warren Cheung, William S. Evans, Jeremy Moses
Predicated Instructions for Code Compaction. [Citation Graph (0, 0)][DBLP] SCOPES, 2003, pp:17-32 [Conf]
- William S. Evans, David G. Kirkpatrick
Restructuring ordered binary trees. [Citation Graph (0, 0)][DBLP] SODA, 2000, pp:477-486 [Conf]
- William S. Evans, David G. Kirkpatrick
Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. [Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1041-1049 [Conf]
- William S. Evans, Nicholas Pippenger
Lower Bounds for Noisy Boolean Decision Trees. [Citation Graph (0, 0)][DBLP] STOC, 1996, pp:620-628 [Conf]
- Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
Checking the Correctness of Memories. [Citation Graph (0, 0)][DBLP] Algorithmica, 1994, v:12, n:2/3, pp:225-244 [Journal]
- William S. Evans, David G. Kirkpatrick, G. Townsend
Right-Triangulated Irregular Networks. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:30, n:2, pp:264-286 [Journal]
- Saumya K. Debray, William S. Evans
Cold code decompression at runtime. [Citation Graph (0, 0)][DBLP] Commun. ACM, 2003, v:46, n:8, pp:54-60 [Journal]
- William S. Evans, Christopher W. Fraser
Grammar-based compression of interpreted code. [Citation Graph (0, 0)][DBLP] Commun. ACM, 2003, v:46, n:8, pp:61-66 [Journal]
- Prosenjit Bose, Luc Devroye, William S. Evans
Diamonds are Not a Minimum Weight Triangulation's Best Friend. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2002, v:12, n:6, pp:445-454 [Journal]
- Daniel Archambault, William S. Evans, David G. Kirkpatrick
Computing the Set of all the Distant Horizons of a Terrain. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2005, v:15, n:6, pp:547-564 [Journal]
- William S. Evans, David G. Kirkpatrick
Restructuring ordered binary trees. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:50, n:2, pp:168-193 [Journal]
- William S. Evans, Nicholas Pippenger
Average-Case Lower Bounds for Noisy Boolean Decision Trees. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:28, n:2, pp:433-446 [Journal]
- William S. Evans, Nicholas Pippenger
On the Maximum Tolerable Noise for Reliable Computation by Formulas. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1299-1305 [Journal]
- William S. Evans, Leonard J. Schulman
On the maximum tolerable noise of k-input gates for reliable computation by formulas. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:11, pp:3094-3098 [Journal]
- William S. Evans, Leonard J. Schulman
Signal propagation and noisy circuits. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2367-2373 [Journal]
- Curtis E. Dyreson, William S. Evans, Hong Lin, Richard T. Snodgrass
Efficiently Supported Temporal Granularities. [Citation Graph (0, 0)][DBLP] IEEE Trans. Knowl. Data Eng., 2000, v:12, n:4, pp:568-587 [Journal]
- Saumya K. Debray, William S. Evans, Robert Muth, Bjorn De Sutter
Compiler techniques for code compaction. [Citation Graph (0, 0)][DBLP] ACM Trans. Program. Lang. Syst., 2000, v:22, n:2, pp:378-415 [Journal]
- Warren Cheung, William Evans
Pursuit-Evasion Voronoi Diagrams in ell_1. [Citation Graph (0, 0)][DBLP] ISVD, 2007, pp:58-65 [Conf]
Multi-guard covers for polygonal regions. [Citation Graph (, )][DBLP]
06301 Working Session Summary: Presentation and Visualization of Redundant Code. [Citation Graph (, )][DBLP]
Similarity in Programs. [Citation Graph (, )][DBLP]
Program Compression. [Citation Graph (, )][DBLP]
Clone Detection via Structural Abstraction. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs
|