default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTetsuo Ida
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c50]Tetsuo Ida:
An e-origami artwork of a big wing crane. SCSS (Work in Progress) 2024: 34-45- [e15]Stephen M. Watt
, Tetsuo Ida:
Symbolic Computation in Software Science - 10th International Symposium, SCSS 2024, Tokyo, Japan, August 28-30, 2024, Proceedings. Lecture Notes in Computer Science 14991, Springer 2024, ISBN 978-3-031-69041-9 [contents] - 2023
- [j15]Adel Bouhoula, Bruno Buchberger, Tetsuo Ida, Temur Kutsia:
Preface. Ann. Math. Artif. Intell. 91(5): 563-565 (2023) - [j14]Adel Bouhoula, Bruno Buchberger, Tetsuo Ida, Temur Kutsia:
Correction to: Preface. Ann. Math. Artif. Intell. 91(5): 567 (2023) - 2021
- [c49]Tetsuo Ida, Hidekazu Takahashi:
A New Modeling of Classical Folds in Computational Origami. ADG 2021: 41-53 - 2020
- [b1]Tetsuo Ida:
An Introduction to Computational Origami - A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria. Texts & Monographs in Symbolic Computation, Springer 2020, ISBN 978-3-319-59188-9, pp. 1-201
2010 – 2019
- 2019
- [j13]Pascal Schreck, Tetsuo Ida, Laura Kovács:
Foreword - Formalization of geometry, automated and interactive geometric reasoning. Ann. Math. Artif. Intell. 85(2-4): 71-72 (2019) - 2017
- [c48]Tetsuo Ida, Stephen M. Watt:
Origami folds in higher-dimension. SCSS 2017: 83-95 - [c47]Tetsuo Ida:
Models of Computation for Origami. SYNASC 2017: 23-25 - [e14]Tudor Jebelean, Viorel Negru, Dana Petcu, Daniela Zaharie, Tetsuo Ida, Stephen M. Watt:
19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017, Timisoara, Romania, September 21-24, 2017. IEEE Computer Society 2017, ISBN 978-1-5386-2626-9 [contents] - 2016
- [j12]Jacques D. Fleuriot, Tetsuo Ida:
Preface to the special issue on geometric reasoning. Ann. Math. Artif. Intell. 77(1-2): 155-156 (2016) - [c46]Tetsuo Ida:
Revisit of "Geometric Exercise in Paper Folding" from a Viewpoint of Computational Origami. SYNASC 2016: 23-28 - [e13]James H. Davenport, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016, Timisoara, Romania, September 24-27, 2016. IEEE 2016, ISBN 978-1-5090-5707-8 [contents] - 2015
- [j11]Tetsuo Ida, Fadoua Ghourabi, Kazuko Takahashi:
Formalizing polygonal knot origami. J. Symb. Comput. 69: 93-108 (2015) - [e12]Laura Kovács, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, Timisoara, Romania, September 21-24, 2015. IEEE Computer Society 2015, ISBN 978-1-5090-0461-4 [contents] - 2014
- [c45]Tetsuo Ida:
Huzita's Basic Origami Fold in Geometric Algebra. SYNASC 2014: 11-13 - [e11]Franz Winkler, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014, Timisoara, Romania, September 22-25, 2014. IEEE Computer Society 2014, ISBN 978-1-4799-8447-3 [contents] - 2013
- [c44]Fadoua Ghourabi, Tetsuo Ida, Kazuko Takahashi:
Logical and Algebraic Views of a Knot Fold of a Regular Heptagon. SCSS 2013: 50-63 - [c43]Tetsuo Ida, Fadoua Ghourabi, Kazuko Takahashi:
Knot Fold of Regular Polygons: Computer-Assisted Construction and Verification. SYNASC 2013: 12-19 - [e10]Tetsuo Ida, Jacques D. Fleuriot:
Automated Deduction in Geometry - 9th International Workshop, ADG 2012, Edinburgh, UK, September 17-19, 2012. Revised Selected Papers. Lecture Notes in Computer Science 7993, Springer 2013, ISBN 978-3-642-40671-3 [contents] - [e9]Nikolaj S. Bjørner, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013, Timisoara, Romania, September 23-26, 2013. IEEE Computer Society 2013, ISBN 978-1-4799-3035-7 [contents] - [e8]Adel Bouhoula, Tetsuo Ida, Fairouz Kamareddine:
Proceedings Fourth International Symposium on Symbolic Computation in Software Science, SCSS 2012, Gammarth, Tunisia, 15-17 December 2012. EPTCS 122, 2013 [contents] - 2012
- [c42]Tetsuo Ida:
Interactive vs. Automated Proofs in Computational Origami. SYNASC 2012: 7 - [e7]Andrei Voronkov, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012, Timisoara, Romania, September 26-29, 2012. IEEE Computer Society 2012, ISBN 978-1-4673-5026-6 [contents] - 2011
- [j10]Tetsuo Ida, Asem Kasem, Fadoua Ghourabi, Hidekazu Takahashi:
Morley's theorem revisited: Origami construction and automated proof. J. Symb. Comput. 46(5): 571-583 (2011) - [c41]Cezary Kaliszyk, Tetsuo Ida:
Proof Assistant Decision Procedures for Formalizing Origami. Calculemus/MKM 2011: 45-57 - [c40]Asem Kasem, Fadoua Ghourabi, Tetsuo Ida:
Origami axioms and circle extension. SAC 2011: 1106-1111 - [e6]Dongming Wang, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2011, Timisoara, Romania, September 26-29, 2011. IEEE Computer Society 2011, ISBN 978-1-4673-0207-4 [contents] - 2010
- [j9]Tetsuo Ida, Hidekazu Takahashi:
Origami fold as algebraic graph rewriting. J. Symb. Comput. 45(4): 393-413 (2010) - [c39]Fadoua Ghourabi, Tetsuo Ida, Asem Kasem:
Proof Documents for Automated Origami Theorem Proving. Automated Deduction in Geometry 2010: 78-97 - [e5]Tetsuo Ida, Viorel Negru, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie:
12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2010, Timisoara, Romania, 23-26 September 2010. IEEE Computer Society 2010, ISBN 978-0-7695-4324-6 [contents]
2000 – 2009
- 2009
- [c38]Tetsuo Ida:
Symbolic and algebraic methods in computational origami: invited talk. ISSAC 2009: 3-4 - [c37]Tetsuo Ida, Hidekazu Takahashi:
Origami fold as algebraic graph rewriting. SAC 2009: 1132-1137 - [c36]Tetsuo Ida:
A Compiler for Origami Construction and Verification. SYNASC 2009: 9 - [e4]Stephen M. Watt, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Daniela Zaharie:
11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2009, Timisoara, Romania, September 26-29, 2009. IEEE Computer Society 2009, ISBN 978-1-4244-5910-0 [contents] - 2008
- [j8]Asem Kasem, Tetsuo Ida:
Computational origami environment on the web. Frontiers Comput. Sci. China 2(1): 39-54 (2008) - [c35]Tetsuo Ida:
Graph Rewriting in Computational Origami. SYNASC 2008: 20-27 - 2007
- [c34]Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi:
Modeling Origami for Computational Construction and Beyond. ICCSA (2) 2007: 653-665 - [c33]Fadoua Ghourabi, Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Asem Kasem:
Logical and algebraic view of Huzita's origami axioms with applications to computational origami. SAC 2007: 767-772 - [c32]Tetsuo Ida:
Modeling Origami and Beyond. SYNASC 2007: 13 - [c31]Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fadoua Ghourabi:
Computational Origami Construction as Constraint Solving and Rewriting. WFLP@RDP 2007: 31-44 - 2006
- [c30]Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi, Asem Kasem:
Computational Construction of a Maximum Equilateral Triangle Inscribed in an Origami. ICMS 2006: 361-372 - [c29]Tetsuo Ida:
Tiers of webOrigami Programming. SYNASC 2006: 11 - [e3]Jacques Calmet, Tetsuo Ida, Dongming Wang:
Artificial Intelligence and Symbolic Computation, 8th International Conference, AISC 2006, Beijing, China, September 20-22, 2006, Proceedings. Lecture Notes in Computer Science 4120, Springer 2006, ISBN 3-540-39728-0 [contents] - 2005
- [j7]Tetsuo Ida:
In memoriam: Professor Eiichi Goto. SIGSAM Bull. 39(3): 71-72 (2005) - [c28]Tetsuo Ida, Hidekazu Takahashi, Mircea Marin:
Computational Origami of a Morley's Triangle. MKM 2005: 267-282 - [c27]Mircea Marin, Tetsuo Ida:
Rule-Based Programming with sigma-Log. SYNASC 2005: 31-38 - 2004
- [c26]Judit Robu, Tetsuo Ida, Dorin Tepeneu, Hidekazu Takahashi, Bruno Buchberger:
Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness. Automated Deduction in Geometry 2004: 19-33 - [c25]Tetsuo Ida, Dorin Tepeneu, Bruno Buchberger, Judit Robu:
Proving and Constraint Solving in Computational Origami. AISC 2004: 132-142 - 2003
- [c24]Tetsuo Ida, Mircea Marin, Hidekazu Takahashi:
Constraint Functional Logic Programming for Origami Construction. APLAS 2003: 73-88 - 2002
- [c23]Tetsuo Ida:
Functional Logic Origami Programming. APLAS 2002: 114 - [c22]Tetsuo Ida, Mircea Marin, Taro Suzuki:
Reducing Search Space in Solving Higher-Order Equations. Progress in Discovery Science 2002: 19-30 - 2001
- [j6]Qiang Li, Yike Guo, John Darlington, Tetsuo Ida:
Minimised Geometric Buchberger Algorithm for Integer Programming. Ann. Oper. Res. 108(1-4): 87-109 (2001) - [c21]Norio Kobayashi, Mircea Marin, Tetsuo Ida:
Collaborative Constraint Functional Logic Programming in an Open Environment. APLAS 2001: 49-59 - [c20]Tetsuo Ida, Mircea Marin, Taro Suzuki:
Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations. EUROCAST 2001: 479-493 - [c19]Tetsuo Ida:
Hot Topics in Reduction Strategies - A Panelist's View. WRS 2001: 192-195 - 2000
- [c18]Tetsuo Ida, Mircea Marin:
An Open Environment for Cooperative Equational Solving. APLAS 2000: 163-166 - [c17]Mircea Marin, Tetsuo Ida, Taro Suzuki:
Higher-order Lazy Narrowing Calculi in Perspective. WFLP 2000: 238-252 - [c16]Mircea Marin, Tetsuo Ida:
Cooperative Constraint Functional Logic Programming. WFLP 2000: 382-390
1990 – 1999
- 1999
- [c15]Mircea Marin, Tetsuo Ida, Taro Suzuki:
On Reducing the Search Space of Higher-Order Lazy Narrowing. Fuji International Symposium on Functional and Logic Programming 1999: 319-334 - 1997
- [j5]Tetsuo Ida, Koichi Nakahara:
Leftmost Outside-In Narrowing Calculi. J. Funct. Program. 7(2): 129-161 (1997) - [c14]Taro Suzuki, Koji Nakagawa, Tetsuo Ida:
Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language. ALP/HOA 1997: 99-113 - [c13]Qiang Li, Yike Guo, Tetsuo Ida, John Darlington:
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming. ISSAC 1997: 331-338 - [e2]Tetsuo Ida, Atsushi Ohori, Masato Takeichi:
Functional and Logic Programming, Proceedings of the Second Fuji International Workshop, Shonan Village Center, Japan, 1-4 November 1996. World Scientific 1997, ISBN 981-02-2923-2 [contents] - 1996
- [j4]Aart Middeldorp, Satoshi Okui, Tetsuo Ida:
Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theor. Comput. Sci. 167(1&2): 95-130 (1996) - 1995
- [c12]Koichi Nakahara, Aart Middeldorp, Tetsuo Ida:
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming. PLILP 1995: 97-114 - [c11]Taro Suzuki, Aart Middeldorp, Tetsuo Ida:
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. RTA 1995: 179-193 - [c10]Satoshi Okui, Aart Middeldorp, Tetsuo Ida:
Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). TAPSOFT 1995: 394-408 - [c9]Aart Middeldorp, Satoshi Okui, Tetsuo Ida:
Lazy Narrowing: Strong Completeness and Eager Variable Elimination. UNIF 1995: 43-46 - [e1]Masato Takeichi, Tetsuo Ida:
Functional and Logic Programming, Proceedings of the Fuji International Workshop, Susono, Japan, 17-19 July 1995. World Scientific 1995, ISBN 981-02-2437-0 [contents] - 1994
- [c8]Makoto Amamiya, Masahiko Satoh, Akifumi Makinouchi, Ken-Ichi Hagiwara, Taiichi Yuasa, Hitoshi Aida, Kazunori Ueda, Keijiro Araki, Tetsuo Ida, Takanobu Baba:
Research on programming languages for massively parallel processing. ISPAN 1994: 443-450 - 1992
- [c7]Myuhng Joo Kim, Chu Shik Jhon, Tetsuo Ida:
G-system: A Functionally-Based Communication System Model for Parallel Processing. IFIP Congress (1) 1992: 170-178
1980 – 1989
- 1984
- [j3]Tetsuo Ida, Jiro Tanaka:
Functional Programming with Streams, Part II. New Gener. Comput. 2(3): 262-275 (1984) - [c6]Tetsuo Ida, Akihiko Konagaya:
Comparison of Closure Reduction and Combinatory Reduction Schemes. RIMS Symposia on Software Science and Engineering 1984: 261-291 - 1983
- [j2]Tetsuo Ida:
Some FP Algebra with Currying Operation. Inf. Process. Lett. 17(5): 259-261 (1983) - [c5]Tetsuo Ida, Jiro Tanaka:
Functional Programming with Streams. IFIP Congress 1983: 265-270 - 1982
- [c4]Eiichi Goto, Takashi Soma, N. Inada, Tetsuo Ida, Masanori Idesawa, Kei Hiraki, M. Suzuki, Kentaro Shimizu, B. Philipov:
Design of a Lisp Machine - FLATS. Symposium on LISP and Functional Programming 1982: 208-215 - 1981
- [c3]Kozo Itano, Tetsuo Ida:
Software-Fault Detector for Microprocessors. SIGSMALL/SIGMOD Symposium 1981: 64-70
1970 – 1979
- 1979
- [c2]Eiichi Goto, Tetsuo Ida, Kei Hiraki:
FLATS, a Machine for Numerical, Symbolic and Associative Computing. ISCA 1979: 102-110 - 1977
- [j1]Eiichi Goto, Tetsuo Ida, Takao Gunji:
Parallel Hashing Algorithms. Inf. Process. Lett. 6(1): 8-13 (1977) - [c1]Tetsuo Ida, Eiichi Goto:
Performance of Parallel Hash Hardware with Key Deletion. IFIP Congress 1977: 643-647
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
