default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th RP 2020: Paris, France
- Sylvain Schmitz, Igor Potapov:
Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings. Lecture Notes in Computer Science 12448, Springer 2020, ISBN 978-3-030-61738-7
Invited Papers
- Valérie Berthé
:
On Decision Problems for Substitutions in Symbolic Dynamics. 3-19 - Orna Kupferman:
Games with Full, Longitudinal, and Transverse Observability. 20-34
Regular Papers
- Shruti Biswal, Andrew S. Miner:
Reachability Set Generation Using Hybrid Relation Compatible Saturation. 37-51 - Sergiy Bogomolov, Marcelo Forets, Kostiantyn Potomkin:
Case Study: Reachability and Scalability in a Unified Combat-Command-and-Control Model. 52-66 - Kousha Etessami, Emanuel Martinov:
Qualitative Multi-objective Reachability for Ordered Branching MDPs. 67-82 - Dmitry Kravchenko, Kamil Khadiev, Danil Serov, Ruslan Kapralov:
Quantum-over-Classical Advantage in Solving Multiplayer Games. 83-98 - Michael Raskin, Chana Weil-Kennedy:
Efficient Restrictions of Immediate Observation Petri Nets. 99-114 - Tristan Stérin:
Binary Expression of Ancestors in the Collatz Graph. 115-130 - Tristan Stérin, Damien Woods:
The Collatz Process Embeds a Base Conversion Algorithm. 131-147 - Ronny Tredup:
The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets. 148-163
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.
last updated on 2025-01-24 17:01 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:
