×
Compute Distance To:
Author ID: ziviani.nivio Recent zbMATH articles by "Ziviani, Nivio"
Published as: Ziviani, Nivio; Ziviani, Nívio; Zivani, Nivio; Ziviani, N.

Publications by Year

Citations contained in zbMATH Open

9 Publications have been cited 48 times in 41 Documents Cited by Year
The theory of fringe analysis and its application to 2-3 trees and B- trees. Zbl 0561.68050
Eisenbarth, Bernhard; Ziviani, Nivio; Gonnet, Gaston H.; Mehlhorn, Kurt; Wood, Derick
18
1982
Simple and space-efficient minimal perfect hash functions. Zbl 1209.68152
Botelho, Fabiano C.; Pagh, Rasmus; Ziviani, Nivio
8
2007
The telephonic switching centre network problem: Formalization and computational experience. Zbl 0628.90087
Luna, Henrique Pacca L.; Ziviani, Nivio; Cabral, Regina Helena B.
8
1987
Binary searching with nonuniform costs and its application to text retrieval. Zbl 0951.68028
Navarro, G.; Barbosa, E. F.; Baeza-Yates, R.; Cunto, W.; Ziviani, N.
4
2000
Optimal binary search trees with costs depending on the access paths. Zbl 1044.68036
Szwarcfiter, Jayme L.; Navarro, Gonzalo; Baeza-Yates, Ricardo; de S. Oliveira, Joísa; Cunto, Walter; Ziviani, Nívio
4
2003
A look at symmetric binary B-trees. Zbl 0501.68003
Ziviani, Nivio; Tompa, Frank Wm.
2
1982
The analysis of an improved symmetric binary B-tree algorithm. Zbl 0568.68049
Zivani, Nivio; Olivié, Henk J.; Gonnet, Gaston H.
2
1985
A practical minimal perfect hashing method. Zbl 1121.68332
Botelho, Fabiano C.; Kohayakawa, Yoshiharu; Ziviani, Nivio
1
2005
Cores of random \(r\)-partite hypergraphs. Zbl 1243.68323
Botelho, Fabiano C.; Wormald, Nicholas; Ziviani, Nivio
1
2012
Cores of random \(r\)-partite hypergraphs. Zbl 1243.68323
Botelho, Fabiano C.; Wormald, Nicholas; Ziviani, Nivio
1
2012
Simple and space-efficient minimal perfect hash functions. Zbl 1209.68152
Botelho, Fabiano C.; Pagh, Rasmus; Ziviani, Nivio
8
2007
A practical minimal perfect hashing method. Zbl 1121.68332
Botelho, Fabiano C.; Kohayakawa, Yoshiharu; Ziviani, Nivio
1
2005
Optimal binary search trees with costs depending on the access paths. Zbl 1044.68036
Szwarcfiter, Jayme L.; Navarro, Gonzalo; Baeza-Yates, Ricardo; de S. Oliveira, Joísa; Cunto, Walter; Ziviani, Nívio
4
2003
Binary searching with nonuniform costs and its application to text retrieval. Zbl 0951.68028
Navarro, G.; Barbosa, E. F.; Baeza-Yates, R.; Cunto, W.; Ziviani, N.
4
2000
The telephonic switching centre network problem: Formalization and computational experience. Zbl 0628.90087
Luna, Henrique Pacca L.; Ziviani, Nivio; Cabral, Regina Helena B.
8
1987
The analysis of an improved symmetric binary B-tree algorithm. Zbl 0568.68049
Zivani, Nivio; Olivié, Henk J.; Gonnet, Gaston H.
2
1985
The theory of fringe analysis and its application to 2-3 trees and B- trees. Zbl 0561.68050
Eisenbarth, Bernhard; Ziviani, Nivio; Gonnet, Gaston H.; Mehlhorn, Kurt; Wood, Derick
18
1982
A look at symmetric binary B-trees. Zbl 0501.68003
Ziviani, Nivio; Tompa, Frank Wm.
2
1982

Citations by Year