Dmitry Chistikov

According to our database1, Dmitry Chistikov
  • authored at least 29 papers between 2010 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Approximate counting in SMT and value estimation for probabilistic programs.
Acta Inf., 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
Hitting Families of Schedules for Asynchronous Programs.
CoRR, 2016

On Restricted Nonnegative Matrix Factorization.
CoRR, 2016

Nonnegative Matrix Factorization Requires Irrationality.
CoRR, 2016

Complexity of regular abstractions of one-counter languages.
CoRR, 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

Synchronizing Automata over Nested Words.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Shortest Paths in One-Counter 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
Fractional coverings, greedy coverings, and rectifier networks.
CoRR, 2015

Context-Free Commutative Grammars with Integer Counters and Resets.
CoRR, 2015

Shortest paths in one-counter systems.
CoRR, 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 Non-Membership for Classes of Read-Once Functions.
Fundam. Inform., 2014

Unary Pushdown Automata and Straight-Line Programs.
CoRR, 2014

Approximate Counting in SMT and Value Estimation for Probabilistic Programs.
CoRR, 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
CoRR, 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...