scientific article
From MaRDI portal
Publication:3686051
zbMath0569.68051MaRDI QIDQ3686051
Thomas Ottmann, Derick Wood, Philippe Flajolet
Publication date: 1985
Full work available at URL: https://eudml.org/doc/92227
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cost measuresaverage case behaviourmajor-minor loop configurationsminimal cost treesstorage of binary search trees
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Data encodings and their costs
- A new permutation algorithm for bubble memories
- The average height of binary trees and other simple trees
- A unifying look at data structures
- On the Complexity of Sorting in Magnetic Bubble Memory Systems
- Tree Search in Major/Minor Loop Magnetic Bubble Memories
- Encoding search trees in lists†
- The Movement and Permutation of Columns in Magnetic Bubble Lattice Files
- Bounds on the costs of data encodings
This page was built for publication: