Sciweavers

11214 search results - page 1999 / 2243
» Just-in-time data structures
Sort
View
202
Voted
PEPM
1992
ACM
15 years 10 months ago
Self-applicable C Program Specialization
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
Lars Ole Andersen
STACS
1992
Springer
15 years 10 months ago
A Simplified Technique for Hidden-Line Elimination in Terrains
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
Franco P. Preparata, Jeffrey Scott Vitter
PODC
1990
ACM
15 years 10 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
VLDB
1989
ACM
114views Database» more  VLDB 1989»
15 years 10 months ago
Extending the Relational Algebra to Capture Complex Objects
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
Bernhard Mitschang
SPAA
1990
ACM
15 years 10 months ago
Parallel Algorithms for Arrangements
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
Richard J. Anderson, Paul Beame, Erik Brisson
« Prev « First page 1999 / 2243 Last » Next »