Romain Beauxis

I am a post-doctoral researcher at the Mathematics Department of Tulane University under the supervision of Michael Mislove, supported by the Office of Naval Research. I got my PhD Degree in 2009 under the supervision of Catuscia Palamidessi (in the Lix, Paris) in Formal Models for Security.

Contact

• Email: romain.beauxis@gmail.com
• Postal address: Mathematics Department, Tulane University, 6823 St. Charles Ave, New Orleans, LA 70118, USA

Profesionnal

You can find a CV here.

Here is the list of my publications :

• Romain Beauxis, Samuel Mimram. A Non-Standard Semantics for Kahn Networks in Continuous Time. 20th Conference on Computer Science Logic, 2011
• Elie Bursztein, Romain Beauxis, Hristo Paskov, Daniele Perito, Celine Fabry and John Mitchell. The Failure of Noise-Based Non-Continuous Audio Captchas. 37th IEEE Symposium on Security & Privacy, Oakland California. 2011. Slides of the presentation
• David Baelde, Romain Beauxis and Samuel Mimram. Liquidsoap: A High-Level Programming Language for Multimedia Streaming In Ivana Cerná et al. editors, SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, 2011.
• Romain Beauxis, Catusica Palamidessi and Frank Valencia. On the asynchronous nature of the asynchronous pi-calculus. In Pierpaolo Degano, Rocco De Nicola and José Meseguer, editors, Concurrency, Graphs and Models, volume 5065 of Lecture Notes in Computer Science, pages 473-492, Springer, 2008
• Romain Beauxis, Catuscia Palamidessi, Kostas Chatzikokolakis and Prakash Panangaden. Formal Approaches to Information-Hiding (Tutorial). In Gilles Barthe and Cédric Fournet, editors. Proceedings of the Third Symposium of Trustworthy Global Computing (TGC 2007), volume 4912 of Lecture Notes in Computer Science, pages 347-362. Springer, 2008
• Romain Beauxis and Catuscia Palamidessi. Probabilistic and nondeterministic aspects of anonymity. Theoretical Computer Science. Special Issue. Invited Paper
• Romain Beauxis. Reducing redundant interleavings in concurrent computations. Technical report. École Polytechnique
• Romain Beauxis. Probabilistic and concurrent models for security. In Maria Garcia de la Banda and Enrico Pontelli, editors. Proceedings of the 24th International Conference on Logic Programming, volume 5366 of Lecture Notes in Computer Science. Springer, 2008
• Romain Beauxis. A smooth probabilistic extension of concurrent constraint programming (poster). Best Student Poster,SOFSEM 2009.

Talks

Recent talks:

• Liquidsoap: a High-Level Programming Language for Multimedia Streaming. Presented at SOFSEM 2011. Slides of the presentation
• Functional programming for (elegant) Mathematicians: a talk I gave during the senior seminar for math students presenting recent ideas in monadic computations. Slides of the talk, code used for the examples.

Teaching

Everything is here

Other

Recent readings:

• Ned Sublette, Cuba and Its Music: From the First Drums to the Mambo: Excellent book about Cuban Music in the context of its various historical cultural roots.
• Ned Sublette, The World That Made New Orleans: From Spanish Silver to Congo Square: Same as above but focused on New Orleans
• George W. Cable, Strange True Stories of Louisana: Amazing collection of alledged true stories from the early times of Louisiana.
• Laura Locoul Gore, Memories of the Old Plantation Home: Interesting story about the Laura Plantation, collected for the purpose of the associated tour.
• Antoine Bello, Les Falsificateurs: Brilliant novel on the Orwelian theme of historical falsifications, but with a totally different twist..

Some friends:

• David Baelde
• Sylvain Pradalier
• Antoine Gaillard
• Florian Richoux
• Samuel Mimram
• Miki Hermann
• Eric Durand

Projects

• HW - A mechanical theorem prover: plans of the machine.

Some propagande: http://rezo.net/

This page is valid hand-made HTML, guaranteed CSS and Javascript free, best viewed with any browser !

Last modified: November 5, 1985