Michael A. Raskin

Publication Activity (10 Years)

Years Active: 2012-2019
Publications (10 Years): 10

Top Topics

Polynomially Solvable

Top Venues

IACR Cryptol. ePrint Arch.

Probl. Inf. Transm.

Publications

Michael A. Raskin, Mark Simkin
Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead. ASIACRYPT (2) (2019)
Michael A. Raskin, Christoph Welzel
Working with first-order proofs and provers. CoRR (2019)
Olivier Gauwin, Anca Muscholl, Michael A. Raskin
Minimization of visibly pushdown automata is NP-complete. CoRR (2019)
Michael A. Raskin, Christoph Welzel
Working with First Order Proofs and Provers. ELS (2019)
Michael A. Raskin, Mark Simkin
Oblivious RAM with Small Storage Overhead. IACR Cryptol. ePrint Arch. 2018 (2018)
Michael A. Raskin
A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton. CoRR (2017)
Michael A. Raskin
Writing a Portable Code Walker in Common Lisp. ELS (2017)
Michael A. Raskin
Lower bounds on communication for multiparty computation of multiple AND instances with secret sharing. IACR Cryptol. ePrint Arch. 2017 (2017)
Michael A. Raskin, N. Nikitenkov
Paradoxical examples of social networks games with product choice. CoRR (2016)
Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael A. Raskin
On the Communication Required for Unconditionally Secure Multiplication. CRYPTO (2) (2016)
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, Michael A. Raskin
Approximating the minimum cycle mean. Theor. Comput. Sci. 547 (2014)
Michael A. Raskin
, 2012, no. 2. Probl. Inf. Transm. 50 (3) (2014)
Michael A. Raskin
Toom's partial order is transitive. Probl. Inf. Transm. 48 (2) (2012)