# Soma Chaudhuri

According to our database

Collaborative distances:

^{1}, Soma Chaudhuri authored at least 25 papers between 1984 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2019

How Fast Reads Affect Multi-Valued Register Simulations.

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2017

Area, energy, and time assessment for a distributed TPM for distributed trust in IoT clusters.

Integration, 2017

2005

Control flow based obfuscation.

Proceedings of the Fifth ACM Workshop on Digital Rights Management, 2005

2000

Tight bounds for

*k*-set agreement.
J. ACM, 2000

One-write algorithms for multivalued regular and atomic registers.

Acta Inf., 2000

1999

Wait-Free Implementations in Message-Passing Systems.

Theor. Comput. Sci., 1999

1998

Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies.

SIAM J. Comput., 1998

1996

Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract).

Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

The Role of Data-Race-Free Programs in Recoverable DSM (Abstract).

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

Using Adaptive Timeouts to Achieve At-Most-Once Message Delivery.

Distributed Computing, 1995

A Tight Lower Bound for Processor Coordination.

Proceedings of the Responsive Computer Systems: Steps Toward Fault-Tolerant Real-Time Systems, 1995

1994

Bounds on the Costs of Multivalued Register Implementations.

SIAM J. Comput., 1994

Fast Increment Registers.

Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

1993

More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems

Inf. Comput., July, 1993

Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies.

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Designing Algorithms for Distributed Systems with Partially Synchronized Clocks.

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

A Tight Lower Bound for k-Set Agreement

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1991

Safety and Liveness of omega-Context-Free Languages.

Inf. Process. Lett., 1991

Using Adaptive Timeouts to Achive At-Most-Once Message Delivery.

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Upper and lower bounds for one-write multivalued regular registers.

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Towards a complexity hierarchy of wait-free concurrent objects.

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1990

Bounds on the Costs of Register Implementations.

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous Systems.

Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

1987

Graph bisection algorithms with good average case behavior.

Combinatorica, 1987

1984

Graph Bisection Algorithms with Good Average Case Behavior

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984