Author image not provided
 Dany Breslauer

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article6.00
Citation Count252
Publication count42
Publication years1989-2014
Available for download3
Average downloads per article376.33
Downloads (cumulative)1,129
Downloads (12 Months)105
Downloads (6 Weeks)13
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


42 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 42
Result page: 1 2 3

Sort by:

1 published by ACM
August 2014 ACM Transactions on Algorithms (TALG): Volume 10 Issue 4, August 2014
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 8,   Downloads (12 Months): 68,   Downloads (Overall): 289

Full text available: PDFPDF
This article presents a real-time randomized streaming string-matching algorithm that uses O (log m ) space. The algorithm only makes one-sided small probability false-positive errors, possibly reporting phantom occurrences of the pattern, but never missing an actual occurrence.
Keywords: randomized algorithms, streaming algorithms, String matching

2
March 2014 Theoretical Computer Science: Volume 525, March, 2014
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

In the packed string matching problem, it is assumed that each machine word can accommodate up to @a characters, thus an n-character string occupies n/@a memory words. (a) We extend the Crochemore-Perrin constant-space O(n)-time string-matching algorithm to run in optimal O(n/@a) time and even in real-time, achieving a factor @a ...
Keywords: Packed strings, Word-RAM, String matching

3
April 2013 Theoretical Computer Science: Volume 483, April, 2013
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 1

String matching is the classical problem of finding all occurrences of a pattern in a text. A real-time string matching algorithm takes worst-case constant-time to check if a pattern occurrence ends at each text location. We derive a real-time variation of the elegant Crochemore-Perrin constant-space string matching algorithm that has ...

4
January 2013 Journal of Discrete Algorithms: Volume 18, January, 2013
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 3

We contribute a further step towards the plausible real-time construction of suffix trees by presenting an on-line algorithm that spends only O(loglogn) time processing each input symbol and takes O(nloglogn) time in total, where n is the length of the input text. Our results improve on a previously published algorithm ...
Keywords: Suffix trees, String algorithms

5
October 2012 Theoretical Computer Science: Volume 457, October, 2012
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 3

Suffix trees are inherently asymmetric: prefix extensions only cause a few updates, while suffix extensions affect all suffixes causing a wave of updates. In his elegant linear-time on-line suffix tree algorithm Ukkonen relaxed the prevailing suffix tree representation and introduced two changes to avoid repeated structural updates and circumvent the ...
Keywords: String algorithms, Suffix trees

6
October 2011 SPIRE'11: Proceedings of the 18th international conference on String processing and information retrieval
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

Suffix trees are inherently asymmetric: prefix extensions only cause a few updates, while suffix extensions affect all suffixes causing a wave of updates. In his elegant linear-time on-line suffix tree algorithm Ukkonen relaxed the prevailing suffix tree representation and introduced two changes to avoid repeated structural updates and circumvent the ...

7
October 2011 SPIRE'11: Proceedings of the 18th international conference on String processing and information retrieval
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

We contribute a further step towards the plausible real time construction of suffix trees by presenting an on-line algorithm that spends O (log log n ) time processing each input symbol and takes O ( n log log n ) time in total. Our results improve on a previously published ...

8
June 2011 CPM'11: Proceedings of the 22nd annual conference on Combinatorial pattern matching
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 8

We use a simple observation about the locations of critical factorizations to derive a real-time variation of the Crochemore-Perrin constant-space string matching algorithm. The real-time variation has a simple and efficient control structure.

9
June 2011 CPM'11: Proceedings of the 22nd annual conference on Combinatorial pattern matching
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

This paper presents a real-time randomized streaming string matching algorithm that uses O (log m ) space. The algorithm only makes one-sided small probability false-positive errors, possibly reporting phantom occurrences of the pattern, but never misses an actual occurrence.

10
December 1998 Theoretical Computer Science: Volume 209 Issue 1-2, Dec. 6, 1998
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 12

Keywords: competitive analysis, paging, lookahead, on-line algorithms

11
October 1998 Journal of Algorithms: Volume 29 Issue 1, Oct. 1998
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 5

In this paper we study the exact comparison complexity of the string prefix-matching problem in the deterministic sequential comparison model with equality tests. We derive almost tight lower and upper bounds on the number of symbol comparisons required in the worst case by on-line prefix-matching algorithms for any fixed pattern ...

12
January 1998 Theoretical Computer Science: Volume 191 Issue 1-2, Jan. 30, 1998
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 12


13
August 1997 Journal of Algorithms: Volume 24 Issue 2, Aug. 1997
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 29

This paper presents two simple approximation algorithms for the shortest superstring problem with approximation ratios 223 (�2.67) and22542(�2.596). The framework of our improved algorithms is similar to that of previous algorithms in the sense that they construct a superstring by computing some optimal cycle covers on the distance graph of ...

14
April 1997 Information Processing Letters: Volume 62 Issue 2, April 28, 1997
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 3

Keywords: Ramsey theory, lower bounds, comparison model, PRAM model

15
January 1997 Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 8


16
December 1996 SIAM Journal on Computing: Volume 25 Issue 6, Dec. 1996
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 9

An optimal $O(\log\log n)$-time concurrent-read concurrent-write parallel algorithm for detecting all squares in a string is presented. A tight lower bound shows that over general alphabets, this is the fastest possible optimal algorithm. When $p$ processors are available, the bounds become $\Theta(\lceil{({n\log n})/ p}\rceil + \log\log_{\lceil 1+p/n \rceil} 2p)$. The ...
Keywords: lower bounds, repititions, squares, parallel algorithms, string matching

17
June 1996 CPM '96: Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3


18
May 1996 Theoretical Computer Science: Volume 158 Issue 1-2, May 20, 1996
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 8


19
February 1996 STACS '96: Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5


20
October 1995 Algorithmica: Volume 14 Issue 4, October 1995
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

An optimalO(log logn)-time CRCW-PRAM algorithm for computing all period lengths of a string is presented. Previous parallel algorithms compute the period only if it is shorter than half of the length of the string. The algorithm can be used to find all initial palindromes of a string in the same ...
Keywords: Strings, Lower bounds, Palindromes, Parallel algorithms, Periods, Comparison model



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us