The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tetsuo Ida: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Judit Robu, Tetsuo Ida, Dorin Tepeneu, Hidekazu Takahashi, Bruno Buchberger
    Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness. [Citation Graph (0, 0)][DBLP]
    Automated Deduction in Geometry, 2004, pp:19-33 [Conf]
  2. Tetsuo Ida, Dorin Tepeneu, Bruno Buchberger, Judit Robu
    Proving and Constraint Solving in Computational Origami. [Citation Graph (0, 0)][DBLP]
    AISC, 2004, pp:132-142 [Conf]
  3. Taro Suzuki, Koji Nakagawa, Tetsuo Ida
    Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language. [Citation Graph (0, 0)][DBLP]
    ALP/HOA, 1997, pp:99-113 [Conf]
  4. Norio Kobayashi, Mircea Marin, Tetsuo Ida
    Collaborative Constraint Functional Logic Programming in an Open Environment. [Citation Graph (0, 0)][DBLP]
    APLAS, 2001, pp:49-59 [Conf]
  5. Tetsuo Ida, Mircea Marin
    An Open Environment for Cooperative Equational Solving. [Citation Graph (0, 0)][DBLP]
    APLAS, 2000, pp:163-166 [Conf]
  6. Tetsuo Ida
    Functional Logic Origami Programming. [Citation Graph (0, 0)][DBLP]
    APLAS, 2002, pp:114- [Conf]
  7. Tetsuo Ida, Mircea Marin, Hidekazu Takahashi
    Constraint Functional Logic Programming for Origami Construction. [Citation Graph (0, 0)][DBLP]
    APLAS, 2003, pp:73-88 [Conf]
  8. Tetsuo Ida, Mircea Marin, Taro Suzuki
    Reducing Search Space in Solving Higher-Order Equations. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:19-30 [Conf]
  9. Tetsuo Ida, Mircea Marin, Taro Suzuki
    Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations. [Citation Graph (0, 0)][DBLP]
    EUROCAST, 2001, pp:479-493 [Conf]
  10. Mircea Marin, Tetsuo Ida, Taro Suzuki
    On Reducing the Search Space of Higher-Order Lazy Narrowing. [Citation Graph (0, 0)][DBLP]
    Fuji International Symposium on Functional and Logic Programming, 1999, pp:319-334 [Conf]
  11. Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi, Asem Kasem
    Computational Construction of a Maximum Equilateral Triangle Inscribed in an Origami. [Citation Graph (0, 0)][DBLP]
    ICMS, 2006, pp:361-372 [Conf]
  12. Tetsuo Ida, Eiichi Goto
    Performance of Parallel Hash Hardware with Key Deletion. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1977, pp:643-647 [Conf]
  13. Tetsuo Ida, Jiro Tanaka
    Functional Programming with Streams. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1983, pp:265-270 [Conf]
  14. Myuhng Joo Kim, Chu Shik Jhon, Tetsuo Ida
    G-system: A Functionally-Based Communication System Model for Parallel Processing. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1992, pp:170-178 [Conf]
  15. Eiichi Goto, Tetsuo Ida, Kei Hiraki
    FLATS, a Machine for Numerical, Symbolic and Associative Computing. [Citation Graph (0, 0)][DBLP]
    ISCA, 1979, pp:102-110 [Conf]
  16. Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
    The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1997, pp:331-338 [Conf]
  17. Eiichi Goto, T. Soma, N. Inada, Tetsuo Ida, M. Idesawa, Kei Hiraki, M. Suzuki, Kentaro Shimizu, B. Philipov
    Design of a Lisp Machine - FLATS. [Citation Graph (0, 0)][DBLP]
    Symposium on LISP and Functional Programming, 1982, pp:208-215 [Conf]
  18. Tetsuo Ida, Hidekazu Takahashi, Mircea Marin
    Computational Origami of a Morley's Triangle. [Citation Graph (0, 0)][DBLP]
    MKM, 2005, pp:267-282 [Conf]
  19. Koichi Nakahara, Aart Middeldorp, Tetsuo Ida
    A Complete Narrowing Calculus for Higher-Order Functional Logic Programming [Citation Graph (0, 0)][DBLP]
    PLILP, 1995, pp:97-114 [Conf]
  20. Tetsuo Ida, Akihiko Konagaya
    Comparison of Closure Reduction and Combinatory Reduction Schemes. [Citation Graph (0, 0)][DBLP]
    RIMS Symposia on Software Science and Engineering, 1984, pp:261-291 [Conf]
  21. Taro Suzuki, Aart Middeldorp, Tetsuo Ida
    Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:179-193 [Conf]
  22. Fadoua Ghourabi, Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Asem Kasem
    Logical and algebraic view of Huzita's origami axioms with applications to computational origami. [Citation Graph (0, 0)][DBLP]
    SAC, 2007, pp:767-772 [Conf]
  23. Kozo Itano, Tetsuo Ida
    Software-Fault Detector for Microprocessors. [Citation Graph (0, 0)][DBLP]
    SIGSMALL/SIGMOD Symposium, 1981, pp:64-70 [Conf]
  24. Satoshi Okui, Aart Middeldorp, Tetsuo Ida
    Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:394-408 [Conf]
  25. Mircea Marin, Tetsuo Ida
    Cooperative Constraint Functional Logic Programming. [Citation Graph (0, 0)][DBLP]
    WFLP, 2000, pp:382-390 [Conf]
  26. Mircea Marin, Tetsuo Ida, Taro Suzuki
    Higher-order Lazy Narrowing Calculi in Perspective. [Citation Graph (0, 0)][DBLP]
    WFLP, 2000, pp:238-252 [Conf]
  27. Mircea Marin, Tetsuo Ida
    Rule-Based Programming with sigma-Log. [Citation Graph (0, 0)][DBLP]
    SYNASC, 2005, pp:31-38 [Conf]
  28. Tetsuo Ida
    Tiers of webOrigami Programming. [Citation Graph (0, 0)][DBLP]
    SYNASC, 2006, pp:11- [Conf]
  29. Tetsuo Ida
    Some FP Algebra with Currying Operation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:5, pp:259-261 [Journal]
  30. Eiichi Goto, Tetsuo Ida, Takao Gunji
    Parallel Hashing Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1977, v:6, n:1, pp:8-13 [Journal]
  31. Tetsuo Ida, Koichi Nakahara
    Leftmost Outside-In Narrowing Calculi. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1997, v:7, n:2, pp:129-161 [Journal]
  32. Tetsuo Ida, Jiro Tanaka
    Functional Programming with Streams, Part II. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1984, v:2, n:3, pp:262-275 [Journal]
  33. Tetsuo Ida
    Hot Topics in Reduction Strategies - A Panelist's View. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:57, n:, pp:- [Journal]
  34. Aart Middeldorp, Satoshi Okui, Tetsuo Ida
    Lazy Narrowing: Strong Completeness and Eager Variable Elimination. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:167, n:1&2, pp:95-130 [Journal]
  35. Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi
    Modeling Origami for Computational Construction and Beyond. [Citation Graph (0, 0)][DBLP]
    ICCSA (2), 2007, pp:653-665 [Conf]

  36. Symbolic and algebraic methods in computational origami: invited talk. [Citation Graph (, )][DBLP]


  37. Origami fold as algebraic graph rewriting. [Citation Graph (, )][DBLP]


  38. Graph Rewriting in Computational Origami. [Citation Graph (, )][DBLP]


  39. Modeling Origami and Beyond. [Citation Graph (, )][DBLP]


  40. Computational Origami Construction as Constraint Solving and Rewriting. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002