Performance of Parallel Hash Hardware with Key Deletion. - Tetsuo Ida; Eiichi Goto (IFIP Congress, 1977)

Parallel Hashing Algorithms. - Eiichi Goto; Tetsuo Ida; Takao Gunji (Inf. Process. Lett., 1977)

FLATS, a Machine for Numerical, Symbolic and Associative Computing. - Eiichi Goto; Tetsuo Ida; Kei Hiraki (ISCA, 1979)

Software-Fault Detector for Microprocessors. - Kozo Itano; Tetsuo Ida (SIGSMALL/SIGMOD Symposium, 1981)

Design of a Lisp Machine - FLATS. - Eiichi Goto; Takashi Soma; N. Inada; Tetsuo Ida; Masanori Idesawa; Kei Hiraki; M. Suzuki; Kentaro Shimizu; B. Philipov (Symposium on LISP and Functional Programming, 1982)

Functional Programming with Streams. - Tetsuo Ida; Jiro Tanaka (IFIP Congress, 1983)

Some FP Algebra with Currying Operation. - Tetsuo Ida (Inf. Process. Lett., 1983)

Comparison of Closure Reduction and Combinatory Reduction Schemes. - Tetsuo Ida; Akihiko Konagaya (RIMS Symposia on Software Science and Engineering, 1984)

Functional Programming with Streams, Part II. - Tetsuo Ida; Jiro Tanaka (New Gener. Comput., 1984)

G-system: A Functionally-Based Communication System Model for Parallel Processing. - Myuhng Joo Kim; Chu Shik Jhon; Tetsuo Ida (IFIP Congress (1), 1992)

Research on programming languages for massively parallel processing. - Makoto Amamiya; Masahiko Satoh; Akifumi Makinouchi; Ken-Ichi Hagiwara; Taiichi Yuasa; Hitoshi Aida; Kazunori Ueda; Keijiro Araki; Tetsuo Ida; Takanobu Baba (ISPAN, 1994)

A Complete Narrowing Calculus for Higher-Order Functional Logic Programming - Koichi Nakahara; Aart Middeldorp; Tetsuo Ida (PLILP, 1995)

Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. - Taro Suzuki; Aart Middeldorp; Tetsuo Ida (RTA, 1995)

Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). - Satoshi Okui; Aart Middeldorp; Tetsuo Ida (TAPSOFT, 1995)

Lazy Narrowing: Strong Completeness and Eager Variable Elimination. - Aart Middeldorp; Satoshi Okui; Tetsuo Ida (Theor. Comput. Sci., 1996)

Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language. - Taro Suzuki; Koji Nakagawa; Tetsuo Ida (ALP/HOA, 1997)

The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming. - Qiang Li; Yike Guo; Tetsuo Ida; John Darlington (ISSAC, 1997)

Leftmost Outside-In Narrowing Calculi. - Tetsuo Ida; Koichi Nakahara (J. Funct. Program., 1997)

On Reducing the Search Space of Higher-Order Lazy Narrowing. - Mircea Marin; Tetsuo Ida; Taro Suzuki (Fuji International Symposium on Functional and Logic Programming, 1999)

An Open Environment for Cooperative Equational Solving. - Tetsuo Ida; Mircea Marin (APLAS, 2000)

Cooperative Constraint Functional Logic Programming. - Mircea Marin; Tetsuo Ida (WFLP, 2000)

Higher-order Lazy Narrowing Calculi in Perspective. - Mircea Marin; Tetsuo Ida; Taro Suzuki (WFLP, 2000)

Collaborative Constraint Functional Logic Programming in an Open Environment. - Norio Kobayashi; Mircea Marin; Tetsuo Ida (APLAS, 2001)

Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations. - Tetsuo Ida; Mircea Marin; Taro Suzuki (EUROCAST, 2001)

Minimised Geometric Buchberger Algorithm for Integer Programming. - Qiang Li; Yike Guo; John Darlington; Tetsuo Ida (Ann. Oper. Res., 2001)

Hot Topics in Reduction Strategies - A Panelist's View. - Tetsuo Ida (WRS, 2001)

Functional Logic Origami Programming. - Tetsuo Ida (APLAS, 2002)

Reducing Search Space in Solving Higher-Order Equations. - Tetsuo Ida; Mircea Marin; Taro Suzuki (Progress in Discovery Science, 2002)

Constraint Functional Logic Programming for Origami Construction. - Tetsuo Ida; Mircea Marin; Hidekazu Takahashi (APLAS, 2003)

Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness. - Judit Robu; Tetsuo Ida; Dorin Tepeneu; Hidekazu Takahashi; Bruno Buchberger (Automated Deduction in Geometry, 2004)

Proving and Constraint Solving in Computational Origami. - Tetsuo Ida; Dorin Tepeneu; Bruno Buchberger; Judit Robu (AISC, 2004)

Computational Origami of a Morley's Triangle. - Tetsuo Ida; Hidekazu Takahashi; Mircea Marin (MKM, 2005)

Rule-Based Programming with sigma-Log. - Mircea Marin; Tetsuo Ida (SYNASC, 2005)

In memoriam: Professor Eiichi Goto. - Tetsuo Ida (SIGSAM Bull., 2005)

Computational Construction of a Maximum Equilateral Triangle Inscribed in an Origami. - Tetsuo Ida; Hidekazu Takahashi; Mircea Marin; Fadoua Ghourabi; Asem Kasem (ICMS, 2006)

Tiers of webOrigami Programming. - Tetsuo Ida (SYNASC, 2006)

Modeling Origami for Computational Construction and Beyond. - Tetsuo Ida; Hidekazu Takahashi; Mircea Marin; Fadoua Ghourabi (ICCSA (2), 2007)

Logical and algebraic view of Huzita's origami axioms with applications to computational origami. - Fadoua Ghourabi; Tetsuo Ida; Hidekazu Takahashi; Mircea Marin; Asem Kasem (SAC, 2007)

Modeling Origami and Beyond. - Tetsuo Ida (SYNASC, 2007)

Computational Origami Construction as Constraint Solving and Rewriting. - Tetsuo Ida; Mircea Marin; Hidekazu Takahashi; Fadoua Ghourabi (WFLP@RDP, 2007)

Graph Rewriting in Computational Origami. - Tetsuo Ida (SYNASC, 2008)

Computational origami environment on the web. - Asem Kasem; Tetsuo Ida (Frontiers Comput. Sci. China, 2008)

Symbolic and algebraic methods in computational origami: invited talk. - Tetsuo Ida (ISSAC, 2009)

A Compiler for Origami Construction and Verification. - Tetsuo Ida (SYNASC, 2009)

Proof Documents for Automated Origami Theorem Proving. - Fadoua Ghourabi; Tetsuo Ida; Asem Kasem (Automated Deduction in Geometry, 2010)

Origami fold as algebraic graph rewriting. - Tetsuo Ida; Hidekazu Takahashi (J. Symb. Comput., 2010)

Proof Assistant Decision Procedures for Formalizing Origami. - Cezary Kaliszyk; Tetsuo Ida (Calculemus/MKM, 2011)

Origami axioms and circle extension. - Asem Kasem; Fadoua Ghourabi; Tetsuo Ida (SAC, 2011)

Morley's theorem revisited: Origami construction and automated proof. - Tetsuo Ida; Asem Kasem; Fadoua Ghourabi; Hidekazu Takahashi (J. Symb. Comput., 2011)

Interactive vs. Automated Proofs in Computational Origami. - Tetsuo Ida (SYNASC, 2012)

Logical and Algebraic Views of a Knot Fold of a Regular Heptagon. - Fadoua Ghourabi; Tetsuo Ida; Kazuko Takahashi 001 (SCSS, 2013)

Knot Fold of Regular Polygons: Computer-Assisted Construction and Verification. - Tetsuo Ida; Fadoua Ghourabi; Kazuko Takahashi 001 (SYNASC, 2013)

Huzita's Basic Origami Fold in Geometric Algebra. - Tetsuo Ida (SYNASC, 2014)

Formalizing polygonal knot origami. - Tetsuo Ida; Fadoua Ghourabi; Kazuko Takahashi 001 (J. Symb. Comput., 2015)

Revisit of "Geometric Exercise in Paper Folding" from a Viewpoint of Computational Origami. - Tetsuo Ida (SYNASC, 2016)

Preface to the special issue on geometric reasoning. - Jacques D. Fleuriot; Tetsuo Ida (Ann. Math. Artif. Intell., 2016)

Origami folds in higher-dimension. - Tetsuo Ida; Stephen M. Watt (SCSS, 2017)

Models of Computation for Origami. - Tetsuo Ida (SYNASC, 2017)

Foreword - Formalization of geometry, automated and interactive geometric reasoning. - Pascal Schreck; Tetsuo Ida; Laura Kovács (Ann. Math. Artif. Intell., 2019)

An Introduction to Computational Origami - A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria - Tetsuo Ida (Springer, 2020)

A New Modeling of Classical Folds in Computational Origami. - Tetsuo Ida; Hidekazu Takahashi (ADG, 2021)

Preface. - Adel Bouhoula; Bruno Buchberger; Tetsuo Ida; Temur Kutsia (Ann. Math. Artif. Intell., 2023)

Correction to: Preface. - Adel Bouhoula; Bruno Buchberger; Tetsuo Ida; Temur Kutsia (Ann. Math. Artif. Intell., 2023)

An e-origami artwork of a big wing crane. - Tetsuo Ida (SCSS (Work in Progress), 2024)