Dany Breslauer

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Laura Toniolo

> Home > Persons > Dany Breslauer

Publications

1998
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/jal/BreslauerCT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/BreslauerCT98
Dany Breslauer, Livio Colussi, Laura Toniolo:
On the Comparison Complexity of the String Prefix-Matching Problem. J. Algorithms 29(1): 18-67 (1998)
1994
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/esa/BreslauerCT94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/BreslauerCT94
Dany Breslauer, Livio Colussi, Laura Toniolo:
On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). ESA 1994: 483-494
1993
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/BreslauerCT93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BreslauerCT93
Dany Breslauer, Livio Colussi, Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem. Inf. Process. Lett. 47(1): 51-57 (1993)
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/cpm/BreslauerCT93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/BreslauerCT93
Dany Breslauer, Livio Colussi, Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem. CPM 1993: 11-19

a service of

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.