• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2008 Fiscal Year Final Research Report

Randomness as Quantitative Computational Resource : Efficient Usage and Limitations

Research Project

  • PDF
Project/Area Number 18500006
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionThe University of Electro-Communications

Principal Investigator

TARUI Jun  The University of Electro-Communications, 電気通信学部, 准教授 (00260539)

Project Period (FY) 2006 – 2008
Keywords計算量理論 / ランダマイズドアルゴリズム / 乱拓計算 / 回路計算量 / 領域計算量
Research Abstract

ネットワークを流れて次から次にやってくる膨大なデータに対する効率的計算が可能なのはどのような場合か?このような『ストリーム計算』と呼ばれる計算モデルにおいて、重複データを特定する問題を解析した。アルゴリズムが使えるランダムビット数と計算に必要なメモリー量のトレードオフを数学的に解明することに成功した。この他にもいくつかの具体的計算課題において計算に必要なランダムネスの量を解明すること成功した。関連する回路計算量の問題についてもいくつかの興味深い結果を得ることに成功した。

  • Research Products

    (10 results)

All 2009 2008 2007 2006 Other

All Journal Article (4 results) (of which Peer Reviewed: 4 results) Presentation (5 results) Remarks (1 results)

  • [Journal Article] Linear size log depth negation limited inverter for k-tonic binary sequences2009

    • Author(s)
      H. Morizumi and J. Tarui
    • Journal Title

      Theoretical Computer Science 410(11)

      Pages: 1054--1060

    • Peer Reviewed
  • [Journal Article] Negation Limited Complexity of Parity and Inverters2009

    • Author(s)
      K. Iwama, H. Morizumi, and J. Tarui
    • Journal Title

      Algorithmica 54(2)

      Pages: 256-267

    • Peer Reviewed
  • [Journal Article] On the Minimum Number of Completely 3-scrambling Permutations2008

    • Author(s)
      J. Tarui
    • Journal Title

      Discrete Mathematics 308(8)

      Pages: 1350-1354

    • Peer Reviewed
  • [Journal Article] Reductions for Monotone Boolean Circuits2008

    • Author(s)
      K. Iwama, H. Morizumi, and J. Tarui
    • Journal Title

      Theoretical Computer Science 408(2-3)

      Pages: 208-212

    • Peer Reviewed
  • [Presentation] Smallest Formulas for Parity of 2k2008

    • Author(s)
      J. Tarui
    • Organizer
      Proc. of COCOON08
    • Place of Presentation
      (LNCS vol 5092)(92-99)
    • Year and Date
      2008-06-29
  • [Presentation] A Well-Mixed Function with Circuit Complexity 5n±o(n)2008

    • Author(s)
      K. Amano and J. Tarui
    • Organizer
      Tightness of the Lachish Raz Type Bounds. Proc. of TAMC08
    • Place of Presentation
      LNCS vol 4978, 342-350
    • Year and Date
      2008-04-27
  • [Presentation] Linear Size Log Depth Negation Limited Inverter for k Tonic Binary Sequences2007

    • Author(s)
      H. Morizumi and J. Tarui
    • Organizer
      Proc. of TAMC07
    • Place of Presentation
      (LNCS vol 4484)(605-615)
    • Year and Date
      2007-05-25
  • [Presentation] Finding a Duplicate and a Missing Item in a Stream2007

    • Author(s)
      J. Tarui
    • Organizer
      Proc. of TAMC07
    • Place of Presentation
      (LNCS vol 4484)(128-135)
    • Year and Date
      2007-05-22
  • [Presentation] Negation Limited Complexity of Parity and Inverters2006

    • Author(s)
      K. Iwama, H. Morizumi, and J. Tarui
    • Organizer
      Proc. of ISAAC06
    • Place of Presentation
      (LNCS vol 4288)(223-232)
    • Year and Date
      20061618
  • [Remarks]

    • URL

      http://www.jtlab.ice.uec.ac.jp/

URL: 

Published: 2010-06-10   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi