Jean H. Gallier

Oleg Naroditsky, Xun S. Zhou, Jean H. Gallier, Stergios I. Roumeliotis, Kostas Daniilidis: Two Efficient Solutions for Visual Odometry Using Directional Correspondence. IEEE Trans. Pattern Anal. Mach. Intell. 34(4): 818-824 (2012)

Ryan Kennedy, Jean H. Gallier, Jianbo Shi: Contour cut: Identifying salient contours in images by solving a Hermitian eigenvalue problem. CVPR 2011: 2065-2072

Marcelo Siqueira, Dianna Xu, Jean H. Gallier, Luis Gustavo Nonato, Dimas Martínez Morera, Luiz Velho: A new construction of smooth surfaces from triangle meshes using parametric pseudo-manifolds. Computers & Graphics 33(3): 331-340 (2009)

Marcelo Siqueira, Longin Jan Latecki, Nicholas J. Tustison, Jean H. Gallier, James C. Gee: Topological Repairing of 3D Digital Images. Journal of Mathematical Imaging and Vision 30(3): 249-274 (2008)

Jean H. Gallier: Discrete Mathematics for Computer Science, Some Notes. CoRR abs/0805.0585 (2008)

Jean H. Gallier: The Completeness of Propositional Resolution: A Simple and Constructive Proof. Logical Methods in Computer Science 2(5) (2006)

Jean H. Gallier: Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches. CoRR abs/cs/0606055 (2006)

Jean H. Gallier, Weqing Gu: Fast and Simple Methods For Computing Control Points. CoRR abs/cs/0606056 (2006)

Jean H. Gallier: On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches. CoRR abs/cs/0606061 (2006)

Jean H. Gallier: The Completeness of Propositional Resolution: A Simple and Constructive Proof. CoRR abs/cs/0606084 (2006)

Suneeta Ramaswami, Marcelo Siqueira, Tessa A. Sundaram, Jean H. Gallier, James C. Gee: Constrained quadrilateral meshes of bounded size. Int. J. Comput. Geometry Appl. 15(1): 55-98 (2005)

Jean H. Gallier, Salvatore La Torre, Supratik Mukhopadhyay: Deterministic finite automata with recursive calls and DPDAs. Inf. Process. Lett. 87(4): 187-193 (2003)

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. IMR 2003: 159-170

Jean H. Gallier: A simple method for drawing a rational curve as two Bézier segments. ACM Trans. Graph. 18(4): 316-328 (1999)

Jean H. Gallier: Typing Untyped lambda-Terms, or Reducibility Strikes Again! Ann. Pure Appl. Logic 91(2-3): 231-270 (1998)

Jean H. Gallier: Kripke Models and the (In)equational Logic of the Second-Order lambda-Calculus. Ann. Pure Appl. Logic 84(3): 257-316 (1997)

Jean H. Gallier: Erratum to ``What's So Special About Kruskal's Theorem and the Ordinal Gamma₀? A Survey of Some Results in Proof Theory''. Ann. Pure Appl. Logic 89(2-3): 275 (1997)

Jean H. Gallier: Drawing Closed Rational Surfaces. Symposium on Computational Geometry 1997: 370-372

Douglas DeCarlo, Jean H. Gallier: Topological Evolution of Surfaces. Graphics Interface 1996: 194-203

Jean H. Gallier: Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves. Theor. Comput. Sci. 142(2): 299-368 (1995)

Val Tannen, Jean H. Gallier: Polymorphic Rewriting Conserves Algebraic Confluence. Inf. Comput. 114(1): 1-29 (1994)

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. J. ACM 40(1): 1-16 (1993)

Jean H. Gallier: Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi. Theor. Comput. Sci. 110(2): 249-339 (1993)

Jean H. Gallier: Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract). RTA 1993: 136

Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder: Theorem Proving Using Equational Matings and Rigid E-Unification. J. ACM 39(2): 377-429 (1992)

Jean H. Gallier: Unification procedures in automated deduction methods based on matings: A survey. Tree Automata and Languages 1992: 439-

Jean H. Gallier: What's So Special About Kruskal's Theorem and the Ordinal Gamma₀? A Survey of Some Results in Proof Theory. Ann. Pure Appl. Logic 53(3): 199-260 (1991)

Val Tannen, Jean H. Gallier: Polymorphic Rewriting Conserves Algebraic Strong Normalization. Theor. Comput. Sci. 83(1): 3-28 (1991)

Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder: Rigid E-Unification: NP-Completeness and Applications to Equational Matings. Inf. Comput. 87(1/2): 129-195 (1990)

Jean H. Gallier, Stan Raatz: Extending SLD Resolution to Equational Horn Clauses using E-Unification. J. Log. Program. 6(1&2): 3-43 (1989)

Wayne Snyder, Jean H. Gallier: Higher-Order Unification Revisited: Complete Sets of Transformations. J. Symb. Comput. 8(1/2): 101-140 (1989)

Jean H. Gallier, Wayne Snyder: Complete Sets of Transformations for General E-Unification. Theor. Comput. Sci. 67(2&3): 203-260 (1989)

Val Tannen, Jean H. Gallier: Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence. ICALP 1989: 137-150

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. CADE 1988: 182-196

Jean H. Gallier, Tomás Isakowitz: Rewriting in Order-sorted Equational Logic. ICLP/SLP 1988: 280-294

Stan Raatz, Jean H. Gallier: A Relational Semantics for Logic Programming. ICLP/SLP 1988: 1024-1035

Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted: Rigid E-Unification is NP-Complete. LICS 1988: 218-227

Jean H. Gallier: Logic for Computer Science: Foundations of Automatic Theorem Proving. Wiley 1987, isbn 978-0-471-61546-0, pp. I-XV, 1-511

Bruno Courcelle, Jean H. Gallier: Decidable Subcases of The Equivalence Problem for Recursive Program Schemes. ITA 21(3): 245-286 (1987)

Jean H. Gallier, Stan Raatz: Hornlog: A Graph-Based Interpreter for General Horn Clauses. J. Log. Program. 4(2): 119-155 (1987)

Jean H. Gallier: Fast Algorithms for Testing Unsatisfiability of Ground Horn Clauses with Equations. J. Symb. Comput. 4(2): 233-254 (1987)

Alex Pelin, Jean H. Gallier: Building Exact Computation Sequences. Theor. Comput. Sci. 53: 125-150 (1987)

Jean H. Gallier, Stan Raatz, Wayne Snyder: Theorem Proving Using Rigid E-Unification Equational Matings. LICS 1987: 338-346

Jean H. Gallier, Wayne Snyder: A General Complete E-Unification Procedure. RTA 1987: 216-227

Jean H. Gallier: Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row 1986, isbn 0-06-042225-4

William F. Dowling, Jean H. Gallier: Continuation Semantics for Flowgraph Equations. Theor. Comput. Sci. 44: 307-331 (1986)

Alex Pelin, Jean H. Gallier: Exact Computation Sequences. CAAP 1986: 45-59

Jean H. Gallier, Stan Raatz: SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification. SLP 1986: 168-179

Karl M. Schimpf, Jean H. Gallier: Tree Pushdown Automata. J. Comput. Syst. Sci. 30(1): 25-40 (1985)

Jean H. Gallier, Ronald V. Book: Reductions in Tree Replacement Systems. Theor. Comput. Sci. 37: 123-150 (1985)

Jean H. Gallier, Stan Raatz: Logic Programming and Graph Rewriting. SLP 1985: 208-219

William F. Dowling, Jean H. Gallier: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Log. Program. 1(3): 267-284 (1984)

Jean H. Gallier: n-Rational Algebras I. Basic Properties and Free Algebras. SIAM J. Comput. 13(4): 750-775 (1984)

Jean H. Gallier: n-Rational Algebras II. Varieties and Logic of Inequalities. SIAM J. Comput. 13(4): 776-794 (1984)

Alex Pelin, Jean H. Gallier: Solving Word Problems in Free Algebras Using Complexity Functions. CADE 1984: 476-495

Jean H. Gallier: Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186. Theor. Comput. Sci. 17: 111 (1982)

Jean H. Gallier: Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. Theor. Comput. Sci. 19: 229 (1982)

Fahimeh Jalili, Jean H. Gallier: Building Friendly Parsers. POPL 1982: 196-206

Jean H. Gallier: Recursion-Closed Algebraic Theories. J. Comput. Syst. Sci. 23(1): 69-105 (1981)

Jean H. Gallier: Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I. Theor. Comput. Sci. 13: 193-223 (1981)

Jean H. Gallier: Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II. Theor. Comput. Sci. 13: 239-270 (1981)

Jean H. Gallier: DPDA's in `Atomic Normal Form' and Applications to Equivalence Problems. Theor. Comput. Sci. 14: 155-186 (1981)

Jean H. Gallier: On The Existence of Optimal Fixpoints. Mathematical Systems Theory 13: 209-217 (1980)

Jean H. Gallier: Recursion Schemes and Generalized Interpretations (Extended Abstract). ICALP 1979: 256-270

Jean H. Gallier: Semantics and correctness of classes of deterministic and nondeterministic recursive programs. University Santa Barbara 1978, pp. 1-237

Jean H. Gallier: Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures. ICALP 1978: 251-267