2095 search results - page 248 / 419 » Improved pebbling bounds |
168
click to vote
ISPD
1997
ACM
15 years 11 months ago
1997
ACM
In this paper, we study optimal bu er design in high-performance VLSI systems. Speci cally, we design a bu er for a given load such that chip area and power dissipation are minima...
155
click to vote
PODC
1997
ACM
15 years 11 months ago
1997
ACM
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
165
click to vote
RTSS
1996
IEEE
15 years 11 months ago
1996
IEEE
We present an integrated framework for developing realtime systems in which lock-free algorithms are employed to implement shared objects. There are two key objectives of our work...
176
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
171
click to vote
FC
2010
Springer
15 years 10 months ago
2010
Springer
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...