Volgen
Mikhail Raskin
Mikhail Raskin
Dept. of CS, TU Munich
Geverifieerd e-mailadres voor in.tum.de
Titel
Geciteerd door
Geciteerd door
Jaar
On the communication required for unconditionally secure multiplication
I Damgård, JB Nielsen, A Polychroniadou, M Raskin
Annual International Cryptology Conference, 459-488, 2016
322016
Affine extensions of integer vector addition systems with states
M Raskin, F Mazowiecki, C Haase, M Blondin
Logical Methods in Computer Science 17, 2021
152021
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
152019
A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
M Raskin
ICALP 2018, 2017
142017
Perfectly secure oblivious RAM with sublinear bandwidth overhead
M Raskin, M Simkin
International Conference on the Theory and Application of Cryptology and …, 2019
9*2019
Approximating the minimum cycle mean
K Chatterjee, M Henzinger, S Krinninger, V Loitzenbauer, MA Raskin
Theoretical Computer Science 547, 104-116, 2014
92014
Sharp thresholds in random simple temporal graphs
A Casteigts, M Raskin, M Renken, V Zamaraev
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
62022
Almost periodicity and finite automata
Y Pritykin, M Raskin
Electronic Proceedings of WIWAD (satellite to CSR 2007), Ekaterinburg, 2007
62007
The complexity of verifying population protocols
J Esparza, S Jaax, M Raskin, C Weil-Kennedy
Distributed Computing 34 (2), 133-177, 2021
52021
The complexity of reachability in affine vector addition systems with states
M Raskin, M Blondin
Logical Methods in Computer Science 17, 2021
42021
A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
M Raskin
ICALP 2017, 2016
42016
Computing parameterized invariants of parameterized petri nets
J Esparza, M Raskin, C Welzel
International Conference on Applications and Theory of Petri Nets and …, 2021
32021
Flatness and complexity of immediate observation Petri nets
M Raskin, C Weil-Kennedy, J Esparza
arXiv preprint arXiv:2001.09966, 2020
32020
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
Abduction of trap invariants in parameterized systems
J Esparza, M Raskin, C Welzel
arXiv preprint arXiv:2108.09101, 2021
22021
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.
AR Balasubramanian, J Esparza, MA Raskin
FoSSaCS, 42-61, 2021
22021
Minimization of visibly pushdown automata is NP-complete
M Raskin, A Muscholl, O Gauwin
Logical Methods in Computer Science 16, 2020
22020
Efficient restrictions of immediate observation Petri nets
M Raskin, C Weil-Kennedy
International Conference on Reachability Problems, 99-114, 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
A unified algorithm for colouring graphs of bounded clique-width
B Courcelle, I Durand, M Raskin
arXiv preprint arXiv:2008.07468, 2020
12020
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20