Sequential and Parallel Algorithms and Data Structures
DOI10.1007/978-3-030-25209-0zbMath1445.68003OpenAlexW4239542686MaRDI QIDQ5232044
Martin Dietzfelbinger, Peter Sanders, Kurt Mehlhorn, Roman Dementiev
Publication date: 5 September 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-25209-0
linear programmingsortingdynamic programminglocal searchqueueshortest pathsload balancingminimum spanning treeevolutionary algorithmsdepth-first searchgreedy algorithmslinked listsbinary search treesinteger arithmetichash tablesDijkstra's algorithmbreadth-first searchquicksortstackalgorithm analysisgraph representationspriority queuesrandomised algorithmspseudocodeKruskal's algorithmP and NPunbounded arraysKaratsuba multiplicationexternal sortingparallel multiplicationparallel quicksortadjacency listsparallel priority queuesBellman-Ford algorithmasymptotic notationsystematic searchparallel hashingmerge-sortall-to-all message exchangeassociative arraysJarnik-Prim algorithmparallel graph representationparallel multiway merge-sortparallel pseudocode
Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithms in computer science (68Wxx) Data structures (68P05)
Related Items (5)
Uses Software
This page was built for publication: Sequential and Parallel Algorithms and Data Structures