Mikhail Raskin
Mikhail Raskin
Dept. of CS, TU Munich
Verified email at in.tum.de
Title
Cited by
Cited by
Year
On the communication required for unconditionally secure multiplication
I Damgård, JB Nielsen, A Polychroniadou, M Raskin
Annual International Cryptology Conference, 459-488, 2016
262016
Affine extensions of integer vector addition systems with states
M Blondin, C Haase, F Mazowiecki, M Raskin
arXiv preprint arXiv:1909.12386, 2019
122019
Parameterized analysis of immediate observation petri nets
J Esparza, M Raskin, C Weil-Kennedy
International Conference on Applications and Theory of Petri Nets and …, 2019
82019
A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
M Raskin
ICALP 2018, 2017
82017
Approximating the minimum cycle mean
K Chatterjee, M Henzinger, S Krinninger, V Loitzenbauer, MA Raskin
Theoretical Computer Science 547, 104-116, 2014
82014
Almost periodicity and finite automata
Y Pritykin, M Raskin
Electronic Proceedings of WIWAD (satellite to CSR 2007), Ekaterinburg, 2007
62007
Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead
M Raskin, M Simkin
International Conference on the Theory and Application of Cryptology and …, 2019
3*2019
A Stay-in-a-Set Game without a Stationary Equilibrium
K Arnsfelt Hansen, M Raskin
International Symposium on Games, Automata, Logics, and Formal Verification …, 2019
3*2019
A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
M Raskin
ICALP 2017, 2016
32016
The complexity of reachability in affine vector addition systems with states
M Blondin, M Raskin
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
22020
Minimization of visibly pushdown automata is NP-complete
O Gauwin, A Muscholl, M Raskin
arXiv preprint arXiv:1907.09563, 2019
22019
Sharp Thresholds in Random Simple Temporal Graphs
A Casteigts, M Raskin, M Renken, V Zamaraev
arXiv preprint arXiv:2011.03738, 2020
12020
On defining linear orders by automata
B Courcelle, I Durand, M Raskin
Moscow Journal of Combinatorics and Number Theory 9 (3), 253-291, 2020
12020
Flatness and complexity of immediate observation Petri nets
M Raskin, C Weil-Kennedy, J Esparza
31st International Conference on Concurrency Theory (CONCUR 2020), 2020
12020
Toom’s partial order is transitive
MA Raskin
Problems of Information Transmission 48 (2), 154-172, 2012
12012
The complexity of verifying population protocols
J Esparza, S Jaax, M Raskin, C Weil-Kennedy
Distributed Computing 34 (2), 133-177, 2021
2021
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
S Kiefer, C Tasson, A Balasubramanian, J Esparza, M Raskin
Foundations of Software Science and Computation Structures24th International …, 2021
2021
Computing Parameterized Invariants of Parameterized Petri Nets
J Esparza, M Raskin, C Welzel
arXiv preprint arXiv:2103.10280, 2021
2021
Efficient restrictions of immediate observation Petri nets
M Raskin, C Weil-Kennedy
International Conference on Reachability Problems, 99-114, 2020
2020
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
AR Balasubramanian, J Esparza, M Raskin
arXiv preprint arXiv:2010.09471, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20