Tetsuo Ida - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Morley s theorem revisited: Origami construction and automated proofTetsuo Ida, Asem Kasem, Fadoua Ghourabi, Hidekazu Takahashi. JSC, 46(5):571-583, 2011. [doi]

Proof Assistant Decision Procedures for Formalizing OrigamiCezary Kaliszyk, Tetsuo Ida. mkm 2011: 45-57 [doi]

Origami axioms and circle extensionAsem Kasem, Fadoua Ghourabi, Tetsuo Ida. SAC 2011: 1106-1111 [doi]

2010

12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2010, Timisoara, Romania, 23-26 September 2010Tetsuo Ida, Viorel Negru, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Daniela Zaharie, editors, IEEE Computer Society, 2010.

Origami fold as algebraic graph rewritingTetsuo Ida, Hidekazu Takahashi. JSC, 45(4):393-413, 2010. [doi]

2009

Symbolic and algebraic methods in computational origami: invited talkTetsuo Ida. issac 2009: 3-4 [doi]

Origami fold as algebraic graph rewritingTetsuo Ida, Hidekazu Takahashi. SAC 2009: 1132-1137 [doi]

2008

Graph Rewriting in Computational OrigamiTetsuo Ida. synasc 2008: 20-27 [doi]

Computational Origami Construction as Constraint Solving and RewritingTetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fadoua Ghourabi. ENTCS, 216:31-44, 2008. [doi]

Computational origami environment on the webAsem Kasem, Tetsuo Ida. fcsc, 2(1):39-54, 2008. [doi]

2007

Logical and algebraic view of Huzita s origami axioms with applications to computational origamiFadoua Ghourabi, Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Asem Kasem. SAC 2007: 767-772 [doi]

Modeling Origami for Computational Construction and BeyondTetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi. iccsa (empty year): 653-665 [doi]

Modeling Origami and BeyondTetsuo Ida. synasc 2007: 13 [doi]

2006

Artificial Intelligence and Symbolic Computation, 8th International Conference, AISC 2006, Beijing, China, September 20-22, 2006, ProceedingsJacques Calmet, Tetsuo Ida, Dongming Wang, editors, Volume 4120 of Lecture Notes in Computer Science, Springer, 2006.

Computational Construction of a Maximum Equilateral Triangle Inscribed in an OrigamiTetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi, Asem Kasem. icms 2006: 361-372 [doi]

Tiers of webOrigami ProgrammingTetsuo Ida. synasc 2006: 11 [doi]

2005

Computational Origami of a Morley s TriangleTetsuo Ida, Hidekazu Takahashi, Mircea Marin. mkm 2005: 267-282 [doi]

Rule-Based Programming with sigma-LogMircea Marin, Tetsuo Ida. synasc 2005: 31-38 [doi]

2004

Proving and Constraint Solving in Computational OrigamiTetsuo Ida, Dorin Tepeneu, Bruno Buchberger, Judit Robu. AISC 2004: 132-142 [doi]

Computational Origami Construction of a Regular Heptagon with Automated Proof of Its CorrectnessJudit Robu, Tetsuo Ida, Dorin Tepeneu, Hidekazu Takahashi, Bruno Buchberger. adg 2006: 19-33 [doi]

2003

Constraint Functional Logic Programming for Origami ConstructionTetsuo Ida, Mircea Marin, Hidekazu Takahashi. aplas 2003: 73-88 [doi]

2002

Reducing Search Space in Solving Higher-Order EquationsTetsuo Ida, Mircea Marin, Taro Suzuki. dsp 2002: 19-30 [doi]

Functional Logic Origami ProgrammingTetsuo Ida. aplas 2002: 114

2001

2000

An Open Environment for Cooperative Equational SolvingTetsuo Ida, Mircea Marin. aplas 2000: 163-166

Higher-order Lazy Narrowing Calculi in PerspectiveMircea Marin, Tetsuo Ida, Taro Suzuki. wflp 2000: 238-252

Cooperative Constraint Functional Logic ProgrammingMircea Marin, Tetsuo Ida. wflp 2000: 382-390

1999

On Reducing the Search Space of Higher-Order Lazy NarrowingMircea Marin, Tetsuo Ida, Taro Suzuki. FLOPS 1999: 319-334

1997

Leftmost Outside-In Narrowing CalculiTetsuo Ida, Koichi Nakahara. JFP, 7(2):129-161, 1997.

The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer ProgrammingQiang Li, Yike Guo, Tetsuo Ida, John Darlington. issac 1997: 331-338

Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic LanguageTaro Suzuki, Koji Nakagawa, Tetsuo Ida. icalp 1997: 99-113

1996

Lazy Narrowing: Strong Completeness and Eager Variable EliminationAart Middeldorp, Satoshi Okui, Tetsuo Ida. TCS, 167(1&2):95-130, 1996. [doi]

1995

A Complete Narrowing Calculus for Higher-Order Functional Logic ProgrammingKoichi Nakahara, Aart Middeldorp, Tetsuo Ida. plilp 1995: 97-114

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

Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand SidesTaro Suzuki, Aart Middeldorp, Tetsuo Ida. RTA 1995: 179-193

1992

G-system: A Functionally-Based Communication System Model for Parallel ProcessingMyuhng Joo Kim, Chu Shik Jhon, Tetsuo Ida. ifip 1992: 170-178

1984

Comparison of Closure Reduction and Combinatory Reduction SchemesTetsuo Ida, Akihiko Konagaya. rims 1986: 261-291

Functional Programming with Streams, Part IITetsuo Ida, Jiro Tanaka. ngc, 2(3):262-275, 1984.

1983

Some FP Algebra with Currying OperationTetsuo Ida. ipl, 17(5):259-261, 1983.

Functional Programming with StreamsTetsuo Ida, Jiro Tanaka. ifip 1983: 265-270

1982

Design of a Lisp Machine - FLATSEiichi Goto, T. Soma, N. Inada, Tetsuo Ida, M. Idesawa, Kei Hiraki, M. Suzuki, Kentaro Shimizu, B. Philipov. lfp 1982: 208-215

1981

Software-Fault Detector for MicroprocessorsKozo Itano, Tetsuo Ida. sigsmall 1981: 64-70

1979

FLATS, a Machine for Numerical, Symbolic and Associative ComputingEiichi Goto, Tetsuo Ida, Kei Hiraki. isca 1979: 102-110

1977

Parallel Hashing AlgorithmsEiichi Goto, Tetsuo Ida, Takao Gunji. ipl, 6(1):8-13, 1977.

Performance of Parallel Hash Hardware with Key DeletionTetsuo Ida, Eiichi Goto. ifip11-9 1977: 643-647