scientific article
From MaRDI portal
Publication:4035655
zbMath0765.90042MaRDI QIDQ4035655
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (4)
The buffer tree: A new technique for optimal I/O-algorithms ⋮ Topology B-trees and their applications ⋮ A general lower bound on the I/O-complexity of comparison-based algorithms ⋮ A comparison of sequential Delaunay triangulation algorithms.
This page was built for publication:
