Lecture Notes in Computer Science - Reachability Problems
Latest Publications

TOTAL DOCUMENTS

10
(FIVE YEARS 0)

H-INDEX

0
(FIVE YEARS 0)

Published By Springer International Publishing

9783030617387, 9783030617394
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

scholarly journals Binary Expression of Ancestors in the Collatz Graph

2020 ◽  
pp. 115-130
Author(s):  
Tristan Stérin

scholarly journals Quantum-over-Classical Advantage in Solving Multiplayer Games

2020 ◽  
pp. 83-98
Author(s):  
Dmitry Kravchenko ◽  
Kamil Khadiev ◽  
Danil Serov ◽  
Ruslan Kapralov
Keyword(s):  
Multiplayer Games

scholarly journals Efficient Restrictions of Immediate Observation Petri Nets

2020 ◽  
pp. 99-114
Author(s):  
Michael Raskin ◽  
Chana Weil-Kennedy
Keyword(s):  
Petri Nets

scholarly journals Qualitative Multi-objective Reachability for Ordered Branching MDPs

2020 ◽  
pp. 67-82
Author(s):  
Kousha Etessami ◽  
Emanuel Martinov
Keyword(s):  
Multi Objective

Reachability Set Generation Using Hybrid Relation Compatible Saturation

2020 ◽  
pp. 37-51
Author(s):  
Shruti Biswal ◽  
Andrew S. Miner
Keyword(s):  
Reachability Set

Case Study: Reachability and Scalability in a Unified Combat-Command-and-Control Model

2020 ◽  
pp. 52-66
Author(s):  
Sergiy Bogomolov ◽  
Marcelo Forets ◽  
Kostiantyn Potomkin
Keyword(s):  
Command And Control ◽  
Control Model ◽  
And Control

scholarly journals The Collatz Process Embeds a Base Conversion Algorithm

2020 ◽  
pp. 131-147
Author(s):  
Tristan Stérin ◽  
Damien Woods
Keyword(s):  
Conversion Algorithm
Load More ...
Sign in / Sign up

Export Citation Format

Share Document