- DNABased Parallel Computation by ``Counting'' Mitsunori Ogihara \Lambda Animesh Ray y
- Parallel Data Mining for Association Rules on Sharedmemory Multiprocessors \Lambda
- Reducing the Number of Solutions of NP Functions 1 Lane A. Hemaspaandra and Mitsunori Ogihara
- Equivalence of NC k and AC k \Gamma1 closures of NP and other classes
- The Minimum DNA Computation Model and Its Computational Power ?
- Universally Serializable Computation Lane A. Hemaspaandra \Lambda Mitsunori Ogihara y
- Simulating Boolean Circuits on a DNA Computer Mitsunori Ogihara \Lambda Animesh Ray y
- Competing Provers Yield Improved Karp--Lipton Collapse Results # JinYi Cai Venkatesan T. Chakaravarthy
- Breadth First Search 3SAT Algorithms for DNA Computers Mitsunori Ogihara
- Scalable Feature Mining for Sequential Data Mitsubishi Electric Research Lab.
- Clustering Distributed Homogeneous Datasets ? Srinivasan Parthasarathy and Mitsunori Ogihara
- Executing parallel logical operations with DNA Mitsunori Ogihara
- PlanMine: Predicting Plan Failures using Sequence Mining \Lambda
- SIGACT News Complexity Theory Column ?? Lane A. Hemaspaandra
- SPACE-EFFICIENT RECOGNITION OF SPARSE SELF-REDUCIBLE LANGUAGES
- On Helping by Paritylike Languages Mitsunori Ogihara 1
- Under consideration for publication in Knowledge and Information Parallel Data Mining for Association
- Executing parallel logical operations with DNA Mitsunori Ogihara
- Relating the Minimum Model for DNA Computation and Boolean Mitsunori Ogihara
- On Closure Properties of #P in the Context of PF #P
- RELATING EQUIVALENCE AND REDUCIBILITY TO SPARSE SETS ERIC ALLENDER
- A DNA-Based Random Walk Method for Solving k-SAT
- PolynomialTime Membership Comparable Sets Mitsunori Ogihara 1
- Generalized Theorems on the Relationships among Reducibility Notions to Certain Complexity Classes
- Detecting Emotion in Music Department of Computer Science
- New Algorithms for Fast Discovery of Association Rules \Lambda
- Circuit Evaluation: Thoughts on a Killer Application in DNA Mitsunori Ogihara \Lambda Animesh Ray y
- This is page 1 Printer: Opaque this
- Active Mining in a Distributed Setting S. Parthasarathy, S. Dwarkadas, M. Ogihara
- Theoretical Foundations of Association Rules Mohammed J. Zaki \Lambda and Mitsunori Ogihara y
- International Journal of Foundations of Computer Science fl World Scientific Publishing Company
- Reducibility Classes of P-selective Sets Lane A. Hemaspaandra y Albrecht Hoene z Mitsunori Ogihara x
- DNABased SelfPropagating Algorithm for Solving BoundedFanIn Boolean Circuits
- Relating the Minimum Model for DNA Computation and Boolean Mitsunori Ogihara \Lambda
- Breadth First Search 3SAT Algorithms for DNA Computers Mitsunori Ogihara
- Evaluation of Sampling for Data Mining of Association Rules \Lambda
- Mining Patterns from Case Base Analysis Tao Li Shenghuo Zhu Mitsuonri Ogihara
- The phase transition in random Horn satisfiability Gabriel Istrate Mitsunori Ogihara
- On Sparse Hard Sets for Counting Classes Mitsunori OGIWARA
- Characterizations of P C=Q Mitsunori OGIWARA
- Sparse Hard Sets for P Yield SpaceEfficient Algorithms Mitsunori Ogihara 1
- Sparse Hard Sets for P Dieter van Melkebeek
- Data Mining and Knowledge Discovery, 0, 1--32 (1998) fl 1998 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Mining Features for Sequence Classi cation Neal Lesh 1 , Mohammed J. Zaki 2 , Mitsunori Ogihara 3
- Biomolecular Computing---Recent Theoretical and Experimental Mitsunori Ogihara \Lambda A. Ray y
- Artificial Intelligence Review, 0, 1--25 (1999) fl 1999 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- The PL Hierarchy Collapses Mitsunori Ogihara
- Properties of Probabilistic Pushdown Automata Ioan I. Macarie and Mitsunori Ogihara
- A Complexity Theory for Feasible Closure Properties Mitsunori Ogiwara
- Biomolecular Computing---A Shape of Computation to Come M. Ogihara 1 A. Ray 2 K. Smith 3
- ON POLYNOMIAL-TIME BOUNDED TRUTH-TABLE REDUCIBILITY OF NP SETS TO SPARSE SETS
- A Relationship between Di erence Hierarchies and Relativized Polynomial Hierarchies
- Communication Complexity of Key Agreement on Small Ranges (Preliminary Version)
- Tally NP Sets and Easy Census Functions Judy Goldsmith 1
- A DNA-Based Random Walk Method for Solving k-SAT Sergio Diaz
- DNA-Based Self-Propagating Algorithm for Solving Bounded-Fan-In Boolean Circuits