Sciweavers

326 search results - page 22 / 66
» Closing the Gap
Sort
View
PLDI
1997
ACM
15 years 2 months ago
Two for the Price of One: Composing Partial Evaluation and Compilation
One of the flagship applications of partial evaluation is compilation and compiler generation. However, partial evaluation is usually expressed as a source-to-source transformati...
Michael Sperber, Peter Thiemann
PLDI
1996
ACM
15 years 2 months ago
Target-Sensitive Construction of Diagnostic Programs for Procedure Calling Sequence Generators
Building compilers that generate correct code is difficult. In this paper we present a compiler testing technique that closes the gap between actual compiler implementations and c...
Mark W. Bailey, Jack W. Davidson
HPTS
1993
146views Database» more  HPTS 1993»
15 years 2 months ago
Parallel Query Processing in Shared Disk Database Systems
System developments and research on parallel query processing have concentrated either on "Shared Everything" or "Shared Nothing" architectures so far. While t...
Erhard Rahm
90
Voted
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
15 years 1 months ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...
107
Voted
FSTTCS
1991
Springer
15 years 1 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich