| Publication | Date of Publication | Type |
|---|
| Quantum programming in polylogarithmic time | 2026-08-05 | Paper |
| Declassification policy for program complexity analysis | 2025-06-18 | Paper |
Complete and tractable machine-independent characterizations of second-order polytime
Logical Methods in Computer Science | 2025-01-31 | Paper |
Complete and tractable machine-independent characterizations of second-order polytime
Lecture Notes in Computer Science | 2024-01-23 | Paper |
| A tier-based typed programming language characterizing feasible functionals | 2022-08-02 | Paper |
A tier-based typed programming language characterizing feasible functionals
(available as arXiv preprint) | 2022-08-02 | Paper |
| \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs | 2022-03-31 | Paper |
| Polynomial time over the reals with parsimony | 2021-07-06 | Paper |
A tier-based typed programming language characterizing Feasible Functionals
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
A tier-based typed programming language characterizing Feasible Functionals
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
| Theory of higher order interpretations and application to basic feasible functions | 2020-12-18 | Paper |
Theory of higher order interpretations and application to basic feasible functions
(available as arXiv preprint) | 2020-12-18 | Paper |
Higher order interpretation for higher order complexity
EPiC Series in Computing | 2019-01-10 | Paper |
A type-based complexity analysis of object oriented programs
Information and Computation | 2018-06-14 | Paper |
Objects in polynomial time
Programming Languages and Systems | 2016-01-08 | Paper |
Characterizing polynomial time complexity of stream programs using interpretations
Theoretical Computer Science | 2015-05-26 | Paper |
Computation with perturbed dynamical systems
Journal of Computer and System Sciences | 2013-07-24 | Paper |
Type-Based Complexity Analysis for Fork Processes
Lecture Notes in Computer Science | 2013-03-18 | Paper |
Interpretation of stream programs: characterizing type 2 polynomial time complexity
Algorithms and Computation | 2010-12-09 | Paper |
Robust Computations with Dynamical Systems
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
On the Computational Capabilities of Several Models
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Computing Omega-Limit Sets in Linear Dynamical Systems
Unconventional Computing | 2008-12-02 | Paper |
Reachability in Linear Dynamical Systems
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Polynomial differential equations compute all real computable functions on computable compact intervals
Journal of Complexity | 2007-07-04 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
| Recursive analysis characterized as a class of real recursive functions | 2007-01-19 | Paper |
Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
Theoretical Computer Science | 2006-01-09 | Paper |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
