Dai T. M. Le (Lê Đại Trí Mẫn)

Selected Publications

1. D. T. M. Le, S. A. Cook and Y. Ye: A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem. To appear in CSL'11 (Computer Science Logic).
   • Conference (short) version: [DROPS]. Full version: .
   • The work was also presented in the LCC'11 (Logic and Computational Complexity) workshop. Presentation slides: .
   • Slides for Prague's Logic and Complexity Seminar: .
     NOTE: open problem 1 on the last slide has been solved affirmatively by Yuval Filmus!
     
     
2. D. T. M. Le and S. A. Cook: Formalizing Randomized Matching Algorithms. In Proceedings of LICS'11 (Logic in Computer Science).
   • Full version with appendices: [arXiv.org]. Presentation slides: .
     
     
3. D. T. M. Le: On Three Alternative Characterizations of Combined Traces. To appear in the special Fundamentae Informatica issue of Petri Nets '10. [arXiv.org]
   (This paper is the revised and expanded version of the PETRI NET '10 paper below.)
   
   
4. D. T. M. Le: A Characterization of Combined Traces using Labeled Stratified Order Structures. In Proceedings of PETRI NETS 2010 (Application and Theory of Petri Nets and other models of concurrency).
   • Full version with appendices: [arXiv.org]. Presentation slides: .
     
     
5. R. Janicki, D. T. M. Le: Modelling Concurrency with Comtraces and Generalized Comtraces. Journal of Information and Computation 209, pages 1355–1389, 2011. [arXiv.org]

Notes and Expositions

• Lecture notes for Avi Wigderson's talks on "Randomness, Pseudorandomness and Derandomization" from the Fields Distinguished Lecture Series, Sept 2010.
  1. Randomness - A computational complexity view.
  2. Cryptography and Pseudorandomness.
  3. Expander graphs - a ubiquitous pseudorandom structure.
  I also wrote an article on Avi's talks for the Fields Institute's Winter 2011 newsletter.

Thesis

• Studies in Comtrace Monoids, Master's Thesis, McMaster University, 2008.