scientific article; zbMATH DE number 3557221
From MaRDI portal
Publication:4133122
zbMath0357.68041MaRDI QIDQ4133122
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99)
Related Items (8)
On the average number of rebalancing operations in weight-balanced trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On a generalization of binary search ⋮ On the correspondence between AVL trees and brother trees ⋮ NP-Complete operations research problems and approximation algorithms ⋮ Maintaining order in a generalized linked list ⋮ An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
This page was built for publication:
