Follow
Jean Gallier
Title
Cited by
Cited by
Year
Linear-time algorithms for testing the satisfiability of propositional Horn formulae
WF Dowling, JH Gallier
The Journal of Logic Programming 1 (3), 267-284, 1984
13761984
Logic for computer science: foundations of automatic theorem proving
JH Gallier
Courier Dover Publications, 2015
12002015
Geometric methods and applications: for computer science and engineering
J Gallier
Springer Science & Business Media, 2011
5212011
Curves and surfaces in geometric modeling: theory and algorithms
J Gallier, JH Gallier
Morgan Kaufmann, 2000
2722000
Higher-order unification revisited: Complete sets of transformations
W Snyder, J Gallier
Journal of Symbolic Computation 8 (1-2), 101-140, 1989
2141989
On Girard's" Candidats de Reductibilité"
JH Gallier
1951989
Constructive logics part I: A tutorial on proof systems and typed λ-calculi
J Gallier
Theoretical computer science 110 (2), 249-339, 1993
180*1993
What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theory
JH Gallier
Annals of pure and applied logic 53 (3), 199-260, 1991
1661991
Complete sets of transformations for general E-unification
JH Gallier, W Snyder
Theoretical Computer Science 67 (2-3), 203-260, 1989
1641989
Computing exponentials of skew-symmetric matrices and logarithms of orthogonal matrices
J Gallier, D Xu
International Journal of Robotics and Automation 18 (1), 10-20, 2003
1532003
Topological evolution of surfaces
D DeCarlo, J Gallier
Graphics Interface 96, 194-203, 1996
1211996
Notes on differential geometry and Lie groups
J Gallier, J Quaintance
University of Pennsylvannia 4 (3-1), 4, 2012
1202012
Notes on the Schur complement
JH Gallier
1142010
Two efficient solutions for visual odometry using directional correspondence
O Naroditsky, XS Zhou, J Gallier, SI Roumeliotis, K Daniilidis
IEEE transactions on pattern analysis and machine intelligence 34 (4), 818-824, 2011
972011
Polymorphic rewriting conserves algebraic strong normalization
V Breazu-Tannen, J Gallier
Theoretical Computer Science 83 (1), 3-28, 1991
941991
Rigid E-unification: NP-completeness and applications to equational matings
J Gallier, P Narendran, D Plaisted, W Snyder
Information and Computation 87 (1-2), 129-195, 1990
901990
Discrete mathematics
J Gallier
Springer Science & Business Media, 2011
862011
Theorem proving using rigid E-unification: Equational matings
JH Gallier, S Raatz, W Snyder
University of Pennsylvania, School of Engineering and Applied Science …, 1987
841987
Theorem proving using equational matings and rigid E-unification
J Gallier, P Narendran, S Raatz, W Snyder
Journal of the ACM (JACM) 39 (2), 377-430, 1992
811992
Building friendly parsers
F Jalili, JH Gallier
Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of …, 1982
781982
The system can't perform the operation now. Try again later.
Articles 1–20