Michael A. Raskin

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