Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Distributed Computing: 13th International Symposium, DISC' 99, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings > Randomness Recycling in Constant-Round Private Computations
Distributed Computing: 13th International Symposium, DISC' 99, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings |
Prasad Jayanti
Springer Berlin Heidelberg
Distributed Computing: 13th International Symposium, DISC' 99, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings
Randomness Recycling in Constant-Round Private Computations
Authors

Carlo Blundo; Clemente Galdi; Pino Persiano

ARI Id

1664828101718_3684276

Access

Not Available Free

Pages

140-149

DOI

10.1007/3-540-48169-9_10

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-48169-9_10

Table of Contents of Book
Showing 1 to 20 of 26 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-X
A Case for Message Oriented Middleware
Guruduth Banavar; Tushar Chandra; Robert Strom; Daniel Sturman
1-17
Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast
Marcos Kawazoe Aguilera; Sam Toueg; Borislav Deianov
19-34
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Mikel Larrea; Sergio Arevalo; Antonio Fernndez
34-49
Solving Consensus Using Chandra-Toueg’s Unreliable Failure Detectors: A General Quorum-Based Approach
Achour Mostéfaoui; Michel Raynal
49-63
A Dynamic Primary Configuration Group Communication Service
Roberto De Prisco; Alan Fekete; Nancy Lynch; Alex Shvartsman
64-78
Asynchronous Group Membership with Oracles
Kal Lin; Vassos Hadzilacos
79-94
Generic Broadcast
Fernando Pedone; André Schiper
94-106
Non-blocking Asynchronous Byzantine Quorum Systems
Rida A. Bazzi
109-122
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Bernd Altmann; Matthias Fitzi; Ueli Maurer
123-139
Randomness Recycling in Constant-Round Private Computations
Carlo Blundo; Clemente Galdi; Pino Persiano
140-149
Abuse-Free Multi-party Contract Signing
Juan A. Garay; Philip MacKenzie
151-166
Fair and Efficient Mutual Exclusion Algorithms
K. Alagarsamy; K. Vidyasankar
166-179
Fast and Scalable Mutual Exclusion
James H. Anderson; Yong-Jik Kim
180-195
The Congenial Talking Philosophers Problem in Computer Networks
Yuh-Jzer Joung
195-211
Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution
Ashis Tarafdar; Vijay K. Garg
212-225
DUALITY: An Architecture Independent Design Model for Parallel Systems Based on Partial Order Semantics
Camelia Zlatea; Tzilla Elrad
226-239
A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems
Joffroy Beauquier; Béatrice Bérard; Laurent Fribourg
240-255
Stabilization-Preserving Atomicity Refinement
Mikhail Nesterenko; Anish Arora
256-268
Self-Testing/Correcting Protocols
Matthew Franklin; Juan A. Garay; Moti Yung
269-284
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 26 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings