| Publication | Date of Publication | Type |
|---|
| Optimized binary search and text retrieval | 2023-05-08 | Paper |
| Expected behaviour analysis of AVL trees | 2022-12-09 | Paper |
| Fast algorithms for two dimensional and multiple pattern matching | 2022-12-09 | Paper |
| Multiple approximate string matching | 2022-08-19 | Paper |
| Analysis of bounded disorder | 2022-08-18 | Paper |
| Very fast and simple approximate string matching | 2016-06-16 | Paper |
| Sync/Async parallel search for the efficient design and construction of web search engines | 2010-09-02 | Paper |
| Towards a Distributed Search Engine | 2010-05-28 | Paper |
| Fast Intersection Algorithms for Sorted Sequences | 2010-05-04 | Paper |
| On the size of Boyer-Moore automata | 2009-10-09 | Paper |
| Web retrieval: Techniques for the aggregation and selection of queries and answers | 2008-12-05 | Paper |
| Algorithmic Challenges in Web Search Engines | 2008-09-18 | Paper |
| Generic Damping Functions for Propagating Importance in Link-Based Ranking | 2008-08-19 | Paper |
| Graphs from Search Engine Queries | 2008-03-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Algorithms and Models for the Web-Graph | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024807 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024813 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4672369 | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662850 | 2005-03-30 | Paper |
| Information retrieval in the Web: Beyond current search engines. | 2004-03-14 | Paper |
| Optimal binary search trees with costs depending on the access paths. | 2003-08-17 | Paper |
| Fast and practical approximate string matching | 2003-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708108 | 2003-06-12 | Paper |
| Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees. | 2003-05-25 | Paper |
| Optimal bounded disorder. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552046 | 2002-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536007 | 2002-07-08 | Paper |
| New and faster filters for multiple approximate string matching | 2002-06-05 | Paper |
| Improving an algorithm for approximate pattern matching | 2001-08-09 | Paper |
| Binary searching with nonuniform costs and its application to text retrieval | 2000-05-09 | Paper |
| Bounding the expected length of longest common subsequences and forests | 1999-06-28 | Paper |
| Faster approximate string matching | 1999-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218435 | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390747 | 1998-05-26 | Paper |
| Fast text searching for regular expressions or automaton searching on tries | 1998-01-22 | Paper |
| A framework to animate string algorithms | 1997-02-27 | Paper |
| Bounded disorder: The effect of the index | 1997-02-27 | Paper |
| Parallel searching in the plane | 1995-12-12 | Paper |
| On Boyer-Moore automata | 1995-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138910 | 1994-09-20 | Paper |
| On efficient entreeings | 1994-05-10 | Paper |
| Fast string matching with mismatches | 1994-05-05 | Paper |
| Searching in the plane | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4692507 | 1993-06-05 | Paper |
| Fast two-dimensional pattern matching | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028869 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028877 | 1993-03-28 | Paper |
| Unbalanced multiway trees improved by partial expansions | 1993-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016521 | 1993-01-16 | Paper |
| Improved bounds for the expected behaviour of AVL trees | 1992-12-14 | Paper |
| Average running time of the Boyer-Moore-Horspool algorithm | 1992-09-26 | Paper |
| Height balance distribution of search trees | 1992-06-28 | Paper |
| An algorithm for string matching with a sequence of don't cares | 1991-01-01 | Paper |
| Searching subsequences | 1991-01-01 | Paper |
| An analysis of the Karp-Rabin string matching algorithm | 1990-01-01 | Paper |
| Modeling splits in file structures | 1989-01-01 | Paper |
| Expected behaviour of \(B^+\)-trees under random insertions | 1989-01-01 | Paper |
| A trivial algorithm whose analysis is not: a continuation | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796804 | 1988-01-01 | Paper |
| Some average measures in m-ary search trees | 1987-01-01 | Paper |
