Jean H. Gallier

Affiliations:
  • University of Pennsylvania, Philadelphia, PA, USA


According to our database1, Jean H. Gallier authored at least 75 papers between 1978 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Note on Logical PERs and Reducibility. Logical Relations Strike Again!
Proceedings of the Provenance of Elegance in Computation - Essays Dedicated to Val Tannen, 2024

2020
Linear Algebra and Optimization with Applications to Machine Learning - Volume II: Fundamentals of Optimization Theory with Applications to Machine Learning
WorldScientific, ISBN: 9789811216589, 2020

Linear Algebra and Optimization with Applications to Machine Learning - Volume I: Linear Algebra for Computer Vision, Robotics, and Machine Learning
WorldScientific, ISBN: 9789811206412, 2020

2017
Coordinated Path Planning for Fixed-Wing UAS Conducting Persistent Surveillance Missions.
IEEE Trans Autom. Sci. Eng., 2017

Semantic Word Clusters Using Signed Spectral Clustering.
Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, 2017

2016
Semantic Word Clusters Using Signed Normalized Graph Cuts.
CoRR, 2016

Spectral Theory of Unsigned and Signed Graphs. Applications to Graph Clustering: a Survey.
CoRR, 2016

2015
The exponential map for the group of similarity transformations and applications to motion interpolation.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

2013
A Guide to the Classification Theorem for Compact Surfaces
Geometry and Computing 9, Springer, ISBN: 978-3-642-34364-3, 2013

Notes on Elementary Spectral Graph Theory. Applications to Graph Clustering Using Normalized Cuts.
CoRR, 2013

2012
Two Efficient Solutions for Visual Odometry Using Directional Correspondence.
IEEE Trans. Pattern Anal. Mach. Intell., 2012

2011
Contour cut: Identifying salient contours in images by solving a Hermitian eigenvalue problem.
Proceedings of the 24th IEEE Conference on Computer Vision and Pattern Recognition, 2011

2009
A new construction of smooth surfaces from triangle meshes using parametric pseudo-manifolds.
Comput. Graph., 2009

2008
Topological Repairing of 3D Digital Images.
J. Math. Imaging Vis., 2008

Discrete Mathematics for Computer Science, Some Notes
CoRR, 2008

2006
The Completeness of Propositional Resolution: A Simple and Constructive Proof.
Log. Methods Comput. Sci., 2006

On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches
CoRR, 2006

Fast and Simple Methods For Computing Control Points
CoRR, 2006

Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches
CoRR, 2006

2005
Constrained quadrilateral meshes of bounded size.
Int. J. Comput. Geom. Appl., 2005

2003
Deterministic finite automata with recursive calls and DPDAs.
Inf. Process. Lett., 2003

A New Algorithm for Generating Quadrilateral Meshes and its Application to FE-Based Image Registration.
Proceedings of the 12th International Meshing Roundtable, 2003

1999
A simple method for drawing a rational curve as two Bézier segments.
ACM Trans. Graph., 1999

1998
Typing Untyped lambda-Terms, or Reducibility Strikes Again!
Ann. Pure Appl. Log., 1998

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

Erratum to "What's So Special About Kruskal's Theorem and the Ordinal Gamma<sub>0</sub>? A Survey of Some Results in Proof Theory".
Ann. Pure Appl. Log., 1997

Drawing Closed Rational Surfaces.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Topological Evolution of Surfaces.
Proceedings of the Graphics Interface 1996 Conference, 1996

1995
Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves.
Theor. Comput. Sci., 1995

1994
Polymorphic Rewriting Conserves Algebraic Confluence
Inf. Comput., October, 1994

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

An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time.
J. ACM, 1993

Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract).
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

1992
Theorem Proving Using Equational Matings and Rigid E-Unification.
J. ACM, 1992

Unification procedures in automated deduction methods based on matings: A survey.
Proceedings of the Tree Automata and Languages., 1992

1991
Polymorphic Rewriting Conserves Algebraic Strong Normalization.
Theor. Comput. Sci., 1991

What's So Special About Kruskal's Theorem and the Ordinal Gamma<sub>0</sub>? A Survey of Some Results in Proof Theory.
Ann. Pure Appl. Log., 1991

1990
Rigid E-Unification: NP-Completeness and Applications to Equational Matings
Inf. Comput., 1990

1989
Complete Sets of Transformations for General E-Unification.
Theor. Comput. Sci., 1989

Higher-Order Unification Revisited: Complete Sets of Transformations.
J. Symb. Comput., 1989

Extending SLD Resolution to Equational Horn Clauses using E-Unification.
J. Log. Program., 1989

Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988
Rigid E-Unification is NP-Complete
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

A Relational Semantics for Logic Programming.
Proceedings of the Logic Programming, 1988

Rewriting in Order-sorted Equational Logic.
Proceedings of the Logic Programming, 1988

Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time.
Proceedings of the 9th International Conference on Automated Deduction, 1988

1987
Building Exact Computation Sequences.
Theor. Comput. Sci., 1987

Fast Algorithms for Testing Unsatisfiability of Ground Horn Clauses with Equations.
J. Symb. Comput., 1987

Hornlog: A Graph-Based Interpreter for General Horn Clauses.
J. Log. Program., 1987

Decidable Subcases of The Equivalence Problem for Recursive Program Schemes.
RAIRO Theor. Informatics Appl., 1987

A General Complete <i>E</i>-Unification Procedure.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

Theorem Proving Using Rigid E-Unification Equational Matings
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

Logic for Computer Science: Foundations of Automatic Theorem Proving.
Wiley, ISBN: 978-0-471-61546-0, 1987

1986
Continuation Semantics for Flowgraph Equations.
Theor. Comput. Sci., 1986

SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification.
Proceedings of the 1986 Symposium on Logic Programming, 1986

Exact Computation Sequences.
Proceedings of the CAAP '86, 1986

Logic for Computer Science: Foundations of Automatic Theorem Proving
Harper & Row, ISBN: 0-06-042225-4, 1986

1985
Reductions in Tree Replacement Systems.
Theor. Comput. Sci., 1985

Tree Pushdown Automata.
J. Comput. Syst. Sci., 1985

Logic Programming and Graph Rewriting.
Proceedings of the 1985 Symposium on Logic Programming, 1985

1984
n-Rational Algebras II. Varieties and Logic of Inequalities.
SIAM J. Comput., 1984

n-Rational Algebras I. Basic Properties and Free Algebras.
SIAM J. Comput., 1984

Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae.
J. Log. Program., 1984

Solving Word Problems in Free Algebras Using Complexity Functions.
Proceedings of the 7th International Conference on Automated Deduction, 1984

1982
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems.
Theor. Comput. Sci., 1982

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

Building Friendly Parsers.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

1981
DPDA's in 'Atomic Normal Form' and Applications to Equivalence Problems.
Theor. Comput. Sci., 1981

Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II.
Theor. Comput. Sci., 1981

Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I.
Theor. Comput. Sci., 1981

Recursion-Closed Algebraic Theories.
J. Comput. Syst. Sci., 1981

1980
On The Existence of Optimal Fixpoints.
Math. Syst. Theory, 1980

1979
Recursion Schemes and Generalized Interpretations (Extended Abstract).
Proceedings of the Automata, 1979

1978
Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures.
Proceedings of the Automata, 1978

Semantics and correctness of classes of deterministic and nondeterministic recursive programs.
PhD thesis, 1978


  Loading...