Mikhail Raskin
Mikhail Raskin
Dept. of CS, TU Munich
Dirección de correo verificada de in.tum.de
Título
Citado por
Citado por
Año
On the communication required for unconditionally secure multiplication
I Damgård, JB Nielsen, A Polychroniadou, M Raskin
Annual International Cryptology Conference, 459-488, 2016
202016
Affine extensions of integer vector addition systems with states
M Blondin, C Haase, F Mazowiecki, M Raskin
arXiv preprint arXiv:1909.12386, 2019
72019
Approximating the minimum cycle mean
K Chatterjee, M Henzinger, S Krinninger, V Loitzenbauer, MA Raskin
Theoretical Computer Science 547, 104-116, 2014
62014
Almost periodicity and finite automata
Y Pritykin, M Raskin
Electronic Proceedings of WIWAD (satellite to CSR 2007), Ekaterinburg, 2007
62007
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
52019
A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
M Raskin
ICALP 2018, 2017
32017
A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
M Raskin
44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017
32017
Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead
M Raskin, M Simkin
International Conference on the Theory and Application of Cryptology and …, 2019
2*2019
A stay-in-a-set game without a stationary equilibrium
KA Hansen, M Raskin
arXiv preprint arXiv:1903.11935, 2019
12019
Toom’s partial order is transitive
MA Raskin
Problems of Information Transmission 48 (2), 154-172, 2012
12012
Constructive expressive power of population protocols
M Raskin
arXiv preprint arXiv:2002.07303, 2020
2020
On the Flatness of Immediate Observation Petri Nets
M Raskin, C Weil-Kennedy
arXiv preprint arXiv:2001.09966, 2020
2020
The Complexity of Verifying Population Protocols
J Esparza, S Jaax, M Raskin, C Weil-Kennedy
arXiv preprint arXiv:1912.06578, 2019
2019
The Complexity of Reachability in Affine Vector Addition Systems with States
M Blondin, M Raskin
arXiv preprint arXiv:1909.02579, 2019
2019
Working with first-order proofs and provers
M Raskin, C Welzel
European Lisp Symposium 2019, 2019
2019
A Stay-in-a-Set Game without a Stationary Equilibrium
K Arnsfelt Hansen, M Raskin
arXiv preprint arXiv:1903.11935, 2019
2019
Population protocols with unreliable communication.
M Raskin
arXiv preprint arXiv:1902.10041, 2019
2019
Writing a best-effort portable code walker in Common Lisp
M Raskin
European Lisp Symposium 2017, 2017
2017
Lower bounds on communication for multiparty computation of multiple AND instances with secret sharing.
M Raskin
IACR Cryptology ePrint Archive 2017, 665, 2017
2017
Paradoxical examples of social networks games with product choice
M Raskin, N Nikitenkov
arXiv preprint arXiv:1608.08859, 2016
2016
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20