default search action
Anatol Slissenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
- [j13]Anatol Slissenko:
Towards Analysis of Information Structure of Computations. FLAP 4(4) (2017) - 2010
- [j12]Sergei N. Artëmov, Yuri V. Matiyasevich
, Grigori Mints, Anatol Slissenko:
Preface. Ann. Pure Appl. Log. 162(3): 173-174 (2010) - 2008
- [j11]Anatol Slissenko, Pavel Vasilyev:
Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking. J. Univers. Comput. Sci. 14(12): 1984-2006 (2008) - 2006
- [j10]Danièle Beauquier, Anatol Slissenko:
Periodicity based decidable classes in a first order timed logic. Ann. Pure Appl. Log. 139(1-3): 43-73 (2006) - [j9]Danièle Beauquier, Alexander Moshe Rabinovich
A Logic of Probability with Decidable Model Checking. J. Log. Comput. 16(4): 461-487 (2006) - 2004
- [j8]Anatol Slissenko:
A Logic Framework for Verification of Timed Algorithms. Fundam. Informaticae 62(1): 29-67 (2004) - [j7]Dima Burago, Dima Grigoriev, Anatol Slissenko:
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon. Theor. Comput. Sci. 315(2-3): 371-404 (2004) - 2002
- [j6]Danièle Beauquier, Anatol Slissenko:
Decidable verification for reducible timed automata specified in a first order logic with time. Theor. Comput. Sci. 275(1-2): 347-388 (2002) - 2001
- [j5]Danièle Beauquier, Anatol Slissenko:
A first order logic for specification of timed algorithms: basic properties and a decidable class. Ann. Pure Appl. Log. 113(1-3): 13-52 (2001) - 1998
- [j4]Danièle Beauquier, Anatol Slissenko:
Polytime Model Checking for Timed Probabilistic Computation Tree Logic. Acta Informatica 35(8): 645-664 (1998) - 1996
- [j3]Dima Burago, Michel de Rougemont, Anatol Slissenko:
On the Complexity of Partially Observed Markov Decision Processes. Theor. Comput. Sci. 157(2): 161-183 (1996) - 1993
- [j2]Anatol Slissenko:
On Fault Tolerance of Syntax. Theor. Comput. Sci. 119(1): 215-222 (1993) - 1991
- [j1]Anatol Slissenko:
On measures of information quality of knowledge processing systems. Inf. Sci. 57-58: 389-401 (1991)
Conference and Workshop Papers
- 2020
- [c16]Anatol Slissenko:
On Entropic Convergence of Algorithms. Fields of Logic and Computation III 2020: 291-304 - 2008
- [c15]Joëlle Cohen, Anatol Slissenko:
Stability of Real-Time Abstract State Machines under Desynchronization. ABZ 2008: 341 - 2005
- [c14]Danièle Beauquier, Egon Börger, Anatol Slissenko:
Introduction. Abstract State Machines 2005: 5-10 - [c13]Anatol Slissenko, Joëlle Cohen:
On Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays. Abstract State Machines 2005: 387-396 - [c12]Anatol Slissenko:
Verification in Predicate Logic with Time: Algorithmic Questions. CSL 2005: 3-17 - [c11]Anatol Slissenko:
Probability and Time in Measuring Security. VISSAS 2005: 169-183 - 2003
- [c10]Anatol Slissenko:
Complexity Problems in the Analysis of Information Systems Security. MMM-ACNS 2003: 47-56 - 2002
- [c9]Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko:
A Logic of Probability with Decidable Model-Checking. CSL 2002: 306-321 - [c8]Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich
The Probability Nesting Game. EXPRESS 2002: 4-14 - 2000
- [c7]Joëlle Cohen, Anatol Slissenko:
On Verification of Refinements of Timed Distributed Algorithms. Abstract State Machines 2000: 34-49 - 1999
- [c6]Anatol Slissenko:
Complexity Problems in Analysis of Multi-Agent Systems. CEEMAS 1999 - [c5]Danièle Beauquier, Anatol Slissenko:
Decidable Classes of the Verification Problem in a Timed Predicate Logic. FCT 1999: 100-111 - 1998
- [c4]Dima Grigoriev, Anatol Slissenko:
Polytime Algorithm for the Shortest Path in a Homotopy Class Amidst Semi-Algebraic Obstacles in the Plane. ISSAC 1998: 17-24 - 1997
- [c3]Dima Grigoriev, Anatol Slissenko:
Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane. AAECC 1997: 114-129 - [c2]Danièle Beauquier, Anatol Slissenko:
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages. TAPSOFT 1997: 201-212 - 1995
- [c1]Danièle Beauquier, Dima Burago, Anatol Slissenko:
On the Complexity of Finite Memory Policies for Markov Decision Processes. MFCS 1995: 191-200
Editorship
- 2008
- [e1]Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov
Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings. Lecture Notes in Computer Science 5010, Springer 2008, ISBN 978-3-540-79708-1 [contents]
Informal and Other Publications
- 2022
- [i2]Anatol Slissenko:
Relating Information and Proof. CoRR abs/2205.07635 (2022) - 2016
- [i1]Anatol Slissenko:
On entropic convergence of algorithms in terms of domain partitions. CoRR abs/1605.01519 (2016)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST 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: