Learning Read-Once Functions Using Subcube Identity Queries - Dmitry V. Chistikov; Andrey A. Voronenko (CoRR, 2010)

Testing Monotone Read-Once Functions. - Dmitry V. Chistikov (IWOCA, 2011)

An Upper Bound on Checking Test Complexity for Almost All Cographs. - Oleg V. Zubkov; Dmitry V. Chistikov; Andrey A. Voronenko (SYNASC, 2011)

Checking Tests for Read-Once Functions over Arbitrary Bases. - Dmitry V. Chistikov (CSR, 2012)

A Uniformization Theorem for Nested Word to Word Transductions. - Dmitry Chistikov 001; Rupak Majumdar (CIAA, 2013)

Notes on Counting with Finite Machines. - Dmitry Chistikov 001 (FSTTCS, 2014)

Unary Pushdown Automata and Straight-Line Programs. - Dmitry Chistikov 001; Rupak Majumdar (ICALP (2), 2014)

Certificates of Non-Membership for Classes of Read-Once Functions. - Dmitry Chistikov 001; Valentina Fedorova; Andrey A. Voronenko (Fundam. Informaticae, 2014)

Hitting Families of Schedules for Asynchronous Programs. - Dmitry Chistikov 001; Rupak Majumdar; Filip Niksic (CAV (2), 2016)

The Taming of the Semi-Linear Set. - Dmitry Chistikov 001; Christoph Haase (ICALP, 2016)

On Restricted Nonnegative Matrix Factorization. - Dmitry Chistikov 001; Stefan Kiefer; Ines Marusic; Mahsa Shirmohammadi; James Worrell 001 (ICALP, 2016)

The complexity of regular abstractions of one-counter languages. - Mohamed Faouzi Atig; Dmitry Chistikov 001; Piotr Hofman; K. Narayan Kumar; Prakash Saivasan; Georg Zetzsche (LICS, 2016)

On the Complexity of Quantified Integer Programming. - Dmitry Chistikov 001; Christoph Haase (ICALP, 2017)

On Rationality of Nonnegative Matrix Factorization. - Dmitry Chistikov 001; Stefan Kiefer; Ines Marusic; Mahsa Shirmohammadi; James Worrell 001 (SODA, 2017)

Fractional Coverings, Greedy Coverings, and Rectifier Networks. - Dmitry Chistikov 001; Szabolcs Iván; Anna Lubiw; Jeffrey O. Shallit (STACS, 2017)

Approximate counting in SMT and value estimation for probabilistic programs. - Dmitry Chistikov 001; Rayna Dimitrova; Rupak Majumdar (Acta Informatica, 2017)

Nonnegative Matrix Factorization Requires Irrationality. - Dmitry Chistikov 001; Stefan Kiefer; Ines Marusic; Mahsa Shirmohammadi; James Worrell 001 (SIAM J. Appl. Algebra Geom., 2017)

Bisimilarity Distances for Approximate Differential Privacy. - Dmitry Chistikov 001; Andrzej S. Murawski; David Purser (ATVA, 2018)

O-Minimal Invariants for Linear Loops. - Shaull Almagor; Dmitry Chistikov 001; Joël Ouaknine; James Worrell 001 (ICALP, 2018)

Context-free commutative grammars with integer counters and resets. - Dmitry Chistikov 001; Christoph Haase; Simon Halfon (Theor. Comput. Sci., 2018)

Asymmetric Distances for Approximate Differential Privacy. - Dmitry Chistikov 001; Andrzej S. Murawski; David Purser (CONCUR, 2019)

Synchronizing Automata over Nested Words. - Dmitry Chistikov 001; Pavel Martyugin; Mahsa Shirmohammadi (J. Autom. Lang. Comb., 2019)

Shortest paths in one-counter systems. - Dmitry Chistikov 001; Wojciech Czerwinski; Piotr Hofman; Michal Pilipczuk; Michael Wehar (Log. Methods Comput. Sci., 2019)

Convergence of Opinion Diffusion is PSPACE-Complete. - Dmitry Chistikov 001; Grzegorz Lisowski; Mike Paterson; Paolo Turrini (AAAI, 2020)

The Big-O Problem for Labelled Markov Chains and Weighted Automata. - Dmitry Chistikov 001; Stefan Kiefer; Andrzej S. Murawski; David Purser (CONCUR, 2020)

Rational Subsets of Baumslag-Solitar Groups. - Michaël Cadilhac; Dmitry Chistikov 001; Georg Zetzsche (ICALP, 2020)

On the Power of Ordering in Linear Arithmetic Theories. - Dmitry Chistikov 001; Christoph Haase (ICALP, 2020)

Re-pairing brackets. - Dmitry Chistikov 001; Mikhail N. Vyalyi (LICS, 2020)

Globe-hopping. - Dmitry Chistikov 001; Olga Goulko; Adrian Kent; Mike Paterson (CoRR, 2020)

Presburger arithmetic with threshold counting quantifiers is easy. - Dmitry Chistikov 001; Christoph Haase; Alessio Mansutti (CoRR, 2021)

Quantifier elimination for counting extensions of Presburger arithmetic. - Dmitry Chistikov 001; Christoph Haase; Alessio Mansutti (FoSSaCS, 2022)

Geometric decision procedures and the VC dimension of linear arithmetic theories. - Dmitry Chistikov 001; Christoph Haase; Alessio Mansutti (LICS, 2022)

Higher-Order Quantified Boolean Satisfiability. - Dmitry Chistikov 001; Christoph Haase; Zahra Hadizadeh; Alessio Mansutti (MFCS, 2022)

The Big-O Problem. - Dmitry Chistikov 001; Stefan Kiefer; Andrzej S. Murawski; David Purser (Log. Methods Comput. Sci., 2022)

Subcubic certificates for CFL reachability. - Dmitry Chistikov 001; Rupak Majumdar; Philipp Schepper (Proc. ACM Program. Lang., 2022)

O-Minimal Invariants for Discrete-Time Dynamical Systems. - Shaull Almagor; Dmitry Chistikov 001; Joël Ouaknine; James Worrell 001 (ACM Trans. Comput. Log., 2022)

Acyclic Petri and Workflow Nets with Resets. - Dmitry Chistikov 001; Wojciech Czerwinski; Piotr Hofman; Filip Mazowiecki; Henry Sinclair-Banks (FSTTCS, 2023)

The Complexity of Presburger Arithmetic with Power or Powers. - Michael Benedikt; Dmitry Chistikov 001; Alessio Mansutti (ICALP, 2023)

Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs. - Dmitry Chistikov 001; Matthias Englert; Ranko Lazic 001 (NeurIPS, 2023)

Learning a Social Network by Influencing Opinions. - Dmitry Chistikov 001; Luisa Estrada; Mike Paterson; Paolo Turrini (AAMAS, 2024)

Invariants for One-Counter Automata with Disequality Tests. - Dmitry Chistikov 001; Jérôme Leroux; Henry Sinclair-Banks; Nicolas Waldburger (CONCUR, 2024)

The Tractability Border of Reachability in Simple Vector Addition Systems with States. - Dmitry Chistikov 001; Wojciech Czerwinski; Filip Mazowiecki; Lukasz Orlikowski; Henry Sinclair-Banks; Karol Wegrzycki (FOCS, 2024)

An Introduction to the Theory of Linear Integer Arithmetic (Invited Paper). - Dmitry Chistikov 001 (FSTTCS, 2024)

Integer Linear-Exponential Programming in NP by Quantifier Elimination. - Dmitry Chistikov 001; Alessio Mansutti; Mikhail R. Starchak (ICALP, 2024)