494 search results - page 31 / 99 » Heap Building Bounds |
133
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
135
Voted
SAS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
166
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
125
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
132
click to vote
SIGCOMM
1996
ACM
15 years 8 months ago
1996
ACM
Hierarchical Packet Fair Queueing (H-PFQ)algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing s...