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 | 1295 | 1984 |

Logic for computer science: foundations of automatic theorem proving JH Gallier Courier Dover Publications, 2015 | 1156 | 2015 |

Geometric methods and applications: for computer science and engineering J Gallier Springer Science & Business Media, 2011 | 452 | 2011 |

Curves and surfaces in geometric modeling: theory and algorithms J Gallier, JH Gallier Morgan Kaufmann, 2000 | 250 | 2000 |

Higher-order unification revisited: Complete sets of transformations W Snyder, J Gallier Journal of Symbolic Computation 8 (1-2), 101-140, 1989 | 206 | 1989 |

On Girard's" Candidats de Reductibilité" JH Gallier | 190 | 1989 |

Constructive logics part I: A tutorial on proof systems and typed λ-calculi J Gallier Theoretical computer science 110 (2), 249-339, 1993 | 180* | 1993 |

Complete sets of transformations for general E-unification JH Gallier, W Snyder Theoretical Computer Science 67 (2-3), 203-260, 1989 | 161 | 1989 |

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 | 158 | 1991 |

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 | 140 | 2003 |

Topological evolution of surfaces D DeCarlo, J Gallier Graphics Interface 96, 194-203, 1996 | 123 | 1996 |

Polymorphic rewriting conserves algebraic strong normalization V Breazu-Tannen, J Gallier Theoretical Computer Science 83 (1), 3-28, 1991 | 95 | 1991 |

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 | 89 | 2011 |

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 | 89 | 1990 |

The Schur complement and symmetric positive semidefinite (and definite) matrices J Gallier Penn Engineering, 1-12, 2010 | 84 | 2010 |

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 | 81 | 1992 |

Theorem proving using rigid E-unification: Equational matings JH Gallier, S Raatz, W Snyder University of Pennsylvania, School of Engineering and Applied Science …, 1987 | 81 | 1987 |

Building friendly parsers F Jalili, JH Gallier Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of …, 1982 | 76 | 1982 |

Notes on differential geometry and Lie groups J Gallier, J Quaintance University of Pennsylvannia 4, 3.1, 2012 | 68 | 2012 |

Polymorphic rewriting conserves algebraic strong normalization and confluence V Breazu-Tannen, J Gallier International Colloquium on Automata, Languages, and Programming, 137-150, 1989 | 68 | 1989 |