Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Dwork, Cynthia Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 5 of 8 reviews    
  Wherefore art thou R3579X?: Anonymized social networks, hidden patterns, and structural steganography
Backstrom L., Dwork C., Kleinberg J. Communications of the ACM 54(12): 133-141, 2011.  Type: Article

This paper presents an extremely interesting informal review of recent work on discovering graph structures in social networks. The principal theme is that information about members in a social network can be obtained with relatively l...
...
Mar 14 2012  
  Contention in shared memory algorithms
Dwork C., Herlihy M., Waarts O. Journal of the ACM 44(6): 779-805, 1997.  Type: Article

It is well known that, in practice, the performance of shared memory multiprocessors can degrade severely in the presence of contention, which occurs when multiple processors access the same memory location concurrently. In this paper,...
...
Jun 1 1998  
  Perfectly secure message transmission
Dolev D., Dwork C., Waarts O., Yung M. Journal of the ACM 40(1): 17-47, 1993.  Type: Article

Perfect security of communications as defined here refers to both secrecy and integrity of communications. In an environment with perfect security where a sender and receiver have some number ...
Feb 1 1994  
  Performing work efficiently in the presence of faults
Dwork C., Halpern J. (ed), Waarts O.  Principles of distributed computing (, Vancouver, B.C., Canada, Aug 10-12, 1992) 1021992.  Type: Proceedings

The authors study this situation: t machines are available to perform n units of idempotent work; the machines execute synchronously, so the absence of an expected message at some time x...
Aug 1 1993  
  Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!
Dwork C., Waarts O.  Theory of computing (Proceedings of the twenty-fourth annual ACM symposium, Victoria, British Columbia, Canada, May 4-6, 1992) 655-666, 1992.  Type: Proceedings

The problem of bounded concurrent timestamping systems (CTSS) is developing an algorithmic and bounded data storage support for a system in which processors repeatedly choose labels whose order reflects the real-time order in which th...
...
May 1 1993  

 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy