Sciweavers

4184 search results - page 614 / 837
» Names of Our Lives
Sort
View
PODC
1993
ACM
15 years 10 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
ZUM
1992
Springer
15 years 10 months ago
Specification in Fresco
software in the form of abstract classes; and the specification elements of the language can also be used in concrete classes to document the implementations and their development ...
Alan Wills
ACISP
2007
Springer
15 years 10 months ago
Practical Compact E-Cash
Compact e-cash schemes allow a user to withdraw a wallet containing k coins in a single operation, each of which the user can spend unlinkably. One big open problem for compact e-c...
Man Ho Au, Willy Susilo, Yi Mu
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 10 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
C3S2E
2009
ACM
15 years 10 months ago
The promise of solid state disks: increasing efficiency and reducing cost of DBMS processing
Most database systems (DBMSs) today are operating on servers equipped with magnetic disks. In our contribution, we want to motivate the use of two emerging and striking technologi...
Karsten Schmidt 0002, Yi Ou, Theo Härder