Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Experimental algorithmics. From algorithm design to robust and efficient software

From MaRDI portal
Publication:1868002
Jump to:navigation, search

DOI10.1007/3-540-36383-1zbMath1011.68694OpenAlexW4213175742MaRDI QIDQ1868002

No author found.

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

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


Related Items (1)

Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1868002&oldid=14258038"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki