IFIP
1991
Springer
15 years 2 months ago
1991
Springer
68
Voted
ICALP
1991
Springer
15 years 2 months ago
1991
Springer
131
Voted
ICALP
1991
Springer
15 years 2 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
64
Voted
ICALP
1991
Springer
15 years 2 months ago
1991
Springer
61
Voted
ICALP
1991
Springer
15 years 2 months ago
1991
Springer
71
Voted
ICALP
1991
Springer
15 years 2 months ago
1991
Springer
We give an expected-case analysis of Delaunay triangulations. To avoid edge effects we consider a unit-intensity Poisson process in Euclidean d-space, and then limit attention to...
71
Voted
FPCA
1991
15 years 2 months ago
1991
We tackle the problem of detecting global variables in functional programs. We present syntactic criteria for single-threading which improves upon previous solutions (both syntact...
78
Voted
FPCA
1991
15 years 2 months ago
1991
We develop a calculus for lazy functional programming based on recursion operators associated with data type de nitions. For these operators we derive various algebraic laws that ...
FPCA
1991
15 years 2 months ago
1991
Objects with dynamic types allow the integration of operations that essentially require runtime type-checking into statically-typed languages. This article presents two extensions...
94
Voted
FPCA
1991
15 years 2 months ago
1991
Hannan. Making Abstract Machines Less Abstract . In Proc. of FPCA'91, LNCS 523, pages