Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Leader election and renaming with optimal message complexity

Leader election and renaming with optimal message complexity

Thumbnail Image
Download
Name

890151019-MIT.pdf

Description
Full printable version
Size

750.98 KB

Format

Adobe PDF

Checksum (MD5)

2a1636a87370eeee3a2730e1b6cde44c

Author(s)
Gelashvili, Rati
Advisor(s)
Nir Shavit.
Date Issued
2014
Publisher
Massachusetts Institute of Technology
Abstract
Asynchronous message-passing system is a standard distributed model, where n processors communicate over unreliable channels, controlled by a strong adaptive adversary. The asynchronous nature of the system and the fact that t
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 65-68).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Persistent DSpace Link
http://hdl.handle.net/1721.1/89859
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.