| Simple strategies versus optimal schedules in multi-agent patrolling | 0 | 0.34 | 2020 |
| Second-Order Linear-Time Computability with Applications to Computable Analysis. | 0 | 0.34 | 2019 |
| Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory. | 0 | 0.34 | 2018 |
| Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. | 0 | 0.34 | 2018 |
| Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs. | 0 | 0.34 | 2018 |
| Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving. | 0 | 0.34 | 2018 |
| Thin strip graphs | 0 | 0.34 | 2017 |
| Sequentially Swapping Colored Tokens On Graphs | 2 | 0.37 | 2017 |
| Polynomial running times for polynomial-time oracle machines. | 2 | 0.38 | 2017 |
| Folding and Punching Paper. | 0 | 0.34 | 2017 |
| On the computational complexity of the Dirichlet Problem for Poisson's Equation. | 0 | 0.34 | 2017 |
| Towards Computational Complexity Theory On Advanced Function Spaces In Analysis | 1 | 0.40 | 2016 |
| Complexity Theory of (Functions on) Compact Metric Spaces. | 2 | 0.42 | 2016 |
| Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey’s hierarchy | 1 | 0.35 | 2015 |
| Fence patrolling by mobile agents with distinct speeds. | 21 | 0.96 | 2015 |
| Computational complexity of smooth differential equations | 7 | 0.68 | 2014 |
| A lower bound on opaque sets | 0 | 0.34 | 2014 |
| On function spaces and polynomial-time computability. | 3 | 0.41 | 2014 |
| Weight Balancing on Boundaries and Skeletons | 0 | 0.34 | 2014 |
| Function Spaces for Second-Order Polynomial Time. | 4 | 0.53 | 2014 |
| The Distance 4-Sector of Two Points Is Unique. | 0 | 0.34 | 2013 |
| Morpion Solitaire 5D: a new upper bound of 121 on the maximum score. | 0 | 0.34 | 2013 |
| Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13). | 0 | 0.34 | 2013 |
| Complexity theory for operators in analysis | 15 | 1.17 | 2013 |
| Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime | 6 | 0.61 | 2012 |
| On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods | 7 | 0.48 | 2012 |
| Generalized Semimagic Squares for Digital Halftoning | 0 | 0.34 | 2011 |
| VC Dimensions of Principal Component Analysis | 2 | 0.51 | 2010 |
| Distance k-sectors exist☆ | 1 | 0.37 | 2010 |
| Distance K-Sectors Exist | 1 | 0.37 | 2010 |
| Differential recursion | 4 | 0.41 | 2009 |
| Zone diagrams in Euclidean spaces and in other normed spaces | 6 | 0.62 | 2009 |
| Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete | 13 | 0.96 | 2009 |
| Differential Recursion and Differentially Algebraic Functions | 1 | 0.35 | 2007 |
| Type-2 Computability and Moore's Recursive Functions | 3 | 0.40 | 2005 |
