The following pages link to Ricardo A. Baeza-Yates (Q671613):
Displayed 50 items.
- (Q196680) (redirect page) (← links)
- (Q294702) (redirect page) (← links)
- Very fast and simple approximate string matching (Q294703) (← links)
- A framework to animate string algorithms (Q671615) (← links)
- Searching in the plane (Q690242) (← links)
- On the size of Boyer-Moore automata (Q732040) (← links)
- An algorithm for string matching with a sequence of don't cares (Q750152) (← links)
- An analysis of the Karp-Rabin string matching algorithm (Q911281) (← links)
- Sync/Async parallel search for the efficient design and construction of web search engines (Q991093) (← links)
- Modeling splits in file structures (Q1105353) (← links)
- Expected behaviour of \(B^+\)-trees under random insertions (Q1105354) (← links)
- Some average measures in m-ary search trees (Q1108026) (← links)
- A trivial algorithm whose analysis is not: a continuation (Q1123606) (← links)
- Height balance distribution of search trees (Q1183418) (← links)
- Average running time of the Boyer-Moore-Horspool algorithm (Q1190450) (← links)
- Improved bounds for the expected behaviour of AVL trees (Q1196459) (← links)
- Unbalanced multiway trees improved by partial expansions (Q1203601) (← links)
- Fast two-dimensional pattern matching (Q1209318) (← links)
- Faster approximate string matching (Q1277393) (← links)
- Bounding the expected length of longest common subsequences and forests (Q1293550) (← links)
- Fast string matching with mismatches (Q1322483) (← links)
- On efficient entreeings (Q1323334) (← links)
- On Boyer-Moore automata (Q1336957) (← links)
- Bounded disorder: The effect of the index (Q1350992) (← links)
- Optimal binary search trees with costs depending on the access paths. (Q1401195) (← links)
- Information retrieval in the Web: Beyond current search engines. (Q1427937) (← links)
- Fast and practical approximate string matching (Q1847363) (← links)
- Optimal bounded disorder. (Q1853058) (← links)
- Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees. (Q1874394) (← links)
- Parallel searching in the plane (Q1903637) (← links)
- Binary searching with nonuniform costs and its application to text retrieval (Q1977134) (← links)
- Searching subsequences (Q2638800) (← links)
- (Q3024807) (← links)
- (Q3024813) (← links)
- (Q3138910) (← links)
- Generic Damping Functions for Propagating Importance in Link-Based Ranking (Q3519886) (← links)
- Algorithmic Challenges in Web Search Engines (Q3525740) (← links)
- Web retrieval: Techniques for the aggregation and selection of queries and answers (Q3544359) (← links)
- Fast Intersection Algorithms for Sorted Sequences (Q3558257) (← links)
- Towards a Distributed Search Engine (Q3562986) (← links)
- (Q3796804) (← links)
- (Q4016521) (← links)
- (Q4028869) (← links)
- (Q4028877) (← links)
- (Q4218435) (← links)
- Fast text searching for regular expressions or automaton searching on tries (Q4371691) (← links)
- (Q4390747) (← links)
- New and faster filters for multiple approximate string matching (Q4534215) (← links)
- (Q4536007) (← links)
- (Q4552046) (← links)