Dai Tri Man Le

According to our database1, Dai Tri Man Le authored at least 15 papers between 2006 and 2019.

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

2019
Bounded Arithmetic and Formalizing Probabilistic Proofs.
PhD thesis, 2019

2014
The complexity of the comparator circuit value problem.
ACM Trans. Comput. Theory, 2014

2011
Modelling concurrency with comtraces and generalized comtraces.
Inf. Comput., 2011

On Three Alternative Characterizations of Combined Traces.
Fundam. Informaticae, 2011

Complexity Classes and Theories for the Comparator Circuit Value Problem
CoRR, 2011

Formalizing Randomized Matching Algorithms
Log. Methods Comput. Sci., 2011

A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem.
Proceedings of the Computer Science Logic, 2011

2010
A Characterization of Combined Traces Using Labeled Stratified Order Structures.
Proceedings of the Applications and Theory of Petri Nets, 2010

2009
Statechart Verification with iState
CoRR, 2009

Modelling Concurrent Behaviors in the Process Specification Language
CoRR, 2009

Closure Operators for Order Structures.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008
A Categorical Approach to Mereology and Its Application to Modelling Software Components.
Trans. Rough Sets, 2008

Modelling Concurrency with Quotient Monoids.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

2007
Towards a Pragmatic Mereology.
Fundam. Informaticae, 2007

2006
On a Parthood Specification Method for Component Software.
Proceedings of the Rough Sets and Current Trends in Computing, 2006


  Loading...