selected publications
-
academic article
- Optimal-depth sorting networks. Journal of Computer and System Sciences. 84:185-204. 2017
- Optimizing sorting algorithms by using sorting networks. Formal Aspects of Computing. 29:559-579. 2017
- Sorting nine inputs requires twenty-five comparisons. Journal of Computer and System Sciences. 82:551-563. 2016
- Sorting networks: to the end and back again. Journal of Computer and System Sciences. 2015
- When six gates are not enough. arXiv preprint arXiv:1508.05737. 2015
- SAT solving for termination proofs with recursive path orders and dependency pairs. Journal of Automated Reasoning. 49:53-93. 2012
- Lazy Abstraction for Size-Change Termination.. LPAR (Yogyakarta). 6397:217-232. 2010
- A SAT-based implementation for RPO termination. Short Papers of LPAR. 6. 2006
-
conference paper
- Applying sorting networks to synthesize optimized sorting libraries. International Symposium on Logic-Based Program Synthesis and Transformation. 127-142. 2015
- Sorting networks: the end game. International Conference on Language and Automata Theory and Applications. 664-675. 2015
- The quest for optimal sorting networks: Efficient generation of two-layer prefixes. Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2014 16th International Symposium on. 359-366. 2015
- Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten). Tools with Artificial Intelligence (ICTAI), 2014 IEEE 26th International Conference on. 186-193. 2014
- Optimal base encodings for pseudo-Boolean constraints. International Conference on Tools and Algorithms for the Construction and Analysis of Systems. 189-204. 2011
- Implementing RPO and POLO using SAT. Dagstuhl Seminar Proceedings. 2007
- SAT solving for argument filterings. International Conference on Logic for Programming Artificial Intelligence and Reasoning. 30-44. 2006