Akitoshi Kawamura

According to our database, Akitoshi Kawamura authored at least 45 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Trade-offs among degree, diameter, and number of paths.

Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi, Kazuhisa Makino

Discret. Appl. Math., 2023

Elementarily Traceable Irrational Numbers.

Keita Hiroshima, Akitoshi Kawamura

Proceedings of the Unity of Logic and Computation, 2023

2022

Weight balancing on boundaries.

Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot

J. Comput. Geom., 2022

Online Scheduling on Identical Machines with a Metric State Space.

Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2020

Simple strategies versus optimal schedules in multi-agent patrolling.

Akitoshi Kawamura, Makoto Soejima

Theor. Comput. Sci., 2020

2019

Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151).

Bruce M. Kapron, Akitoshi Kawamura, Florian Steinberg

NII Shonan Meet. Rep., 2019

Sequentially Swapping Colored Tokens on Graphs.

Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno

J. Graph Algorithms Appl., 2019

A lower bound on opaque sets.

Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach

Comput. Geom., 2019

Second-Order Linear-Time Computability with Applications to Computable Analysis.

Akitoshi Kawamura, Florian Steinberg, Holger Thies

Proceedings of the Theory and Applications of Models of Computation, 2019

2018

Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory.

Akitoshi Kawamura, Donghyun Lim, Svetlana Selivanova, Martin Ziegler

CoRR, 2018

Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs.

Akitoshi Kawamura, Martin Ziegler

CoRR, 2018

On characterizations of randomized computation using plain Kolmogorov complexity.

Shuichi Hirahara, Akitoshi Kawamura

Comput., 2018

Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving.

Akitoshi Kawamura, Florian Steinberg, Holger Thies

Proceedings of the Logic, Language, Information, and Computation, 2018

Average-Case Polynomial-Time Computability of Hamiltonian Dynamics.

Akitoshi Kawamura, Holger Thies, Martin Ziegler

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

On the computational complexity of the Dirichlet Problem for Poisson's Equation.

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

Math. Struct. Comput. Sci., 2017

Folding and Punching Paper.

Yasuhiko Asao, Erik D. Demaine, Martin L. Demaine, Hideaki Hosaka, Akitoshi Kawamura, Tomohiro Tachi, Kazune Takahashi

J. Inf. Process., 2017

Morpion Solitaire 5D: A new upper bound of 121 on the maximum score.

Akitoshi Kawamura, Yuichi Tatsu, Yushi Uno, Masahide Yamato

Inf. Process. Lett., 2017

Thin strip graphs.

Takashi Hayashi, Akitoshi Kawamura, Yota Otachi, Hidehiro Shinohara, Koichi Yamazaki

Discret. Appl. Math., 2017

Polynomial Running Times for Polynomial-Time Oracle Machines.

Akitoshi Kawamura, Florian Steinberg

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2016

Complexity Theory of (Functions on) Compact Metric Spaces.

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Towards Computational Complexity Theory on Advanced Function Spaces in Analysis.

Akitoshi Kawamura, Florian Steinberg, Martin Ziegler

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015

On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods.

Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco

Theory Comput. Syst., 2015

Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy.

Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler

J. Complex., 2015

Fence patrolling by mobile agents with distinct speeds.

Akitoshi Kawamura, Yusuke Kobayashi

Distributed Comput., 2015

Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392).

Vasco Brattka, Akitoshi Kawamura, Alberto Marcone, Arno Pauly

Dagstuhl Reports, 2015

2014

On function spaces and polynomial-time computability.

Akitoshi Kawamura, Arno Pauly

CoRR, 2014

Computational Complexity of Smooth Differential Equations.

Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler

Log. Methods Comput. Sci., 2014

Small Complexity Classes for Computable Analysis.

Akitoshi Kawamura, Hiroyuki Ota

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Weight Balancing on Boundaries and Skeletons.

Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Function Spaces for Second-Order Polynomial Time.

Akitoshi Kawamura, Arno Pauly

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013

Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13).

Akitoshi Kawamura, Jean-Yves Marion, David Nowak

NII Shonan Meet. Rep., 2013

The Distance 4-Sector of Two Points Is Unique.

Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Morpion Solitaire 5D: a new upper bound 121 on the maximum score.

Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Complexity Theory for Operators in Analysis.

Akitoshi Kawamura, Stephen A. Cook

ACM Trans. Comput. Theory, 2012

Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime

Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler

CoRR, 2012

2011

Computational Complexity in Analysis and Geometry.

Akitoshi Kawamura

PhD thesis, 2011

Generalized Semimagic Squares for Digital Halftoning.

Akitoshi Kawamura

Theory Comput. Syst., 2011

2010

VC Dimensions of Principal Component Analysis.

Yohji Akama, Kei Irie, Akitoshi Kawamura, Yasutaka Uwano

Discret. Comput. Geom., 2010

Distance k-sectors exist.

Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama

Comput. Geom., 2010

Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete.

Akitoshi Kawamura

Comput. Complex., 2010

Zone diagrams in Euclidean spaces and in other normed spaces.

Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Distance <i>k</i>-sectors exist.

Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Differential recursion.

Akitoshi Kawamura

ACM Trans. Comput. Log., 2009

2007

Differential Recursion and Differentially Algebraic Functions

Akitoshi Kawamura

CoRR, 2007

2004

Type-2 Computability and Moore's Recursive Functions.

Akitoshi Kawamura

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004