Mikhail A. Raskin

According to our database, Mikhail A. Raskin authored at least 38 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Protocols with constant local storage and unreliable communication.

Mikhail A. Raskin

Theor. Comput. Sci., 2023

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.

A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin

Log. Methods Comput. Sci., 2023

Geometry of Reachability Sets of Vector Addition Systems.

Roland Guttenberg, Mikhail A. Raskin, Javier Esparza

Proceedings of the 34th International Conference on Concurrency Theory, 2023

Giant Components in Random Temporal Graphs.

Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev

Proceedings of the Approximation, 2023

2022

Computing Parameterized Invariants of Parameterized Petri Nets.

Javier Esparza, Mikhail A. Raskin, Christoph Welzel

Fundam. Informaticae, 2022

Geometry of VAS reachability sets.

Roland Guttenberg, Mikhail A. Raskin

CoRR, 2022

QueryFS: compiling queries to define a filesystem.

Michael Raskin

Proceedings of the 15th European Lisp Symposium, 2022

Regular Model Checking Upside-Down: An Invariant-Based Approach.

Javier Esparza, Mikhail A. Raskin, Christoph Welzel

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

The Complexity of Reachability in Affine Vector Addition Systems with States.

Michael Blondin, Mikhail A. Raskin

Log. Methods Comput. Sci., 2021

Affine Extensions of Integer Vector Addition Systems with States.

Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin

Log. Methods Comput. Sci., 2021

The complexity of verifying population protocols.

Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy

Distributed Comput., 2021

Modular population protocols.

Mikhail A. Raskin

CoRR, 2021

Abduction of trap invariants in parameterized systems.

Javier Esparza, Mikhail A. Raskin, Christoph Welzel

Proceedings of the Proceedings 12th International Symposium on Games, 2021

Sharp Thresholds in Random Simple Temporal Graphs.

Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Lisp in the middle - using Lisp to manage a Linux system.

Michael Raskin

Proceedings of the 14th European Lisp Symposium, 2021

Population Protocols with Unreliable Communication.

Mikhail A. Raskin

Proceedings of the Algorithms for Sensor Systems, 2021

2020

Minimization of visibly pushdown automata is NP-complete.

Olivier Gauwin, Anca Muscholl, Michael Raskin

Log. Methods Comput. Sci., 2020

A unified algorithm for colouring graphs of bounded clique-width.

Bruno Courcelle, Irène Durand, Michael Raskin

CoRR, 2020

Constructive expressive power of population protocols.

Mikhail A. Raskin

CoRR, 2020

On the Flatness of Immediate Observation Petri Nets.

Mikhail A. Raskin, Chana Weil-Kennedy

CoRR, 2020

Efficient Restrictions of Immediate Observation Petri Nets.

Michael Raskin, Chana Weil-Kennedy

Proceedings of the Reachability Problems - 14th International Conference, 2020

Flatness and Complexity of Immediate Observation Petri Nets.

Mikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

A Stay-in-a-Set Game without a Stationary Equilibrium.

Kristoffer Arnsfelt Hansen, Mikhail A. Raskin

Proceedings of the Proceedings Tenth International Symposium on Games, 2019

Working with First Order Proofs and Provers.

Michael A. Raskin, Christoph Welzel

Proceedings of the 12th European Lisp Symposium (ELS 2019), 2019

Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead.

Michael A. Raskin, Mark Simkin

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

Parameterized Analysis of Immediate Observation Petri Nets.

Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019

2018

Oblivious RAM with Small Storage Overhead.

Michael A. Raskin, Mark Simkin

IACR Cryptol. ePrint Arch., 2018

A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton.

Mikhail A. Raskin

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Lower bounds on communication for multiparty computation of multiple AND instances with secret sharing.

Michael A. Raskin

IACR Cryptol. ePrint Arch., 2017

A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model.

Mikhail A. Raskin

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Writing a Portable Code Walker in Common Lisp.

Michael A. Raskin

Proceedings of the 10th European Lisp Symposium (ELS 2017), 2017

2016

Paradoxical examples of social networks games with product choice.

Michael A. Raskin, N. Nikitenkov

CoRR, 2016

Accessing Local Variables During Debugging.

Michael Raskin, Nikita Mamardashvili

Proceedings of the 9th European Lisp Symposium (ELS 2016), Kraków, Poland, May 9-10, 2016., 2016

On the Communication Required for Unconditionally Secure Multiplication.

Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael A. Raskin

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2014

Approximating the minimum cycle mean.

Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, Michael A. Raskin

Theor. Comput. Sci., 2014

Remark on "Toom's partial order is transitive" published in <i>Probl. Peredachi Inf.</i>, 2012, no. 2.

Michael A. Raskin

Probl. Inf. Transm., 2014

2013

Data-Transformer: an Example of Data-Centered Toolset.

Michael Raskin

Proceedings of ELS 2013 - 6th European Lisp Symposium, Madrid, Spain, June 3-4, 2013., 2013

2012

Toom's partial order is transitive.

Michael A. Raskin

Probl. Inf. Transm., 2012