Publications Coauthored with Peter Schneider-Kamp

• Optimal-Depth Sorting Networks;
  Daniel Bundala, Michael Codish, Luis Cruz-Filipe, Peter Schneider-Kamp and Jakub Zavodny ;   Journal of Computer and System Sciences;  (accepted)(?):?.

• Sorting nine inputs requires twenty-five comparisons;
  Michael Codish, Luis Cruz-Filipe, Michael Frank and Peter Schneider-Kamp ;   Journal of Computer and System Sciences; 82(3):551-563.

• Sorting Networks: The End Game;
  Michael Codish, Luis Cruz-Filipe and Peter Schneider-Kamp;    Language and Automata Theory and Applications - 9th International Conference, {LATA}

• Applying Sorting Networks to Synthesize Optimized Sorting Libraries;
  Michael Codish, Luis Cruz-Filipe, Markus Nebe and Peter Schneider-Kamp;    Logic-Based Program Synthesis and Transformation (LOPSTR), Revised Selected Papers

• The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes;
  Michael Codish, Luis Cruz-Filipe and Peter Schneider-Kamp; Technical Report (unpublished);
  International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (Timisoara, Romania); September, 2014.

• Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten);
  Michael Codish, Luis Cruz-Filipe, Michael Frank and Peter Schneider-Kamp; Technical Report (unpublished);
  IEEE International Conference on Tools with Artificial Intelligence (ICTAI) ; November, 2014.

• SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs;
  Michael Codish, Jürgen Giesl, Peter Schneider-Kamp and René Thiemann ;   Journal of Automated Reasoning ; 1(
  ):53--93.

• Optimal Base Encodings for Pseudo-Boolean Constraints;
  Michael Codish, Yoav Fekete, Carsten Fuhs and Peter Schneider-Kamp;    Proceedings of TACAS 2011

• Optimal Base Encodings for Pseudo-Boolean Constraints;
  Michael Codish, Yoav Fekete, Carsten Fuhs and Peter Schneider-Kamp; Technical Report (unpublished);
  Department of Computer Science; Ben-Gurion University; May, 2010.

• Proving Termination using Recursive Path Orders and SAT Solving;
  Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish and Jürgen Giesl;    FroCoS 2007 - 6th International Symposium on Frontiers of Combining Systems

• SAT Solving for Argument Filterings;
  Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann and Jürgen Giesl;    International Conference on Logic for Programming, Artificial Intelligence and Reasoning

• A SAT-based Implementation for RPO Termination;
  Elena Annov, Michael Codish, Jürgen Giesl, Peter Schneider-Kamp and René Thiemann;    International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Short Paper)