WDAG 2005 - PDF Preprint Papers

WDAG 2005 International Workshop on Distributed Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WDAG-2005 Paper

click to vote

WDAG
2005
Springer

157views Algorithms» more WDAG 2005»

(Almost) All Objects Are Universal in Message Passing Systems

13 years 10 months ago

Download www.liafa.jussieu.fr

d Abstract) Carole Delporte-Gallet1 , Hugues Fauconnier2 , and Rachid Guerraoui3 1 ESIEE-IGM Marne-La-Vallee, France 2 LIAFA Univ Paris VII, France 3 EPFL Lausanne, Switzerland Thi...

Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	157	(Almost) All Objects Are Universal in Message Passing Systems	claim
2	130	Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs	claim
3	118	Distributed Computing with Imperfect Randomness	claim
4	111	Byzantine Clients Rendered Harmless	claim
5	108	Non-blocking Hashtables with Open Addressing	claim
6	108	Optimistic Generic Broadcast	claim
7	104	Polymorphic Contention Management	claim
8	103	Adaptive Software Transactional Memory	claim
9	102	Papillon: Greedy Routing in Rings	claim
10	102	Computing with Reads and Writes in the Absence of Step Contention	claim
11	102	On Conspiracies and Hyperfairness in Distributed Computing	claim
12	101	Keeping Denial-of-Service Attackers in the Dark	claim
13	100	The Dynamic And-Or Quorum System	claim
14	98	Compact Routing for Graphs Excluding a Fixed Minor	claim
15	94	Causing Communication Closure: Safe Program Composition with Non-FIFO Channels	claim
16	92	Could any Graph be Turned into a Small-World?	claim
17	92	Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks	claim
18	92	Plausible Clocks with Bounded Inaccuracy	claim
19	92	Timing Games and Shared Memory	claim
20	90	Proving Atomicity: An Assertional Approach	claim
21	88	Optimal Resilience for Erasure-Coded Byzantine Distributed Storage	claim
22	85	Time and Space Lower Bounds for Implementations Using k-CAS	claim
23	82	Distributed Transactional Memory for Metric-Space Networks	claim
24	80	Obstruction-Free Algorithms Can Be Practically Wait-Free	claim
25	77	Restricted Stack Implementations	claim
26	74	On the Availability of Non-strict Quorum Systems	claim
27	69	Reliably Executing Tasks in the Presence of Malicious Processors	claim
28	67	What Can Be Implemented Anonymously?	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers