default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry Chistikov 0001
Person information
- affiliation: University of Warwick, Department of Computer Science, Coventry, United Kingdom
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c35]Dmitry Chistikov, Luisa Estrada, Mike Paterson, Paolo Turrini:
Learning a Social Network by Influencing Opinions. AAMAS 2024: 363-371- [c34]Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, Nicolas Waldburger:
Invariants for One-Counter Automata with Disequality Tests. CONCUR 2024: 17:1-17:21 - [c33]Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki:
The Tractability Border of Reachability in Simple Vector Addition Systems with States. FOCS 2024: 1332-1354 - [c32]Dmitry Chistikov:
An Introduction to the Theory of Linear Integer Arithmetic (Invited Paper). FSTTCS 2024: 1:1-1:36 - [c31]Dmitry Chistikov, Alessio Mansutti, Mikhail R. Starchak
:
Integer Linear-Exponential Programming in NP by Quantifier Elimination. ICALP 2024: 132:1-132:20 - [i25]Dmitry Chistikov, Alessio Mansutti, Mikhail R. Starchak:
Integer Linear-Exponential Programming in NP by Quantifier Elimination. CoRR abs/2407.07083 (2024) - [i24]Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, Nicolas Waldburger:
Invariants for One-Counter Automata with Disequality Tests. CoRR abs/2408.11908 (2024) - 2023
- [c30]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks:
Acyclic Petri and Workflow Nets with Resets. FSTTCS 2023: 16:1-16:18 - [c29]Michael Benedikt, Dmitry Chistikov, Alessio Mansutti:
The Complexity of Presburger Arithmetic with Power or Powers. ICALP 2023: 112:1-112:18 - [c28]Dmitry Chistikov, Matthias Englert, Ranko Lazic:
Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs. NeurIPS 2023 - [i23]Michael Benedikt, Dmitry Chistikov, Alessio Mansutti:
The complexity of Presburger arithmetic with power or powers. CoRR abs/2305.03037 (2023) - [i22]Dmitry Chistikov, Matthias Englert, Ranko Lazic:
Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs. CoRR abs/2306.06479 (2023) - [i21]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks:
Acyclic Petri and Workflow Nets with Resets. CoRR abs/2310.01992 (2023) - 2022
- [j9]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem. Log. Methods Comput. Sci. 18(1) (2022) - [j8]Dmitry Chistikov, Rupak Majumdar, Philipp Schepper:
Subcubic certificates for CFL reachability. Proc. ACM Program. Lang. 6(POPL): 1-29 (2022) - [j7]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Discrete-Time Dynamical Systems. ACM Trans. Comput. Log. 23(2): 9:1-9:20 (2022) - [c27]Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Quantifier elimination for counting extensions of Presburger arithmetic. FoSSaCS 2022: 225-243 - [c26]Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Geometric decision procedures and the VC dimension of linear arithmetic theories. LICS 2022: 59:1-59:13 - [c25]Dmitry Chistikov, Christoph Haase, Zahra Hadizadeh, Alessio Mansutti:
Higher-Order Quantified Boolean Satisfiability. MFCS 2022: 33:1-33:15 - 2021
- [i20]Dmitry Chistikov, Rupak Majumdar, Philipp Schepper:
Subcubic Certificates for CFL Reachability. CoRR abs/2102.13095 (2021) - [i19]Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Presburger arithmetic with threshold counting quantifiers is easy. CoRR abs/2103.05087 (2021) - 2020
- [c24]Dmitry Chistikov, Grzegorz Lisowski, Mike Paterson, Paolo Turrini:
Convergence of Opinion Diffusion is PSPACE-Complete. AAAI 2020: 7103-7110 - [c23]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem for Labelled Markov Chains and Weighted Automata. CONCUR 2020: 41:1-41:19 - [c22]Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche:
Rational Subsets of Baumslag-Solitar Groups. ICALP 2020: 116:1-116:16 - [c21]Dmitry Chistikov, Christoph Haase:
On the Power of Ordering in Linear Arithmetic Theories. ICALP 2020: 119:1-119:15 - [c20]Dmitry Chistikov, Mikhail Vyalyi:
Re-pairing brackets. LICS 2020: 312-326 - [i18]Dmitry Chistikov, Olga Goulko, Adrian Kent, Mike Paterson:
Globe-hopping. CoRR abs/2001.06442 (2020) - [i17]Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche:
Rational subsets of Baumslag-Solitar groups. CoRR abs/2006.11898 (2020) - [i16]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem for Labelled Markov Chains and Weighted Automata. CoRR abs/2007.07694 (2020)
2010 – 2019
- 2019
- [j6]Dmitry Chistikov, Pavel Martyugin, Mahsa Shirmohammadi:
Synchronizing Automata over Nested Words. J. Autom. Lang. Comb. 24(2-4): 219-251 (2019) - [j5]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest paths in one-counter systems. Log. Methods Comput. Sci. 15(1) (2019) - [c19]Dmitry Chistikov, Andrzej S. Murawski, David Purser:
Asymmetric Distances for Approximate Differential Privacy. CONCUR 2019: 10:1-10:17 - [i15]Dmitry Chistikov, Mikhail Vyalyi:
Re-pairing brackets. CoRR abs/1904.08402 (2019) - [i14]Dmitry Chistikov, Grzegorz Lisowski, Mike Paterson, Paolo Turrini:
Convergence of Opinion Diffusion is PSPACE-complete. CoRR abs/1912.09864 (2019) - 2018
- [j4]Dmitry Chistikov, Christoph Haase, Simon Halfon:
Context-free commutative grammars with integer counters and resets. Theor. Comput. Sci. 735: 147-161 (2018) - [c18]Dmitry Chistikov, Andrzej S. Murawski, David Purser:
Bisimilarity Distances for Approximate Differential Privacy. ATVA 2018: 194-210 - [c17]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Linear Loops. ICALP 2018: 114:1-114:14 - [i13]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Linear Loops. CoRR abs/1802.09263 (2018) - [i12]Dmitry Chistikov, Andrzej S. Murawski, David Purser:
Bisimilarity Distances for Approximate Differential Privacy. CoRR abs/1807.10015 (2018) - 2017
- [j3]Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar:
Approximate counting in SMT and value estimation for probabilistic programs. Acta Informatica 54(8): 729-764 (2017) - [j2]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
Nonnegative Matrix Factorization Requires Irrationality. SIAM J. Appl. Algebra Geom. 1(1): 285-307 (2017) - [c16]Dmitry Chistikov, Christoph Haase:
On the Complexity of Quantified Integer Programming. ICALP 2017: 94:1-94:13 - [c15]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Rationality of Nonnegative Matrix Factorization. SODA 2017: 1290-1305 - [c14]Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit:
Fractional Coverings, Greedy Coverings, and Rectifier Networks. STACS 2017: 23:1-23:14 - 2016
- [c13]Dmitry Chistikov, Rupak Majumdar, Filip Niksic:
Hitting Families of Schedules for Asynchronous Programs. CAV (2) 2016: 157-176 - [c12]Dmitry Chistikov, Pavel Martyugin, Mahsa Shirmohammadi:
Synchronizing Automata over Nested Words. FoSSaCS 2016: 252-268 - [c11]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest Paths in One-Counter Systems. FoSSaCS 2016: 462-478 - [c10]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Restricted Nonnegative Matrix Factorization. ICALP 2016: 103:1-103:14 - [c9]Dmitry Chistikov, Christoph Haase:
The Taming of the Semi-Linear Set. ICALP 2016: 128:1-128:13 - [c8]Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche:
The complexity of regular abstractions of one-counter languages. LICS 2016: 207-216 - [i11]Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche:
Complexity of regular abstractions of one-counter languages. CoRR abs/1602.03419 (2016) - [i10]Dmitry Chistikov, Rupak Majumdar, Filip Niksic:
Hitting Families of Schedules for Asynchronous Programs. CoRR abs/1602.03755 (2016) - [i9]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
Nonnegative Matrix Factorization Requires Irrationality. CoRR abs/1605.06848 (2016) - [i8]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Restricted Nonnegative Matrix Factorization. CoRR abs/1605.07061 (2016) - 2015
- [c7]Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar:
Approximate Counting in SMT and Value Estimation for Probabilistic Programs. TACAS 2015: 320-334 - [i7]Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit:
Fractional coverings, greedy coverings, and rectifier networks. CoRR abs/1509.07588 (2015) - [i6]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest paths in one-counter systems. CoRR abs/1510.05460 (2015) - [i5]Dmitry Chistikov, Christoph Haase, Simon Halfon:
Context-Free Commutative Grammars with Integer Counters and Resets. CoRR abs/1511.04893 (2015) - 2014
- [j1]Dmitry Chistikov, Valentina Fedorova, Andrey A. Voronenko:
Certificates of Non-Membership for Classes of Read-Once Functions. Fundam. Informaticae 132(1): 63-77 (2014) - [c6]Dmitry Chistikov:
Notes on Counting with Finite Machines. FSTTCS 2014: 339-350 - [c5]Dmitry Chistikov, Rupak Majumdar:
Unary Pushdown Automata and Straight-Line Programs. ICALP (2) 2014: 146-157 - [i4]Dmitry Chistikov, Rupak Majumdar:
Unary Pushdown Automata and Straight-Line Programs. CoRR abs/1403.0509 (2014) - [i3]Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar:
Approximate Counting in SMT and Value Estimation for Probabilistic Programs. CoRR abs/1411.0659 (2014) - 2013
- [c4]Dmitry Chistikov, Rupak Majumdar:
A Uniformization Theorem for Nested Word to Word Transductions. CIAA 2013: 97-108 - 2012
- [c3]Dmitry V. Chistikov:
Checking Tests for Read-Once Functions over Arbitrary Bases. CSR 2012: 52-63 - [i2]Dmitry V. Chistikov:
Checking Tests for Read-Once Functions over Arbitrary Bases. CoRR abs/1203.0631 (2012) - 2011
- [c2]Dmitry V. Chistikov:
Testing Monotone Read-Once Functions. IWOCA 2011: 121-134 - [c1]Oleg V. Zubkov, Dmitry V. Chistikov, Andrey A. Voronenko:
An Upper Bound on Checking Test Complexity for Almost All Cographs. SYNASC 2011: 323-330 - 2010
- [i1]Dmitry V. Chistikov, Andrey A. Voronenko:
Learning Read-Once Functions Using Subcube Identity Queries. CoRR abs/1007.1073 (2010)
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-12-10 20:51 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:
