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="Manber, Udi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
How to find it: Research issues in distributed search
Udi Manber
Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'98 (Puerto Vallarta, Mexico, June 28 - July 2, 1998)
, 1998, pp. 4-4
Approximate multiple string search
Robert Muth
,
Udi Manber
Lecture Notes in Computer Science
1075
, 1996, pp. 75-86
A subquadratic algorithm for approximate regular expression matching
Sun Wu
,
Udi Manber
,
Eugene Myers
Journal of Algorithms
19
(3), 1995, pp. 346-360
Proximity matching using fixed-queries trees
Ricardo Baeza-Yates
,
Walter Cunto
,
Udi Manber
,
Sun Wu
Lecture Notes in Computer Science
807
, 1994, pp. 198-212
An algorithm for approximate membership checking with application to password security
Udi Manber
,
Sun Wu
Information Processing Letters
50
, 1994, pp. 191-197
A text compression scheme that allows fast searching directly in the compressed file
Udi Manber
Lecture Notes in Computer Science
807
, 1994, pp. 113-124
Suffix arrays: A new method for on-line string searches
Udi Manber
,
Gene Myers
SIAM Journal on Computing
22
(5), 1993, October, pp. 935-948
Path-matching problems
Sun Wu
,
Udi Manber
Algorithmica
8
, 1992, pp. 89-101
An algorithm for string matching with a sequence of don't cares
Udi Manber
,
Ricardo Baeza-Yates
Information Processing Letters
37
, 1991, pp. 133-136
The complexity of controlled selection
Kirk Pruhs
,
Udi Manber
Information and Computation
91
(1), 1991, March, pp. 103-127
Suffix arrays: A new method for on-line string searches
Udi Manber
,
Gene Myers
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 319-327
Recognizing breadth-first search trees in linear time
Udi Manber
Information Processing Letters
34
, 1990, pp. 167-171
An
O(np)
sequence comparison algorithm
Sun Wu
,
Udi Manber
,
Gene Myers
,
Webb Miller
Information Processing Letters
35
, 1990, pp. 317-323
Using induction to design algorithms
Udi Manber
Communications of the ACM
31
(11), 1988, pp. 1300-1313
On non-intersecting Eulerian circuits
Samuel W. Bent
,
Udi Manber
Discrete Applied Mathematics
18
, 1987, pp. 87-94
Applications of Ramsey's theorem to decision tree complexity
Shlomo Moran
,
Marc Snir
,
Udi Manber
Journal of the ACM
32
(4), 1985, pp. 938-949
Applications of Ramsey's theorem to decison trees complexity
Shlomo Moran
,
Marc Snir
,
Udi Manber
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 332-337