Algorithms unplugged

DOI10.1007/978-3-642-15328-0MaRDI QIDQ5747792zbMATH OpenOpenAlexFDO

Authors

Publication date 14 September 2010

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

zbMATH Keywords

binary searchbox packingbroadcastingcodingcryptographycycles in graphsdepth-first searchdynamic programmingEuclidean algorithmEulerian circuitsevolutionary algorithmsfast sorting algorithmsfingerprintingGauß-Seidel iterative methodhashinghigh-speed circlesinsertion sortKnapsack problemlong integer multiplicationmatchstick gamesmaximum flowsminimum spanning treeonline algorithmsonline problemsparallel sortingPledge's algorithmpublic-keyrandom numbers generatorsearching and sortingsecret keepingsecret sharingshortest pathSieve of Eratosthenessimulated annealingtopological sortingtournament schedulingtraveling salesman problem

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) General topics in the theory of algorithms (68W01) Comprehensive works on computer science (educational aspects) (97P10)

Recommendations

• Algorithms from THE BOOK
• Algorithmics. The spirit of computing
• Algorithmics for beginners. For students, teachers and pupils of the subjects of mathematics and informatics
• Foundations of algorithms
• Computational thinking. First algorithms, then code

Cited in

(3)

• Computer science unplugged and related projects in math and computer science popularization
• Algorithmics. The spirit of computing
• Once upon an algorithm. How stories explain computing

This page was built for publication: Algorithms unplugged

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