• Publications
  • Influence
Geometric constraint solver
TLDR
This paper reports on the development of a 2D geometric constraint solver. Expand
An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem
TLDR
This paper develops an $O(m\log n) time algorithm to find a maximal planar subgraph. Expand
Program Derivation by Fixed Point Computation
TLDR
This paper develops a transformational paradigm by which nonnumerical algorithms are treated as fixed point computations derived from very high level problem specifications. Expand
Look ma, no hashing, and no arrays neither
TLDR
We show how multiset discrimination, together with other tools, can be tailored to rid compilation of hashing without loss in asymptotic performance. Expand
Using Multiset Discrimination to Solve Language Processing Problems Without Hashing
TLDR
We propose an efficient compiler methodology without hashing or sorting, and show how almost every subtask of compilation can be solved without hashing in worst case running time. Expand
Towards increased productivity of algorithm implementation
TLDR
This paper reports experimental results that support the feasibility of a new transformational approach developed by the authors for implementing complex algorithms correctly and efficiently. Expand
Type Analysis and Data Structure Selection
TLDR
We solve a modified form of Schwartz’s data structure selection problem with a simpler top-down transformation that uses a first-order parametric subtyping theory for inferring typings and type containments in a high-level declarative set-theoretic programming language. Expand
Binding performance at language design time
TLDR
An important research goal in software engineering and programming languages is the development of principles underlying the specification of computable problems, the translation of these problems into efficient and correct programs, and the performance analysis of these programs. Expand
More Efficient Bottom-Up Multi-Pattern Matching in Trees
TLDR
We trade a log factor in time for a linear space bottom-up pattern-matching algorithm that handles a wide subclass of Hoffmann and O'Donnell's class of simple patterns. Expand
More Efficient Bottom-Up Tree Pattern Matching
TLDR
Pattern matching in trees is fundamental to a variety of programming language systems. Expand
...
1
2
...