Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAkitoshi Kawamura
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j16]Shuichi Hirahara, Akitoshi Kawamura:
On characterizations of randomized computation using plain Kolmogorov complexity. Computability 7(1): 45-56 (2018)- [c21]Akitoshi Kawamura, Holger Thies, Martin Ziegler:
Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. MFCS 2018: 30:1-30:17 - [c20]Akitoshi Kawamura, Florian Steinberg, Holger Thies:
Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving. WoLLIC 2018: 223-236 - [i18]Akitoshi Kawamura, Martin Ziegler:
Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs. CoRR abs/1801.07108 (2018) - [i17]Akitoshi Kawamura, Donghyun Lim, Svetlana Selivanova, Martin Ziegler:
Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory. CoRR abs/1809.08695 (2018) - 2017
- [j15]Takashi Hayashi, Akitoshi Kawamura, Yota Otachi, Hidehiro Shinohara, Koichi Yamazaki:
Thin strip graphs. Discrete Applied Mathematics 216: 203-210 (2017) - [j14]Akitoshi Kawamura, Yuichi Tatsu, Yushi Uno, Masahide Yamato:
Morpion Solitaire 5D: A new upper bound of 121 on the maximum score. Inf. Process. Lett. 121: 6-10 (2017) - [j13]Yasuhiko Asao, Erik D. Demaine, Martin L. Demaine, Hideaki Hosaka, Akitoshi Kawamura, Tomohiro Tachi, Kazune Takahashi:
Folding and Punching Paper. JIP 25: 590-600 (2017) - [j12]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
On the computational complexity of the Dirichlet Problem for Poisson's Equation. Mathematical Structures in Computer Science 27(8): 1437-1465 (2017) - [c19]Akitoshi Kawamura, Florian Steinberg:
Polynomial Running Times for Polynomial-Time Oracle Machines. FSCD 2017: 23:1-23:18 - [c18]Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno:
Sequentially Swapping Colored Tokens on Graphs. WALCOM 2017: 435-447 - [i16]Akitoshi Kawamura, Florian Steinberg:
Polynomial running times for polynomial-time oracle machines. CoRR abs/1704.01405 (2017) - 2016
- [c17]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. CiE 2016: 142-152 - [c16]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A Lower Bound on Opaque Sets. Symposium on Computational Geometry 2016: 46:1-46:10 - [c15]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
Complexity Theory of (Functions on) Compact Metric Spaces. LICS 2016: 837-846 - 2015
- [j11]Akitoshi Kawamura, Yusuke Kobayashi:
Fence patrolling by mobile agents with distinct speeds. Distributed Computing 28(2): 147-154 (2015) - [j10]Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler:
Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy. J. Complexity 31(5): 689-714 (2015) - [j9]Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco:
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. Theory Comput. Syst. 56(1): 220-250 (2015) - [c14]Akitoshi Kawamura, Makoto Soejima:
Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling. CIAC 2015: 261-273 - [i15]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:
Weight Balancing on Boundaries and Skeletons. CoRR abs/1511.04123 (2015) - [i14]Vasco Brattka, Akitoshi Kawamura, Alberto Marcone, Arno Pauly:
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392). Dagstuhl Reports 5(9): 77-104 (2015) - 2014
- [j8]Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler:
Computational Complexity of Smooth Differential Equations. Logical Methods in Computer Science 10(1) (2014) - [c13]
- [c12]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:
Weight Balancing on Boundaries and Skeletons. Symposium on Computational Geometry 2014: 436 - [c11]Shuichi Hirahara, Akitoshi Kawamura:
On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity. MFCS (2) 2014: 348-359 - [c10]Akitoshi Kawamura, Hiroyuki Ota:
Small Complexity Classes for Computable Analysis. MFCS (2) 2014: 432-444 - [i13]Akitoshi Kawamura, Arno Pauly:
On function spaces and polynomial-time computability. CoRR abs/1401.2861 (2014) - [i12]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A lower bound on opaque sets. CoRR abs/1403.3894 (2014) - [i11]Akitoshi Kawamura, Yusuke Kobayashi:
Fence patrolling by mobile agents with distinct speeds. CoRR abs/1407.8194 (2014) - [i10]Akitoshi Kawamura, Makoto Soejima:
Simple strategies versus optimal schedules in multi-agent patrolling. CoRR abs/1411.6853 (2014) - 2013
- [c9]Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato:
Morpion Solitaire 5D: a new upper bound 121 on the maximum score. CCCG 2013 - [c8]Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson:
The Distance 4-Sector of Two Points Is Unique. ISAAC 2013: 612-622 - [i9]Akitoshi Kawamura, Stephen A. Cook:
Complexity Theory for Operators in Analysis. CoRR abs/1305.0453 (2013) - [i8]Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato:
Morpion Solitaire 5D: a new upper bound of 121 on the maximum score. CoRR abs/1307.8192 (2013) - [i7]Akitoshi Kawamura, Jean-Yves Marion, David Nowak:
Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13). NII Shonan Meet. Rep. 2013 (2013) - 2012
- [j7]Akitoshi Kawamura, Stephen A. Cook:
Complexity Theory for Operators in Analysis. TOCT 4(2): 5:1-5:24 (2012) - [c7]Akitoshi Kawamura, Yusuke Kobayashi:
Fence Patrolling by Mobile Agents with Distinct Speeds. ISAAC 2012: 598-608 - [c6]Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler:
Computational Complexity of Smooth Differential Equations. MFCS 2012: 578-589 - [c5]Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco:
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. WAOA 2012: 93-106 - [i6]Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler:
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime. CoRR abs/1211.4974 (2012) - 2011
- [j6]Akitoshi Kawamura:
Generalized Semimagic Squares for Digital Halftoning. Theory Comput. Syst. 49(3): 632-638 (2011) - 2010
- [j5]Akitoshi Kawamura:
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. Computational Complexity 19(2): 305-332 (2010) - [j4]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. Comput. Geom. 43(9): 713-720 (2010) - [j3]Yohji Akama, Kei Irie, Akitoshi Kawamura, Yasutaka Uwano:
VC Dimensions of Principal Component Analysis. Discrete & Computational Geometry 44(3): 589-598 (2010) - [c4]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. Symposium on Computational Geometry 2010: 210-215 - [c3]Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama:
Zone diagrams in Euclidean spaces and in other normed spaces. Symposium on Computational Geometry 2010: 216-221 - [c2]
- [i5]Akitoshi Kawamura:
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. CoRR abs/1004.4622 (2010) - [i4]
2000 – 2009
- 2009
- [j2]
- [c1]Akitoshi Kawamura:
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. IEEE Conference on Computational Complexity 2009: 149-160 - [i3]Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama:
Zone Diagrams in Euclidean Spaces and in Other Normed Spaces. CoRR abs/0912.3016 (2009) - [i2]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-Sectors Exist. CoRR abs/0912.4164 (2009) - 2007
- [i1]Akitoshi Kawamura:
Differential Recursion and Differentially Algebraic Functions. CoRR abs/0704.0301 (2007) - 2005
- [j1]Akitoshi Kawamura:
Type-2 Computability and Moore's Recursive Functions. Electr. Notes Theor. Comput. Sci. 120: 83-95 (2005)
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-01-25 20:29 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
