Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Baeza-Yates, Ricardo A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal bounded disorder
Ricardo A. Baeza-Yates
,
Héctor Soza-Pollman
Information Processing Letters
83
(3), 2002, pp. 151-157
Similarity in two-dimensional strings
Ricardo A. Baeza-Yates
Lecture Notes in Computer Science
1449
, 1998, pp. 319-328
New indices for text: PAT trees and PAT arrays
Gaston H. Gonnet
,
Ricardo A. Baeza-Yates
,
Tim Snider
Information Retrieval - Data Structures and Algorithms, 1998, pp. 66-82
A framework to animate string algorithms
Ricardo A. Baeza-Yates
,
Luis O. Fuentes
Information Processing Letters
59
(5), 1996, pp. 241-244
Fast and practical approximate string matching
Ricardo A. Baeza-Yates
,
Chris H. Perleberg
Information Processing Letters
59
(1), 1996, pp. 21-27
Bounded disorder: The effect of the index
Ricardo A. Baeza-Yates
Theoretical Computer Science
168
(1), 1996, pp. 21-38
Higher-order analysis of 2-3 trees
Ricardo A. Baeza-Yates
,
Patricio V. Poblete
International Journal of Foundations of Computer Science
6
(1), 1995, pp. 1-10
Fringe analysis revisited
Ricardo A. Baeza-Yates
ACM Computing Surveys
27
(1), 1995, pp. 109-119
Fast string matching with mismatches
Ricardo A. Baeza-Yates
,
Gaston H. Gonnet
Information and Computation
108
(2), 1994, February, pp. 187-199
Analysis of bounded disorder
Ricardo A. Baeza-Yates
Lecture Notes in Computer Science
841
, 1994, pp. 233-244
On efficient entreeings
Paul S. Amerins
,
Ricardo A. Baeza-Yates
,
Derick Wood
Acta Informatica
30
, 1993, pp. 203-213
Searching in the plane
Ricardo A. Baeza-Yates
,
Joseph C. Culberson
,
Gregory J.E. Rawlins
Information and Computation
106
(2), 1993, October, pp. 234-252
Unbalanced multiway trees improved by partial expansions
Ricardo A. Baeza-Yates
,
Walter Cunto
Acta Informatica
29
, 1992, pp. 443-460
Fast and practical approximate string matching
Ricardo A. Baeza-Yates
,
Chris H. Perleberg
Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, CPM'92 (Tuscon, Arizona, USA, April 29 - May 1, 1992)
644
, 1992, pp. 185-192
Average running time of the Boyer-Moore-Horspool algorithm
Ricardo A. Baeza-Yates
,
Mireille Régnier
Theoretical Computer Science
92
, 1991, pp. 19-31
Height balance distribution of search trees
Ricardo A. Baeza-Yates
Information Processing Letters
39
, 1991, pp. 317-324
Analysis of Boyer-Moore-type string searching algorithms
Ricardo A. Baeza-Yates
,
Gaston H. Gonnet
,
Mireille Régnier
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 328-343
Searching subsequences
Ricardo A. Baeza-Yates
Theoretical Computer Science
78
, 1990, pp. 363-376
An analysis of the Karp-Rabin string matching algorithm
Gaston H. Gonnet
,
Ricardo A. Baeza-Yates
Information Processing Letters
34
, 1990, pp. 271-274
Efficient text searching of regular expressions
Ricardo A. Baeza-Yates
,
Gaston H. Gonnet
Lecture Notes in Computer Science
382
, 1989, pp. 1-2
String searching algorithms revisited
Ricardo A. Baeza-Yates
Lecture Notes in Computer Science
382
, 1989, pp. 75-96
Expected behaviour of
B+
-trees under random insertions
Ricardo A. Baeza-Yates
Acta Informatica
26
, 1988, pp. 439-471
Modelling splits in file structures
Ricardo A. Baeza-Yates
Acta Informatica
26
, 1988, pp. 349-362