Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
Communication complexity of atomic commitment and of gossiping
Ouri Wolfson, Adrian Segall
Columbia University
Research output
:
Contribution to journal
›
Article
›
peer-review
24
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Communication complexity of atomic commitment and of gossiping'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Communication Complexity
100%
Gossip
100%
Atomic Commitment
100%
Communication Cost
50%
Linear Time
25%
Distributed Algorithms
25%
Minimum Spanning Tree
25%
Number of Participants
25%
Distributed Databases
25%
Two-phase Commit
25%
Communication Time
25%
Gossip Problem
25%
Communication Delay
25%
Time Distributed
25%
Computer Science
Communication Cost
100%
Communication Complexity
100%
Distributed Algorithm
50%
Minimum Spanning Tree
50%
Distributed Databases
50%
Two-Phase Commit
50%
Phase Commit Protocol
50%
Communication Delay
50%
Mathematics
Upper Bound
100%
Minimum Spanning Tree
100%
Linear Time
100%