Jean H. Gallier

Publication Activity (10 Years)

Years Active: 1978-2013
Publications (10 Years): 0

Top Venues

CoRR

IEEE Trans. Pattern Anal. Mach. Intell.

University of California, Santa Barbara, CA, USA (PHD)

Education History

University of California, Santa Barbara, CA, USA

PHD

Publications

Jean H. Gallier
Notes on Elementary Spectral Graph Theory. Applications to Graph Clustering Using Normalized Cuts. CoRR (2013)
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) (2012)
Ryan Kennedy, Jean H. Gallier, Jianbo Shi
Contour cut: Identifying salient contours in images by solving a Hermitian eigenvalue problem. CVPR (2011)
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. Comput. Graph. 33 (3) (2009)
Jean H. Gallier
Discrete Mathematics for Computer Science, Some Notes CoRR (2008)
Marcelo Siqueira, Longin Jan Latecki, Nicholas J. Tustison, Jean H. Gallier, James C. Gee
Topological Repairing of 3D Digital Images. J. Math. Imaging Vis. 30 (3) (2008)
Jean H. Gallier
Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches CoRR (2006)
Jean H. Gallier
The Completeness of Propositional Resolution: A Simple and Constructive Proof CoRR (2006)
Jean H. Gallier
The Completeness of Propositional Resolution: A Simple and Constructive Proof. Log. Methods Comput. Sci. 2 (5) (2006)
Jean H. Gallier
On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches CoRR (2006)
Jean H. Gallier, Weqing Gu
Fast and Simple Methods For Computing Control Points CoRR (2006)
Suneeta Ramaswami, Marcelo Siqueira, Tessa A. Sundaram, Jean H. Gallier, James C. Gee
Constrained quadrilateral meshes of bounded size. Int. J. Comput. Geom. Appl. 15 (1) (2005)
Jean H. Gallier, Salvatore La Torre, Supratik Mukhopadhyay
Deterministic finite automata with recursive calls and DPDAs. Inf. Process. Lett. 87 (4) (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)
Jean H. Gallier
A simple method for drawing a rational curve as two Bézier segments. ACM Trans. Graph. 18 (4) (1999)
Jean H. Gallier
Typing Untyped lambda-Terms, or Reducibility Strikes Again! Ann. Pure Appl. Log. 91 (2-3) (1998)
Jean H. Gallier
Kripke Models and the (In)equational Logic of the Second-Order lambda-Calculus. Ann. Pure Appl. Log. 84 (3) (1997)
Jean H. Gallier
Drawing Closed Rational Surfaces. SCG (1997)
Jean H. Gallier
? A Survey of Some Results in Proof Theory". Ann. Pure Appl. Log. 89 (2-3) (1997)
Douglas DeCarlo, Jean H. Gallier
Topological Evolution of Surfaces. Graphics Interface (1996)
Jean H. Gallier
Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves. Theor. Comput. Sci. 142 (2) (1995)
Val Tannen, Jean H. Gallier
Polymorphic Rewriting Conserves Algebraic Confluence Inf. Comput. 114 (1) (1994)
Jean H. Gallier
Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi. Theor. Comput. Sci. 110 (2) (1993)
Jean H. Gallier
Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract). RTA (1993)
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) (1993)
Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder
Theorem Proving Using Equational Matings and Rigid E-Unification. J. ACM 39 (2) (1992)
Val Tannen, Jean H. Gallier
Polymorphic Rewriting Conserves Algebraic Strong Normalization. Theor. Comput. Sci. 83 (1) (1991)
Jean H. Gallier
? A Survey of Some Results in Proof Theory. Ann. Pure Appl. Log. 53 (3) (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) (1990)
Wayne Snyder, Jean H. Gallier
Higher-Order Unification Revisited: Complete Sets of Transformations. J. Symb. Comput. 8 (1/2) (1989)
Val Tannen, Jean H. Gallier
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence. ICALP (1989)
Jean H. Gallier, Stan Raatz
Extending SLD Resolution to Equational Horn Clauses using E-Unification. J. Log. Program. 6 (1&2) (1989)
Jean H. Gallier, Wayne Snyder
Complete Sets of Transformations for General E-Unification. Theor. Comput. Sci. 67 (2&3) (1989)
Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted
Rigid E-Unification is NP-Complete LICS (1988)
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)
Jean H. Gallier, Tomás Isakowitz
Rewriting in Order-sorted Equational Logic. ICLP/SLP (1988)
Stan Raatz, Jean H. Gallier
A Relational Semantics for Logic Programming. ICLP/SLP (1988)
Bruno Courcelle, Jean H. Gallier
Decidable Subcases of The Equivalence Problem for Recursive Program Schemes. RAIRO Theor. Informatics Appl. 21 (3) (1987)
Jean H. Gallier, Stan Raatz
Hornlog: A Graph-Based Interpreter for General Horn Clauses. J. Log. Program. 4 (2) (1987)
Alex Pelin, Jean H. Gallier
Building Exact Computation Sequences. Theor. Comput. Sci. 53 (1987)
Jean H. Gallier
Fast Algorithms for Testing Unsatisfiability of Ground Horn Clauses with Equations. J. Symb. Comput. 4 (2) (1987)
Jean H. Gallier, Stan Raatz, Wayne Snyder
Theorem Proving Using Rigid E-Unification Equational Matings LICS (1987)
Jean H. Gallier, Wayne Snyder
-Unification Procedure. RTA (1987)
Alex Pelin, Jean H. Gallier
Exact Computation Sequences. CAAP (1986)
William F. Dowling, Jean H. Gallier
Continuation Semantics for Flowgraph Equations. Theor. Comput. Sci. 44 (1986)
Jean H. Gallier, Stan Raatz
SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification. SLP (1986)
Karl M. Schimpf, Jean H. Gallier
Tree Pushdown Automata. J. Comput. Syst. Sci. 30 (1) (1985)
Jean H. Gallier, Stan Raatz
Logic Programming and Graph Rewriting. SLP (1985)
Jean H. Gallier, Ronald V. Book
Reductions in Tree Replacement Systems. Theor. Comput. Sci. 37 (1985)
Alex Pelin, Jean H. Gallier
Solving Word Problems in Free Algebras Using Complexity Functions. CADE (1984)
William F. Dowling, Jean H. Gallier
Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Log. Program. 1 (3) (1984)
Jean H. Gallier
n-Rational Algebras II. Varieties and Logic of Inequalities. SIAM J. Comput. 13 (4) (1984)
Jean H. Gallier
n-Rational Algebras I. Basic Properties and Free Algebras. SIAM J. Comput. 13 (4) (1984)
Fahimeh Jalili, Jean H. Gallier
Building Friendly Parsers. POPL (1982)
Jean H. Gallier
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186. Theor. Comput. Sci. 17 (1982)
Jean H. Gallier
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. Theor. Comput. Sci. 19 (1982)
Jean H. Gallier
Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I. Theor. Comput. Sci. 13 (1981)
Jean H. Gallier
Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II. Theor. Comput. Sci. 13 (1981)
Jean H. Gallier
DPDA's in 'Atomic Normal Form' and Applications to Equivalence Problems. Theor. Comput. Sci. 14 (1981)
Jean H. Gallier
Recursion-Closed Algebraic Theories. J. Comput. Syst. Sci. 23 (1) (1981)
Jean H. Gallier
On The Existence of Optimal Fixpoints. Math. Syst. Theory 13 (1980)
Jean H. Gallier
Recursion Schemes and Generalized Interpretations (Extended Abstract). ICALP (1979)
Jean H. Gallier
Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures. ICALP (1978)

Jean H. Gallier.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean H. Gallier