The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dany Breslauer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alberto Apostolico, Dany Breslauer
    Of Periods, Quasiperiods, Repetitions and Covers. [Citation Graph (0, 0)][DBLP]
    Structures in Logic and Computer Science, 1997, pp:236-248 [Conf]
  2. Dany Breslauer
    Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:184-197 [Conf]
  3. Dany Breslauer
    The suffix Tree of a Tree and Minimizing Sequential Transducers. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:116-129 [Conf]
  4. Dany Breslauer, Livio Colussi, Laura Toniolo
    Tight Comparison Bounds for the String Prefix-Matching Problem. [Citation Graph (0, 0)][DBLP]
    CPM, 1993, pp:11-19 [Conf]
  5. Dany Breslauer, Leszek Gasieniec
    Efficient String Matching on Coded Texts. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:27-40 [Conf]
  6. Dany Breslauer
    Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:61-72 [Conf]
  7. Dany Breslauer, Livio Colussi, Laura Toniolo
    On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:483-494 [Conf]
  8. Alberto Apostolico, Dany Breslauer, Zvi Galil
    Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:296-307 [Conf]
  9. Alberto Apostolico, Dany Breslauer, Zvi Galil
    Parallel Detection of all Palindromes in a String. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:497-506 [Conf]
  10. Dany Breslauer
    On Competitive On-Line Paging with Lookahead. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:593-603 [Conf]
  11. Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin
    Highly Parallelizable Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:309-319 [Conf]
  12. Dany Breslauer, Zvi Galil
    A Lower Bound for Parallel String Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:439-443 [Conf]
  13. Dany Breslauer, Zvi Galil
    Finding All Periods and Initial Palindromes of a String in Parallel. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:4, pp:355-366 [Journal]
  14. Dany Breslauer
    An On-Line String Superprimitivity Test. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:6, pp:345-347 [Journal]
  15. Dany Breslauer
    Testing String Superprimitivity in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:5, pp:235-241 [Journal]
  16. Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide
    Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:2, pp:103-110 [Journal]
  17. Dany Breslauer, Livio Colussi, Laura Toniolo
    Tight Comparison Bounds for the String Prefix-Matching Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:51-57 [Journal]
  18. Dany Breslauer, Leszek Gasieniec
    Efficient String Matching on Packed Texts. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:6, pp:521-544 [Journal]
  19. Dany Breslauer
    Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:2, pp:278-296 [Journal]
  20. Dany Breslauer, Livio Colussi, Laura Toniolo
    On the Comparison Complexity of the String Prefix-Matching Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:1, pp:18-67 [Journal]
  21. Dany Breslauer, Tao Jiang, Zhigen Jiang
    Rotations of Periodic Strings and Short Superstrings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:340-353 [Journal]
  22. Dany Breslauer, Zvi Galil
    Efficient Comparison Based String Matching. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1993, v:9, n:3, pp:339-365 [Journal]
  23. Alberto Apostolico, Dany Breslauer
    An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1318-1331 [Journal]
  24. Dany Breslauer, Zvi Galil
    An Optimal O(log log n) Time Parallel String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:6, pp:1051-1058 [Journal]
  25. Dany Breslauer, Zvi Galil
    A Lower Bound for Parallel String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:856-862 [Journal]
  26. Alberto Apostolico, Dany Breslauer, Zvi Galil
    Parallel Detection of all Palindromes in a String. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:163-173 [Journal]
  27. Dany Breslauer
    Fast Parallel String Prefix-Matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:137, n:2, pp:269-278 [Journal]
  28. Dany Breslauer
    Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:177-192 [Journal]
  29. Dany Breslauer
    The Suffix Tree of a Tree and Minimizing Sequential Transducers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:131-144 [Journal]
  30. Dany Breslauer
    On Competitive On-Line Paging with Lookahead. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:365-375 [Journal]

Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002