Cryptography

Publications

Preprints

Undergraduate Research

  • Arboral Satisfaction: Recognition and LP Approximation
    Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi, Qipeng Liu, Quanquan Liu, Fermi Ma, Ofir Nachum, Aaron Sidford, Erik Waingarten, and Daniel Ziegler
    Information Processing Letters, volume 127, November 2017, pages 1–5.
    [pdf]

  • The Fewest Clues Problem
    Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, and Scott Aaronson
    Proceedings of the 8th International Conference on Fun with Algorithms (FUN 2016), La Maddalena, Italy, June 8–10, 2016, 12:1–12:12.
    Invited to a special issue of Theoretical Computer Science.
    [pdf]

  • You Should Be Scared of German Ghost
    Erik D. Demaine, Fermi Ma, Matt Susskind, and Erik Waingarten
    Journal of Information Processing, volume 23, number 3, 2015, pages 293–298.
    [pdf]

  • Playing Dominoes is Hard, Except by Yourself
    Erik D. Demaine, Fermi Ma, Erik Waingarten
    Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014), Lipari Island, Italy, July 1–3, 2014, pages 137–146.
    [pdf]