Publications:

Journal:

[1] Michael Codish, Luis Cruz-Filipe, Michael Frank, and Peter Schneider-Kamp. “Sorting
    nine inputs requires twenty-five comparisons”. In: Journal of Computer and System Sci-
    ences 82.3 (2016), pp. 551–563.
[2] Michael Codish, Michael Frank, Avraham Itzhakov, and Alice Miller. “Computing the
    Ramsey number R(4,3,3) using abstraction and symmetry breaking”. In: Constraints First
    Online (2016), pp. 1–19.
[3] Michael Codish, Michael Frank, and Moshe Zazon-Ivry. “Pairwise Networks are Superior
    for Selection”. In: Journal of Computer and System Sciences (in prep.).

Conference:

[1] Michael Codish, Luı́s Cruz-Filipe, Michael Frank, and Peter Schneider-Kamp. “Twenty-
    Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten)”. In:
    Proceedings of ICTAI 2014. Accepted for publication. IEEE, 2014.
[2] Michael Codish, Luı́s Cruz-Filipe, Michael Frank, and Peter Schneider-Kamp. “When Six
    Gates are Not Enough”. In: CoRR abs/1508.05737 (in prep.).
[3] Michael Codish, Michael Frank, Avraham Itzhakov, and Alice Miller. “Solving Graph
    Coloring Problems with Abstraction and Symmetry: the Ramsey Number R(4, 3, 3) = 30”.
    In: CPAIOR 2016. May 2016.
[4] Michael Frank and Michael Codish. “Logic Programming with Graph Automorphism:
    Integrating nauty with Prolog (a Tool Paper)”. Submitted for Publication in proceedings
    of the 32nd International Conference on Logic Programming. 2016.

Workshops:

[1] Michael Codish, Michael Frank, Avraham Itzhakov, and Alice Miller. “Solving Graph
    Coloring Problems with Abstraction and Symmetry: the Ramsey Number R(4, 3, 3) = 30”.
    In: Fifth International Workshop on the Cross-Fertilization Between CSP and SAT in
    Conjunction with CP 2015. Aug. 2015.

Software:

Contact Information:

Address

    Department of Computer Science
    Ben-Gurion University of the Negev
    PoB 653
    Beer-Sheva, Israel 84105