| Publication | Date of Publication | Type |
|---|
| Ranked Document Retrieval in External Memory | 2023-10-23 | Paper |
| Approximating Gromov-Hausdorff distance in Euclidean space | 2023-09-15 | Paper |
| External-memory algorithms for processing line segments in geographic information systems | 2023-05-08 | Paper |
| Output-sensitive generation of the perspective view of isothetic parallelepipeds | 2022-12-09 | Paper |
| A simplified technique for hidden-line elimination in terrains | 2022-08-18 | Paper |
| Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform | 2019-09-16 | Paper |
| A Data-Aware FM-index | 2019-09-12 | Paper |
| I/O overhead and parallel VLSI architectures for lattice computations | 2018-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643854 | 2018-05-29 | Paper |
| Space-Efficient String Indexing for Wildcard Pattern Matching. | 2017-03-03 | Paper |
| Fast construction of wavelet trees | 2016-06-16 | Paper |
| When indexing equals compression | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501319 | 2015-08-03 | Paper |
| Compressing dictionary matching index via sparsification technique | 2015-07-10 | Paper |
| Geometric BWT: compressed text indexing via sparse suffixes and range searching | 2015-05-26 | Paper |
| Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) | 2014-09-26 | Paper |
| Space-Efficient Frameworks for Top- k String Retrieval | 2014-09-12 | Paper |
| Lexicographically optimal smoothing for broadband traffic multiplexing | 2014-07-25 | Paper |
| Space-Efficient Framework for Top-k String Retrieval Problems | 2014-07-25 | Paper |
| Compressed text indexing with wildcards | 2014-02-03 | Paper |
| Optimal Color Range Reporting in One Dimension | 2013-09-17 | Paper |
| Top-k Document Retrieval in External Memory | 2013-09-17 | Paper |
| Indexes for Document Retrieval with Relevance | 2013-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5326951 | 2013-08-01 | Paper |
| On position restricted substring searching in succinct space | 2013-06-24 | Paper |
| Faster compressed dictionary matching | 2013-03-04 | Paper |
| Document Listing for Queries with Excluded Pattern | 2012-08-14 | Paper |
| Algorithms and Data Structures for External Memory | 2012-08-07 | Paper |
| Cache-oblivious index for approximate string matching | 2011-07-14 | Paper |
| Boosting Pattern Matching Performance via k-bit Filtering | 2010-10-06 | Paper |
| Compression, Indexing, and Retrieval for Massive String Data | 2010-07-26 | Paper |
| Distribution sort with randomized cycling | 2008-12-21 | Paper |
| Cache-Oblivious Index for Approximate String Matching | 2008-06-17 | Paper |
| Compressed data structures: Dictionaries and data-aware measures | 2007-12-19 | Paper |
| A Framework for Dynamizing Succinct Data Structures | 2007-11-28 | Paper |
| Compressed Dictionaries: Space Measures, Data Sets, and Experiments | 2007-09-14 | Paper |
| Efficient Bundle Sorting | 2007-05-03 | Paper |
| External-memory algorithms for processing line segments in geographic information systems | 2007-03-05 | Paper |
| Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching | 2006-06-01 | Paper |
| Duality Between Prefetching and Queued Writing with Parallel Disks | 2005-09-16 | Paper |
| I/O-Efficient Algorithms for Problems on Grid-Based Terrains | 2005-08-04 | Paper |
| Efficient sorting using registers and caches | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024793 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471381 | 2004-07-28 | Paper |
| Optimal External Memory Interval Management | 2003-09-28 | Paper |
| Dynamic generation of discrete random variates | 2003-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411348 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796704 | 2003-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779066 | 2002-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778727 | 2002-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552049 | 2002-08-28 | Paper |
| A simple and efficient parallel disk mergesort | 2002-06-27 | Paper |
| Efficient bulk operations on dynamic \(R\)-trees | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535014 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768275 | 2002-01-30 | Paper |
| Competitive Parallel Disk Prefetching and Buffer Management | 2001-04-09 | Paper |
| Efficient searching with linear constraints | 2001-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527021 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945524 | 2000-11-12 | Paper |
| THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL | 2000-11-07 | Paper |
| Cylindrical static and kinetic binary space partitions | 2000-09-04 | Paper |
| A theory for memory-based learning | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952708 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252705 | 2000-04-26 | Paper |
| Application-Controlled Paging for a Shared Cache | 2000-03-19 | Paper |
| Binary Space Partitions for Fat Rectangles | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250238 | 2000-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234136 | 1999-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228471 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252266 | 1999-06-17 | Paper |
| Algorithms for parallel memory, I: Two-level memories | 1999-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224922 | 1999-01-17 | Paper |
| Simple randomized mergesort on parallel disks | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385514 | 1998-05-04 | Paper |
| Algorithm 673 | 1998-02-09 | Paper |
| A data structure for arc insertion and regular path finding | 1997-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335209 | 1997-10-16 | Paper |
| Parallel lossless image compression using Huffman and arithmetic coding | 1997-02-27 | Paper |
| Indexing for data models with constraints and classes | 1996-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886043 | 1996-11-04 | Paper |
| Using Vapnik-Chervonenkis dimension to analyze the testing complexity of program segments | 1996-10-01 | Paper |
| Blocking for external graph searching | 1996-08-12 | Paper |
| An efficient parallel algorithm for shortest paths in planar layered digraphs | 1996-03-18 | Paper |
| Optimal cooperative search in fractional cascaded data structures | 1996-03-07 | Paper |
| Algorithms for parallel memory. II: Hierarchical multilevel memories | 1994-10-13 | Paper |
| Complexity models for incremental computation | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281566 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138873 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140440 | 1993-12-15 | Paper |
| A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS | 1993-10-24 | Paper |
| Large-scale sorting in uniform memory hierarchies | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035655 | 1993-05-18 | Paper |
| Approximation algorithms for geometric median problems | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016538 | 1993-01-16 | Paper |
| Output-sensitive generation of the perspective view of isothetic parallelepipeds | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013532 | 1992-09-27 | Paper |
| Learning in parallel | 1992-06-28 | Paper |
| Lower bounds for planar orthogonal drawings of graphs | 1992-06-27 | Paper |
| The Maximum Size of Dynamic Data Structures | 1992-06-26 | Paper |
| Parallel Transitive Closure and Point Location in Planar Structures | 1992-06-25 | Paper |
| Maximum queue size and hashing with lazy deletion | 1991-01-01 | Paper |
| Computation of the axial view of a set of isothetic parallelepipeds | 1990-01-01 | Paper |
| A parallel algorithm for recognizing unordered depth-first search | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3763598 | 1987-01-01 | Paper |
| Design and analysis of dynamic Huffman codes | 1987-01-01 | Paper |
| The complexity of hashing with lazy deletion | 1986-01-01 | Paper |
| Shortest paths in Euclidean graphs | 1986-01-01 | Paper |
| Deletion Algorithms for Coalesced Hashing | 1986-01-01 | Paper |
| New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P | 1986-01-01 | Paper |
| Random sampling with a reservoir | 1985-01-01 | Paper |
| Optimum Algorithms for a Model of Direct Chaining | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3711762 | 1985-01-01 | Paper |
| Analysis of new variants of coalesced hashing | 1984-01-01 | Paper |
| Faster methods for random sampling | 1984-01-01 | Paper |
| Analysis of Early-Insertion Standard Coalesced Hashing | 1983-01-01 | Paper |
| Analysis of the Search Performance of Coalesced Hashing | 1983-01-01 | Paper |
| Deletion algorithms for hashing that preserve randomness | 1982-01-01 | Paper |
