Dmitry Chistikov
According to our database^{1},
Dmitry Chistikov
authored at least 20 papers
between 2011 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
Contextfree commutative grammars with integer counters and resets.
Theor. Comput. Sci., 2018
OMinimal 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
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 TwentyEighth Annual ACMSIAM 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 onecounter 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 SemiLinear Set.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Synchronizing Automata over Nested Words.
Proceedings of the Foundations of Software Science and Computation Structures, 2016
Shortest Paths in OneCounter Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2016
Hitting Families of Schedules for Asynchronous Programs.
Proceedings of the Computer Aided Verification  28th International Conference, 2016
2015
Approximate Counting in SMT and Value Estimation for Probabilistic Programs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015
2014
Certificates of NonMembership for Classes of ReadOnce Functions.
Fundam. Inform., 2014
Unary Pushdown Automata and StraightLine 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 ReadOnce 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 ReadOnce Functions.
Proceedings of the Combinatorial Algorithms  22nd International Workshop, 2011