| Publication | Date of Publication | Type |
|---|
| Online scheduling on identical machines with a metric state space | 2024-04-23 | Paper |
Elementarily traceable irrational numbers
Lecture Notes in Computer Science | 2024-01-12 | Paper |
Trade-offs among degree, diameter, and number of paths
Discrete Applied Mathematics | 2023-01-11 | Paper |
| Average-case polynomial-time computability of Hamiltonian dynamics | 2021-08-04 | Paper |
Simple strategies versus optimal schedules in multi-agent patrolling
Theoretical Computer Science | 2020-09-03 | Paper |
Polynomial Running Times for Polynomial-Time Oracle Machines
(available as arXiv preprint) | 2020-05-26 | Paper |
A lower bound on opaque sets
Computational Geometry | 2019-10-18 | Paper |
| Second-order linear-time computability with applications to computable analysis | 2019-10-15 | Paper |
Sequentially swapping colored tokens on graphs
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
| Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving | 2018-10-18 | Paper |
Weight Balancing on Boundaries and Skeletons
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Complexity theory of (functions on) compact metric spaces
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
On characterizations of randomized computation using plain Kolmogorov complexity
Computability | 2018-03-16 | Paper |
A lower bound on opaque sets
(available as arXiv preprint) | 2018-01-30 | Paper |
On the computational complexity of the Dirichlet problem for Poisson's equation
Mathematical Structures in Computer Science | 2017-11-22 | Paper |
Sequentially swapping colored tokens on graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Morpion solitaire 5D: a new upper bound of 121 on the maximum score
Information Processing Letters | 2017-02-21 | Paper |
Thin strip graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
Pursuit of the Universal | 2016-08-17 | Paper |
Complexity theory for operators in analysis
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Differential recursion
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
Journal of Complexity | 2015-08-24 | Paper |
Fence patrolling by mobile agents with distinct speeds
Distributed Computing | 2015-07-08 | Paper |
On minimum- and maximum-weight minimum spanning trees with neighborhoods
Theory of Computing Systems | 2015-05-12 | Paper |
Function spaces for second-order polynomial time
Language, Life, Limits | 2015-02-25 | Paper |
Function spaces for second-order polynomial time
Language, Life, Limits | 2015-02-25 | Paper |
On characterizations of randomized computation using plain Kolmogorov complexity
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Small complexity classes for computable analysis
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Complexity theory for operators in analysis
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Zone diagrams in Euclidean spaces and in other normed spaces
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Distance \(k\)-sectors exist
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Computational complexity of smooth differential equations
Logical Methods in Computer Science | 2014-03-24 | Paper |
The Distance 4-Sector of Two Points Is Unique
Algorithms and Computation | 2014-01-14 | Paper |
On minimum-and maximum-weight minimum spanning trees with neighborhoods
Approximation and Online Algorithms | 2013-09-13 | Paper |
Fence patrolling by mobile agents with distinct speeds
Lecture Notes in Computer Science | 2013-03-21 | Paper |
Zone diagrams in Euclidean spaces and in other normed spaces
Mathematische Annalen | 2012-12-20 | Paper |
Zone diagrams in Euclidean spaces and in other normed spaces
Mathematische Annalen | 2012-12-20 | Paper |
| Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime | 2012-11-21 | Paper |
Computational complexity of smooth differential equations
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Generalized semimagic squares for digital halftoning
Theory of Computing Systems | 2011-11-30 | Paper |
Lipschitz continuous ordinary differential equations are polynomial-space complete
Computational Complexity | 2011-02-18 | Paper |
VC dimensions of principal component analysis
Discrete & Computational Geometry | 2010-11-08 | Paper |
Distance \(k\)-sectors exist
Computational Geometry | 2010-09-02 | Paper |
