default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoma Chaudhuri
Person information
- affiliation: Iowa State University, Ames, Iowa, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c15]Soma Chaudhuri, Reginald Frank
, Jennifer L. Welch:
How Fast Reads Affect Multi-Valued Register Simulations. PODC 2019: 215-217- 2017
- [j10]Hala Hamadeh, Soma Chaudhuri, Akhilesh Tyagi:
Area, energy, and time assessment for a distributed TPM for distributed trust in IoT clusters. Integr. 58: 267-273 (2017) - 2015
- [c14]Hala Hamadeh, Soma Chaudhuri, Akhilesh Tyagi:
Area, Energy, and Time Assessment for a Distributed TPM for Distributed Trust in IoT Clusters. iNIS 2015: 225-230
2000 – 2009
- 2006
- [e2]Soma Chaudhuri, Samir R. Das, Himadri S. Paul, Srikanta Tirthapura:
Distributed Computing and Networking, 8th International Conference, ICDCN 2006, Guwahati, India, December 27-30, 2006. Lecture Notes in Computer Science 4308, Springer 2006, ISBN 3-540-68139-6 [contents] - 2005
- [c13]Jun Ge, Soma Chaudhuri, Akhilesh Tyagi:
Control flow based obfuscation. Digital Rights Management Workshop 2005: 83-92 - 2004
- [e1]Soma Chaudhuri, Shay Kutten:
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004. ACM 2004, ISBN 1-58113-802-4 [contents] - 2000
- [j9]Soma Chaudhuri, Martha J. Kosa, Jennifer L. Welch:
One-write algorithms for multivalued regular and atomic registers. Acta Informatica 37(3): 161-192 (2000) - [j8]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
Tight bounds for k-set agreement. J. ACM 47(5): 912-943 (2000)
1990 – 1999
- 1999
- [j7]Soma Chaudhuri, Maurice Herlihy, Mark R. Tuttle:
Wait-Free Implementations in Message-Passing Systems. Theor. Comput. Sci. 220(1): 211-245 (1999) - 1998
- [j6]Hagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch:
Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies. SIAM J. Comput. 27(1): 65-89 (1998) - 1996
- [c12]Soma Chaudhuri, Sundar Kanthadai, Jennifer L. Welch:
The Role of Data-Race-Free Programs in Recoverable DSM (Abstract). PODC 1996: 245 - [c11]Soma Chaudhuri, Paul Reiners:
Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract). WDAG 1996: 362-379 - 1995
- [j5]Soma Chaudhuri, Brian A. Coan, Jennifer L. Welch:
Using Adaptive Timeouts to Achieve At-Most-Once Message Delivery. Distributed Comput. 9(3): 109-117 (1995) - [p1]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
A Tight Lower Bound for Processor Coordination. Responsive Computer Systems 1995: 1-18 - 1994
- [j4]Soma Chaudhuri, Jennifer L. Welch:
Bounds on the Costs of Multivalued Register Implementations. SIAM J. Comput. 23(2): 335-354 (1994) - [c10]Soma Chaudhuri, Mark R. Tuttle:
Fast Increment Registers. WDAG 1994: 74-88 - 1993
- [j3]Soma Chaudhuri:
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Inf. Comput. 105(1): 132-158 (1993) - [c9]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
A Tight Lower Bound for k-Set Agreement. FOCS 1993: 206-215 - [c8]Soma Chaudhuri, Rainer Gawlick, Nancy A. Lynch:
Designing Algorithms for Distributed Systems with Partially Synchronized Clocks. PODC 1993: 121-132 - [c7]Hagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch:
Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies. SPAA 1993: 241-250 - 1991
- [j2]Soma Chaudhuri, Richard E. Ladner:
Safety and Liveness of omega-Context-Free Languages. Inf. Process. Lett. 37(1): 13-20 (1991) - [c6]Soma Chaudhuri, Martha J. Kosa, Jennifer L. Welch:
Upper and lower bounds for one-write multivalued regular registers. SPDP 1991: 134-141 - [c5]Soma Chaudhuri:
Towards a complexity hierarchy of wait-free concurrent objects. SPDP 1991: 730-737 - [c4]Soma Chaudhuri, Brian A. Coan, Jennifer L. Welch:
Using Adaptive Timeouts to Achive At-Most-Once Message Delivery. WDAG 1991: 151-166 - 1990
- [c3]Soma Chaudhuri:
Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous Systems. PODC 1990: 311-324 - [c2]Soma Chaudhuri, Jennifer L. Welch:
Bounds on the Costs of Register Implementations. WDAG 1990: 402-421
1980 – 1989
- 1987
- [j1]Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser:
Graph bisection algorithms with good average case behavior. Comb. 7(2): 171-191 (1987) - 1984
- [c1]Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser:
Graph Bisection Algorithms with Good Average Case Behavior. FOCS 1984: 181-192
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
