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->

Technical Committee on Theoretical Foundations of Computing (COMP)  (Searched in: 2011)

Search Results: Keywords 'from:2011-10-21 to:2011-10-21'
[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 8 of 8  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2011-10-21
10:00		 Miyagi Tohoku Univ. Memory-Constrained Algorithms for Shortest Path Problem
Tetsuo Asano (JAIST), Benjamin Doerr (MPI) COMP2011-28		 This paper presents a space-efficient algorithm for finding a shortest
path in a grid graph whose size is $\sqrt{n}\tim... [more]		 COMP2011-28
pp.1-5
COMP 2011-10-21
10:35		 Miyagi Tohoku Univ. Fast Algorithm for Finding a Graph Node with High Closeness Centrality
Koji Tabata, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) COMP2011-29		 The Closeness Centrality is one of centrality measures of a node in a graph.
It is calculated as the reciprocal of the ... [more]		 COMP2011-29
pp.7-14
COMP 2011-10-21
11:10		 Miyagi Tohoku Univ. An Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem
Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-30		 This report presents a result for polynomial-time solvability of the maximum clique problem, that is:for any pair of ver... [more] COMP2011-30
pp.15-22
COMP 2011-10-21
13:10		 Miyagi Tohoku Univ. [Fellow Memorial Lecture] Personal View on Research in Computational Complexity Theory
Osamu Watanabe (Tokyo Tech) COMP2011-31		 For those not experts in computational complexity theory, it may be a bit mysterious how researchers in this field pursu... [more] COMP2011-31
p.23
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 2011-10-21
15:00		 Miyagi Tohoku Univ. Vertex Angle and Crossing Angle Resolution of Leveled Tree Drawings
Walter Didimo (Univ. of Perugia), Michael Kaufmann (Univ. of Tuebingen), Giuseppe Liotta (Univ. of Perugia), Yoshio Okamoto (JAIST), Andreas Spillner (Univ. of Greifswald) COMP2011-33		  [more] COMP2011-33
pp.33-38
COMP 2011-10-21
15:50		 Miyagi Tohoku Univ. Memory Compression
Wing-Kin Sung (NUS), Kunihiko Sadakane (NII), Jesper Jansson (Ochanomizu U.) COMP2011-34		 This paper proposes a new dynamic data-structure
for \emph{compressed random access memory}.
A memory (or string) $T[1... [more]		 COMP2011-34
pp.39-46
COMP 2011-10-21
16:25		 Miyagi Tohoku Univ. Maximization of Gross Substitutes Utility Function under Budget Constraints
Akiyoshi Shioura (Tohoku Univ.) COMP2011-35		  [more] COMP2011-35
pp.47-54
 Results 1 - 8 of 8  /   
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