Pierre Chambart

According to our database1, Pierre Chambart authored at least 12 papers between 2007 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Tenderbake - A Solution to Dynamic Repeated Consensus for Blockchains.
Proceedings of the 4th International Symposium on Foundations and Applications of Blockchain 2021, 2021

2020
Tenderbake - Classical BFT Style Consensus for Public Blockchains.
CoRR, 2020

2016
Forward analysis and model checking for trace bounded WSTS.
Theor. Comput. Sci., 2016

2011
On Post's embedding problem and the complexity of lossy channels. (Du problème de sous mot de Post et de la complexité des canaux non fiables).
PhD thesis, 2011

2010
Forward Analysis and Model Checking for Bounded WSTS
CoRR, 2010

Pumping and Counting on the Regular Post Embedding Problem.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Toward a Compositional Theory of Leftist Grammars and Transformations.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

Computing Blocker Sets for the Regular Post Embedding Problem.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2008
The Ordinal Recursive Complexity of Lossy Channel Systems.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

The omega-Regular Post Embedding Problem.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Mixing Lossy and Perfect Fifo Channels.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007


  Loading...