Liuba Shrira

Liuba Shrira is a professor of computer science at Brandeis University, whose research interests primarily involve distributed systems.[1]

Liuba Shrira received her PhD from Technion.[1] She is affiliated with the MIT Computer Science and Artificial Intelligence Laboratory. Previously, she was a researcher in the MIT Programming Methodology Group (1986–1997), a visiting researcher at Microsoft Research (2004–2005)[1], and a visiting professor at Technion (2010–2011)[2].

She is a member of the Association for Computing Machinery (ACM), which has recognized her as a Distinguished Scientist in 2009, and the IEEE Computer Society.[1]

Shrira was one of the founding members of the Systers mailing list for women in computing.[3]

Interests

According to her Brandeis bio page[4], Shrira is interested in the design and evaluation of system architectures that provide consistency and reliability without compromising on performance. For example, how to provide high-performance reliable storage in the presence of malicious attacks, how can a scalable Internet storage system support consistent sharing for mobile collaborators, how to make long-lived consistent past states available to an application without performance penalty, how to upgrade without down-time a storage system as it evolves over time.

Aside from technology and research she enjoys outdoor activities such as biking, hiking, and exploring caves.

Selected publications

Some of Liuba Shrira's publications include:

  • Barbara Liskov; Sanjay Ghemawat; Robert Gruber; Paul Johnson; Liuba Shrira; Michael Williams (1991). "Replication in the Harp File System". 13th ACM Symposium on Operating Systems Principles.[5]
  • Rivka Ladin; Barbara Liskov; Liuba Shrira; Sanjay Ghemawat (1992). "Providing high availability using lazy replication". ACM Transactions on Computer Systems.[6]
  • Chandrasekhar Boyapati; Barbara Liskov; Liuba Shrira (2003). "Ownership Types for Object Encapsulation". ACM Symposium on Principles of Programming Languages.[5]
gollark: You have a datacentre?
gollark: ↑ osmarks.tk
gollark: https://media.discordapp.net/attachments/426116061415342080/759526694699663420/data-centre.png
gollark: The Nyquist-Shannon sampling theorem.
gollark: Oh hey, it got "palaiologically" too.

References
  1. "Liuba Shrira". pages.cs.brandeis.edu.
  2. "Keynote Talk: Optimistic and pessimistic synchronization for data structures for in-memory stores | NETYS 2020" (in French). Retrieved 2020-02-01.
  3. "Founding Systers – AnitaB.org". anitaborg.org.
  4. https://www.cs.brandeis.edu/~liuba/
  5. "Liuba Shrira's publications". pmg.csail.mit.edu.
  6. Ladin, Rivka; Liskov, Barbara; Shrira, Liuba; Ghemawat, Sanjay (1 November 1992). "Providing high availability using lazy replication". ACM Transactions on Computer Systems. 10 (4): 360–391. CiteSeerX 10.1.1.586.7749. doi:10.1145/138873.138877.
External video
ACID Objects and Modularity in the Cloud, Microsoft Research, 5 June 2012
A New Approach to Old Storage, Google Tech Talks July 12, 2007


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.