- Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
- Accessing the Internal Organization of Data Structures in the JDSL Library
- Sparse Voronoi Refinement Beno^it Hudson, Gary Miller, and Todd Phillips
- Sparse Parallel Delaunay Mesh Refinement Benot Hudson Gary L. Miller Todd Phillips
- Using Bistellar Flips for Rotations in Point Location Structures Beno^ t Hudson Gary Miller
- Sparse Voronoi Refinement # Benot Hudson, Gary Miller, and Todd Phillips
- September 12, 2008 Towards Surface Reconstruction in Linear Time
- An Experimental Study of SBH with Gapped Probes
- Sparse Parallel Delaunay Mesh Refinement # Benot Hudson Gary L. Miller Todd Phillips
- CCCG 2008, Montreal, Quebec, August 1315, 2008 An Efficient Query Structure for Mesh Refinement
- Size Complexity of Volume Meshes vs. Surface Meshes Beno^it Hudson Gary L. Miller Todd Phillips Don Sheehy
- Effectiveness of preference elicitation in combinatorial Benot Hudson and Tuomas Sandholm
- July 31, 2008 Safe Steiner Points for Delaunay Refinement
- Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
- Optimal-time dynamic mesh refinement: preliminary results Umut A. Acar
- The Comprehensive LATEX Symbol List Scott Pakin
