default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDany Breslauer
Person information
- affiliation: University of Haifa, Caesarea Rothchild Institute for Interdisciplinary Applications of Computer Science, Israel
- affiliation: University of Aarhus, Department of Computer Science, Denmark
- affiliation (PhD 1992): Columbia University, Department of Computer Science, New York, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j25]Takuya Takagi
, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian:
Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. Algorithmica 82(5): 1346-1377 (2020)
2010 – 2019
- 2014
- [j24]Dany Breslauer, Zvi Galil:
Real-Time Streaming String-Matching. ACM Trans. Algorithms 10(4): 22:1-22:12 (2014) - [j23]Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann:
Towards optimal packed string matching. Theor. Comput. Sci. 525: 111-129 (2014) - 2013
- [j22]Dany Breslauer, Giuseppe F. Italiano:
Near real-time suffix tree construction via the fringe marked ancestor problem. J. Discrete Algorithms 18: 32-48 (2013) - [j21]Dany Breslauer, Roberto Grossi, Filippo Mignosi:
Simple real-time constant-space string matching. Theor. Comput. Sci. 483: 2-9 (2013) - 2012
- [j20]Dany Breslauer, Giuseppe F. Italiano:
On suffix extensions in suffix trees. Theor. Comput. Sci. 457: 27-34 (2012) - [c18]Dany Breslauer, Leszek Gasieniec, Roberto Grossi:
Constant-Time Word-Size String Matching. CPM 2012: 83-96 - 2011
- [c17]Dany Breslauer, Zvi Galil:
Real-Time Streaming String-Matching. CPM 2011: 162-172 - [c16]Dany Breslauer, Roberto Grossi, Filippo Mignosi:
Simple Real-Time Constant-Space String Matching. CPM 2011: 173-183 - [c15]Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann:
Optimal Packed String Matching. FSTTCS 2011: 423-432 - [c14]Dany Breslauer, Giuseppe F. Italiano:
Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. SPIRE 2011: 156-167 - [c13]Dany Breslauer, Giuseppe F. Italiano:
On Suffix Extensions in Suffix Trees. SPIRE 2011: 301-312
1990 – 1999
- 1998
- [j19]Dany Breslauer, Livio Colussi, Laura Toniolo:
On the Comparison Complexity of the String Prefix-Matching Problem. J. Algorithms 29(1): 18-67 (1998) - [j18]Dany Breslauer:
The Suffix Tree of a Tree and Minimizing Sequential Transducers. Theor. Comput. Sci. 191(1-2): 131-144 (1998) - [j17]Dany Breslauer:
On Competitive On-Line Paging with Lookahead. Theor. Comput. Sci. 209(1-2): 365-375 (1998) - 1997
- [j16]Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide:
Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. Inf. Process. Lett. 62(2): 103-110 (1997) - [j15]Dany Breslauer, Tao Jiang, Zhigen Jiang:
Rotations of Periodic Strings and Short Superstrings. J. Algorithms 24(2): 340-353 (1997) - [c12]Alberto Apostolico, Dany Breslauer:
Of Periods, Quasiperiods, Repetitions and Covers. Structures in Logic and Computer Science 1997: 236-248 - 1996
- [j14]Dany Breslauer, Leszek Gasieniec:
Efficient String Matching on Packed Texts. RAIRO Theor. Informatics Appl. 30(6): 521-544 (1996) - [j13]Dany Breslauer, Ramesh Hariharan:
Optimal Parallel Construction of Minimal Suffix and Factor Automata. Parallel Process. Lett. 6(1): 35-44 (1996) - [j12]Alberto Apostolico, Dany Breslauer:
An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String. SIAM J. Comput. 25(6): 1318-1331 (1996) - [j11]Dany Breslauer:
Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm. Theor. Comput. Sci. 158(1&2): 177-192 (1996) - [c11]Dany Breslauer:
The suffix Tree of a Tree and Minimizing Sequential Transducers. CPM 1996: 116-129 - [c10]Dany Breslauer:
On Competitive On-Line Paging with Lookahead. STACS 1996: 593-603 - 1995
- [j10]Dany Breslauer, Zvi Galil:
Finding All Periods and Initial Palindromes of a String in Parallel. Algorithmica 14(4): 355-366 (1995) - [j9]Dany Breslauer:
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. J. Algorithms 18(2): 278-296 (1995) - [j8]Dany Breslauer:
Fast Parallel String Prefix-Matching. Theor. Comput. Sci. 137(2): 269-278 (1995) - [j7]Alberto Apostolico, Dany Breslauer, Zvi Galil:
Parallel Detection of all Palindromes in a String. Theor. Comput. Sci. 141(1&2): 163-173 (1995) - [c9]Dany Breslauer, Leszek Gasieniec:
Efficient String Matching on Coded Texts. CPM 1995: 27-40 - 1994
- [j6]Dany Breslauer:
Testing String Superprimitivity in Parallel. Inf. Process. Lett. 49(5): 235-241 (1994) - [c8]Dany Breslauer:
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. CPM 1994: 184-197 - [c7]Dany Breslauer, Livio Colussi, Laura Toniolo:
On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). ESA 1994: 483-494 - [c6]Alberto Apostolico, Dany Breslauer, Zvi Galil:
Parallel Detection of all Palindromes in a String. STACS 1994: 497-506 - 1993
- [j5]Dany Breslauer, Livio Colussi, Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem. Inf. Process. Lett. 47(1): 51-57 (1993) - [j4]Dany Breslauer, Zvi Galil:
Efficient Comparison Based String Matching. J. Complex. 9(3): 339-365 (1993) - [c5]Dany Breslauer, Livio Colussi, Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem. CPM 1993: 11-19 - [c4]Dany Breslauer:
Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. ESA 1993: 61-72 - 1992
- [j3]Dany Breslauer:
An On-Line String Superprimitivity Test. Inf. Process. Lett. 44(6): 345-347 (1992) - [j2]Dany Breslauer, Zvi Galil:
A Lower Bound for Parallel String Matching. SIAM J. Comput. 21(5): 856-862 (1992) - [c3]Alberto Apostolico, Dany Breslauer, Zvi Galil:
Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). ICALP 1992: 296-307 - 1991
- [c2]Dany Breslauer, Zvi Galil:
A Lower Bound for Parallel String Matching. STOC 1991: 439-443 - 1990
- [j1]Dany Breslauer, Zvi Galil:
An Optimal O(log log n) Time Parallel String Matching Algorithm. SIAM J. Comput. 19(6): 1051-1058 (1990)
1980 – 1989
- 1989
- [c1]Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin:
Highly Parallelizable Problems (Extended Abstract). STOC 1989: 309-319
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
