![]() | ![]() |
| 2011 | ||
|---|---|---|
| 52 | 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 | |
| 51 | Cezary Kaliszyk, Tetsuo Ida: Proof Assistant Decision Procedures for Formalizing Origami. Calculemus/MKM 2011: 45-57 | |
| 50 | Asem Kasem, Fadoua Ghourabi, Tetsuo Ida: Origami axioms and circle extension. SAC 2011: 1106-1111 | |
| 49 | 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) | |
| 2010 | ||
| 48 | 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 | |
| 47 | Fadoua Ghourabi, Tetsuo Ida, Asem Kasem: Proof Documents for Automated Origami Theorem Proving. Automated Deduction in Geometry 2010: 78-97 | |
| 46 | Tetsuo Ida, Hidekazu Takahashi: Origami fold as algebraic graph rewriting. J. Symb. Comput. 45(4): 393-413 (2010) | |
| 2009 | ||
| 45 | 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 | |
| 44 | Tetsuo Ida: Symbolic and algebraic methods in computational origami: invited talk. ISSAC 2009: 3-4 | |
| 43 | Tetsuo Ida, Hidekazu Takahashi: Origami fold as algebraic graph rewriting. SAC 2009: 1132-1137 | |
| 42 | Tetsuo Ida: A Compiler for Origami Construction and Verification. SYNASC 2009: 9 | |
| 2008 | ||
| 41 | Tetsuo Ida: Graph Rewriting in Computational Origami. SYNASC 2008: 20-27 | |
| 40 | Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fadoua Ghourabi: Computational Origami Construction as Constraint Solving and Rewriting. Electr. Notes Theor. Comput. Sci. 216: 31-44 (2008) | |
| 39 | Asem Kasem, Tetsuo Ida: Computational origami environment on the web. Frontiers of Computer Science in China 2(1): 39-54 (2008) | |
| 2007 | ||
| 38 | Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi: Modeling Origami for Computational Construction and Beyond. ICCSA (2) 2007: 653-665 | |
| 37 | 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 | |
| 36 | Tetsuo Ida: Modeling Origami and Beyond. SYNASC 2007: 13 | |
| 2006 | ||
| 35 | Jacques Calmet, Tetsuo Ida, Dongming Wang: Artificial Intelligence and Symbolic Computation, 8th International Conference, AISC 2006, Beijing, China, September 20-22, 2006, Proceedings Springer 2006 | |
| 34 | 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 | |
| 33 | Tetsuo Ida: Tiers of webOrigami Programming. SYNASC 2006: 11 | |
| 2005 | ||
| 32 | Tetsuo Ida, Hidekazu Takahashi, Mircea Marin: Computational Origami of a Morley's Triangle. MKM 2005: 267-282 | |
| 31 | Mircea Marin, Tetsuo Ida: Rule-Based Programming with sigma-Log. SYNASC 2005: 31-38 | |
| 2004 | ||
| 30 | Tetsuo Ida, Dorin Tepeneu, Bruno Buchberger, Judit Robu: Proving and Constraint Solving in Computational Origami. AISC 2004: 132-142 | |
| 29 | 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 | |
| 2003 | ||
| 28 | Tetsuo Ida, Mircea Marin, Hidekazu Takahashi: Constraint Functional Logic Programming for Origami Construction. APLAS 2003: 73-88 | |
| 2002 | ||
| 27 | Tetsuo Ida: Functional Logic Origami Programming. APLAS 2002: 114 | |
| 26 | Tetsuo Ida, Mircea Marin, Taro Suzuki: Reducing Search Space in Solving Higher-Order Equations. Progress in Discovery Science 2002: 19-30 | |
| 2001 | ||
| 25 | Norio Kobayashi, Mircea Marin, Tetsuo Ida: Collaborative Constraint Functional Logic Programming in an Open Environment. APLAS 2001: 49-59 | |
| 24 | Tetsuo Ida, Mircea Marin, Taro Suzuki: Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations. EUROCAST 2001: 479-493 | |
| 23 | Qiang Li, Yike Guo, John Darlington, Tetsuo Ida: Minimised Geometric Buchberger Algorithm for Integer Programming. Annals OR 108(1-4): 87-109 (2001) | |
| 22 | Tetsuo Ida: Hot Topics in Reduction Strategies - A Panelist's View. Electr. Notes Theor. Comput. Sci. 57: 192-195 (2001) | |
| 2000 | ||
| 21 | Tetsuo Ida, Mircea Marin: An Open Environment for Cooperative Equational Solving. APLAS 2000: 163-166 | |
| 20 | Mircea Marin, Tetsuo Ida, Taro Suzuki: Higher-order Lazy Narrowing Calculi in Perspective. WFLP 2000: 238-252 | |
| 19 | Mircea Marin, Tetsuo Ida: Cooperative Constraint Functional Logic Programming. WFLP 2000: 382-390 | |
| 1999 | ||
| 18 | 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 | ||
| 17 | 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 | |
| 16 | Qiang Li, Yike Guo, Tetsuo Ida, John Darlington: The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming. ISSAC 1997: 331-338 | |
| 15 | Tetsuo Ida, Koichi Nakahara: Leftmost Outside-In Narrowing Calculi. J. Funct. Program. 7(2): 129-161 (1997) | |
| 1996 | ||
| 14 | Aart Middeldorp, Satoshi Okui, Tetsuo Ida: Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theor. Comput. Sci. 167(1&2): 95-130 (1996) | |
| 1995 | ||
| 13 | Koichi Nakahara, Aart Middeldorp, Tetsuo Ida: A Complete Narrowing Calculus for Higher-Order Functional Logic Programming PLILP 1995: 97-114 | |
| 12 | Taro Suzuki, Aart Middeldorp, Tetsuo Ida: Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. RTA 1995: 179-193 | |
| 11 | Satoshi Okui, Aart Middeldorp, Tetsuo Ida: Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). TAPSOFT 1995: 394-408 | |
| 1992 | ||
| 10 | 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 | |
| 1984 | ||
| 9 | Tetsuo Ida, Akihiko Konagaya: Comparison of Closure Reduction and Combinatory Reduction Schemes. RIMS Symposia on Software Science and Engineering 1984: 261-291 | |
| 8 | Tetsuo Ida, Jiro Tanaka: Functional Programming with Streams, Part II. New Generation Comput. 2(3): 262-275 (1984) | |
| 1983 | ||
| 7 | Tetsuo Ida, Jiro Tanaka: Functional Programming with Streams. IFIP Congress 1983: 265-270 | |
| 6 | Tetsuo Ida: Some FP Algebra with Currying Operation. Inf. Process. Lett. 17(5): 259-261 (1983) | |
| 1982 | ||
| 5 | Eiichi Goto, T. Soma, N. Inada, Tetsuo Ida, M. 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 | ||
| 4 | Kozo Itano, Tetsuo Ida: Software-Fault Detector for Microprocessors. SIGSMALL/SIGMOD Symposium 1981: 64-70 | |
| 1979 | ||
| 3 | Eiichi Goto, Tetsuo Ida, Kei Hiraki: FLATS, a Machine for Numerical, Symbolic and Associative Computing. ISCA 1979: 102-110 | |
| 1977 | ||
| 2 | Tetsuo Ida, Eiichi Goto: Performance of Parallel Hash Hardware with Key Deletion. IFIP Congress 1977: 643-647 | |
| 1 | Eiichi Goto, Tetsuo Ida, Takao Gunji: Parallel Hashing Algorithms. Inf. Process. Lett. 6(1): 8-13 (1977) | |
Colors in the list of coauthors
Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page