316 search results - page 29 / 64 » On the Space Complexity of Randomized Synchronization |
FOCS
1990
IEEE
15 years 2 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
LATIN
2010
Springer
15 years 10 hour ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
MA
2010
Springer
14 years 8 months ago
2010
Springer
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
CLUSTER
2008
IEEE
15 years 4 months ago
2008
IEEE
—Remote atomic memory operations are critical for achieving high-performance synchronization in tightly-coupled systems. Previous approaches to implementing atomic memory operati...
EMSOFT
2010
Springer
14 years 8 months ago
2010
Springer
In the design of hard real-time systems, the feasibility of the task set is one of the primary concerns. However, in embedded systems with scarce resources, optimizing resource us...