Daniel K. Blandford

According to our database, Daniel K. Blandford authored at least 8 papers between 2002 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

Compact dictionaries for variable-length keys and data with applications.

Daniel K. Blandford, Guy E. Blelloch

ACM Trans. Algorithms, 2008

2006

Engineering a compact parallel delaunay algorithm in 3D.

Daniel K. Blandford, Guy E. Blelloch, Clemens Kadow

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Compact representations of simplicial meshes in two and three dimensions.

Daniel K. Blandford, Guy E. Blelloch, David E. Cardoze, Clemens Kadow

Int. J. Comput. Geom. Appl., 2005

Dictionaries using variable-length keys and data, with applications.

Daniel K. Blandford, Guy E. Blelloch

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Compact representations of ordered sets.

Daniel K. Blandford, Guy E. Blelloch

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

An Experimental Analysis of a Compact Graph Representation.

Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Compact representations of separable graphs.

Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Index Compression through Document Reordering.

Daniel K. Blandford, Guy E. Blelloch

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002