| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6187829 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065424 | 2023-11-14 | Paper |
| Space-Efficient Data Structures for Lattices | 2023-11-02 | Paper |
| A Simple Algorithm for Optimal Search Trees with Two-way Comparisons | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075965 | 2023-09-20 | Paper |
| Internal masked prefix sums and its connection to fully internal measurement queries | 2023-08-04 | Paper |
| The binomial transform and its application to the analysis of skip lists | 2023-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874454 | 2023-02-07 | Paper |
| On Approximate Range Mode and Range Selection | 2023-02-03 | Paper |
| Neighbours on a grid | 2022-12-09 | Paper |
| Analysis of the expected search cost in skip lists | 2022-12-09 | Paper |
| On Huang and Wong's algorithm for generalized binary split trees | 2022-10-24 | Paper |
| Trans-dichotomous algorithms without multiplication — some upper and lower bounds | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091062 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091119 | 2022-07-21 | Paper |
| Dynamic Planar Point Location in External Memory. | 2022-07-18 | Paper |
| On the cost of unsuccessful searches in search trees with two-way comparisons | 2021-11-25 | Paper |
| Improved Time and Space Bounds for Dynamic Range Mode | 2021-08-04 | Paper |
| Dynamic Trees with Almost-Optimal Access Cost | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009630 | 2021-08-04 | Paper |
| Range majorities and minorities in arrays | 2021-06-11 | Paper |
| Succinct Color Searching in One Dimension | 2020-11-25 | Paper |
| Fast Compressed Self-Indexes with Deterministic Linear-Time Construction | 2020-11-25 | Paper |
| Faster algorithms for some optimization problems on collinear points | 2020-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116481 | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115775 | 2020-08-18 | Paper |
| Fast compressed self-indexes with deterministic linear-time construction | 2020-04-09 | Paper |
| Ranked document selection | 2020-02-20 | Paper |
| Multi-Pivot Quicksort: Theory and Experiments | 2019-09-12 | Paper |
| Selection and Sorting in the “Restore” Model | 2019-06-20 | Paper |
| Maintaining discrete probability distributions optimally | 2019-03-29 | Paper |
| Selection and Sorting in the “Restore” Model | 2018-11-13 | Paper |
| Data Structures for Path Queries | 2018-11-05 | Paper |
| Dynamic path queries in linear space | 2018-10-18 | Paper |
| Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643864 | 2018-05-29 | Paper |
| Raising Permutations to Powers in Place | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607917 | 2018-03-15 | Paper |
| Finding modes with equality comparisons | 2017-11-16 | Paper |
| On the succinct representation of equivalence classes | 2017-10-09 | Paper |
| Top-\(k\) term-proximity in succinct space | 2017-07-07 | Paper |
| Succinct indices for path minimum, with applications | 2017-07-07 | Paper |
| Succinct Data Structures ... Potential for Symbolic Computation? | 2017-05-10 | Paper |
| The Hausdorff core problem on simple polygons | 2017-03-09 | Paper |
| Succinct representation of finite abelian groups | 2017-02-03 | Paper |
| Succinct posets | 2016-10-21 | Paper |
| Dynamic range majority data structures | 2016-09-01 | Paper |
| Less space: indexing for queries with wildcards | 2016-06-27 | Paper |
| Permuted scaled matching | 2016-06-16 | Paper |
| Fast construction of wavelet trees | 2016-06-16 | Paper |
| Document retrieval with one wildcard | 2016-05-26 | Paper |
| On the Succinct Representation of Unlabeled Permutations | 2016-01-11 | Paper |
| Optimal Search Trees with 2-Way Comparisons | 2016-01-11 | Paper |
| Compressed Data Structures for Dynamic Sequences | 2015-11-19 | Paper |
| Sorting and Selection with Equality Comparisons | 2015-10-30 | Paper |
| Top-$$k$$ Term-Proximity in Succinct Space | 2015-09-11 | Paper |
| Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes | 2015-09-11 | Paper |
| Dynamic Path Counting and Reporting in Linear Space | 2015-09-11 | Paper |
| Low space data structures for geometric range mode query | 2015-05-22 | Paper |
| On hardness of several string indexing problems | 2015-04-29 | Paper |
| Finding median in read-only memory on integer input | 2015-04-29 | Paper |
| An efficient algorithm for partial order production | 2015-02-04 | Paper |
| A framework for succinct labeled ordinal trees over large alphabets | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934653 | 2014-12-18 | Paper |
| Document Retrieval with One Wildcard | 2014-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921650 | 2014-10-13 | Paper |
| Succinct Indices for Path Minimum, with Applications to Path Reporting | 2014-10-08 | Paper |
| Improved Explicit Data Structures in the Bitprobe Model | 2014-10-08 | Paper |
| Succinct indexes for strings, binary relations and multilabeled trees | 2014-09-09 | Paper |
| Succinct ordinal trees based on tree covering | 2014-09-09 | Paper |
| Ranked Document Selection | 2014-09-02 | Paper |
| Sorting under partial information (without the ellipsoid algorithm). | 2014-08-13 | Paper |
| Permuted Scaled Matching | 2014-06-30 | Paper |
| On Hardness of Several String Indexing Problems | 2014-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417721 | 2014-05-22 | Paper |
| A uniform paradigm to succinctly encode various families of trees | 2014-03-25 | Paper |
| Sorting under partial information (without the ellipsoid algorithm). | 2014-03-17 | Paper |
| Space efficient data structures for dynamic orthogonal range counting | 2014-01-22 | Paper |
| Less Space: Indexing for Queries with Wildcards | 2014-01-14 | Paper |
| Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers | 2014-01-14 | Paper |
| Succinct Data Structures for Representing Equivalence Classes | 2014-01-14 | Paper |
| The Distance 4-Sector of Two Points Is Unique | 2014-01-14 | Paper |
| Succinct encoding of arbitrary graphs | 2014-01-13 | Paper |
| Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima | 2013-08-12 | Paper |
| A novel approach for leveraging co-occurrence to improve the false positive error in signature files | 2013-06-24 | Paper |
| Range majority in constant time and linear space | 2013-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4918390 | 2013-04-24 | Paper |
| A Framework for Succinct Labeled Ordinal Trees over Large Alphabets | 2013-03-21 | Paper |
| Succinct Data Structures for Path Queries | 2012-09-25 | Paper |
| Succinct Posets | 2012-09-25 | Paper |
| Succinct representations of permutations and functions | 2012-08-08 | Paper |
| Succinct representation of labeled graphs | 2012-04-26 | Paper |
| Path Queries in Weighted Trees | 2011-12-16 | Paper |
| Dynamic Range Majority Data Structures | 2011-12-16 | Paper |
| Dynamic Range Selection in Linear Space | 2011-12-16 | Paper |
| Space Efficient Data Structures for Dynamic Orthogonal Range Counting | 2011-08-12 | Paper |
| Untangled monotonic chains and adaptive range search | 2011-07-27 | Paper |
| Range Majority in Constant Time and Linear Space | 2011-07-06 | Paper |
| Succinct representation of dynamic trees | 2011-06-07 | Paper |
| An Efficient Algorithm for Partial Order Production | 2011-04-04 | Paper |
| Sorting with networks of data structures | 2010-11-05 | Paper |
| Implicit dictionaries with O(1) modifications per update and fast search | 2010-08-16 | Paper |
| Rank/select operations on large alphabets | 2010-08-16 | Paper |
| Cache-oblivious priority queue and graph algorithm applications | 2010-08-05 | Paper |
| Integer representation and counting in the bit probe model | 2010-02-23 | Paper |
| Untangled Monotonic Chains and Adaptive Range Search | 2009-12-17 | Paper |
| Reflections on Optimal and Nearly Optimal Binary Search Trees | 2009-11-12 | Paper |
| Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance | 2009-10-20 | Paper |
| On the relative dominance of paging algorithms | 2009-09-10 | Paper |
| Deterministic SkipNet | 2009-07-21 | Paper |
| Dynamic Succinct Ordered Trees | 2009-07-14 | Paper |
| Succinct Representations of Arbitrary Graphs | 2008-11-25 | Paper |
| A Uniform Approach Towards Succinct Representation of Trees | 2008-07-15 | Paper |
| Integer Representation and Counting in the Bit Probe Model | 2008-05-27 | Paper |
| Succinct Representation of Labeled Graphs | 2008-05-27 | Paper |
| On the Relative Dominance of Paging Algorithms | 2008-05-27 | Paper |
| An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms | 2008-01-03 | Paper |
| Adaptive searching in succinctly encoded binary relations and tree-structured documents | 2007-12-19 | Paper |
| Succinct Ordinal Trees Based on Tree Covering | 2007-11-28 | Paper |
| Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents | 2007-09-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| The binomial transform and the analysis of skip lists | 2006-03-24 | Paper |
| Representing trees of higher degree | 2006-03-21 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024760 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024774 | 2005-07-04 | Paper |
| Fast allocation and deallocation with an improved buddy system | 2005-04-15 | Paper |
| Fun-Sort -- or the chaos of unordered binary search | 2005-02-23 | Paper |
| ONLINE ROUTING IN CONVEX SUBDIVISIONS | 2004-09-29 | Paper |
| Robot Localization without Depth Perception | 2004-08-12 | Paper |
| Implicit \(B\)-trees: A new data structure for the dictionary problem | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472479 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449187 | 2004-02-08 | Paper |
| On universally easy classes for NP-complete problems. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411371 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801183 | 2003-04-07 | Paper |
| Efficient visibility queries in simple polygons | 2003-03-10 | Paper |
| Succinct Representation of Balanced Parentheses and Static Trees | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768343 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768345 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768398 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407717 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753950 | 2001-11-11 | Paper |
| Space Efficient Suffix Trees | 2001-01-01 | Paper |
| Permuting in Place | 2000-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952695 | 2000-05-10 | Paper |
| Membership in Constant Time and Almost-Minimum Space | 1999-10-28 | Paper |
| The Diagonal Poisson Transform and its application to the analysis of a hashing scheme | 1997-05-06 | Paper |
| Selection from read-only memory and sorting with minimum data movement | 1997-02-27 | Paper |
| Fast stable in-place sorting with \(O(n)\) data moves | 1996-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875211 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763422 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037402 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037442 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028918 | 1993-03-28 | Paper |
| Sorting with minimum data movement | 1993-01-16 | Paper |
| Average search and update costs in skip lists | 1992-12-14 | Paper |
| An implicit data structure for searching a multikey table in logarithmic time | 1992-06-28 | Paper |
| Fringe analysis for extquick: An in situ distributive external sorting algorithm | 1991-01-01 | Paper |
| Analysis of the standard deletion algorithms in exact fit domain binary search trees | 1990-01-01 | Paper |
| Stable in situ sorting and minimum data movement | 1990-01-01 | Paper |
| Deterministic optimal and expedient move-to-rear list organizing strategies | 1990-01-01 | Paper |
| Average case selection | 1989-01-01 | Paper |
| Last-come-first-served hashing | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796732 | 1988-01-01 | Paper |
| An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3753486 | 1986-01-01 | Paper |
| Heaps on Heaps | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3685208 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3694707 | 1985-01-01 | Paper |
| The analysis of a fringe heuristic for binary search trees | 1985-01-01 | Paper |
| Efficient uses of the past | 1985-01-01 | Paper |
| Partial match retrieval in implicit data structures | 1984-01-01 | Paper |
| Fault tolerance and storage reduction in binary search trees | 1984-01-01 | Paper |
| The analysis of linear probing sort by the use of a new mathematical transform | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3330522 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3673089 | 1983-01-01 | Paper |
| How Small Can the Mean Shadow of a Set Be? | 1983-01-01 | Paper |
| Direct dynamic structures for some line segment problems | 1983-01-01 | Paper |
| Optimum reorganization points for arbitrary database costs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3945583 | 1982-01-01 | Paper |
| Technical Note—Reducing Space Requirements for Shortest Path Problems | 1982-01-01 | Paper |
| Optimal Time Minimal Space Selection Algorithms | 1981-01-01 | Paper |
| Exegesis of Self-Organizing Linear Search | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3917501 | 1981-01-01 | Paper |
| Continual pattern replication | 1981-01-01 | Paper |
| Determining the mode | 1980-01-01 | Paper |
| Selection and sorting with limited storage | 1980-01-01 | Paper |
| Implicit data structures for fast search and update | 1980-01-01 | Paper |
| Efficient Ordering of Hash Tables | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4160413 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4163005 | 1978-01-01 | Paper |
| Self-Organizing Binary Search Trees | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3923618 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4128013 | 1977-01-01 | Paper |
| Designing overlay structures | 1977-01-01 | Paper |
| Sorting and Searching in Multisets | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4107931 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190138 | 1975-01-01 | Paper |
| Optimal algorithms for parallel polynomial evaluation | 1973-01-01 | Paper |
| Efficient determination of the transitive closure of a directed graph | 1971-01-01 | Paper |
| Evaluating polynomials at many points | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672172 | 1971-01-01 | Paper |
