The following pages link to Nivio Ziviani (Q436311):
Displaying 15 items.
- Cores of random \(r\)-partite hypergraphs (Q436312) (← links)
- The telephonic switching centre network problem: Formalization and computational experience (Q1093558) (← links)
- Improved bounds for the expected behaviour of AVL trees (Q1196459) (← links)
- (Q1401194) (redirect page) (← links)
- Optimal binary search trees with costs depending on the access paths. (Q1401195) (← links)
- (Q1977133) (redirect page) (← links)
- Binary searching with nonuniform costs and its application to text retrieval (Q1977134) (← links)
- Simple and Space-Efficient Minimal Perfect Hash Functions (Q3603522) (← links)
- The Analysis of an Improved Symmetric Binary B-tree Algorithm (Q3685213) (← links)
- A Look at Symmetric Binary B-Trees (Q3967043) (← links)
- Expected behaviour analysis of AVL trees (Q5056099) (← links)
- The theory of fringe analysis and its application to 23 trees and b-trees (Q5186749) (← links)
- String Processing and Information Retrieval (Q5393954) (← links)
- Experimental and Efficient Algorithms (Q5710049) (← links)
- Optimized binary search and text retrieval (Q6102310) (← links)
