Nivio Ziviani

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Optimized binary search and text retrieval Lecture Notes in Computer Science	2023-05-08	Paper
Expected behaviour analysis of AVL trees SWAT 90	2022-12-09	Paper
Cores of random \(r\)-partite hypergraphs Information Processing Letters	2012-07-20	Paper
Simple and Space-Efficient Minimal Perfect Hash Functions Lecture Notes in Computer Science	2009-02-17	Paper
String Processing and Information Retrieval Lecture Notes in Computer Science	2006-10-24	Paper
Experimental and Efficient Algorithms Lecture Notes in Computer Science	2005-11-30	Paper
Optimal binary search trees with costs depending on the access paths. Theoretical Computer Science	2003-08-17	Paper
Binary searching with nonuniform costs and its application to text retrieval Algorithmica	2000-05-09	Paper
Improved bounds for the expected behaviour of AVL trees BIT	1992-12-14	Paper
The telephonic switching centre network problem: Formalization and computational experience Discrete Applied Mathematics	1987-01-01	Paper
The Analysis of an Improved Symmetric Binary B-tree Algorithm The Computer Journal	1985-01-01	Paper
A Look at Symmetric Binary B-Trees INFOR: Information Systems and Operational Research	1982-01-01	Paper
The theory of fringe analysis and its application to 23 trees and b-trees Information and Control	1982-01-01	Paper

Research outcomes over time

This page was built for person: Nivio Ziviani