scientific article
From MaRDI portal
Publication:2757736
zbMath0995.68183MaRDI QIDQ2757736
Roberto Tamassia, Michael T. Goodrich
Publication date: 29 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of algorithms (68W01)
Related Items (16)
Two new methods for constructing double-ended priority queues from priority queues ⋮ A compact data structure for representing a dynamic multiset ⋮ Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks ⋮ A Tight Bound on the Worst-Case Number of Comparisons for Floyd’s Heap Construction Algorithm ⋮ Unnamed Item ⋮ A Path to Hadamard Matrices ⋮ Two-tier relaxed heaps ⋮ Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons ⋮ An intersection model for multitolerance graphs: efficient algorithms and hierarchy ⋮ Should one always use repeated squaring for modular exponentiation? ⋮ On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection ⋮ A complementary view on the growth of directory trees ⋮ Using the complete sequences for sorting natural numbers ⋮ Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication:
