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="Breslauer, Dany"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Towards optimal packed string matching
Oren Ben-Kiki
,
Philip Bille
,
Dany Breslauer
,
Leszek Ga̧sieniec
,
Roberto Grossi
,
Oren Weimann
Theoretical Computer Science
525
, 2014, pp. 111-129
Simple real-time constant-space string matching
Dany Breslauer
,
Roberto Grossi
,
Filippo Mignosi
Theoretical Computer Science
483
, 2013, pp. 2-9
Constant-time word-size string matching
Dany Breslauer
,
Leszek Ga̧sieniec
,
Roberto Grossi
Lecture Notes in Computer Science
7354
, 2012, pp. 83-96
On suffix extensions in suffix trees
Dany Breslauer
,
Giuseppe F. Italiano
Theoretical Computer Science
457
, 2012, pp. 27-34
Optimal packed string matching
Oren Ben-Kiki
,
Philip Bille
,
Dany Breslauer
,
Leszek Ga̧sieniec
,
Roberto Grossi
,
Oren Weimann
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 423-432
Real-time streaming string-matching
Dany Breslauer
,
Zvi Galil
Lecture Notes in Computer Science
6661
, 2011, pp. 162-172
Simple real-time constant-space string matching
Dany Breslauer
,
Roberto Grossi
,
Filippo Mignosi
Lecture Notes in Computer Science
6661
, 2011, pp. 173-183
On the comparison complexity of the string prefix-matching problem
Dany Breslauer
,
Livio Colussi
,
Laura Toniolo
Journal of Algorithms
29
(1), 1998, pp. 18-67
The suffix tree of a tree and minimizing sequential transducers
Dany Breslauer
Theoretical Computer Science
191
(1-2), 1998, pp. 131-144
On competitive on-line paging with lookahead
Dany Breslauer
Theoretical Computer Science
209
(1-2), 1998, pp. 365-375
Transforming comparison model lower bounds to the parallel-random-access-machine
Dany Breslauer
,
Artur Czumaj
,
Devdatt P. Dubhashi
,
Friedhelm Meyer auf der Heide
Information Processing Letters
62
(2), 1997, pp. 103-110
Rotations of periodic strings and short superstrings
Dany Breslauer
,
Tao Jiang
,
Zhigen Jiang
Journal of Algorithms
24
(2), 1997, pp. 340-353
Optimal parallel construction of minimal suffix and factor automata
Dany Breslauer
,
Ramesh Hariharan
Parallel Processing Letters
6
(1), 1996, pp. 35-44
On competitive on-line paging with lookahead
Dany Breslauer
Lecture Notes in Computer Science
1046
, 1996, pp. 593-603
The suffix tree of a tree and minimizing sequential transducers
Dany Breslauer
Lecture Notes in Computer Science
1075
, 1996, pp. 116-129
Saving comparisons in the Crochemore--Perrin string-matching algorithm
Dany Breslauer
Theoretical Computer Science
158
(1-2), 1996, pp. 177-192
Parallel detection of all palindromes in a string
Alberto Apostolico
,
Dany Breslauer
,
Zvi Galil
Theoretical Computer Science
141
(1-2), 1995, pp. 163-173
Efficient string matching on coded texts
Dany Breslauer
,
Leszek Ga̧sieniec
Lecture Notes in Computer Science
937
, 1995, pp. 27-40
Dictionary-matching on unbounded alphabets: Uniform length dictionaries
Dany Breslauer
Journal of Algorithms
18
(2), 1995, pp. 278-295
Fast parallel string prefix-matching
Dany Breslauer
Theoretical Computer Science
137
(2), 1995, pp. 269-278
Parallel detection of all palindromes in a string
Alberto Apostolico
,
Dany Breslauer
,
Zvi Galil
Lecture Notes in Computer Science
775
, 1994, pp. 497-506
On the exact complexity of the string prefix-matching problem
Dany Breslauer
,
Livio Colussi
,
Laura Toniolo
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 483-494
Testing string superprimitivity in parallel
Dany Breslauer
Information Processing Letters
49
, 1994, pp. 235-241
Dictionary-matching on unbounded alphabets: Uniform length dictionaries
Dany Breslauer
Lecture Notes in Computer Science
807
, 1994, pp. 184-197
Tight comparison bounds for the string prefix-matching problem
Dany Breslauer
,
Livio Colussi
,
Laura Toniolo
Information Processing Letters
47
(1), 1993, pp. 51-57
Seiten 1
2
>