Search the dblp DataBase
Soma Chaudhuri :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jun Ge , Soma Chaudhuri , Akhilesh Tyagi Control flow based obfuscation. [Citation Graph (0, 0)][DBLP ] Digital Rights Management Workshop, 2005, pp:83-92 [Conf ] Thang Bui , Soma Chaudhuri , Frank Thomson Leighton , Michael Sipser Graph Bisection Algorithms with Good Average Case Behavior [Citation Graph (0, 0)][DBLP ] FOCS, 1984, pp:181-192 [Conf ] Soma Chaudhuri , Maurice Herlihy , Nancy A. Lynch , Mark R. Tuttle A Tight Lower Bound for k-Set Agreement [Citation Graph (0, 0)][DBLP ] FOCS, 1993, pp:206-215 [Conf ] Soma Chaudhuri Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous Systems. [Citation Graph (0, 0)][DBLP ] PODC, 1990, pp:311-324 [Conf ] Soma Chaudhuri , Rainer Gawlick , Nancy A. Lynch Designing Algorithms for Distributed Systems with Partially Synchronized Clocks. [Citation Graph (0, 0)][DBLP ] PODC, 1993, pp:121-132 [Conf ] Soma Chaudhuri , Sundar Kanthadai , Jennifer L. Welch The Role of Data-Race-Free Programs in Recoverable DSM (Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1996, pp:245- [Conf ] Hagit Attiya , Soma Chaudhuri , Roy Friedman , Jennifer L. Welch Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies. [Citation Graph (0, 0)][DBLP ] SPAA, 1993, pp:241-250 [Conf ] Soma Chaudhuri , Brian A. Coan , Jennifer L. Welch Using Adaptive Timeouts to Achive At-Most-Once Message Delivery. [Citation Graph (0, 0)][DBLP ] WDAG, 1991, pp:151-166 [Conf ] Soma Chaudhuri , Paul Reiners Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WDAG, 1996, pp:362-379 [Conf ] Soma Chaudhuri , Mark R. Tuttle Fast Increment Registers. [Citation Graph (0, 0)][DBLP ] WDAG, 1994, pp:74-88 [Conf ] Soma Chaudhuri , Jennifer L. Welch Bounds on the Costs of Register Implementations. [Citation Graph (0, 0)][DBLP ] WDAG, 1990, pp:402-421 [Conf ] Soma Chaudhuri , Martha J. Kosa , Jennifer L. Welch One-write algorithms for multivalued regular and atomic registers. [Citation Graph (0, 0)][DBLP ] Acta Inf., 2000, v:37, n:3, pp:161-192 [Journal ] Thang Nguyen Bui , Soma Chaudhuri , Frank Thomson Leighton , Michael Sipser Graph bisection algorithms with good average case behavior. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1987, v:7, n:2, pp:171-191 [Journal ] Soma Chaudhuri , Brian A. Coan , Jennifer L. Welch Using Adaptive Timeouts to Achieve At-Most-Once Message Delivery. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 1995, v:9, n:3, pp:109-117 [Journal ] Soma Chaudhuri More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1993, v:105, n:1, pp:132-158 [Journal ] Soma Chaudhuri , Richard E. Ladner Safety and Liveness of omega-Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:1, pp:13-20 [Journal ] Soma Chaudhuri , Maurice Herlihy , Nancy A. Lynch , Mark R. Tuttle Tight bounds for k -set agreement. [Citation Graph (0, 0)][DBLP ] J. ACM, 2000, v:47, n:5, pp:912-943 [Journal ] Hagit Attiya , Soma Chaudhuri , Roy Friedman , Jennifer L. Welch Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:27, n:1, pp:65-89 [Journal ] Soma Chaudhuri , Jennifer L. Welch Bounds on the Costs of Multivalued Register Implementations. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:2, pp:335-354 [Journal ] Soma Chaudhuri , Maurice Herlihy , Mark R. Tuttle Wait-Free Implementations in Message-Passing Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:220, n:1, pp:211-245 [Journal ] Towards a complexity hierarchy of wait-free concurrent objects. [Citation Graph (, )][DBLP ] Upper and lower bounds for one-write multivalued regular registers. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.004secs