Search Results1-2 of  2

  • TAKENAGA Yasuhiko ID: 1000020236491

    UEC (2012 from CiNii)

    Articles in CiNii:27

    • NP-Completeness of Maximum Chain Problem on Puyopuyo (2006)
    • Recognizing Ordered Tree-Shellable Boolean Functions Based on OBDDs (Foundations of Computer Science) (2000)
    • Recognition of Ordered Tree-Shellable Functions Based on OBDDs (Algorithm Engineering as a New Paradigm) (2001)
  • TAKENAGA Yasuhiko ID: 9000014350237

    Department of Computer Science and Information Mathematics, University of Electro-Communications (1998 from CiNii)

    Articles in CiNii:28

    • On Tree-Shellable Boolean Functions (1998)
    • Computational Power of a Memory - Based Parallel Computation Model with Content Addressable Memory (1992)
    • A Memory - Type Parallel Computation Model and Its Computation Power -Yet Another Approach to Supercomputing- (1990)
Page Top