Data structures and algorithms with Python. With an introduction to multiprocessing
DOI10.1007/978-3-031-42209-6MaRDI QIDQ6535455FDOQ6535455
Authors: Kent D. Lee, Steve Hubbard
Publication date: 10 January 2024
Published in: Undergraduate Topics in Computer Science (Search for Journal in Brave)
Recommendations
mapssetscomputational complexitygraphsminimaxtreesbinary treespoolingsequencesbreadth-first searchdepth-first searchheuristic searchsynchronisationqueuerecursionsortingstackDijkstra's algorithmhashingheapsparallelisationKruskal's algorithmB-treessearch treesBloom filtershill climbingsplay treestwo-dimensional sequencesA*amortised complexitymemoisationserialisationasymptotic notationPython programmingbalanced binary treesbig-O notationdistributed multiprocessingtrie datatypes
Theory of programming languages (68N15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of algorithms (68W01)
Cited In (1)
This page was built for publication: Data structures and algorithms with Python. With an introduction to multiprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535455)