| On Contigs and Coverage. | 0 | 0.34 | 2013 |
| Accurate and precise aggregation counting | 0 | 0.34 | 2012 |
| Steps Toward Unraveling a Vatican Cipher of the 1930s | 0 | 0.34 | 2011 |
| Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction | 0 | 0.34 | 2009 |
| The evolving profile and role of computer science. | 0 | 0.34 | 2009 |
| Algorithms for Location Estimation Based on RSSI Sampling | 33 | 1.52 | 2008 |
| The unpredictable deviousness of models | 0 | 0.34 | 2008 |
| Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings | 30 | 2.60 | 2008 |
| Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings | 29 | 1.74 | 2007 |
| A Novel Approach to the Detection of Genomic Approximate Tandem Repeats in the Levenshtein Metric. | 5 | 0.55 | 2007 |
| Beware of the model: reflections on algorithmic research | 0 | 0.34 | 2006 |
| Quick, Practical Selection of Effective Seeds for Homology Search. | 13 | 0.65 | 2005 |
| Adaptive control of hybridization noise in DNA sequencing-by-hybridization. | 0 | 0.34 | 2005 |
| Sequencing-by-Hybridization Revisited: The Analog-Spectrum Proposal | 104 | 5.99 | 2004 |
| DNA Sequencing by Hybridization Using Semi-Degenerate Bases. | 4 | 1.39 | 2004 |
| Circular Cylinders through Four or Five Points in Space. | 6 | 0.74 | 2003 |
| Sequencing by hybridization using direct and reverse cooperating spectra | 4 | 0.43 | 2002 |
| On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization | 4 | 0.45 | 2002 |
| The Role of Arithmetic in Fast Parallel Matrix Inversion | 2 | 0.37 | 2001 |
| Generalized scans and tridiagonal systems | 1 | 0.36 | 2001 |
| Enhanced Sequence Reconstruction with DNA Microarray Application | 10 | 0.82 | 2001 |
| Evaluating the cylindricity of a nominally cylindrical point set | 7 | 0.83 | 2000 |
| Robust Plane Sweep for Intersecting Segments | 33 | 1.69 | 2000 |
| Sequencing-by-hybridization at the information-theory bound: an optimal algorithm | 26 | 7.29 | 2000 |
| Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds | 9 | 0.51 | 1999 |
| A Probabilistic Analysis of the Power of Arithmetic Filters | 20 | 2.39 | 1999 |
| Further results on arithmetic filters for geometric predicates | 5 | 0.70 | 1999 |
| Checking the convexity of polytopes and the planarity of subdivision | 25 | 1.46 | 1998 |
| Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design | 46 | 3.39 | 1998 |
| Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract) | 5 | 0.45 | 1997 |
| Evaluating Signs of Determinants Using Single-Precision Arithmetic | 42 | 6.96 | 1997 |
| Practical Constructive Schemes for Deterministic Shared-Memory Access. | 3 | 0.41 | 1997 |
| A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps | 24 | 1.38 | 1996 |
| Data Structures and Algorithms for the String Statistics Problem. | 18 | 7.09 | 1996 |
| Robustness in Geometric Algorithms | 1 | 0.36 | 1996 |
| Robust Proximity Queries in Implicit Voronoi Diagrams. | 11 | 1.60 | 1996 |
| Should Amdahl's Law Be Repealed? (Abstract) | 0 | 0.34 | 1995 |
| Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation | 2 | 0.53 | 1995 |
| Horizons of parallel computation | 46 | 11.05 | 1995 |
| Generalized Scans and Tri-Diagonal Systems | 0 | 0.34 | 1995 |
| Work-preserving speed-up of parallel matrix computations | 7 | 0.62 | 1995 |
| Upper bounds to processor-time tradeoffs under bounded-speed message propagation | 7 | 1.96 | 1995 |
| Motion Planning Of Legged Robots - The Spider Robot Problem | 3 | 0.66 | 1995 |
| A Time-Optimal Parallel Algorithm for Three-Dimensional Convex Hulls | 3 | 0.38 | 1995 |
| A UNIFIED APPROACH TO DYNAMIC POINT LOCATION, RAY SHOOTING, AND SHORTEST PATHS IN PLANAR MAPS | 19 | 1.19 | 1993 |
| An NC parallel 3D convex hull algorithm | 12 | 0.73 | 1993 |
| Efficient point location in a convex spatial cell-complex | 21 | 1.90 | 1992 |
| Frontiers of Parallel Computing | 1 | 0.36 | 1992 |
| Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds | 7 | 0.57 | 1992 |
| Horizons of Parallel Computation | 8 | 0.72 | 1992 |
