The following pages link to Anatol Slissenko (Q234699):
Displaying 20 items.
- (Q598212) (redirect page) (← links)
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon (Q598213) (← links)
- Preface to the special issue dedicated to Nikolai Alexandrovich Shanin on the occasion of his 90th birthday (Q638481) (← links)
- Polytime model checking for times probabilistic computation tree logic (Q1127817) (← links)
- On the complexity of partially observed Markov decision processes (Q1351500) (← links)
- Decidable verification for reducible timed automata specified in a first order logic with time (Q1606131) (← links)
- Periodicity based decidable classes in a first order timed logic (Q2368906) (← links)
- The probability nesting game (Q2842598) (← links)
- A Logic of Probability with Decidable Model Checking (Q3412000) (← links)
- On the complexity of finite memory policies for Markov decision processes (Q3569011) (← links)
- (Q4232467) (← links)
- (Q4263951) (← links)
- (Q4411831) (← links)
- (Q4470463) (← links)
- (Q4824484) (← links)
- (Q4934321) (← links)
- On Entropic Convergence of Algorithms (Q5049056) (← links)
- (Q5215799) (← links)
- Computer Science Logic (Q5394565) (← links)
- A first order logic for specification of timed algorithms: Basic properties and a decidable class (Q5957904) (← links)
