default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkitoshi Kawamura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c27]Mika Hirvensalo, Akitoshi Kawamura, Igor Potapov, Takao Yuyama:
Reachability in Linear Recurrence Automata. RP 2024: 167-183- [c26]Akitoshi Kawamura
:
Proof of the Density Threshold Conjecture for Pinwheel Scheduling. STOC 2024: 1816-1819 - 2023
- [j20]Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi, Kazuhisa Makino:
Trade-offs among degree, diameter, and number of paths. Discret. Appl. Math. 327: 96-100 (2023) - [c25]Keita Hiroshima, Akitoshi Kawamura:
Elementarily Traceable Irrational Numbers. CiE 2023: 135-140 - 2022
- [j19]Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot:
Weight balancing on boundaries. J. Comput. Geom. 13(1): 1-12 (2022) - [c24]Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita:
Online Scheduling on Identical Machines with a Metric State Space. STACS 2022: 32:1-32:21 - 2020
- [j18]Akitoshi Kawamura, Makoto Soejima:
Simple strategies versus optimal schedules in multi-agent patrolling. Theor. Comput. Sci. 839: 195-206 (2020)
2010 – 2019
- 2019
- [j17]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A lower bound on opaque sets. Comput. Geom. 80: 13-22 (2019) - [j16]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. J. Graph Algorithms Appl. 23(1): 3-27 (2019) - [c23]Akitoshi Kawamura, Florian Steinberg, Holger Thies:
Second-Order Linear-Time Computability with Applications to Computable Analysis. TAMC 2019: 337-358 - [i19]Bruce M. Kapron, Akitoshi Kawamura, Florian Steinberg:
Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151). NII Shonan Meet. Rep. 2019 (2019) - 2018
- [j15]Shuichi Hirahara, Akitoshi Kawamura:
On characterizations of randomized computation using plain Kolmogorov complexity. Comput. 7(1): 45-56 (2018) - [c22]Akitoshi Kawamura, Holger Thies, Martin Ziegler:
Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. MFCS 2018: 30:1-30:17 - [c21]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
- [j14]Takashi Hayashi, Akitoshi Kawamura, Yota Otachi, Hidehiro Shinohara, Koichi Yamazaki:
Thin strip graphs. Discret. Appl. Math. 216: 203-210 (2017) - [j13]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) - [j12]Yasuhiko Asao, Erik D. Demaine, Martin L. Demaine, Hideaki Hosaka, Akitoshi Kawamura, Tomohiro Tachi, Kazune Takahashi:
Folding and Punching Paper. J. Inf. Process. 25: 590-600 (2017) - [j11]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
On the computational complexity of the Dirichlet Problem for Poisson's Equation. Math. Struct. Comput. Sci. 27(8): 1437-1465 (2017) - [c20]Akitoshi Kawamura, Florian Steinberg:
Polynomial Running Times for Polynomial-Time Oracle Machines. FSCD 2017: 23:1-23:18 - [c19]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
- [c18]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. CiE 2016: 142-152 - [c17]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A Lower Bound on Opaque Sets. SoCG 2016: 46:1-46:10 - [c16]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
Complexity Theory of (Functions on) Compact Metric Spaces. LICS 2016: 837-846 - 2015
- [j10]Akitoshi Kawamura, Yusuke Kobayashi:
Fence patrolling by mobile agents with distinct speeds. Distributed Comput. 28(2): 147-154 (2015) - [j9]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. Complex. 31(5): 689-714 (2015) - [j8]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) - [c15]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
- [j7]Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler:
Computational Complexity of Smooth Differential Equations. Log. Methods Comput. Sci. 10(1) (2014) - [c14]Akitoshi Kawamura, Arno Pauly:
Function Spaces for Second-Order Polynomial Time. CiE 2014: 245-254 - [c13]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. SoCG 2014: 436 - [c12]Shuichi Hirahara, Akitoshi Kawamura:
On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity. MFCS (2) 2014: 348-359 - [c11]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
- [c10]Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato:
Morpion Solitaire 5D: a new upper bound 121 on the maximum score. CCCG 2013 - [c9]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
- [j6]Akitoshi Kawamura, Stephen A. Cook:
Complexity Theory for Operators in Analysis. ACM Trans. Comput. Theory 4(2): 5:1-5:24 (2012) - [c8]Akitoshi Kawamura, Yusuke Kobayashi:
Fence Patrolling by Mobile Agents with Distinct Speeds. ISAAC 2012: 598-608 - [c7]Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler:
Computational Complexity of Smooth Differential Equations. MFCS 2012: 578-589 - [c6]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
- [b1]Akitoshi Kawamura:
Computational Complexity in Analysis and Geometry. University of Toronto, Canada, 2011 - [j5]Akitoshi Kawamura:
Generalized Semimagic Squares for Digital Halftoning. Theory Comput. Syst. 49(3): 632-638 (2011) - 2010
- [j4]Akitoshi Kawamura:
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. Comput. Complex. 19(2): 305-332 (2010) - [j3]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. Comput. Geom. 43(9): 713-720 (2010) - [j2]Yohji Akama, Kei Irie, Akitoshi Kawamura, Yasutaka Uwano:
VC Dimensions of Principal Component Analysis. Discret. Comput. Geom. 44(3): 589-598 (2010) - [c5]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. SCG 2010: 210-215 - [c4]Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama:
Zone diagrams in Euclidean spaces and in other normed spaces. SCG 2010: 216-221 - [c3]Akitoshi Kawamura, Stephen A. Cook:
Complexity theory for operators in analysis. STOC 2010: 495-502 - [i5]Akitoshi Kawamura:
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. CoRR abs/1004.4622 (2010) - [i4]Akitoshi Kawamura:
Generalized Semimagic Squares for Digital Halftoning. CoRR abs/1009.1373 (2010)
2000 – 2009
- 2009
- [j1]Akitoshi Kawamura:
Differential recursion. ACM Trans. Comput. Log. 10(3): 22:1-22:22 (2009) - [c2]Akitoshi Kawamura:
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. CCC 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) - 2004
- [c1]Akitoshi Kawamura:
Type-2 Computability and Moore's Recursive Functions. CCA 2004: 83-95
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
