| Publication | Date of Publication | Type |
|---|
A unified view to string matching algorithms
| 2024-06-21 | Paper |
Wikipedia Multilingual Vandalism Detection Dataset
| 2023-07-22 | Dataset |
Optimized binary search and text retrieval
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Fast algorithms for two dimensional and multiple pattern matching
SWAT 90 | 2022-12-09 | Paper |
Expected behaviour analysis of AVL trees
SWAT 90 | 2022-12-09 | Paper |
Multiple approximate string matching
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Analysis of bounded disorder
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Very fast and simple approximate string matching
Information Processing Letters | 2016-06-16 | Paper |
Sync/Async parallel search for the efficient design and construction of web search engines
Parallel Computing | 2010-09-02 | Paper |
Towards a Distributed Search Engine
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Fast Intersection Algorithms for Sorted Sequences
Algorithms and Applications | 2010-05-04 | Paper |
On the size of Boyer-Moore automata
Theoretical Computer Science | 2009-10-09 | Paper |
Web retrieval: Techniques for the aggregation and selection of queries and answers
International Journal of Intelligent Systems | 2008-12-05 | Paper |
Algorithmic Challenges in Web Search Engines
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Generic Damping Functions for Propagating Importance in Link-Based Ranking
Internet Mathematics | 2008-08-19 | Paper |
Graphs from Search Engine Queries
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithms and Models for the Web-Graph
Lecture Notes in Computer Science | 2005-08-22 | Paper |
scientific article; zbMATH DE number 2185640 (Why is no real title available?)
| 2005-07-04 | Paper |
scientific article; zbMATH DE number 2185645 (Why is no real title available?)
| 2005-07-04 | Paper |
scientific article; zbMATH DE number 2163505 (Why is no real title available?)
| 2005-04-29 | Paper |
scientific article; zbMATH DE number 2150301 (Why is no real title available?)
| 2005-03-30 | Paper |
Information retrieval in the Web: Beyond current search engines.
International Journal of Approximate Reasoning | 2004-03-14 | Paper |
Optimal binary search trees with costs depending on the access paths.
Theoretical Computer Science | 2003-08-17 | Paper |
Fast and practical approximate string matching
Information Processing Letters | 2003-06-24 | Paper |
scientific article; zbMATH DE number 1927249 (Why is no real title available?)
| 2003-06-12 | Paper |
Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees.
Theoretical Computer Science | 2003-05-25 | Paper |
Optimal bounded disorder.
Information Processing Letters | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1792104 (Why is no real title available?)
| 2002-11-11 | Paper |
scientific article; zbMATH DE number 1756671 (Why is no real title available?)
| 2002-07-08 | Paper |
New and faster filters for multiple approximate string matching
Random Structures & Algorithms | 2002-06-05 | Paper |
Improving an algorithm for approximate pattern matching
Algorithmica | 2001-08-09 | Paper |
Binary searching with nonuniform costs and its application to text retrieval
Algorithmica | 2000-05-09 | Paper |
Bounding the expected length of longest common subsequences and forests
Theory of Computing Systems | 1999-06-28 | Paper |
Faster approximate string matching
Algorithmica | 1999-06-07 | Paper |
scientific article; zbMATH DE number 1222846 (Why is no real title available?)
| 1998-11-11 | Paper |
scientific article; zbMATH DE number 1156718 (Why is no real title available?)
| 1998-05-26 | Paper |
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM | 1998-01-22 | Paper |
A framework to animate string algorithms
Information Processing Letters | 1997-02-27 | Paper |
Bounded disorder: The effect of the index
Theoretical Computer Science | 1997-02-27 | Paper |
Parallel searching in the plane
Computational Geometry | 1995-12-12 | Paper |
On Boyer-Moore automata
Algorithmica | 1995-10-09 | Paper |
scientific article; zbMATH DE number 432780 (Why is no real title available?)
| 1994-09-20 | Paper |
On efficient entreeings
Acta Informatica | 1994-05-10 | Paper |
Fast string matching with mismatches
Information and Computation | 1994-05-05 | Paper |
Searching in the plane
Information and Computation | 1993-12-20 | Paper |
scientific article; zbMATH DE number 194543 (Why is no real title available?)
| 1993-06-05 | Paper |
Fast two-dimensional pattern matching
Information Processing Letters | 1993-05-16 | Paper |
scientific article; zbMATH DE number 140453 (Why is no real title available?)
| 1993-03-28 | Paper |
scientific article; zbMATH DE number 140461 (Why is no real title available?)
| 1993-03-28 | Paper |
Unbalanced multiway trees improved by partial expansions
Acta Informatica | 1993-02-16 | Paper |
scientific article; zbMATH DE number 88944 (Why is no real title available?)
| 1993-01-16 | Paper |
Improved bounds for the expected behaviour of AVL trees
BIT | 1992-12-14 | Paper |
Average running time of the Boyer-Moore-Horspool algorithm
Theoretical Computer Science | 1992-09-26 | Paper |
Height balance distribution of search trees
Information Processing Letters | 1992-06-28 | Paper |
An algorithm for string matching with a sequence of don't cares
Information Processing Letters | 1991-01-01 | Paper |
Searching subsequences
Theoretical Computer Science | 1991-01-01 | Paper |
An analysis of the Karp-Rabin string matching algorithm
Information Processing Letters | 1990-01-01 | Paper |
Modeling splits in file structures
Acta Informatica | 1989-01-01 | Paper |
Expected behaviour of \(B^+\)-trees under random insertions
Acta Informatica | 1989-01-01 | Paper |
A trivial algorithm whose analysis is not: a continuation
BIT | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4062645 (Why is no real title available?)
| 1988-01-01 | Paper |
Some average measures in m-ary search trees
Information Processing Letters | 1987-01-01 | Paper |
