Sciweavers

3775 search results - page 721 / 755
» The Expression Problem Revisited
Sort
View
SPAA
1997
ACM
15 years 5 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 5 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
ICSM
1994
IEEE
15 years 4 months ago
A Framework for Partial Data Flow Analysis
Although data pow analysis was first developed for use in compilers, its usefulness is now recognized in many software tools. Because of its compiler origins, the computation of d...
Rajiv Gupta, Mary Lou Soffa
PODC
1994
ACM
15 years 4 months ago
Using Belief to Reason about Cache Coherence
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
Lily B. Mummert, Jeannette M. Wing, Mahadev Satyan...
147
Voted
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 4 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein