default search action
Jean H. Gallier
Person information
- affiliation: University of Pennsylvania, Philadelphia, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Jean Gallier:
A Note on Logical PERs and Reducibility. Logical Relations Strike Again! Tannen's Festschrift 2024: 7:1-7:12 - 2020
- [b6]Jean H. Gallier, Jocelyn Quaintance:
Linear Algebra and Optimization with Applications to Machine Learning - Volume I: Linear Algebra for Computer Vision, Robotics, and Machine Learning. WorldScientific 2020, ISBN 9789811206399, pp. 1-824 - [b5]Jean H. Gallier, Jocelyn Quaintance:
Linear Algebra and Optimization with Applications to Machine Learning - Volume II: Fundamentals of Optimization Theory with Applications to Machine Learning. WorldScientific 2020, ISBN 9789811216565, pp. 1-896
2010 – 2019
- 2017
- [j39]James Keller
, Dinesh Thakur, Maxim Likhachev, Jean Gallier, Vijay Kumar:
Coordinated Path Planning for Fixed-Wing UAS Conducting Persistent Surveillance Missions. IEEE Trans Autom. Sci. Eng. 14(1): 17-24 (2017) - [c22]João Sedoc
Semantic Word Clusters Using Signed Spectral Clustering. ACL (1) 2017: 939-949 - 2016
- [i8]Jean Gallier:
Spectral Theory of Unsigned and Signed Graphs. Applications to Graph Clustering: a Survey. CoRR abs/1601.04692 (2016) - [i7]João Sedoc, Jean Gallier, Lyle H. Ungar, Dean P. Foster:
Semantic Word Clusters Using Signed Normalized Graph Cuts. CoRR abs/1601.05403 (2016) - 2015
- [c21]Spyridon Leonardos, Christine Allen-Blanchette, Jean Gallier:
The exponential map for the group of similarity transformations and applications to motion interpolation. ICRA 2015: 377-382 - [c20]James Keller, Dinesh Thakur, Maxim Likhachev, Jean Gallier, Vijay Kumar:
Coordinated path planning for fixed-wing UAS conducting persistent surveillance missions. SSRR 2015: 1-6 - 2013
- [b4]Jean Gallier, Dianna Xu:
A Guide to the Classification Theorem for Compact Surfaces. Geometry and Computing 9, Springer 2013, ISBN 978-3-642-34363-6, pp. 1-178 - [i6]Jean H. Gallier:
Notes on Elementary Spectral Graph Theory. Applications to Graph Clustering Using Normalized Cuts. CoRR abs/1311.2492 (2013) - 2012
- [j38]Oleg Naroditsky, Xun S. Zhou, Jean H. Gallier, Stergios I. Roumeliotis, Kostas Daniilidis:
Two Efficient Solutions for Visual Odometry Using Directional Correspondence. IEEE Trans. Pattern Anal. Mach. Intell. 34(4): 818-824 (2012) - 2011
- [c19]Ryan Kennedy, Jean H. Gallier, Jianbo Shi:
Contour cut: Identifying salient contours in images by solving a Hermitian eigenvalue problem. CVPR 2011: 2065-2072
2000 – 2009
- 2009
- [j37]Marcelo Siqueira
A new construction of smooth surfaces from triangle meshes using parametric pseudo-manifolds. Comput. Graph. 33(3): 331-340 (2009) - 2008
- [j36]Marcelo Siqueira
Topological Repairing of 3D Digital Images. J. Math. Imaging Vis. 30(3): 249-274 (2008) - [i5]Jean H. Gallier:
Discrete Mathematics for Computer Science, Some Notes. CoRR abs/0805.0585 (2008) - 2006
- [j35]Jean H. Gallier:
The Completeness of Propositional Resolution: A Simple and Constructive Proof. Log. Methods Comput. Sci. 2(5) (2006) - [i4]Jean H. Gallier:
Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches. CoRR abs/cs/0606055 (2006) - [i3]Jean H. Gallier, Weqing Gu:
Fast and Simple Methods For Computing Control Points. CoRR abs/cs/0606056 (2006) - [i2]Jean H. Gallier:
On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches. CoRR abs/cs/0606061 (2006) - [i1]Jean H. Gallier:
The Completeness of Propositional Resolution: A Simple and Constructive Proof. CoRR abs/cs/0606084 (2006) - 2005
- [j34]Suneeta Ramaswami, Marcelo Siqueira
Constrained quadrilateral meshes of bounded size. Int. J. Comput. Geom. Appl. 15(1): 55-98 (2005) - 2003
- [j33]Jean H. Gallier, Salvatore La Torre, Supratik Mukhopadhyay:
Deterministic finite automata with recursive calls and DPDAs. Inf. Process. Lett. 87(4): 187-193 (2003) - [c18]Suneeta Ramaswami, Marcelo Siqueira, Tessa A. Sundaram, Jean H. Gallier, James C. Gee:
A New Algorithm for Generating Quadrilateral Meshes and its Application to FE-Based Image Registration. IMR 2003: 159-170
1990 – 1999
- 1999
- [j32]Jean H. Gallier:
A simple method for drawing a rational curve as two Bézier segments. ACM Trans. Graph. 18(4): 316-328 (1999) - 1998
- [j31]Jean H. Gallier:
Typing Untyped lambda-Terms, or Reducibility Strikes Again! Ann. Pure Appl. Log. 91(2-3): 231-270 (1998) - 1997
- [j30]Jean H. Gallier:
Kripke Models and the (In)equational Logic of the Second-Order lambda-Calculus. Ann. Pure Appl. Log. 84(3): 257-316 (1997) - [j29]Jean H. Gallier:
Erratum to "What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory". Ann. Pure Appl. Log. 89(2-3): 275 (1997) - [c17]Jean H. Gallier:
Drawing Closed Rational Surfaces. SCG 1997: 370-372 - 1996
- [c16]Douglas DeCarlo, Jean H. Gallier:
Topological Evolution of Surfaces. Graphics Interface 1996: 194-203 - 1995
- [j28]Jean H. Gallier:
Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves. Theor. Comput. Sci. 142(2): 299-368 (1995) - 1994
- [j27]Val Tannen, Jean H. Gallier:
Polymorphic Rewriting Conserves Algebraic Confluence. Inf. Comput. 114(1): 1-29 (1994) - 1993
- [j26]Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder:
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time. J. ACM 40(1): 1-16 (1993) - [j25]Jean H. Gallier:
Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi. Theor. Comput. Sci. 110(2): 249-339 (1993) - [c15]Jean H. Gallier:
Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract). RTA 1993: 136 - 1992
- [j24]Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder:
Theorem Proving Using Equational Matings and Rigid E-Unification. J. ACM 39(2): 377-429 (1992) - [p1]Jean H. Gallier:
Unification procedures in automated deduction methods based on matings: A survey. Tree Automata and Languages 1992: 439- - 1991
- [j23]Jean H. Gallier:
What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory. Ann. Pure Appl. Log. 53(3): 199-260 (1991) - [j22]Val Tannen, Jean H. Gallier:
Polymorphic Rewriting Conserves Algebraic Strong Normalization. Theor. Comput. Sci. 83(1): 3-28 (1991) - 1990
- [j21]Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder:
Rigid E-Unification: NP-Completeness and Applications to Equational Matings. Inf. Comput. 87(1/2): 129-195 (1990)
1980 – 1989
- 1989
- [j20]Jean H. Gallier, Stan Raatz:
Extending SLD Resolution to Equational Horn Clauses using E-Unification. J. Log. Program. 6(1&2): 3-43 (1989) - [j19]Wayne Snyder, Jean H. Gallier:
Higher-Order Unification Revisited: Complete Sets of Transformations. J. Symb. Comput. 8(1/2): 101-140 (1989) - [j18]Jean H. Gallier, Wayne Snyder:
Complete Sets of Transformations for General E-Unification. Theor. Comput. Sci. 67(2&3): 203-260 (1989) - [c14]Val Tannen, Jean H. Gallier:
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence. ICALP 1989: 137-150 - 1988
- [c13]Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder:
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. CADE 1988: 182-196 - [c12]Jean H. Gallier, Tomás Isakowitz:
Rewriting in Order-sorted Equational Logic. ICLP/SLP 1988: 280-294 - [c11]Stan Raatz, Jean H. Gallier:
A Relational Semantics for Logic Programming. ICLP/SLP 1988: 1024-1035 - [c10]Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted:
Rigid E-Unification is NP-Complete. LICS 1988: 218-227 - 1987
- [b3]Jean H. Gallier:
Logic for Computer Science: Foundations of Automatic Theorem Proving. Wiley 1987, ISBN 978-0-471-61546-0, pp. I-XV, 1-511 - [j17]Bruno Courcelle, Jean H. Gallier:
Decidable Subcases of The Equivalence Problem for Recursive Program Schemes. RAIRO Theor. Informatics Appl. 21(3): 245-286 (1987) - [j16]Jean H. Gallier, Stan Raatz:
Hornlog: A Graph-Based Interpreter for General Horn Clauses. J. Log. Program. 4(2): 119-155 (1987) - [j15]Jean H. Gallier:
Fast Algorithms for Testing Unsatisfiability of Ground Horn Clauses with Equations. J. Symb. Comput. 4(2): 233-254 (1987) - [j14]Alex Pelin, Jean H. Gallier:
Building Exact Computation Sequences. Theor. Comput. Sci. 53: 125-150 (1987) - [c9]Jean H. Gallier, Stan Raatz, Wayne Snyder:
Theorem Proving Using Rigid E-Unification Equational Matings. LICS 1987: 338-346 - [c8]Jean H. Gallier, Wayne Snyder:
A General Complete E-Unification Procedure. RTA 1987: 216-227 - 1986
- [b2]Jean H. Gallier:
Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row 1986, ISBN 0-06-042225-4 - [j13]William F. Dowling, Jean H. Gallier:
Continuation Semantics for Flowgraph Equations. Theor. Comput. Sci. 44: 307-331 (1986) - [c7]Alex Pelin, Jean H. Gallier:
Exact Computation Sequences. CAAP 1986: 45-59 - [c6]Jean H. Gallier, Stan Raatz:
SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification. SLP 1986: 168-179 - 1985
- [j12]Karl M. Schimpf, Jean H. Gallier:
Tree Pushdown Automata. J. Comput. Syst. Sci. 30(1): 25-40 (1985) - [j11]Jean H. Gallier, Ronald V. Book:
Reductions in Tree Replacement Systems. Theor. Comput. Sci. 37: 123-150 (1985) - [c5]Jean H. Gallier, Stan Raatz:
Logic Programming and Graph Rewriting. SLP 1985: 208-219 - 1984
- [j10]William F. Dowling, Jean H. Gallier:
Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Log. Program. 1(3): 267-284 (1984) - [j9]Jean H. Gallier:
n-Rational Algebras I. Basic Properties and Free Algebras. SIAM J. Comput. 13(4): 750-775 (1984) - [j8]Jean H. Gallier:
n-Rational Algebras II. Varieties and Logic of Inequalities. SIAM J. Comput. 13(4): 776-794 (1984) - [c4]Alex Pelin, Jean H. Gallier:
Solving Word Problems in Free Algebras Using Complexity Functions. CADE 1984: 476-495 - 1982
- [j7]Jean H. Gallier:
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186. Theor. Comput. Sci. 17: 111 (1982) - [j6]Jean H. Gallier:
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. Theor. Comput. Sci. 19: 229 (1982) - [c3]Fahimeh Jalili, Jean H. Gallier:
Building Friendly Parsers. POPL 1982: 196-206 - 1981
- [j5]Jean H. Gallier:
Recursion-Closed Algebraic Theories. J. Comput. Syst. Sci. 23(1): 69-105 (1981) - [j4]Jean H. Gallier:
Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I. Theor. Comput. Sci. 13: 193-223 (1981) - [j3]Jean H. Gallier:
Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II. Theor. Comput. Sci. 13: 239-270 (1981) - [j2]Jean H. Gallier:
DPDA's in 'Atomic Normal Form' and Applications to Equivalence Problems. Theor. Comput. Sci. 14: 155-186 (1981) - 1980
- [j1]Jean H. Gallier:
On The Existence of Optimal Fixpoints. Math. Syst. Theory 13: 209-217 (1980)
1970 – 1979
- 1979
- [c2]Jean H. Gallier:
Recursion Schemes and Generalized Interpretations (Extended Abstract). ICALP 1979: 256-270 - 1978
- [b1]Jean H. Gallier:
Semantics and correctness of classes of deterministic and nondeterministic recursive programs. University of California, Santa Barbara, CA, USA, 1978, pp. 1-237 - [c1]Jean H. Gallier:
Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures. ICALP 1978: 251-267
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: