Bastian Pochon

According to our database1, Bastian Pochon authored at least 18 papers between 2002 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
The Complexity of Early Deciding Set Agreement.
SIAM J. Comput., 2011

2010
Throughput optimal total order broadcast for cluster environments.
ACM Trans. Comput. Syst., 2010

2009
A topological treatment of early-deciding set-agreement.
Theor. Comput. Sci., 2009

2008
The collective memory of amnesic processes.
ACM Trans. Algorithms, 2008

2007
The Time-Complexity of Local Decision in Distributed Agreement.
SIAM J. Comput., 2007

The perfectly synchronized round-based model of distributed computing.
Inf. Comput., 2007

2006
Towards a theory of transactional contention managers.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

High Throughput Total Order Broadcast for Cluster Environments.
Proceedings of the 2006 International Conference on Dependable Systems and Networks (DSN 2006), 2006

2005
Polymorphic Contention Management.
Proceedings of the Distributed Computing, 19th International Conference, 2005

From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Toward a theory of transactional contention managers.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004
Fast non-blocking atomic commit: an inherent trade-off.
Inf. Process. Lett., 2004

The Complexity of Early Deciding Set Agreement: How can Topology help?
Proceedings of the Workshops on Geometric and Topological Methods in Concurrency Theory, 2004

The Driving Philosophers.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Tight Bounds on Early Local Decisions in Uniform Consensus.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Distributed Programming for Dummies: A Shifting Transformation Technique.
Proceedings of the 22nd Symposium on Reliable Distributed Systems (SRDS 2003), 2003

2002
A Note on Set Agreement with Omission Failures.
Proceedings of the 4th Workshop on GEometry and Topology in COncurrency and distributed systems theory, 2002

An Efficient Universal Construction for Message-Passing Systems.
Proceedings of the Distributed Computing, 16th International Conference, 2002


  Loading...