Publications – research papers

2017

  • T. Ida, S. M. Watt, Origami folds in higher-dimension. SCSS 2017: The 8th International Symposium on Symbolic Computation in Software Science 2017, April 6-9, 2017, Gammarth, Tunisia), pp. 83-95, http://dblp.uni-trier.de/rec/bi b/conf/sycss/IdaW17

2016

  • T Ida, Revisit of “Geometric Exercise in Paper Folding” from a Viewpoint of Computational Origami, Post-Proceedings of SYNASC 2016: The 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, September 24-27, 2016, pp. 23-28, IEEE Computer Society Conference Publishing Services (CPS), 2016, doi://10.1109/SYNASC.2016 .017
  • T. Ida, J. Fleuriot, F. Ghourabi, A New Formalization of Origami in Geometric Algebra, Proceedings of ADG 2016: The 11th International Workshop on Automated Deduction in Geometry, Strasbourg, France, June 27-29, 2016, pp. 117—136, 2016,
    https://hal.inria.fr/hal-013343 34/file/ADG2016-Proceedings%20. pdf.


2015

  • F. Ghourabi, T. Ida, K. Takahashi, Interactive Construction and Automated Proof in Eos System with Application to Knot Fold of Regular Polygons. Origami6: Proceedings of the Sixth International Meeting on Origami Science, Mathematics, and Education (6OSME). Part I: Mathematics, pp. 55-66, American Mathematical Society, 2015.
  • T. Ida and F. Ghourabi, Polygonal Knot by Computational Origami, Symmetry: Culture and Science, Vol. 26, No. 2, pp. 171-187, 2015.
  • T. Ida, F. Ghourabi, Verified Construction of Polygonal Knots, Proceedings of the 12th International Mathematica Symposium (IMS 2015), CDROM-publication, 2015.
  • T. Ida, Huzita’s Basic Origami Fold in Geometric Algebra, Post-Proceedings of SYNASC 2014: The 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.11-13, IEEE Computer Society Conference Publishing Services (CPS), 2015.

2014

  • T. Ida, F. Ghourabi and K. Takahashi, Formalizing Polygonal Knot Origami, Journal of Symbolic Computation, Vol. 69, pp. 93 -108, 2014.
  • T. Ida, Knot Fold of Regular Polygons: Computer-Assisted Construction and Verification, Post-Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2013), pp.12 – 19, IEEE Computer Society Conference Publishing Services (CPS), 2014.

2013

  • F. Ghourabi, T. Ida and K. Takahashi, Logical and Algebraic Views of a Knot Fold of a Regular Heptagon, Proceedings of the International Symposium on Symbolic Computation in Software Science (SCSS 2013), EPiC Series 15, pp. 50 – 63, 2013.

2012

  • T. Ida, Interactive vs. Automated Proofs in Computational Origami, Post-Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012.

2011

  • C. Kaliszyk and T. Ida, Proof Assistant Decision Procedures for Formalization of Origami, Proceedings of the 4th Conference on Intelligent Computer Mathematics, Lecture Notes in Computer Science, Vol. 6624, Springer-Verlag, pp.45 – 57, 2011.
  • A. Kasem, F. Ghourabi and T. Ida, Origami Axioms and Circle Extension, Proceedings of the 26th Annual ACM Symposium on Applied Computing, pp. 1106 -1111, 2011.
  • T. Ida, A. Kasem, F. Ghourabi, H. Takahashi, Morley’s Theorem Revisited: Origami Construction and Automated Proof, Journal of Symbolic Computation, Vol. 46, pp. 162 – 170, 2011.
  • F. Ghourabi, T. Ida and A. Kasem, Proof Documents for Automated Origami Theorem Proving, : Post-Proceedings of the 8th International Workshop on Automated Deduction in Geometry (ADG 2010), Lecture Notes in Computer Science, Vol. 6877, Springer-Verlag, pp. 78-97, 2011.

2010

H. Takahashi and T. Ida， Modelling of Computational Origami by Graph Rewriting and Its Realization, Computer Software, Vol. 27, pp. 2 – 13, 2010. (in Japanese)

T. Ida and H. Takahashi, Origami Fold as Algebraic Graph Rewriting, Journal of Symbolic Computation, Vol. 45, No. 4, pp. 393 – 413, 2010.

  • A. Kasem and T. Ida, Extended Web Services for Computational Origami, Proceedings of the Austrian-Japanese Workshop on Symbolic Computation in Software Science (SCSS 2010), 2010.

2009

  • T. Ida, Graph Rewriting in Computational Origami, Post-Proceedings of the 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2008), IEEE Computer Society Conference Publishing Services (CPS), pp. 20 -27, 2009.
  • T. Ida, Symbolic and Algebraic Methods in Computational Origami (Invited Talk), Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation (ISSAC 2009), ACM, pp. 3 – 4, 2009.
  • T. Ida, et al., Computational Origami System Eos, Origami 4 (selected papers from the Fourth International Meeting of Origami, Science, Mathematics, and Education), A K Peters Ltd., pp. 285 – 293, 2009.
  • T. Ida and H. Takahashi, Origami Fold as Algebraic Graph Rewriting, Proceedings of the 24th Annual ACM, Symposium on Applied Computing (SAC 2009). ACM Press, pages 1132 -1138, 2009.

2008

  • A. Kasem and T. Ida, Computational Origami Environment on the Web, Frontiers of Computer Science in China, Vol. 2, No. 1, pp. 39-54, 2008.
  • T. Ida, M. Marin, H. Takahashi and F. Ghourabi, Computational Origami Construction as Constraint Solving and Rewriting, Electronic Notes in Theoretical Computer Science, Vol. 216, pp. 31 – 44, 2008.
  • T. Ida, Modeling Origami and Beyond, Post-Proceedings of the 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007), IEEE Computer Society Conference Publishing Services (CPS), p. 13, 2008.

2007

  • F. Ghourabi, T. Ida, H. Takahashi, M. Marin and A. Kasem, Logical and Algebraic View of Huzita’s Origami Axioms with Applications to Computational Origami, Proceedings of the 22nd Annual ACM, Symposium on Applied Computing (SAC 2007). ACM Press, pp. 767-772, 2007.
  • T. Ida, H. Takahashi, M. Marin and F. Ghourabi, Modelling Origami for Computational Construction and Beyond, International Conference on Computational Science and Its Applications 2007 (ICCSA 2007) Lecture Notes in Computer Science, Vol. 4151, Springer-Verlag, pp. 653 – 665, 2007.
  • T. Ida, Tiers of webOrigami Programming, Post-Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), I EEE Computer Society Conference Publishing Services (CPS), p. 4, 2007.

2006

  • J. Robu, T. Ida, D. Tepeneu, H. Takahashi and B. Buchberger, Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness, Post-Proceedings of the 5th International Workshop on Automated Deduction in Geometry (ADG 2004), Lecture Notes in Computer Science, Vol. 3763, pp. 19-33, 2006.
  • T. Ida, H. Takahashi, M. Marin, A. Kasem and F. Ghourabi, Computational Construction of a Maximal Equilateral Triangle Inscribed in an Origami, Proceedings of the Second International Congress on Mathematical Software  (ICMS 2006), Lecture Notes in Computer Science, Vol. 4151, pp. 361-372, 2006.
  • T. Ida, M. Marin and H. Takahashi, Computational Origami of a Morley’s Triangle, Selected and Revised Papers of the 4th International Conference on Mathematical Knowledge Management (MKM 2005), Lecture Notes in Artificial Intelligence, Vol. 3863, pp. 267-282. 2006.
  • M. Marin and T. Ida, Progress of rho-Log, a rule-based programming system. Mathematica in Education and Research, Vol. 11, No. 1, pp. 50-66, 2006.
  • M. Marin and T. Ida, Rule-Based Programming with rho-Log. Post-Proceedings of the 7th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), IEEE Computer Society Conference Publishing Services (CPS), pp. 31 38, 2006.

2005

  • T. Ida, H. Takahashi, D. Tepeneu and M. Marin, Morley’s Theorem Revisited through Computational Origami, Proceedings of 7th International Mathematica Symposium (IMS 2005), CDROM-publication, 2005.
  • M. Marine and T. Ida, Rule-based Framework for Automated Reasoning, Proceedings of the 7th Asian Symposium on Computer Mathematics (ASCM 2005), pp. 28-31, 2005.


2004

  • T. Ida, D. Tepeneu, B. Buchberger and J. Robu, Proving and Constraint Solving in Computational Origami, Post-Proceeding of the 7th International Symposium on Artificial Intelligence and Symbolic Computation (AISC 2004), Lecture Notes in Artificial Intelligence, Vol. 3249, Springer-Verlag, pp. 132-142, 2004.
  • B. Buchberger and T. Ida, Computational Origami: Interaction of Solving, Proving and Computing, Proceedings of World Conference on 21st Century Mathematics 2004, pp. 37 – 51, 2004.
  • D. Tepeneu and T. Ida, MathGridLink – Connecting Mathematica to “the Grid”, Proceedings of the 6th International Mathematica Symposium (IMS 2004), 2004.
  • H. Takahashi, D. Tepeneu and T. Ida, A System for Computational Origami – progress report, Proceedings of the 6th International Mathematica Symposium (IMS 2004) , 2004.

2003

  • N. Kobayashi, M. Marin and T. Ida A Web Oriented System for Equational Solving, Proceedings of the 12th International Workshop on Functional and (Constraint) Logic Programming, pp. 309 – 312, 2003.
  • T. Ida, M. Marin and H. Takahashi, Constraint Functional Logic Programming for Origami Construction, The First Asian Symposium on Programming Languages and Systems (APLAS 2003), Lecture Notes in Computer Science, Vol. 2895, Springer-Verlag, pp. 73 – 88, 2003
  • H. Takahashi and T. Ida, Origami Programming Environment, Proceedings of the 5th International Mathematica Symposium (IMS 2003), pp. 413 – 420, 2003.
  • T. Ida and M. Marin, Functional Logic Origami Programming with Open CFLP, Proceedings of the 5th International Mathematica Symposium (IMS 2003), pp. 397 – 404, 2003.
  • N. Kobayashi, M. Marin and T. Ida, Collaborative Constraint Functional Logic Programming System in an Open Environment, IEICE Transactions on Information and Systems, Vol. E86-D, No. 1, pp. 63 – 70, 2003.

2002

  • T. Ida, Equational Reasoning in Programming, Proceedings of the 7th Asian Technology Conference in Mathematics 2002, pp. 22 – 34, 2002
  • T. Ida and M. Marin, Constraint Functional Logic Programming for Origami Construction, Analele Universitatii din Timisoara de Vest, Vol. XL, Fasc. Special, 2002, Seria Mathematica-Informatica, pp. 93 – 112, 2002.
  • N. Kobayashi, M. Marin, T. Ida and Z. Che, Open CFLP: An Open System for Collaborative Constraint Functional Logic Programming, Proceedings of the 11th International Workshop on Functional and (constraint) Logic Programming (WFLP 2002), pp. 229 – 232, 2002.
  • T. Ida, M. Marin and T. Suzuki, Reducing Search Space in Solving Higher-Order Equations, Progress in Discovery Science 2001, Lecture Notes in Artificial Intelligence, Vol. 2281, Springer-Verlag, pp. 19 – 30, 2002.

2001

  • M. Marin, T. Ida and W. Schreiner, CFLP: a Mathematica Implementation of a Distributed Constraint Solving System, The Mathematica Journal, Vol. 8, No. 2, pp. 287 – 300,. 2001.
  • T. Ida, M. Marin and T. Suzuki, Higher-order Lazy Narrowing Calculus: a Solver for Higher-Order Equations, Computer Aided Systems Theory – EUROCAST 2001, Lecture Notes in Computer Science, Vol. 2178, Springer-Verlag, pp. 478 – 493, 2001.
  • T. Ida, N. Kobayashi and M. Marin, An Open Environment for Cooperative Scientific Problem Solving, Proceedings of the 4th International Mathematica Symposium (IMS 2001), pp. 71 – 78, 2001.
  • T. Ida, M. Marin and N. Kobayashi, An Open Environment for Cooperative Equational Solving, International Software Engineering Symposium 2001 (ISES’01), Wuhan University Journal of Natural Sciences, Vol. 6, No. 1 – 2, pp. 169 – 174, 2001.
  • T. Ida, N. Kobayashi and M. Marin, Collaborative Constraint Functional Logic Programming in an Open Environment, Analele Universitatii din Timisoara, Vol. XXXIX, Fasc. Special, 2001, Seria Mathematica- Informatica, pp. 69 – 80, 2001.
    (Proceedings of the Third International Workshop on Symbolic and Numeric Algorithms on Scientific Computing (SYNASC 2001))
  • Q. Li, Y. Guo, J. Darlington and T. Ida, Minimised Geometric Buchberger Algorithm for Integer Programming, Annals of Operations Research, Vol. 108, pp. 87 – 109, 2001.

2000

  • M. Marin, T. Ida and T. Suzuki, Cooperative Constraint Functional Logic Programming, International Symposium on Principles of Software Evolution (ISPSE 2000), pp. 223 – 230, 2000.
  • M. Marin and T. Ida Cooperative Constraint Functional Logic Programming, Proceedings of the 9th International Workshop on Functional and Logic Programming (WFLP 2000), pp. 382 – 390, 2000.
  • M. Marin, T. Ida and T. Suzuki, Higher-order Lazy Narrowing Calculi in Perspective, Proceedings of the 9th International Workshop on Functional and Logic Programming (WFLP 2000), pp. 238 – 253, 2000.
  • Q. Li, Y. Guo and T. Ida, Modelling Integer Programming with Logic: Language and Implementation, IEICE Transactions of Fundamentals of Electronics, Communications and Computer Sciences, Vol. E83-A, No. 8, pp. 1673 – 1680, 2000.

1999

  • M. Marin, T. Ida and T. Suzuki, On Reducing the Search Space of Higher-Order Lazy Narrowing, Proceedings of The International Symposium on Functional and Logic Programming (FLOPS’99), Lecture Notes in Computer Science, Vol. 1722, Springer-Verlag, pp. 225 – 240, 1999.
  • M. Marin, T. Ida and W. Schreiner, A Distributed Constraint Solving System for Functional Logic Programming, Proceedings of Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT’99), pp. 151 – 155, 1999.
  • M. Marin and W. Schreiner and T. Ida, CFLP: a Mathematica Implementation of a Distributed Constraint Solving System, The Third International Mathematica Symposium (IMS’99), Computational Mechanics Publications, WIT Press, 1999.
  • Q. Li, Y. Guo and T. Ida, Transformation of Logical Specification into IP-formulas, The Third International Mathematica Symposium (IMS’99), Computational Mechanics Publications, WIT Press, 1999.
  • T. Ida, Lazy Narrowing Calculus and Equational Problem Solving , International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC’99), 1999
  • H. Ohsaki, A. Middeldorp and T. Ida, Persistence in Equational Rewriting, Computer Software, Vol. 16, No.1, pp. 33 – 45, 1999. (in Japanese)

1998

  • M. Hamada and T. Ida, Deterministic and Non-deterministic Lazy Conditional Narrowing and their Implementations, Transactions of Information Processing Society of Japan, Vol. 39, No. 3, pp. 656 – 663, 1998
  • Q. Li, F. Janssen and Z. Yang, ILIN: An Implementation of the Integer Labeling Algorithm for Integer Programming, IEICE Transactions of Fundamentals of Electronics, Communications and Computer Sciences, Vol. E81-A, No. 2, pp. 304 – 309, 1998.

1997

  • Q. Li, Y. Guo and T. Ida, A Parallel Algebraic Approach Towards Integer Programming, Proceedings of the 9th IASTED International Conference Parallel and Distributed Computing and Systems (PDCS’97), pp. 59 – 64, 1997.
  • T. Suzuki and K. Nakagawa and T. Ida, Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language, Proceedings of the 6th International Joint Conference, ALP’97 – HOA’97, Lecture Notes in Computer Science, Vol. 1298, Springer-Verlag, pp. 99 – 113, 1997.
  • Q. Li, Y. Guo, T. Ida and J. Darlington, The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC 97), pp. 331 – 338, 1997.
  • T. Ida and K. Nakahara, Leftmost outside-in narrowing calculi, Journal of Functional Programming, Vol. 7, No. 2, pp. 129-161, 1997.

1996

  • S. Okui, A. Middeldorp and T. Ida, Lazy Narrowing: Strong Completeness and Eager Variable Elimination, Theoretical Computer Science, Vol. 167, No. 1/2, pp. 95 -130, 1996.

1995

  • H. Ohsaki, A. Middeldorp and T. Ida, Distribution Elimination by Semantic Labelling: Methods for Proving Termination for Term Rewriting Systems, Computer Software, Vol. 13, No. 2, pp. 58 – 73, 1995. (in Japanese)
  • S. Sasaki and T. Ida, A Constraint Functional Logic Programming Language System and its Implementation,  Transactions of Information Processing Society of Japan, Vol. 36, No. 9, pp. 2152 – 2160, 1995. (in Japanese)
  • T. Yamada, A. Middeldorp and T. Ida, Modularity of Level-Confluence for Conditional Term Rewriting Systems, Computer Software, Vol. 12, No. 5, pp. 72 – 84, 1995. (in Japanese)
  •  M. Hamana, T. Nishioka, K. Nakahara, A. Middeldorp and T. Ida, Design and Implementation of a Functional-Logic Language Based on Applicative Term Rewriting Systems, Transactions of Information Processing Society of Japan, Vol. 36, No. 8, 1897 – 1905, 1995. (in Japanese)
  • S. Okui, A. Middeldorp and T. Ida, Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract), Proceedings of the 20th Colloquium On Trees In Algebra and Programming (CAAP), Lecture Notes in Computer Science, Vol. 915, Springer-Verlag, pp. 394 – 409, 1995.
  • K. Nakagawa, K. Nakahara, T. Suzuki and T. Ida, Lazy Narrowing Abstract Machine, IEICE Transactions on Information and Systems, Vol. J78-D-1, No. 5, pp. 467 – 477, 1995. (in Japanese)
  • T. Suzuki, A. Middeldorp and T. Ida, Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides, Proceedings of the 6th International Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, Vol. 914, Springer-Verlag, pp. 179 – 193, 1995.
  • K. Nakahara, A. Middeldorp and T. Ida, A Complete Narrowing Calculus for Higher-Order Functional Logic Programming, Proceedings of the 7th International Conference on Programming Languages: Implementations, Logics and Programs (PLILP’95), Lecture Notes in Computer Science, Vol. 982, Springer-Verlag, pp. 97 – 114, 1995.

1994

  • M. Amamiya et al., Research on Programming Languages for Massively Parallel Processing, Proceedings of International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), pp. 443 – 451, 1994.
  • T. Ida and S. Okui, Outside-in Conditional Narrowing, IEICE Transactions on Information and Systems, Vol. E77-D, No. 6, pp. 631- 641, 1994.


1992

  • T. Ida, A. Nakamura, T. Suzuki and K. Nakagawa Abstract Machine Approach to Operational Semantics of Prolog, Journal of Information Processing, Vol. 15, No. 4, pp. 545 – 553, 1992.
  • M. J. Kim, C. S. Jhon and T. Ida, G-system: A Functionality-based Communication System Model for Parallel Processing, Information Processing 92, Vol. 1, Elsevier Science Publishers B.V. (North Holland), pp. 170 – 178, 1992.


1990

  • T. Ida and T. Matsuno, Overview of MC/LISP, Journal of Information Processing, Vol. 13, No. 3, pp. 304 – 317, 1990.
  • T. Ida, T. Matsuno and A. Nakamura, Implementing Lisp and Prolog on a Common Abstract Machine: A Practical Approach to Combining Functional and Logic Programming, Declarative systems, Elsevier Science Publishers B.V. (North Holland), pp. 227 – 252, 1990. (IFIP WG 10.1 Workshop on Concepts and Characteristics of Declarative Systems, 1988)

1988

  • T. Ida, A. Aiba and Y. Toyama, T: A Simple Reduction Language Based on Combinatory Term Rewriting, Programming of Future Generation Computers, K. Fuchi and M. Nivat (eds.), Elsevier Science Publishers B.V. (North Holland), pp. 217 – 236, 1988.


1987

  • T. Ida, An Interpretation of LISP by the Lambda Calculus and Cartesian Closed Categories with Implementation Consideration, Computer Software, Vol. 4, No.4, pp. 33 – 44, 1987. (in Japanese)

1985

  • T. Ida and A. Konagaya, Comparison of Closure Reduction and Combinatory Reduction Schemes, RIMS Symposia on Software Science and Engineering II, Lecture Notes in Computer Science, Vol. 220, Springer-Verlag, pp. 261 – 291, 1985.


1984

  •  T. Ida and J. Tanaka, Functional Programming with Streams – part II -, New Generation Computing, Vol. 2, No. 3, pp. 261 – 275, 1984.


1983

  • T. Ida, Some FP algebra with Currying Operation, Information Processing Letters, Vol. 17, No. 5, pp. 259 – 261, 1983.
  • T. Ida and J. Tanaka, Functional Programming with Streams, Information Processing 83: Proceedings of the IFIP 9th World Computer Congress, pp. 265 – 270, 1983.


1982

  • E. Ida, T. Soma, N. Inada, T. Ida, M. Idesawa, K. Hiraki, N. Suzuki, K. Shimizu and B. Philipov, Design of a Lisp Machine FLATS, Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming, pp. 208 – 215, 1982.


1981

  • T. Ida and K. Itano, Associative Descriptor Scheme – for the Exploitation of Address Arithmetic in Lisp, Journal of Information Processing, Vol. 4, No. 3, pp. 147 – 151, 1981.
  • T. Soma, T. Ida, N. Inada and M. Idesawa, The Virtual Plane Concept in Image Processing, Real-time/Parallel Computing Image Analysis (Eds. M. Onoe et al.), Plenum Press, pp.193 – 202, 1981.
  • K. Itano and T. Ida, Software Fault Detector for Microprocessors, Joint Proceedings of Sigsmall Symposium on Small Systems and Sigmod Workshop on Small Data Base Systems, pp. 64 – 70, 1981.

1980

  • T. Ida, Hashing Hardware and its Application to Symbol Manipulation, Proceedings of the International Workshop on High-level Language Computer Architecture, Fort Lauderdale, pp. 99 – 107, 1980.

1979

  • E. Goto, T. Ida, K. Hiraki, Suzuki and N. Inada, FLATS, a Machine for Numerical, Symbolic and Associative Computing, Proceedings of the 6th Annual Symposium on Computer Architecture sponsored by the IEEE Computer Society and ACM, pp. 102 – 110, 1979.

1978

  • T. Ida and E. Goto, Overflow Free and Variable Precision Computing in FLATS, Journal of Information Processing, Vol. 1, No. 3, pp. 140 – 142, 1978.
  • T. Ida and E. Goto, Parallel Hash Algorithms for Virtual Key Index Tables, Journal of Information Processing, Vol. 1, No. 3, pp. 130 – 137, 1978.
  • T. Ida and E. Goto, Analysis of Parallel Hashing Algorithms with Key Deletion, Journal of Information Processing, Vol. 1, No. 1, pp. 25 – 32, 1978.

1977

  • T. Ida and E. Goto, Performance of a Parallel Hash Hardware with Key Deletion, Information Processing 77, North Holland, pp. 643 – 647, 1977．
  • E. Goto, T. Ida and T. Gunji, Parallel Hashing Algorithms, Information Processing Letters, Vol. 6, No. 1, pp. 8 – 13, 1977.

1972

  • S. Kawai, E. Goto, M. Sassa, K. Itano, T. Ida and M. Yasumura, A Graphic System with Halftone and Area Coloring Capabilities, First USA-JAPAN Computer Conference Proceedings, pp. 320 – 324, 1972.