2343 search results - page 220 / 469 » Structure and Interpretation of Computer Programs |
177
click to vote
MPC
1992
Springer
15 years 10 months ago
1992
Springer
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
142
Voted
ESOP
2009
Springer
16 years 1 months ago
2009
Springer
ion for Concurrent Objects Ivana Filipovi´c, Peter O’Hearn, Noam Rinetzky, and Hongseok Yang Queen Mary University of London, UK Concurrent data structures are usually designed ...
165
click to vote
OOPSLA
2009
Springer
16 years 29 days ago
2009
Springer
The Task Parallel Library (TPL) is a library for .NET that makes it easy to take advantage of potential parallelism in a program. The library relies heavily on generics and delega...
195
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
144
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...