On measures of information quality of knowledge processing systems. - Anatol Slissenko (Inf. Sci., 1991)

On Fault Tolerance of Syntax. - Anatol Slissenko (Theor. Comput. Sci., 1993)

On the Complexity of Finite Memory Policies for Markov Decision Processes. - Danièle Beauquier; Dima Burago; Anatol Slissenko (MFCS, 1995)

On the Complexity of Partially Observed Markov Decision Processes. - Dima Burago; Michel de Rougemont; Anatol Slissenko (Theor. Comput. Sci., 1996)

Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane. - Dima Grigoriev; Anatol Slissenko (AAECC, 1997)

The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages. - Danièle Beauquier; Anatol Slissenko (TAPSOFT, 1997)

Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the Plane. - Dima Grigoriev; Anatol Slissenko (ISSAC, 1998)

Polytime Model Checking for Timed Probabilistic Computation Tree Logic. - Danièle Beauquier; Anatol Slissenko (Acta Informatica, 1998)

Complexity Problems in Analysis of Multi-Agent Systems. - Anatol Slissenko (CEEMAS, 1999)

Decidable Classes of the Verification Problem in a Timed Predicate Logic. - Danièle Beauquier; Anatol Slissenko (FCT, 1999)

On Verification of Refinements of Timed Distributed Algorithms. - Joëlle Cohen; Anatol Slissenko (Abstract State Machines, 2000)

A first order logic for specification of timed algorithms: basic properties and a decidable class. - Danièle Beauquier; Anatol Slissenko (Ann. Pure Appl. Log., 2001)

The Probability Nesting Game. - Danièle Beauquier; Yoram Hirshfeld; Alexander Moshe Rabinovich; Anatol Slissenko (EXPRESS, 2002)

Decidable verification for reducible timed automata specified in a first order logic with time. - Danièle Beauquier; Anatol Slissenko (Theor. Comput. Sci., 2002)

Complexity Problems in the Analysis of Information Systems Security. - Anatol Slissenko (MMM-ACNS, 2003)

A Logic Framework for Verification of Timed Algorithms. - Anatol Slissenko (Fundam. Informaticae, 2004)

Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon. - Dima Burago; Dima Grigoriev; Anatol Slissenko (Theor. Comput. Sci., 2004)

Introduction. - Danièle Beauquier; Egon Börger; Anatol Slissenko (Abstract State Machines, 2005)

On Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays. - Anatol Slissenko; Joëlle Cohen (Abstract State Machines, 2005)

Verification in Predicate Logic with Time: Algorithmic Questions. - Anatol Slissenko (CSL, 2005)

Probability and Time in Measuring Security. - Anatol Slissenko (VISSAS, 2005)

Periodicity based decidable classes in a first order timed logic. - Danièle Beauquier; Anatol Slissenko (Ann. Pure Appl. Log., 2006)

A Logic of Probability with Decidable Model Checking. - Danièle Beauquier; Alexander Moshe Rabinovich; Anatol Slissenko (J. Log. Comput., 2006)

Stability of Real-Time Abstract State Machines under Desynchronization. - Joëlle Cohen; Anatol Slissenko (ABZ, 2008)

Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking. - Anatol Slissenko; Pavel Vasilyev (J. Univers. Comput. Sci., 2008)

Preface. - Sergei N. Artëmov; Yuri V. Matiyasevich; Grigori Mints; Anatol Slissenko (Ann. Pure Appl. Log., 2010)

On entropic convergence of algorithms in terms of domain partitions. - Anatol Slissenko (CoRR, 2016)

Towards Analysis of Information Structure of Computations. - Anatol Slissenko (FLAP, 2017)

On Entropic Convergence of Algorithms. - Anatol Slissenko (Fields of Logic and Computation III, 2020)

Relating Information and Proof. - Anatol Slissenko (CoRR, 2022)