Algorithms and data structures

DOI10.1524/9783486719666MaRDI QIDQ4904854zbMATH OpenOpenAlexFDO

Authors Norbert Blum

Publication date 12 February 2013

Full work available at URL https://doi.org/10.1524/9783486719666

zbMATH Keywords

approximation algorithmsbacktrackingbranch-and-bound algorithmsdata structuresdivide-and -conquerdynamic programmingfast Fourier transformgraph isomorphismhashinglinear programmingmatchingminimal spanning treesnetwork flowsonline algorithmspriority queuesprobabilistic algorithmsshortest-paths problemsstring matchingsuffix treestrees

Mathematics Subject Classification ID

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

Recommendations

• Algorithms and data structures. Basics and probabilistic methods for design and analysis
• Algorithms and data structures. Basics and probabilistic methods for design and analysis
• Algorithms and data structures
• Algorithms and data structures
• scientific article; zbMATH DE number 1552764

Cited in

(6)

• Algorithms and data structures
• scientific article; zbMATH DE number 53903 (Why is no real title available?)
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• scientific article; zbMATH DE number 930345 (Why is no real title available?)
• Algorithms and data structures. Basics and probabilistic methods for design and analysis
• Algorithms and data structures. Basics and probabilistic methods for design and analysis

This page was built for publication: Algorithms and data structures

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