Experimental algorithmics. From algorithm design to robust and efficient software

DOI10.1007/3-540-36383-1MaRDI QIDQ1868002zbMATH OpenOpenAlexFDO

Authors

Publication date 27 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/tocs/t2547.htm

zbMATH Keywords

Algorithm designExperimental algorithmicsEfficient softwareRobust software

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Algorithms in computer science (68Wxx) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited in

(2)

• Recognizing union-find trees is NP-complete, even without rank info
• Designing algorithms by expectations

This page was built for publication: Experimental algorithmics. From algorithm design to robust and efficient software

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