The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean H. Gallier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. William F. Dowling, Jean H. Gallier
    Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. [Citation Graph (7, 0)][DBLP]
    J. Log. Program., 1984, v:1, n:3, pp:267-284 [Journal]
  2. Jean H. Gallier, Stan Raatz
    Logic Programming and Graph Rewriting. [Citation Graph (1, 0)][DBLP]
    SLP, 1985, pp:208-219 [Conf]
  3. Jean H. Gallier, Stan Raatz
    Hornlog: A Graph-Based Interpreter for General Horn Clauses. [Citation Graph (1, 0)][DBLP]
    J. Log. Program., 1987, v:4, n:2, pp:119-155 [Journal]
  4. Jean H. Gallier, Stan Raatz
    Extending SLD Resolution to Equational Horn Clauses using E-Unification. [Citation Graph (1, 0)][DBLP]
    J. Log. Program., 1989, v:6, n:1&2, pp:3-43 [Journal]
  5. Jean H. Gallier, Wayne Snyder
    Complete Sets of Transformations for General E-Unification. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:203-260 [Journal]
  6. Alex Pelin, Jean H. Gallier
    Exact Computation Sequences. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:45-59 [Conf]
  7. Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
    Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:182-196 [Conf]
  8. Alex Pelin, Jean H. Gallier
    Solving Word Problems in Free Algebras Using Complexity Functions. [Citation Graph (0, 0)][DBLP]
    CADE, 1984, pp:476-495 [Conf]
  9. Jean H. Gallier
    Drawing Closed Rational Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:370-372 [Conf]
  10. Douglas DeCarlo, Jean H. Gallier
    Topological Evolution of Surfaces. [Citation Graph (0, 0)][DBLP]
    Graphics Interface, 1996, pp:194-203 [Conf]
  11. Jean H. Gallier
    Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1978, pp:251-267 [Conf]
  12. Jean H. Gallier
    Recursion Schemes and Generalized Interpretations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:256-270 [Conf]
  13. Val Tannen, Jean H. Gallier
    Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:137-150 [Conf]
  14. Jean H. Gallier, Tomás Isakowitz
    Rewriting in Order-sorted Equational Logic. [Citation Graph (0, 0)][DBLP]
    ICLP/SLP, 1988, pp:280-294 [Conf]
  15. Stan Raatz, Jean H. Gallier
    A Relational Semantics for Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP/SLP, 1988, pp:1024-1035 [Conf]
  16. Suneeta Ramaswami, Marcelo Siqueira, Tessa A. Sundaram, Jean H. Gallier, James C. Gee
    A New Algorithm for Generating Quadrilateral Meshes and its Application to FE-Based Image Registration. [Citation Graph (0, 0)][DBLP]
    IMR, 2003, pp:159-170 [Conf]
  17. Jean H. Gallier, Stan Raatz, Wayne Snyder
    Theorem Proving Using Rigid E-Unification Equational Matings [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:338-346 [Conf]
  18. Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted
    Rigid E-Unification is NP-Complete [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:218-227 [Conf]
  19. Fahimeh Jalili, Jean H. Gallier
    Building Friendly Parsers. [Citation Graph (0, 0)][DBLP]
    POPL, 1982, pp:196-206 [Conf]
  20. Jean H. Gallier
    Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:136- [Conf]
  21. Jean H. Gallier, Wayne Snyder
    A General Complete E-Unification Procedure. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:216-227 [Conf]
  22. Jean H. Gallier, Stan Raatz
    SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification. [Citation Graph (0, 0)][DBLP]
    SLP, 1986, pp:168-179 [Conf]
  23. Jean H. Gallier
    What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:53, n:3, pp:199-260 [Journal]
  24. Jean H. Gallier
    Erratum to ``What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory''. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:89, n:2-3, pp:275- [Journal]
  25. Jean H. Gallier
    Kripke Models and the (In)equational Logic of the Second-Order lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:84, n:3, pp:257-316 [Journal]
  26. Jean H. Gallier
    Typing Untyped lambda-Terms, or Reducibility Strikes Again! [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:91, n:2-3, pp:231-270 [Journal]
  27. Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder
    Rigid E-Unification: NP-Completeness and Applications to Equational Matings [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:87, n:1/2, pp:129-195 [Journal]
  28. Val Tannen, Jean H. Gallier
    Polymorphic Rewriting Conserves Algebraic Confluence [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:114, n:1, pp:1-29 [Journal]
  29. Suneeta Ramaswami, Marcelo Siqueira, Tessa A. Sundaram, Jean H. Gallier, James C. Gee
    Constrained quadrilateral meshes of bounded size. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:1, pp:55-98 [Journal]
  30. Jean H. Gallier, Salvatore La Torre, Supratik Mukhopadhyay
    Deterministic finite automata with recursive calls and DPDAs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:4, pp:187-193 [Journal]
  31. Bruno Courcelle, Jean H. Gallier
    Decidable Subcases of The Equivalence Problem for Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:3, pp:245-286 [Journal]
  32. Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
    An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:1, pp:1-16 [Journal]
  33. Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder
    Theorem Proving Using Equational Matings and Rigid E-Unification. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:2, pp:377-429 [Journal]
  34. Jean H. Gallier
    Recursion-Closed Algebraic Theories. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:23, n:1, pp:69-105 [Journal]
  35. Karl M. Schimpf, Jean H. Gallier
    Tree Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:1, pp:25-40 [Journal]
  36. Jean H. Gallier
    Fast Algorithms for Testing Unsatisfiability of Ground Horn Clauses with Equations. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1987, v:4, n:2, pp:233-254 [Journal]
  37. Wayne Snyder, Jean H. Gallier
    Higher-Order Unification Revisited: Complete Sets of Transformations. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:8, n:1/2, pp:101-140 [Journal]
  38. Jean H. Gallier
    On The Existence of Optimal Fixpoints. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1980, v:13, n:, pp:209-217 [Journal]
  39. Jean H. Gallier
    n-Rational Algebras I. Basic Properties and Free Algebras. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:4, pp:750-775 [Journal]
  40. Jean H. Gallier
    n-Rational Algebras II. Varieties and Logic of Inequalities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:4, pp:776-794 [Journal]
  41. William F. Dowling, Jean H. Gallier
    Continuation Semantics for Flowgraph Equations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:307-331 [Journal]
  42. Jean H. Gallier
    Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:13, n:, pp:193-223 [Journal]
  43. Jean H. Gallier
    Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:13, n:, pp:239-270 [Journal]
  44. Jean H. Gallier
    DPDA's in `Atomic Normal Form' and Applications to Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:155-186 [Journal]
  45. Jean H. Gallier
    Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:111- [Journal]
  46. Jean H. Gallier
    Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:229- [Journal]
  47. Jean H. Gallier
    Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:110, n:2, pp:249-339 [Journal]
  48. Jean H. Gallier
    Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:299-368 [Journal]
  49. Jean H. Gallier, Ronald V. Book
    Reductions in Tree Replacement Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:37, n:, pp:123-150 [Journal]
  50. Alex Pelin, Jean H. Gallier
    Building Exact Computation Sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:125-150 [Journal]
  51. Val Tannen, Jean H. Gallier
    Polymorphic Rewriting Conserves Algebraic Strong Normalization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:1, pp:3-28 [Journal]
  52. Jean H. Gallier
    A simple method for drawing a rational curve as two Bézier segments. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 1999, v:18, n:4, pp:316-328 [Journal]
  53. Jean H. Gallier
    Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  54. Jean H. Gallier, Weqing Gu
    Fast and Simple Methods For Computing Control Points [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  55. Jean H. Gallier
    On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  56. Jean H. Gallier
    The Completeness of Propositional Resolution: A Simple and Constructive<br> Proof [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  57. A new construction of smooth surfaces from triangle meshes using parametric pseudo-manifolds. [Citation Graph (, )][DBLP]


  58. Discrete Mathematics for Computer Science, Some Notes [Citation Graph (, )][DBLP]


Search in 0.100secs, Finished in 0.101secs
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