Dany Breslauer

1.0k total citations
38 papers, 389 citations indexed

About

Dany Breslauer is a scholar working on Artificial Intelligence, Hardware and Architecture and Computational Theory and Mathematics. According to data from OpenAlex, Dany Breslauer has authored 38 papers receiving a total of 389 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Artificial Intelligence, 26 papers in Hardware and Architecture and 16 papers in Computational Theory and Mathematics. Recurrent topics in Dany Breslauer's work include Algorithms and Data Compression (35 papers), Network Packet Processing and Optimization (26 papers) and semigroups and automata theory (14 papers). Dany Breslauer is often cited by papers focused on Algorithms and Data Compression (35 papers), Network Packet Processing and Optimization (26 papers) and semigroups and automata theory (14 papers). Dany Breslauer collaborates with scholars based in Denmark, United States and Italy. Dany Breslauer's co-authors include Zvi Galil, Alberto Apostolico, Tao Jiang, Giuseppe F. Italiano, Ramesh Hariharan, Roberto Grossi, Leszek Gąsieniec, Oren Weimann, Philip Bille and Uzi Vishkin and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Algorithms.

In The Last Decade

Dany Breslauer

37 papers receiving 355 citations

Peers

Dany Breslauer

AI

CTM

MB

HA

CNC

Michael G. Main United States

Omer Berkman United States

Manuela Fischer Switzerland

Christophe Hancart France

Tomasz Kociumaka Poland

Kimmo Fredriksson Finland

Artūrs Bačkurs United States

Bernd Steinbach Germany

Vigyan Singhal United States

Norbert Blüm Germany

Michael G. Main United States

Dany Breslauer

313 ×0.9

AI

272 ×1.2

CTM

243 ×1.6

MB

67 ×0.5

HA

39 ×1.1

CNC

Citations per year, relative to Dany Breslauer Dany Breslauer (= 1×) peers Michael G. Main

Countries citing papers authored by Dany Breslauer

Since Specialization

Citations

This map shows the geographic impact of Dany Breslauer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dany Breslauer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dany Breslauer more than expected).

Fields of papers citing papers by Dany Breslauer

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dany Breslauer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dany Breslauer. The network helps show where Dany Breslauer may publish in the future.

Co-authorship network of co-authors of Dany Breslauer

This figure shows the co-authorship network connecting the top 25 collaborators of Dany Breslauer. A scholar is included among the top collaborators of Dany Breslauer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Dany Breslauer. Dany Breslauer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Takagi, T., et al.. (2019). Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. Algorithmica. 82(5). 1346–1377. 1 indexed citations

2.

Breslauer, Dany & Zvi Galil. (2014). Real-Time Streaming String-Matching. ACM Transactions on Algorithms. 10(4). 1–12. 6 indexed citations

3.

Bille, Philip, et al.. (2013). Towards optimal packed string matching. Theoretical Computer Science. 525. 111–129. 5 indexed citations

4.

Breslauer, Dany & Giuseppe F. Italiano. (2012). Near real-time suffix tree construction via the fringe marked ancestor problem. Journal of Discrete Algorithms. 18. 32–48. 7 indexed citations

5.

Breslauer, Dany, Roberto Grossi, & Filippo Mignosi. (2012). Simple real-time constant-space string matching. Theoretical Computer Science. 483. 2–9. 2 indexed citations

6.

Breslauer, Dany. (1998). On competitive on-line paging with lookahead. Theoretical Computer Science. 209(1-2). 365–375. 14 indexed citations

7.

Breslauer, Dany. (1998). The suffix tree of a tree and minimizing sequential transducers. Theoretical Computer Science. 191(1-2). 131–144. 16 indexed citations

8.

Breslauer, Dany, et al.. (1998). On the Comparison Complexity of the String Prefix-Matching Problem. Journal of Algorithms. 29(1). 18–67. 3 indexed citations

9.

Breslauer, Dany, et al.. (1997). Rotations of Periodic Strings and Short Superstrings. Journal of Algorithms. 24(2). 340–353. 33 indexed citations

10.

Breslauer, Dany. (1996). Saving comparisons in the Crochemore-Perrin string-matching algorithm. Theoretical Computer Science. 158(1-2). 177–192. 7 indexed citations

11.

Breslauer, Dany & Ramesh Hariharan. (1996). OPTIMAL PARALLEL CONSTRUCTION OF MINIMAL SUFFIX AND FACTOR AUTOMATA. Parallel Processing Letters. 6(1). 35–44. 4 indexed citations

12.

Breslauer, Dany. (1995). Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. Journal of Algorithms. 18(2). 278–295. 6 indexed citations

13.

Breslauer, Dany. (1995). Fast parallel string prefix-matching. Theoretical Computer Science. 137(2). 269–278. 4 indexed citations

14.

Breslauer, Dany. (1995). The Suffix Tree of a Tree and Minimizing Sequential Transducers. BRICS Report Series. 2(47). 5 indexed citations

15.

Breslauer, Dany. (1994). Efficient String Matching on Coded Texts. BRICS Report Series. 1(42). 1 indexed citations

16.

Breslauer, Dany. (1994). Testing string superprimitivity in parallel. Information Processing Letters. 49(5). 235–241. 14 indexed citations

17.

Breslauer, Dany. (1993). Saving comparisons in the Crochemore-Perrin string matching algorithm. Data Archiving and Networked Services (DANS). 1–13. 1 indexed citations

18.

Breslauer, Dany & Zvi Galil. (1993). Efficient Comparison Based String Matching. Journal of Complexity. 9(3). 339–365. 7 indexed citations

19.

Breslauer, Dany, et al.. (1993). Tight comparison bounds for the string prefix-matching problem. Information Processing Letters. 47(1). 51–57. 7 indexed citations

20.

Berkman, Omer, Dany Breslauer, Zvi Galil, Baruch Schieber, & Uzi Vishkin. (1989). Highly Parallelizable Problems (Extended Abstract). 1(2). 309–319. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact