| Publication | Date of Publication | Type |
|---|
| On the power of ordering in linear arithmetic theories | 2026-03-18 | Paper |
| Rational subsets of Baumslag-Solitar groups | 2026-03-18 | Paper |
| Invariants for one-counter automata with disequality tests | 2026-02-10 | Paper |
| Integer linear-exponential programming in NP by quantifier elimination | 2026-01-14 | Paper |
| Acyclic Petri and workflow nets with resets | 2025-07-28 | Paper |
| Geometric decision procedures and the VC dimension of linear arithmetic theories | 2024-12-06 | Paper |
| The complexity of Presburger arithmetic with power or powers | 2024-11-14 | Paper |
| Higher-order quantified Boolean satisfiability | 2024-08-06 | Paper |
Quantifier elimination for counting extensions of Presburger arithmetic
Lecture Notes in Computer Science | 2024-01-23 | Paper |
Bisimilarity distances for approximate differential privacy
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
| Asymmetric Distances for Approximate Differential Privacy | 2023-02-03 | Paper |
The big-O problem
(available as arXiv preprint) | 2022-08-02 | Paper |
| The big-O problem | 2022-08-02 | Paper |
| The big-O problem for labelled Markov chains and weighted automata | 2022-07-18 | Paper |
o-minimal invariants for discrete-time dynamical systems
ACM Transactions on Computational Logic | 2022-02-24 | Paper |
Globe-hopping
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2021-10-29 | Paper |
Globe-hopping
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2021-10-29 | Paper |
| o-minimal invariants for linear loops | 2021-07-28 | Paper |
Re-pairing brackets
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Re-pairing brackets
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
| Rational subsets of Baumslag-Solitar groups | 2020-06-21 | Paper |
| On the complexity of quantified integer programming | 2020-05-27 | Paper |
Approximate Counting in SMT and Value Estimation for Probabilistic Programs
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
Hitting Families of Schedules for Asynchronous Programs
Computer Aided Verification | 2019-05-03 | Paper |
Hitting Families of Schedules for Asynchronous Programs
Computer Aided Verification | 2019-05-03 | Paper |
Shortest paths in one-counter systems
Logical Methods in Computer Science | 2019-03-18 | Paper |
On rationality of nonnegative matrix factorization
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Context-free commutative grammars with integer counters and resets
Theoretical Computer Science | 2018-06-05 | Paper |
Context-free commutative grammars with integer counters and resets
Theoretical Computer Science | 2018-06-05 | Paper |
The complexity of regular abstractions of one-counter languages
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Fractional coverings, greedy coverings, and rectifier networks
(available as arXiv preprint) | 2018-04-19 | Paper |
On restricted nonnegative matrix factorization
(available as arXiv preprint) | 2017-12-19 | Paper |
| The taming of the semi-linear set | 2017-12-19 | Paper |
Approximate counting in SMT and value estimation for probabilistic programs
Acta Informatica | 2017-12-01 | Paper |
Approximate counting in SMT and value estimation for probabilistic programs
Acta Informatica | 2017-12-01 | Paper |
Nonnegative matrix factorization requires irrationality
SIAM Journal on Applied Algebra and Geometry | 2017-07-21 | Paper |
| Notes on counting with finite machines | 2017-04-25 | Paper |
Synchronizing automata over nested words
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Shortest paths in one-counter systems
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Certificates of Non-Membership for Classes of Read-Once Functions
Fundamenta Informaticae | 2014-12-22 | Paper |
Unary pushdown automata and straight-line programs
Automata, Languages, and Programming | 2014-07-01 | Paper |
Using relevance queries for identification of read-once functions
Journal of Mathematical Sciences (New York) | 2013-11-04 | Paper |
A uniformization theorem for nested word to word transductions
Implementation and Application of Automata | 2013-08-07 | Paper |
Learning read once functions using subcube parity queries
Computational Mathematics and Modeling | 2012-12-12 | Paper |
Iterated Boolean functions in the elementary basis
Russian Mathematics | 2012-11-20 | Paper |
Read-once functions with hard-to-test projections
Moscow University Computational Mathematics and Cybernetics | 2012-11-20 | Paper |
Testing read-once functions over the elementary basis
Moscow University Computational Mathematics and Cybernetics | 2012-11-20 | Paper |
Checking tests for read-once functions over arbitrary bases
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Testing Monotone Read-Once Functions
Lecture Notes in Computer Science | 2012-01-13 | Paper |
| Learning read-once functions individually | 2011-07-18 | Paper |
On the relationship between diagnostic and checking tests of the read-once functions
Discrete Mathematics and Applications | 2011-06-03 | Paper |
Some test length bounds for nonrepeating functions in the \(\{ \& , \vee \}\) basis
Computational Mathematics and Modeling | 2011-01-10 | Paper |
