Segui
Mikhail Raskin
Mikhail Raskin
Altri nomiMichael Raskin
LaBRI, University of Bordeaux (CNRS UMR 5800)
Email verificata su tum.de
Titolo
Citata da
Citata da
Anno
On the communication required for unconditionally secure multiplication
I Damgård, JB Nielsen, A Polychroniadou, M Raskin
Annual International Cryptology Conference, 459-488, 2016
402016
Sharp thresholds in random simple temporal graphs
A Casteigts, M Raskin, M Renken, V Zamaraev
SIAM Journal on Computing 53 (2), 346-388, 2024
242024
Affine extensions of integer vector addition systems with states
M Blondin, C Haase, F Mazowiecki, M Raskin
Logical Methods in Computer Science 17, 2021
242021
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
222019
A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
M Raskin
ICALP 2018, 2017
202017
The complexity of verifying population protocols
J Esparza, S Jaax, M Raskin, C Weil-Kennedy
Distributed Computing 34 (2), 133-177, 2021
142021
Approximating the minimum cycle mean
K Chatterjee, M Henzinger, S Krinninger, V Loitzenbauer, MA Raskin
Theoretical Computer Science 547, 104-116, 2014
132014
Perfectly secure oblivious RAM with sublinear bandwidth overhead
M Raskin, M Simkin
Advances in Cryptology–ASIACRYPT 2019: 25th International Conference on the …, 2019
10*2019
Minimization of visibly pushdown automata is NP-complete
O Gauwin, A Muscholl, M Raskin
Logical Methods in Computer Science 16, 2020
92020
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
82020
Giant components in random temporal graphs
R Becker, A Casteigts, P Crescenzi, B Kodric, M Renken, M Raskin, ...
arXiv preprint arXiv:2205.14888, 2022
72022
Almost periodicity and finite automata
Y Pritykin, M Raskin
Electronic Proceedings of WIWAD (satellite to CSR 2007), Ekaterinburg, 2007
72007
Computing parameterized invariants of parameterized petri nets
J Esparza, M Raskin, C Welzel
Fundamenta Informaticae 187, 2022
62022
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.
AR Balasubramanian, J Esparza, MA Raskin
FoSSaCS, 42-61, 2021
62021
Flatness and complexity of immediate observation Petri nets
M Raskin, C Weil-Kennedy, J Esparza
arXiv preprint arXiv:2001.09966, 2020
52020
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
5*2019
Regular model checking upside-down: An invariant-based approach
J Esparza, M Raskin, C Welzel
arXiv preprint arXiv:2205.03060, 2022
42022
A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
M Raskin
ICALP 2017, 2016
42016
Abduction of trap invariants in parameterized systems
J Esparza, M Raskin, C Welzel
arXiv preprint arXiv:2108.09101, 2021
32021
Population protocols with unreliable communication
M Raskin
Algorithms for Sensor Systems: 17th International Symposium on Algorithms …, 2021
32021
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20