Nivio Ziviani

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 Eduardo F. Barbosa

> Home > Persons > Nivio Ziviani

Publications

2000
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/NavarroBBZC00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/NavarroBBZC00
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F. Barbosa, Nivio Ziviani, Walter Cunto:
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval. Algorithmica 27(2): 145-169 (2000)
1996
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/is/Baeza-YatesBZ96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/is/Baeza-YatesBZ96
Ricardo A. Baeza-Yates, Eduardo F. Barbosa, Nivio Ziviani:
Hierarchies of Indices for Text Searching. Inf. Syst. 21(6): 497-514 (1996)
1995
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/esa/BarbosaNBPZ95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/BarbosaNBPZ95
Eduardo F. Barbosa, Gonzalo Navarro, Ricardo A. Baeza-Yates, Chris H. Perleberg, Nivio Ziviani:
Optimized Binary Search and Text Retrieval. ESA 1995: 311-326
1994
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/riao/Baeza-YatesBZ94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/riao/Baeza-YatesBZ94
Ricardo A. Baeza-Yates, Eduardo F. Barbosa, Nivio Ziviani:
Hierarchies of Indices for Text Searching. RIAO 1994: 295-312

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.