| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5501814 | 2015-08-14 | Paper |
| Data compression with long repeated strings | 2001-10-10 | Paper |
| Template-driven interfaces for numerical subroutines | 1998-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138882 | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138891 | 1994-09-19 | Paper |
| Fast linear expected-time algorithms for computing maxima and convex hulls | 1993-04-01 | Paper |
| Fast Algorithms for Geometric Traveling Salesman Problems | 1993-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3992623 | 1993-01-23 | Paper |
| A general class of resource tradeoffs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3666231 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783526 | 1982-01-01 | Paper |
| Approximation algorithms for convex hulls | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3911419 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933766 | 1981-01-01 | Paper |
| Multidimensional divide-and-conquer | 1980-04-01 | Paper |
| Multidimensional divide-and-conquer | 1980-01-01 | Paper |
| Efficient worst-case data structures for range searching | 1980-01-01 | Paper |
| Generating Sorted Lists of Random Numbers | 1980-01-01 | Paper |
| A parallel algorithm for constructing minimum spanning trees | 1980-01-01 | Paper |
| Optimal Expected-Time Algorithms for Closest Point Problems | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3886873 | 1980-01-01 | Paper |
| An Alphard Specification of a Correct and Efficient Transformation on Data Structures | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3898031 | 1980-01-01 | Paper |
| Decomposable searching problems I. Static-to-dynamic transformation | 1980-01-01 | Paper |
| A note on Euclidean near neighbor searching in the plane | 1979-01-01 | Paper |
| Decomposable searching problems | 1979-01-01 | Paper |
| Algorithms for Reporting and Counting Geometric Intersections | 1979-01-01 | Paper |
| Multidimensional Binary Search Trees in Database Applications | 1979-01-01 | Paper |
| Divide and conquer for linear expected time | 1978-01-01 | Paper |
| Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces | 1978-01-01 | Paper |
| On the Average Number of Maxima in a Set of Vectors and Applications | 1978-01-01 | Paper |
| The complexity of finding fixed-radius near neighbors | 1977-01-01 | Paper |
| An Algorithm for Finding Best Matches in Logarithmic Expected Time | 1977-01-01 | Paper |
| Heuristics for partial-match retrieval data base design | 1976-01-01 | Paper |
| An almost optimal algorithm for unbounded searching | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140384 | 1976-01-01 | Paper |
| Analysis of range searches in quad trees | 1975-01-01 | Paper |
| Multidimensional binary search trees used for associative searching | 1975-01-01 | Paper |
| Quad trees: A data structure for retrieval by composite keys | 1974-01-01 | Paper |
