Rchr
J-GLOBAL ID:200901043987898940
Update date: Jan. 30, 2024
TARUI JUN
タルイ ジュン | TARUI JUN
Affiliation and department:
Job title:
Associate Professor
Homepage URL (1):
http://www.jtlab.cei.uec.ac.jp
Research field (2):
Mathematical informatics
, Information theory
Research keywords (3):
computational complexity
, 計算量理論
, アルゴリズム
Research theme for competitive and other funds (8):
- 2012 - 2017 Exploring the Limits of Computation in the Scenario of Constrained Work Space
- 2013 - 2016 Study of Circuit Complexity Using Polynomial Representations of Boolean Functions
- 2010 - 2012 Propositional Proof Complexity: Analysis fromComputational Complexity Perspectives
- 2007 - 2009 Improvement and extension of maximum-clique-finding algorithms with complexity analysis and their applications
- 2004 - 2007 量子論理回路の最適化に関する研究
- 1997 - 1998 計算量の理論-下界の証明・計算量の正確な決定・最適アルゴリズムの一意性の問題
- 1994 - 1995 組合せ論的計算量の理論-特に下界の証明と最適アルゴリズムの-意性の問題
- 1994 - 1995 Development and Evaluations of Efficient Algorithms for Combinatorial Optimization Problems
Show all
Papers (38):
-
M. Kiyomi, H. Ono, Y. Otachi, P. Schweitzer, J. Tarui. Space-Efficient Algorithms for Longest Increasing Subsequence. Theory of Computing Systems https://doi.org/10.1007/s00224-018-09908-6. 2019. First Online:. 22 January 2019. 1-20
-
M. Kiyomi, H. Ono, Y. Otachi, P. Schweitzer, J. Tarui. Space-Efficient Algorithms for Longest Increasing Subsequence. Proceedings of STACS2018: 35th International Symposium on Theoretical Aspects of Computer Science. 2018. 44:1-44:15
-
Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara. Depth-First Search Using O(n) Bits. ALGORITHMS AND COMPUTATION, ISAAC 2014. 2014. 8889. 553-564
-
Akinobu Miyata, Jun Tarui, Etsuji Tomita. Learning Boolean functions in AC(0) on attribute and classification noise-Estimating an upper bound on attribute and classification noise. THEORETICAL COMPUTER SCIENCE. 2011. 412. 35. 4650-4660
-
Kazuyuki Amano, Jun Tarui. A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds. THEORETICAL COMPUTER SCIENCE. 2011. 412. 18. 1646-1651
more...
MISC (7):
-
垂井淳. [京都賞業績紹介]A.C.ヤオ/通信計算量理論:ヤオの卓越した独創の産物. 数学セミナー2022年1月号 https://amzn.to/3v13ibP. 2022. 20-25
-
Jun Tarui. Google Scholar Profile. Google Scholar. 2018
-
Jun Tarui. Google Scholar Profile: http://scholar.google.co.jp/citations?user=7hrsV9cAAAAJ. 2018
-
垂井淳. P≠NP予想,代数的計算量. 数学セミナー2013年12月号:P≠NP予想特集号. 2013. 52. 12. 18-22
-
Mitusnori Ogihara, Jun Tarui. Theory and Applications of Models of Computation 2011 Preface. THEORETICAL COMPUTER SCIENCE. 2013. 505. 1-1
more...
Books (1):
-
Proceedings of TAMC2011: Theory and Applications of Models of Computation, 8th Annual Conference (Tokyo, Japan, May 23-25, 2011).
Springer-Verlag 2011
Lectures and oral presentations (14):
-
Expanders and Computational Complexity Theory
(2023)
-
ブログは研究に役立つか?どのように?
(国際学術情報流通基盤整備事業(SPARC Japan)2015年第3回セミナー招待講演(会場:国立情報学研究所) 2016)
-
計算量理論のいろんな話題
(計算量理論秋学校講演(熱海, 9月24日--26日, 2012) 2012)
-
計算の複雑さと証明の複雑さ
(京大数理解析研究所研究集会「証明論と複雑性」(9月12日--14日, 2012) 2012)
-
Complexity of Finding a Duplicate in a Stream
(NII Shonan Meeting: "Large-Scale Distributed Computation" 2012)
more...
Education (2):
- - 1991 University of Rochester Department of Computer Science
- - 1985 The University of Tokyo Faculty of Education
Professional career (3):
- MS in Computer Science (University of Rochester)
- MA in Mathematics (University of Rochester)
- PhD in Computer Science (University of Rochester)
Work history (4):
- 2010/04/01 - 電気通信大学情報理工学研究科 准教授
- 2008/05/01 - 2010/03/31 電気通信大学電気通信学研究科 准教授
- 1993/10/01 - 2008/04/30 電気通信大学電気通信学部 講師
- 1991/10/01 - 1993/09/30 University of Warwick (United Kingdom) Lecturer
Association Membership(s) (6):
情報処理学会
, 電子情報通信学会
, LA シンポジウム
, EATCS
, IEEE
, ACM
Return to Previous Page