19 citations · 19 across the 3 of their papers we have counts for
4 papers
BlockQuicksort: How Branch Mispredictions don't affect Quicksort
Stefan Edelkamp, Armin Weiß
Since the work of Kaligosi and Sanders (2006), it is well-known that Quicksort -- which is commonly considered as one of the fastest in-place sorting algorithms -- suffers in an es…
Lex-Partitioning: A New Option for BDD Search
Stefan Edelkamp, Peter Kissmann, Álvaro Torralba
For the exploration of large state spaces, symbolic search using binary decision diagrams (BDDs) can save huge amounts of memory and computation time. State sets are represented an…
Proceedings First Workshop on GRAPH Inspection and Traversal Engineering
Anton Wijs, Dragan Bošnački, Stefan Edelkamp
These are the proceedings of the First Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2012), which took place on April 1, 2012 in Tallinn, Estonia, as a satellite…
Taming Numbers and Durations in the Model Checking Integrated Planning System
S. Edelkamp
The Model Checking Integrated Planning System (MIPS) is a temporal least commitment heuristic search planner based on a flexible object-oriented workbench architecture. Its design…