I am currently a postdoc at Department of Informatics, Technical university of Munich

J. Esparza, M. Raskin, C. Weil-Kennedy. Parameterized Analysis of Immediate Observation Petri Nets. (preprint available)

M. Raskin, M. Simkin. Oblivious RAM with Small Storage Overhead. (preprint available)

M. Raskin. Population protocols with unreliable communication. (in preparation for submission)

K. Arnsfelt, M. Raskin. A two-player stay-in-a-set game with perfect information and without Nash equilibria. (in preparation for publication)

A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton. International Colloquium on Automata, Languages, and Programming 2018, Prague, Czech Republic (slides)

A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model. International Colloquium on Automata, Languages, and Programming 2017, Warsaw, Poland (slides)

Writing a best-effort portable code walker in Common Lisp. European Lisp Symposium 2017, Brussels, Belgium. (slides)

Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael Raskin. On the Communication Required for Unconditionally Secure Multiplication.

Paradox of choice in social network games with product choice. (joint work with Nikita Nikitenkov) Game theory society congress 2016, Maastrich, Netherlands. (slides)

Accessing local variables during debugging. (joint work with Nikita Mamardashvili) European Lisp Symposium 2016, Krakow, Poland. (slides)

K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin. Approximating the minimum cycle mean.

Computable measures that are couplable but not computably couplable. International Conference on Computability, Complexity and Randomness 2013, Moscow, Russia. (slides)

Data-transformer: an example of data-centered tool set. European Lisp Symposium 2013, Madrid, Spain. (slides)

M. Raskin. Toom's Partial Order Is Transitive.

M. Raskin. Lower Estimate of the Regulator of the Direct Product of almost Periodic and Periodic Sequences.

M. Raskin. Coupling of computable measures coordinated with an order relation is not always computable.

Almost periodicity and finite automata (joint work with Yu. Pritykin). Workshop on Infinite Words, Automata and Dynamics 2007, Ekaterinburg, Russia.