| Notes on Elementary Spectral Graph Theory. Applications to Graph Clustering Using Normalized Cuts. | 2 | 0.39 | 2013 |
| Discrete Mathematics for Computer Science, Some Notes | 0 | 0.34 | 2008 |
| Fast and Simple Methods For Computing Control Points | 0 | 0.34 | 2006 |
| Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches | 1 | 0.49 | 2006 |
| The Completeness of Propositional Resolution: A Simple and Constructive Proof. | 1 | 0.45 | 2006 |
| Constrained Quadrilateral Meshes Of Bounded Size | 5 | 0.56 | 2005 |
| A New Algorithm for Generating Quadrilateral Meshes and its Application to FE-Based Image Registration | 1 | 0.36 | 2003 |
| Deterministic finite automata with recursive calls and DPDAs | 0 | 0.34 | 2003 |
| A simple method for drawing a rational curve as two Bézier segments | 1 | 0.38 | 1999 |
| Kripke models and the (in)equational logic of the second-order λ-calculus | 0 | 0.34 | 1997 |
| Erratum to ``What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory | 0 | 0.34 | 1997 |
| Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi | 9 | 0.79 | 1993 |
| An algorithm for finding canonical sets of ground rewrite rules in polynomial time | 25 | 1.27 | 1993 |
| Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract) | 0 | 0.34 | 1993 |
| What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof Theory | 10 | 0.95 | 1991 |
| Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence | 22 | 2.99 | 1989 |
| Extending SLD resolution to equational horn clauses using E-unification | 26 | 1.67 | 1989 |
| Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time | 16 | 1.68 | 1988 |
| A Relational Semantics for Logic Programming | 0 | 0.34 | 1988 |
| Rewriting in Order-sorted Equational Logic | 3 | 0.55 | 1988 |
| Rigid E-unification is NP-complete | 19 | 1.47 | 1988 |
| Decidable Subcases of The Equivalence Problem for Recursive Program Schemes | 1 | 0.42 | 1987 |
| Theorem Proving Using Rigid E-Unification Equational Matings | 33 | 2.33 | 1987 |
| Hornlog: a graph-based interpreter for general horn clauses | 10 | 8.47 | 1987 |
| Fast algorithms for testing unsatisfiability of ground horn clauses with equations | 2 | 0.41 | 1987 |
| SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification | 14 | 1.06 | 1986 |
| Tree pushdown automata | 18 | 2.61 | 1985 |
| Logic Programming and Graph Rewriting | 4 | 2.98 | 1985 |
| Reductions In Tree Replacement Systems | 33 | 2.38 | 1985 |
| Linear-time algorithms for testing the satisfiability of propositional horn formulae | 429 | 62.11 | 1984 |
| Solving Word Problems in Free Algebras Using Complexity Functions | 0 | 0.34 | 1984 |
| N-Rational Algebras .1. Basic Properties And Free Algebras | 2 | 0.71 | 1984 |
| n-rational algebras II. varieties and logic of inequalities | 1 | 0.45 | 1984 |
| Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems | 0 | 0.34 | 1982 |
| Building friendly parsers | 31 | 4.04 | 1982 |
| Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186 | 0 | 0.34 | 1982 |
| Nondeterministic Flowchart Programs With Recursive Procedures - Semantics And Correctness .1. | 3 | 0.70 | 1981 |
| Recursion-closed algebraic theories | 8 | 2.31 | 1981 |
| Dpdas In Atomic Normal-Form And Applications To Equivalence Problems | 14 | 1.35 | 1981 |
| On The Existence of Optimal Fixpoints. | 1 | 1.09 | 1980 |
| Recursion Schemes and Generalized Interpretations (Extended Abstract) | 0 | 0.34 | 1979 |
| Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures | 4 | 0.71 | 1978 |
