| Publication | Date of Publication | Type |
|---|
| Dynamic Play via Suit Factorization Search in Skat | 2023-03-29 | Paper |
Improving the cache-efficiency of shortest path search
KI 2017: Advances in Artificial Intelligence | 2022-11-02 | Paper |
QuickXsort: a fast sorting scheme in theory and practice
Algorithmica | 2020-02-06 | Paper |
Worst-case efficient sorting with QuickMergesort
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
BlockQuicksort: avoiding branch mispredictions in Quicksort
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
BlockQuicksort: avoiding branch mispredictions in Quicksort
(available as arXiv preprint) | 2018-03-02 | Paper |
Optimizing binary heaps
Theory of Computing Systems | 2017-10-20 | Paper |
Efficient symbolic search for cost-optimal planning
Artificial Intelligence | 2016-11-29 | Paper |
An in-place priority queue with \(O(1)\) time for push and \(\lg n + O(1)\) comparisons for pop
Lecture Notes in Computer Science | 2015-10-20 | Paper |
A catalogue of algorithms for building weak heaps
Lecture Notes in Computer Science | 2014-08-19 | Paper |
Weak heaps engineered
Journal of Discrete Algorithms | 2014-08-13 | Paper |
QuickXsort: efficient sorting with \(n \log n - 1.399n + o(n)\) comparisons on average
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Weak heaps and friends: recent developments
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Distributed verification of multi-threaded C++ programs
Electronic Notes in Theoretical Computer Science | 2013-12-13 | Paper |
| Action planning for directed model checking of Petri nets | 2013-10-07 | Paper |
| Dynamic incremental hashing in program model checking | 2013-10-07 | Paper |
The weak-heap data structure: variants and applications
Journal of Discrete Algorithms | 2013-01-18 | Paper |
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Two constant-factor-optimal realizations of adaptive heapsort
Lecture Notes in Computer Science | 2012-01-13 | Paper |
| Heuristic search. Theory and applications | 2011-09-22 | Paper |
Flash memory efficient LTL model checking
Science of Computer Programming | 2011-01-14 | Paper |
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
(available as arXiv preprint) | 2009-04-28 | Paper |
Survey on Directed Model Checking
Model Checking and Artificial Intelligence | 2009-03-17 | Paper |
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence | 2009-03-17 | Paper |
Heuristic Search for the Analysis of Graph Transition Systems
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Semi-external LTL Model Checking
Computer Aided Verification | 2008-07-15 | Paper |
KI 2004: Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2008-03-14 | Paper |
KI 2004: Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2008-03-14 | Paper |
Automated Creation of Pattern Database Search Heuristics
Model Checking and Artificial Intelligence | 2007-11-01 | Paper |
Real-Time Model Checking on Secondary Storage
Model Checking and Artificial Intelligence | 2007-11-01 | Paper |
Model Checking Software
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Model Checking Software
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2007-02-12 | Paper |
scientific article; zbMATH DE number 2243406 (Why is no real title available?)
(available as arXiv preprint) | 2006-01-04 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2005-12-06 | Paper |
Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n log n + 0.2 n ) comparisons
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
| scientific article; zbMATH DE number 2087625 (Why is no real title available?) | 2004-08-11 | Paper |
scientific article; zbMATH DE number 2038900 (Why is no real title available?)
(available as arXiv preprint) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1984688 (Why is no real title available?) | 2003-09-22 | Paper |
| scientific article; zbMATH DE number 1982206 (Why is no real title available?) | 2003-09-16 | Paper |
| scientific article; zbMATH DE number 1980923 (Why is no real title available?) | 2003-09-15 | Paper |
| scientific article; zbMATH DE number 1951554 (Why is no real title available?) | 2003-07-21 | Paper |
| scientific article; zbMATH DE number 1882054 (Why is no real title available?) | 2003-03-13 | Paper |
| scientific article; zbMATH DE number 1882049 (Why is no real title available?) | 2003-03-13 | Paper |
| scientific article; zbMATH DE number 1882050 (Why is no real title available?) | 2003-03-13 | Paper |
| scientific article; zbMATH DE number 1746648 (Why is no real title available?) | 2002-06-17 | Paper |
| scientific article; zbMATH DE number 1629827 (Why is no real title available?) | 2001-11-06 | Paper |
Time complexity of iterative-deepening-\(A^{*}\)
Artificial Intelligence | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1487475 (Why is no real title available?) | 2001-02-14 | Paper |
