Jean H. Gallier

69 papers A* 7A 2B 1Journal 44Unranked 9
YearRankTypeTitle / Venue / Authors
2020 — book
Linear Algebra and Optimization with Applications to Machine Learning - Volume I: Linear Algebra for Computer Vision, Robotics, and Machine Learning
Linear Algebra and Optimization with Applications to Machine Learning, Volume I
Jean H. Gallier, Jocelyn Quaintance
2020 — book
Linear Algebra and Optimization with Applications to Machine Learning - Volume II: Fundamentals of Optimization Theory with Applications to Machine Learning
Linear Algebra and Optimization with Applications to Machine Learning, Volume II
Jean H. Gallier, Jocelyn Quaintance
2013 J jnl
Notes on Elementary Spectral Graph Theory. Applications to Graph Clustering Using Normalized Cuts.
CoRR
Jean H. Gallier
2012 J jnl
Two Efficient Solutions for Visual Odometry Using Directional Correspondence.
IEEE Trans. Pattern Anal. Mach. Intell.
Oleg Naroditsky, Xun S. Zhou, Jean H. Gallier, Stergios I. Roumeliotis, Kostas Daniilidis
2011 A* conf
Contour cut: Identifying salient contours in images by solving a Hermitian eigenvalue problem.
CVPR
Ryan Kennedy, Jean H. Gallier, Jianbo Shi
2009 J jnl
A new construction of smooth surfaces from triangle meshes using parametric pseudo-manifolds.
Comput. Graph.
Marcelo Siqueira, Dianna Xu, Jean H. Gallier, Luis Gustavo Nonato, Dimas Martínez Morera, Luiz Velho
2008 J jnl
Discrete Mathematics for Computer Science, Some Notes
CoRR
Jean H. Gallier
2008 J jnl
Topological Repairing of 3D Digital Images.
J. Math. Imaging Vis.
Marcelo Siqueira, Longin Jan Latecki, Nicholas J. Tustison, Jean H. Gallier, James C. Gee
2006 J jnl
Fast and Simple Methods For Computing Control Points
CoRR
Jean H. Gallier, Weqing Gu
2006 J jnl
On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches
CoRR
Jean H. Gallier
2006 J jnl
Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches
CoRR
Jean H. Gallier
2006 J jnl
The Completeness of Propositional Resolution: A Simple and Constructive Proof
CoRR
Jean H. Gallier
2006 J jnl
The Completeness of Propositional Resolution: A Simple and Constructive Proof.
Log. Methods Comput. Sci.
Jean H. Gallier
2005 J jnl
Constrained quadrilateral meshes of bounded size.
Int. J. Comput. Geom. Appl.
Suneeta Ramaswami, Marcelo Siqueira, Tessa A. Sundaram, Jean H. Gallier, James C. Gee
2003 — conf
A New Algorithm for Generating Quadrilateral Meshes and its Application to FE-Based Image Registration.
IMR
Suneeta Ramaswami, Marcelo Siqueira, Tessa A. Sundaram, Jean H. Gallier, James C. Gee
2003 J jnl
Deterministic finite automata with recursive calls and DPDAs.
Inf. Process. Lett.
Jean H. Gallier, Salvatore La Torre, Supratik Mukhopadhyay
1999 J jnl
A simple method for drawing a rational curve as two Bézier segments.
ACM Trans. Graph.
Jean H. Gallier
1998 J jnl
Typing Untyped lambda-Terms, or Reducibility Strikes Again!
Ann. Pure Appl. Log.
Jean H. Gallier
1997 — conf
Drawing Closed Rational Surfaces.
SCG
Jean H. Gallier
1997 J jnl
Erratum to "What's So Special About Kruskal's Theorem and the Ordinal Gamma
Ann. Pure Appl. Log.
Jean H. Gallier
1997 J jnl
Kripke Models and the (In)equational Logic of the Second-Order lambda-Calculus.
Ann. Pure Appl. Log.
Jean H. Gallier
1996 B conf
Topological Evolution of Surfaces.
Graphics Interface
Douglas DeCarlo, Jean H. Gallier
1995 J jnl
Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves.
Theor. Comput. Sci.
Jean H. Gallier
1994 J jnl
Polymorphic Rewriting Conserves Algebraic Confluence
Inf. Comput.
Val Tannen, Jean H. Gallier
1993 J jnl
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time.
J. ACM
Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
1993 J jnl
Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi.
Theor. Comput. Sci.
Jean H. Gallier
1993 — conf
Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract).
RTA
Jean H. Gallier
1992 J jnl
Theorem Proving Using Equational Matings and Rigid E-Unification.
J. ACM
Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder
1992 — ch.
Unification procedures in automated deduction methods based on matings: A survey.
Tree Automata and Languages
Jean H. Gallier
1991 J jnl
Polymorphic Rewriting Conserves Algebraic Strong Normalization.
Theor. Comput. Sci.
Val Tannen, Jean H. Gallier
1991 J jnl
What's So Special About Kruskal's Theorem and the Ordinal Gamma
Ann. Pure Appl. Log.
Jean H. Gallier
1990 J jnl
Rigid E-Unification: NP-Completeness and Applications to Equational Matings
Inf. Comput.
Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder
1989 J jnl
Complete Sets of Transformations for General E-Unification.
Theor. Comput. Sci.
Jean H. Gallier, Wayne Snyder
1989 J jnl
Extending SLD Resolution to Equational Horn Clauses using E-Unification.
J. Log. Program.
Jean H. Gallier, Stan Raatz
1989 J jnl
Higher-Order Unification Revisited: Complete Sets of Transformations.
J. Symb. Comput.
Wayne Snyder, Jean H. Gallier
1989 A* conf
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence.
ICALP
Val Tannen, Jean H. Gallier
1988 — conf
A Relational Semantics for Logic Programming.
ICLP/SLP
Stan Raatz, Jean H. Gallier
1988 A conf
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time.
CADE
Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
1988 — conf
Rewriting in Order-sorted Equational Logic.
ICLP/SLP
Jean H. Gallier, Tomás Isakowitz
1988 A* conf
Rigid E-Unification is NP-Complete
LICS
Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted
1987 — conf
A General Complete
RTA
Jean H. Gallier, Wayne Snyder
1987 J jnl
Building Exact Computation Sequences.
Theor. Comput. Sci.
Alex Pelin, Jean H. Gallier
1987 J jnl
Decidable Subcases of The Equivalence Problem for Recursive Program Schemes.
RAIRO Theor. Informatics Appl.
Bruno Courcelle, Jean H. Gallier
1987 J jnl
Fast Algorithms for Testing Unsatisfiability of Ground Horn Clauses with Equations.
J. Symb. Comput.
Jean H. Gallier
1987 J jnl
Hornlog: A Graph-Based Interpreter for General Horn Clauses.
J. Log. Program.
Jean H. Gallier, Stan Raatz
1987 — book
Logic for Computer Science: Foundations of Automatic Theorem Proving.
Jean H. Gallier
1987 A* conf
Theorem Proving Using Rigid E-Unification Equational Matings
LICS
Jean H. Gallier, Stan Raatz, Wayne Snyder
1986 J jnl
Continuation Semantics for Flowgraph Equations.
Theor. Comput. Sci.
William F. Dowling, Jean H. Gallier
1986 — conf
Exact Computation Sequences.
CAAP
Alex Pelin, Jean H. Gallier
1986 — book
Logic for Computer Science: Foundations of Automatic Theorem Proving
Jean H. Gallier
1986 — conf
SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification.
SLP
Jean H. Gallier, Stan Raatz
1985 — conf
Logic Programming and Graph Rewriting.
SLP
Jean H. Gallier, Stan Raatz
1985 J jnl
Reductions in Tree Replacement Systems.
Theor. Comput. Sci.
Jean H. Gallier, Ronald V. Book
1985 J jnl
Tree Pushdown Automata.
J. Comput. Syst. Sci.
Karl M. Schimpf, Jean H. Gallier
1984 J jnl
Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae.
J. Log. Program.
William F. Dowling, Jean H. Gallier
1984 A conf
Solving Word Problems in Free Algebras Using Complexity Functions.
CADE
Alex Pelin, Jean H. Gallier
1984 J jnl
n-Rational Algebras I. Basic Properties and Free Algebras.
SIAM J. Comput.
Jean H. Gallier
1984 J jnl
n-Rational Algebras II. Varieties and Logic of Inequalities.
SIAM J. Comput.
Jean H. Gallier
1982 A* conf
Building Friendly Parsers.
POPL
Fahimeh Jalili, Jean H. Gallier
1982 J jnl
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems.
Theor. Comput. Sci.
Jean H. Gallier
1982 J jnl
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186.
Theor. Comput. Sci.
Jean H. Gallier
1981 J jnl
DPDA's in 'Atomic Normal Form' and Applications to Equivalence Problems.
Theor. Comput. Sci.
Jean H. Gallier
1981 J jnl
Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I.
Theor. Comput. Sci.
Jean H. Gallier
1981 J jnl
Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II.
Theor. Comput. Sci.
Jean H. Gallier
1981 J jnl
Recursion-Closed Algebraic Theories.
J. Comput. Syst. Sci.
Jean H. Gallier
1980 J jnl
On The Existence of Optimal Fixpoints.
Math. Syst. Theory
Jean H. Gallier
1979 A* conf
Recursion Schemes and Generalized Interpretations (Extended Abstract).
ICALP
Jean H. Gallier
1978 A* conf
Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures.
ICALP
Jean H. Gallier
1978 — —
Semantics and correctness of classes of deterministic and nondeterministic recursive programs.
Jean H. Gallier