default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail A. Raskin
Person information
- unicode name: Михаил Александрович Раскин
- affiliation: Technical University of Munich, Germany
- affiliation: Aarhus University, Department of Computer Science
- affiliation: Lomonosov Moscow State University, Faculty of Mathematics and Mechanics
- affiliation: Independent University of Moscow, Russia
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Arnaud Casteigts
, Michael Raskin, Malte Renken, Viktor Zamaraev:
Sharp Thresholds in Random Simple Temporal Graphs. SIAM J. Comput. 53(2): 346-388 (2024)- [c24]Michael Raskin:
Modular Population Protocols. ALGOWIN 2024: 173-187 - 2023
- [j10]A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. Log. Methods Comput. Sci. 19(4) (2023) - [j9]Mikhail A. Raskin:
Protocols with constant local storage and unreliable communication. Theor. Comput. Sci. 940(Part): 269-282 (2023) - [c23]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. APPROX/RANDOM 2023: 29:1-29:17 - [c22]Roland Guttenberg, Mikhail A. Raskin, Javier Esparza:
Geometry of Reachability Sets of Vector Addition Systems. CONCUR 2023: 6:1-6:16 - 2022
- [j8]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Computing Parameterized Invariants of Parameterized Petri Nets. Fundam. Informaticae 187(2-4): 197-243 (2022) - [c21]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Regular Model Checking Upside-Down: An Invariant-Based Approach. CONCUR 2022: 23:1-23:19 - [c20]Michael Raskin:
QueryFS: compiling queries to define a filesystem. ELS 2022: 14-19 - [d9]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Examples for submission to CONCUR'22. Version 1. Zenodo, 2022 [all versions]
- [d8]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Examples for submission to CONCUR'22. Version 2. Zenodo, 2022 [all versions] - [i23]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Regular Model Checking Upside-Down: An Invariant-Based Approach. CoRR abs/2205.03060 (2022) - [i22]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. CoRR abs/2205.14888 (2022) - [i21]Roland Guttenberg, Mikhail A. Raskin:
Geometry of VAS reachability sets. CoRR abs/2211.02889 (2022) - 2021
- [j7]Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy:
The complexity of verifying population protocols. Distributed Comput. 34(2): 133-177 (2021) - [j6]Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin:
Affine Extensions of Integer Vector Addition Systems with States. Log. Methods Comput. Sci. 17(3) (2021) - [j5]Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. Log. Methods Comput. Sci. 17(3) (2021) - [c19]Mikhail A. Raskin:
Population Protocols with Unreliable Communication. ALGOSENSORS 2021: 140-154 - [c18]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Computing Parameterized Invariants of Parameterized Petri Nets. Petri Nets 2021: 141-163 - [c17]Michael Raskin:
Lisp in the middle - using Lisp to manage a Linux system. ELS 2021: 36-44 - [c16]Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev:
Sharp Thresholds in Random Simple Temporal Graphs. FOCS 2021: 319-326 - [c15]A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. FoSSaCS 2021: 42-61 - [c14]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Abduction of trap invariants in parameterized systems. GandALF 2021: 1-17 - [i20]Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Computing Parameterized Invariants of Parameterized Petri Nets. CoRR abs/2103.10280 (2021) - [i19]Mikhail A. Raskin:
Modular population protocols. CoRR abs/2111.11983 (2021) - 2020
- [j4]Olivier Gauwin, Anca Muscholl, Michael Raskin:
Minimization of visibly pushdown automata is NP-complete. Log. Methods Comput. Sci. 16(1) (2020) - [c13]Mikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza:
Flatness and Complexity of Immediate Observation Petri Nets. CONCUR 2020: 45:1-45:19 - [c12]Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. LICS 2020: 224-236 - [c11]Michael Raskin, Chana Weil-Kennedy:
Efficient Restrictions of Immediate Observation Petri Nets. RP 2020: 99-114 - [d7]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
heron. Version 1. Zenodo, 2020 [all versions] - [d6]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
heron. Version 2. Zenodo, 2020 [all versions] - [d5]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
heron. Version 3. Zenodo, 2020 [all versions] - [d4]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
heron. Version 4. Zenodo, 2020 [all versions] - [d3]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
ostrich. Version pn-2021. Zenodo, 2020 [all versions] - [d2]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
heron. Version 5. Zenodo, 2020 [all versions] - [d1]Christoph Welzel, Javier Esparza, Mikhail A. Raskin:
ostrich. Version fi-2022. Zenodo, 2020 [all versions] - [i18]Mikhail A. Raskin, Chana Weil-Kennedy:
On the Flatness of Immediate Observation Petri Nets. CoRR abs/2001.09966 (2020) - [i17]Mikhail A. Raskin:
Constructive expressive power of population protocols. CoRR abs/2002.07303 (2020) - [i16]Michael Raskin, Chana Weil-Kennedy:
Efficient Restrictions of Immediate Observation Petri Nets. CoRR abs/2007.09189 (2020) - [i15]Bruno Courcelle, Irène Durand, Michael Raskin:
A unified algorithm for colouring graphs of bounded clique-width. CoRR abs/2008.07468 (2020) - [i14]A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. CoRR abs/2010.09471 (2020) - [i13]Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev:
Sharp Thresholds in Random Simple Temporal Graphs. CoRR abs/2011.03738 (2020)
2010 – 2019
- 2019
- [c10]Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy:
Parameterized Analysis of Immediate Observation Petri Nets. Petri Nets 2019: 365-385 - [c9]Michael A. Raskin, Mark Simkin:
Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead. ASIACRYPT (2) 2019: 537-563 - [c8]Michael A. Raskin, Christoph Welzel:
Working with First Order Proofs and Provers. ELS 2019: 42-45 - [c7]Kristoffer Arnsfelt Hansen, Mikhail A. Raskin:
A Stay-in-a-Set Game without a Stationary Equilibrium. GandALF 2019: 83-90 - [i12]Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy:
Parameterized Analysis of Immediate Observation Petri Nets. CoRR abs/1902.03025 (2019) - [i11]Mikhail A. Raskin:
Population protocols with unreliable communication. CoRR abs/1902.10041 (2019) - [i10]Michael A. Raskin, Christoph Welzel:
Working with first-order proofs and provers. CoRR abs/1904.01079 (2019) - [i9]Olivier Gauwin, Anca Muscholl, Michael A. Raskin:
Minimization of visibly pushdown automata is NP-complete. CoRR abs/1907.09563 (2019) - [i8]Michael Blondin, Mikhail A. Raskin:
The Complexity of Reachability in Affine Vector Addition Systems with States. CoRR abs/1909.02579 (2019) - [i7]Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin:
Affine Extensions of Integer Vector Addition Systems with States. CoRR abs/1909.12386 (2019) - [i6]Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy:
The Complexity of Verifying Population Protocols. CoRR abs/1912.06578 (2019) - 2018
- [c6]Mikhail A. Raskin:
A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton. ICALP 2018: 138:1-138:11 - [i5]Michael A. Raskin, Mark Simkin:
Oblivious RAM with Small Storage Overhead. IACR Cryptol. ePrint Arch. 2018: 268 (2018) - 2017
- [c5]Michael A. Raskin:
Writing a Portable Code Walker in Common Lisp. ELS 2017: 98-105 - [c4]Mikhail A. Raskin:
A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model. ICALP 2017: 88:1-88:12 - [i4]Michael A. Raskin:
A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton. CoRR abs/1711.03993 (2017) - [i3]Michael A. Raskin:
Lower bounds on communication for multiparty computation of multiple AND instances with secret sharing. IACR Cryptol. ePrint Arch. 2017: 665 (2017) - 2016
- [c3]Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael A. Raskin:
On the Communication Required for Unconditionally Secure Multiplication. CRYPTO (2) 2016: 459-488 - [c2]Michael Raskin, Nikita Mamardashvili:
Accessing Local Variables During Debugging. ELS 2016: 93-94 - [i2]Mikhail A. Raskin:
A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model. CoRR abs/1607.00242 (2016) - [i1]Michael A. Raskin, N. Nikitenkov:
Paradoxical examples of social networks games with product choice. CoRR abs/1608.08859 (2016) - 2014
- [j3]Michael A. Raskin:
Remark on "Toom's partial order is transitive" published in Probl. Peredachi Inf., 2012, no. 2. Probl. Inf. Transm. 50(3): 292-301 (2014) - [j2]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, Michael A. Raskin:
Approximating the minimum cycle mean. Theor. Comput. Sci. 547: 104-116 (2014) - 2013
- [c1]Michael Raskin:
Data-Transformer: an Example of Data-Centered Toolset. ELS 2013: 15-17 - 2012
- [j1]Michael A. Raskin:
Toom's partial order is transitive. Probl. Inf. Transm. 48(2): 154-172 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-13 01:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
