Mikhail A. Raskin

32 papers A* 3B 6C 1Journal 20Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Vector TSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints.
Discret. Appl. Math.
Arnaud Casteigts, Mathieu Raffinot, Mikhail A. Raskin, Jason Schoeters
2023 J jnl
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.
Log. Methods Comput. Sci.
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
2023 B conf
Geometry of Reachability Sets of Vector Addition Systems.
CONCUR
Roland Guttenberg, Mikhail A. Raskin, Javier Esparza
2023 J jnl
Protocols with constant local storage and unreliable communication.
Theor. Comput. Sci.
Mikhail A. Raskin
2022 J jnl
Computing Parameterized Invariants of Parameterized Petri Nets.
Fundam. Informaticae
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
2022 J jnl
Geometry of VAS reachability sets.
CoRR
Roland Guttenberg, Mikhail A. Raskin
2022 B conf
Regular Model Checking Upside-Down: An Invariant-Based Approach.
CONCUR
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
2022 J jnl
Regular Model Checking Upside-Down: An Invariant-Based Approach.
CoRR
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
2021 — conf
Abduction of trap invariants in parameterized systems.
GandALF
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
2021 J jnl
Affine Extensions of Integer Vector Addition Systems with States.
Log. Methods Comput. Sci.
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
2021 B conf
Computing Parameterized Invariants of Parameterized Petri Nets.
Petri Nets
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
2021 J jnl
Computing Parameterized Invariants of Parameterized Petri Nets.
CoRR
Javier Esparza, Mikhail A. Raskin, Christoph Welzel
2021 B conf
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.
FoSSaCS
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
2021 J jnl
Modular population protocols.
CoRR
Mikhail A. Raskin
2021 C conf
Population Protocols with Unreliable Communication.
ALGOSENSORS
Mikhail A. Raskin
2021 J jnl
The Complexity of Reachability in Affine Vector Addition Systems with States.
Log. Methods Comput. Sci.
Michael Blondin, Mikhail A. Raskin
2021 J jnl
The complexity of verifying population protocols.
Distributed Comput.
Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy
2020 J jnl
Constructive expressive power of population protocols.
CoRR
Mikhail A. Raskin
2020 J jnl
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.
CoRR
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
2020 B conf
Flatness and Complexity of Immediate Observation Petri Nets.
CONCUR
Mikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza
2020 J jnl
On the Flatness of Immediate Observation Petri Nets.
CoRR
Mikhail A. Raskin, Chana Weil-Kennedy
2020 A* conf
The Complexity of Reachability in Affine Vector Addition Systems with States.
LICS
Michael Blondin, Mikhail A. Raskin
2019 — conf
A Stay-in-a-Set Game without a Stationary Equilibrium.
GandALF
Kristoffer Arnsfelt Hansen, Mikhail A. Raskin
2019 J jnl
Affine Extensions of Integer Vector Addition Systems with States.
CoRR
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
2019 B conf
Parameterized Analysis of Immediate Observation Petri Nets.
Petri Nets
Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy
2019 J jnl
Parameterized Analysis of Immediate Observation Petri Nets.
CoRR
Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy
2019 J jnl
Population protocols with unreliable communication.
CoRR
Mikhail A. Raskin
2019 J jnl
The Complexity of Reachability in Affine Vector Addition Systems with States.
CoRR
Michael Blondin, Mikhail A. Raskin
2019 J jnl
The Complexity of Verifying Population Protocols.
CoRR
Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy
2018 A* conf
A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton.
ICALP
Mikhail A. Raskin
2017 A* conf
A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model.
ICALP
Mikhail A. Raskin
2016 J jnl
A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model.
CoRR
Mikhail A. Raskin