Sciweavers

WDAG
2000
Springer
125views Algorithms» more  WDAG 2000»
13 years 8 months ago
Establishing Business Rules for Inter-Enterprise Electronic Commerce
Conventional mechanisms for electronic commerce provide strong means for securing transfer of funds, and for ensuring such things as authenticity and non-repudiation. But they gene...
Victoria Ungureanu, Naftaly H. Minsky
WDAG
2000
Springer
97views Algorithms» more  WDAG 2000»
13 years 8 months ago
Objects Shared by Byzantine Processes
Work to date on algorithms for message-passing systems has explored a wide variety of types of faults, but corresponding work on shared memory systems has usually assumed that only...
Dahlia Malkhi, Michael Merritt, Michael K. Reiter,...
WDAG
2000
Springer
81views Algorithms» more  WDAG 2000»
13 years 8 months ago
Distributed Cooperation During the Absence of Communication
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
Grzegorz Malewicz, Alexander Russell, Alexander A....
WDAG
2000
Springer
72views Algorithms» more  WDAG 2000»
13 years 8 months ago
Computing with Infinitely Many Processes
Michael Merritt, Gadi Taubenfeld
WDAG
2000
Springer
90views Algorithms» more  WDAG 2000»
13 years 8 months ago
Disk Paxos
Eli Gafni, Leslie Lamport
WDAG
2000
Springer
79views Algorithms» more  WDAG 2000»
13 years 8 months ago
Lower Bounds in Distributed Computing
Faith Ellen Fich, Eric Ruppert
WDAG
2000
Springer
68views Algorithms» more  WDAG 2000»
13 years 8 months ago
Approximation Algorithms for Survivable Optical Networks
Tamar Eilam, Shlomo Moran, Shmuel Zaks
WDAG
2000
Springer
87views Algorithms» more  WDAG 2000»
13 years 8 months ago
A Probabilistically Correct Leader Election Protocol for Large Groups
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
Indranil Gupta, Robbert van Renesse, Kenneth P. Bi...
WDAG
2000
Springer
112views Algorithms» more  WDAG 2000»
13 years 8 months ago
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
Paolo Boldi, Sebastiano Vigna