scientific article; zbMATH DE number 3635510
From MaRDI portal
Publication:4195958
zbMath0408.68055MaRDI QIDQ4195958
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Information TheoryComputational ComplexityDynamic Data StructuresSearchivySorting Of FilesWeight-Balanced Trees
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Information theory (general) (94A15) Data structures (68P05) Discrete mathematics in relation to computer science (68R99)
Related Items (7)
On BF-orderable graphs ⋮ Obstacle growing in a nonpolygonal world ⋮ An O(log n) time parallel algorithm for triangulating a set of points in the plane ⋮ Voronoi diagrams with barriers and the shortest diagonal problem ⋮ Optimal binary search trees ⋮ An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains ⋮ Graph layout for applications in compiler construction
This page was built for publication: