Semantics and correctness of classes of deterministic and nondeterministic recursive programs. - Jean H. Gallier (1978)

Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures. - Jean H. Gallier (ICALP, 1978)

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

On The Existence of Optimal Fixpoints. - Jean H. Gallier (Math. Syst. Theory, 1980)

Recursion-Closed Algebraic Theories. - Jean H. Gallier (J. Comput. Syst. Sci., 1981)

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

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

DPDA's in 'Atomic Normal Form' and Applications to Equivalence Problems. - Jean H. Gallier (Theor. Comput. Sci., 1981)

Building Friendly Parsers. - Fahimeh Jalili; Jean H. Gallier (POPL, 1982)

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

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

Solving Word Problems in Free Algebras Using Complexity Functions. - Alex Pelin; Jean H. Gallier (CADE, 1984)

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

n-Rational Algebras I. Basic Properties and Free Algebras. - Jean H. Gallier (SIAM J. Comput., 1984)

n-Rational Algebras II. Varieties and Logic of Inequalities. - Jean H. Gallier (SIAM J. Comput., 1984)

Logic Programming and Graph Rewriting. - Jean H. Gallier; Stan Raatz (SLP, 1985)

Tree Pushdown Automata. - Karl M. Schimpf; Jean H. Gallier (J. Comput. Syst. Sci., 1985)

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

Logic for Computer Science: Foundations of Automatic Theorem Proving - Jean H. Gallier (Harper & Row, 1986)

Exact Computation Sequences. - Alex Pelin; Jean H. Gallier (CAAP, 1986)

SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification. - Jean H. Gallier; Stan Raatz (SLP, 1986)

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

Logic for Computer Science: Foundations of Automatic Theorem Proving. - Jean H. Gallier (Wiley, 1987)

Theorem Proving Using Rigid E-Unification Equational Matings - Jean H. Gallier; Stan Raatz; Wayne Snyder (LICS, 1987)

A General Complete E-Unification Procedure. - Jean H. Gallier; Wayne Snyder (RTA, 1987)

Decidable Subcases of The Equivalence Problem for Recursive Program Schemes. - Bruno Courcelle; Jean H. Gallier (RAIRO Theor. Informatics Appl., 1987)

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

Fast Algorithms for Testing Unsatisfiability of Ground Horn Clauses with Equations. - Jean H. Gallier (J. Symb. Comput., 1987)

Building Exact Computation Sequences. - Alex Pelin; Jean H. Gallier (Theor. Comput. Sci., 1987)

Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. - Jean H. Gallier; Paliath Narendran; David A. Plaisted; Stan Raatz; Wayne Snyder (CADE, 1988)

Rewriting in Order-sorted Equational Logic. - Jean H. Gallier; Tomás Isakowitz (ICLP/SLP, 1988)

A Relational Semantics for Logic Programming. - Stan Raatz; Jean H. Gallier (ICLP/SLP, 1988)

Rigid E-Unification is NP-Complete - Jean H. Gallier; Wayne Snyder; Paliath Narendran; David A. Plaisted (LICS, 1988)

Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence. - Val Tannen; Jean H. Gallier (ICALP, 1989)

Extending SLD Resolution to Equational Horn Clauses using E-Unification. - Jean H. Gallier; Stan Raatz (J. Log. Program., 1989)

Higher-Order Unification Revisited: Complete Sets of Transformations. - Wayne Snyder; Jean H. Gallier (J. Symb. Comput., 1989)

Complete Sets of Transformations for General E-Unification. - Jean H. Gallier; Wayne Snyder (Theor. Comput. Sci., 1989)

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

What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory. - Jean H. Gallier (Ann. Pure Appl. Log., 1991)

Polymorphic Rewriting Conserves Algebraic Strong Normalization. - Val Tannen; Jean H. Gallier (Theor. Comput. Sci., 1991)

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

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

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

An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time. - Jean H. Gallier; Paliath Narendran; David A. Plaisted; Stan Raatz; Wayne Snyder (J. ACM, 1993)

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

Polymorphic Rewriting Conserves Algebraic Confluence - Val Tannen; Jean H. Gallier (Inf. Comput., 1994)

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

Topological Evolution of Surfaces. - Douglas DeCarlo; Jean H. Gallier (Graphics Interface, 1996)

Drawing Closed Rational Surfaces. - Jean H. Gallier (SCG, 1997)

Erratum to "What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory". - Jean H. Gallier (Ann. Pure Appl. Log., 1997)

Kripke Models and the (In)equational Logic of the Second-Order lambda-Calculus. - Jean H. Gallier (Ann. Pure Appl. Log., 1997)

Typing Untyped lambda-Terms, or Reducibility Strikes Again! - Jean H. Gallier (Ann. Pure Appl. Log., 1998)

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

A New Algorithm for Generating Quadrilateral Meshes and its Application to FE-Based Image Registration. - Suneeta Ramaswami; Marcelo Siqueira; Tessa A. Sundaram; Jean H. Gallier; James C. Gee (IMR, 2003)

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

Constrained quadrilateral meshes of bounded size. - Suneeta Ramaswami; Marcelo Siqueira; Tessa A. Sundaram; Jean H. Gallier; James C. Gee (Int. J. Comput. Geom. Appl., 2005)

Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches - Jean H. Gallier (CoRR, 2006)

Fast and Simple Methods For Computing Control Points - Jean H. Gallier; Weqing Gu (CoRR, 2006)

On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches - Jean H. Gallier (CoRR, 2006)

The Completeness of Propositional Resolution: A Simple and Constructive Proof. - Jean H. Gallier (Log. Methods Comput. Sci., 2006)

Discrete Mathematics for Computer Science, Some Notes - Jean H. Gallier (CoRR, 2008)

Topological Repairing of 3D Digital Images. - Marcelo Siqueira; Longin Jan Latecki; Nicholas J. Tustison; Jean H. Gallier; James C. Gee (J. Math. Imaging Vis., 2008)

A new construction of smooth surfaces from triangle meshes using parametric pseudo-manifolds. - Marcelo Siqueira; Dianna Xu; Jean H. Gallier; Luis Gustavo Nonato; Dimas Martínez Morera; Luiz Velho 001 (Comput. Graph., 2009)

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

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

Notes on Elementary Spectral Graph Theory. Applications to Graph Clustering Using Normalized Cuts. - Jean H. Gallier (CoRR, 2013)

A Guide to the Classification Theorem for Compact Surfaces - Jean Gallier; Dianna Xu (Springer, 2013)

The exponential map for the group of similarity transformations and applications to motion interpolation. - Spyridon Leonardos; Christine Allen-Blanchette; Jean Gallier (ICRA, 2015)

Spectral Theory of Unsigned and Signed Graphs. Applications to Graph Clustering: a Survey. - Jean Gallier (CoRR, 2016)

Semantic Word Clusters Using Signed Normalized Graph Cuts. - João Sedoc; Jean Gallier; Lyle H. Ungar; Dean P. Foster (CoRR, 2016)

Semantic Word Clusters Using Signed Spectral Clustering. - João Sedoc; Jean Gallier; Dean P. Foster; Lyle H. Ungar (ACL (1), 2017)

Coordinated Path Planning for Fixed-Wing UAS Conducting Persistent Surveillance Missions. - James Keller 002; Dinesh Thakur; Maxim Likhachev; Jean Gallier; Vijay Kumar 001 (IEEE Trans Autom. Sci. Eng., 2017)

Linear Algebra and Optimization with Applications to Machine Learning - Volume I: Linear Algebra for Computer Vision, Robotics, and Machine Learning - Jean H. Gallier; Jocelyn Quaintance (Linear Algebra and Optimization with Applications to Machine Learning, Volume I, 2020)

Linear Algebra and Optimization with Applications to Machine Learning - Volume II: Fundamentals of Optimization Theory with Applications to Machine Learning - Jean H. Gallier; Jocelyn Quaintance (Linear Algebra and Optimization with Applications to Machine Learning, Volume II, 2020)

A Note on Logical PERs and Reducibility. Logical Relations Strike Again! - Jean Gallier (Tannen's Festschrift, 2024)

Aspects of Representation Theory and Noncommutative Harmonic Analysis - Jean Gallier; Jocelyn Quaintance (WorldScientific, 2025)