IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 13 of 13  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2023-12-22
15:25		 Miyazaki Miyazaki Univ. Machinaka Campus The ultimate signs of second-order holonomic sequences
Akitoshi Kawamura, Fugen Hagihara (Kyoto Univ.) COMP2023-25		 A real-valued sequence ${f(n)} _{n in mathbb{N}}$ is said to be second-order holonomic if it satisfies a linear recurren... [more] COMP2023-25
pp.56-60
COMP 2022-10-26
16:30		 Fukuoka Kyusyu Univ. Nishijin Plaza COMP2022-19 The sum approximation (from below) of an irrational number $alpha$ is the function that, given a nonnegative number $n$,... [more] COMP2022-19
pp.30-31
COMP, IPSJ-AL 2016-06-25
15:05		 Ishikawa   Computational Complexity of Sequential Token Swapping Problem
Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takashi Horiyama (Saitama Univ.), Akitoshi Kawamura (Univ. of Tokyo), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (UEC), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2016-13		 We consider a puzzle consisting of colored tokens on an $n$-vertex graph, where each token has a distinct starting verte... [more] COMP2016-13
pp.115-121
COMP 2015-12-01
15:40		 Osaka   Polynomial-time computable measure and randomness
Akitoshi Kawamura (U Tokyo) COMP2015-35		  [more] COMP2015-35
pp.27-28
COMP, IPSJ-AL 2014-06-14
10:30		 Ehime Matsuyama, Ehime On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity
Shuichi Hirahara, Akitoshi Kawamura (Univ. of Tokyo) COMP2014-12		 Allender, Friedman, and Gasarch recently proved an upper bound of PSPACE
for the class $DTTR_K$
of decidable language... [more]		 COMP2014-12
pp.77-83
COMP 2014-04-24
10:20		 Miyagi Tohoku University Thin strip graphs
Yota Otachi (JAIST), Akitoshi Kawamura (Univ. of Tokyo), Hidehiro Shinohara (Tohoku Univ.), Takashi Hayashi, Koichi Yamazaki (Gunma Univ.) COMP2014-1		 A unit disk graph is a emph{$c$-strip graph} if it has a unit disk representation in which all centers of the unit disks... [more] COMP2014-1
pp.1-4
COMP 2013-06-24
10:00		 Nara Nara Women's University Morpion Solitaire: a new upper bound 121 of the maximum score
Akitoshi Kawamura (Univ. of Tokyo), Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato (Osaka Prefecture Univ.) COMP2013-19		 Morpion Solitaire is a pencil-and-paper game for a single player, popular in several countries including
France. A move... [more]		 COMP2013-19
pp.1-6
COMP 2011-12-16
17:15		 Aichi Nagoya Univ. [Invited Talk] Research Story on Distance Trisector Curves: How was it born and developed?
Tetsuo Asano (JAIST), Takeshi Tokuyama (Tohoku Univ.), Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Tokyo) COMP2011-46		 It is easy to draw a bisecting line for two points in the plane. Is it also easy to draw two curves between two points t... [more] COMP2011-46
p.71
COMP 2011-10-21
14:25		 Miyagi Tohoku Univ. Complexity Theory for Operators in Analysis
Akitoshi Kawamura (Univ. of Tokyo), Stephen Cook (Univ. of Toronto) COMP2011-32		 We propose a new framework for discussing the computational complexity of problems involving uncountably many objects, s... [more] COMP2011-32
pp.25-32
COMP 2010-01-25
10:55		 Fukuoka Nishijin Plaza, Kyushu University Distance k-Sectors Exist
Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ.), Daniel Reem (Technion - Israel Inst. of Tech.) COMP2009-41		 The bisector of two nonempty sets P and Q in a metric space is the set of all points with equal distance to P and to Q. ... [more] COMP2009-41
pp.17-22
COMP 2010-01-25
11:30		 Fukuoka Nishijin Plaza, Kyushu University Zone Diagrams in Euclidean Spaces and in Other Normed Spaces
Akitoshi Kawamura (Univ. of Toronto.), Takeshi Tokuyama (Tohoku Univ.), Jiri Matousek (Charles Univ./ETH Zurich) COMP2009-42		 Zone diagram is a variation on the classical concept of a Voronoi diagram. Given n sites in a metric space that compete ... [more] COMP2009-42
pp.23-28
NLP 2010-01-21
15:20		 Gifu   Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete
Akitoshi Kawamura (U. Toronto) NLP2009-145		 In answer to Ko's question raised in 1983, we show that an initial value problem given by a polynomial-time computable, ... [more] NLP2009-145
pp.31-36
COMP 2007-12-14
15:25		 Hiroshima Hiroshima University Computational Complexity of Initial-Value Problems with the Lipschitz Condition
Akitoshi Kawamura (Toronto) COMP2007-52		 We show, in answer to Ko's 1983 question, that an initial value problem given by a polynomial-time computable, Lipschitz... [more] COMP2007-52
pp.29-34
 Results 1 - 13 of 13  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan