Dmitry Chistikov

Orcid: 0000-0001-9055-918X

Affiliations:
  • University of Warwick, Department of Computer Science, Coventry, United Kingdom


According to our database1, Dmitry Chistikov authored at least 42 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Integer Linear-Exponential Programming in NP by Quantifier Elimination.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Invariants for One-Counter Automata with Disequality Tests.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

Learning a Social Network by Influencing Opinions.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

The Complexity of Presburger Arithmetic with Power or Powers.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Acyclic Petri and Workflow Nets with Resets.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
O-Minimal Invariants for Discrete-Time Dynamical Systems.
ACM Trans. Comput. Log., 2022

Subcubic certificates for CFL reachability.
Proc. ACM Program. Lang., 2022

The Big-O Problem.
Log. Methods Comput. Sci., 2022

Higher-Order Quantified Boolean Satisfiability.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Geometric decision procedures and the VC dimension of linear arithmetic theories.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Quantifier elimination for counting extensions of Presburger arithmetic.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021
Presburger arithmetic with threshold counting quantifiers is easy.
CoRR, 2021

2020
Globe-hopping.
CoRR, 2020

Re-pairing brackets.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

On the Power of Ordering in Linear Arithmetic Theories.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Rational Subsets of Baumslag-Solitar Groups.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

The Big-O Problem for Labelled Markov Chains and Weighted Automata.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

Convergence of Opinion Diffusion is PSPACE-Complete.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Shortest paths in one-counter systems.
Log. Methods Comput. Sci., 2019

Synchronizing Automata over Nested Words.
J. Autom. Lang. Comb., 2019

Asymmetric Distances for Approximate Differential Privacy.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Context-free commutative grammars with integer counters and resets.
Theor. Comput. Sci., 2018

O-Minimal Invariants for Linear Loops.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Bisimilarity Distances for Approximate Differential Privacy.
Proceedings of the Automated Technology for Verification and Analysis, 2018

2017
Nonnegative Matrix Factorization Requires Irrationality.
SIAM J. Appl. Algebra Geom., 2017

Approximate counting in SMT and value estimation for probabilistic programs.
Acta Informatica, 2017

Fractional Coverings, Greedy Coverings, and Rectifier Networks.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On Rationality of Nonnegative Matrix Factorization.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

On the Complexity of Quantified Integer Programming.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
The complexity of regular abstractions of one-counter languages.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

On Restricted Nonnegative Matrix Factorization.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Taming of the Semi-Linear Set.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Hitting Families of Schedules for Asynchronous Programs.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2014
Certificates of Non-Membership for Classes of Read-Once Functions.
Fundam. Informaticae, 2014

Unary Pushdown Automata and Straight-Line Programs.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Notes on Counting with Finite Machines.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
A Uniformization Theorem for Nested Word to Word Transductions.
Proceedings of the Implementation and Application of Automata, 2013

2012
Checking Tests for Read-Once Functions over Arbitrary Bases.
Proceedings of the Computer Science - Theory and Applications, 2012

2011
An Upper Bound on Checking Test Complexity for Almost All Cographs.
Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

Testing Monotone Read-Once Functions.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010
Learning Read-Once Functions Using Subcube Identity Queries
CoRR, 2010


  Loading...