Sequential and parallel algorithms and data structures. The basic toolbox

DOI10.1007/978-3-030-25209-0MaRDI QIDQ5232044zbMATH OpenOpenAlexFDO

Authors Peter Sanders, K. Mehlhorn, Martin Dietzfelbinger, Roman Dementiev

Publication date 5 September 2019

Full work available at URL https://doi.org/10.1007/978-3-030-25209-0

zbMATH Keywords

adjacency listsalgorithm analysisall-to-all message exchangeassociative arraysasymptotic notationBellman-Ford algorithmbinary search treesbreadth-first searchdepth-first searchDijkstra's algorithmdynamic programmingevolutionary algorithmsexternal sortinggraph representationsgreedy algorithmshash tablesinteger arithmeticJarnik-Prim algorithmKaratsuba multiplicationKruskal's algorithmlinear programminglinked listsload balancinglocal searchmerge-sortminimum spanning treeP and NPparallel graph representationparallel hashingparallel multiplicationparallel multiway merge-sortparallel priority queuesparallel pseudocodeparallel quicksortpriority queuespseudocodequeuequicksortrandomised algorithmsshortest pathssortingstacksystematic searchunbounded arrays

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Data structures (68P05) Searching and sorting (68P10) Algorithms in computer science (68Wxx)

Recommendations

• Algorithms and Data Structures
• Parallel algorithms
• scientific article; zbMATH DE number 1865430
• Algorithmen und Datenstrukturen
• scientific article; zbMATH DE number 107951

Cited in

(16)

• Guide to competitive programming. Learning and improving algorithms through contests
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Distributed graph analytics. Programming, languages, and their compilation
• Algorithmen und Datenstrukturen
• Upper tail analysis of bucket sort and random tries
• Upper tail analysis of bucket sort and random tries
• Simulation of emission processes in strong electromagnetic fields
• Certifying induced subgraphs in large graphs
• Decentralized Online Scheduling of Malleable NP-hard Jobs
• Data structures and algorithms with Python. With an introduction to multiprocessing
• Finding strong components using depth-first search
• Certifying induced subgraphs in large graphs
• Insertion time of random walk cuckoo hashing below the peeling threshold
• Analysis of smooth heaps and slim heaps
• Scalable distributed string sorting
• Fast and lightweight distributed suffix array construction

Describes a project that uses

Uses Software

• LEDA
• Boost C++ Libraries
• LEMON
• JGraphT
• STXXL
• MCSTL
• gmp
• OpenMPI
• HordeSat
• AWK
• PCM

This page was built for publication: Sequential and parallel algorithms and data structures. The basic toolbox

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232044)