| Modelling concurrency with comtraces and generalized comtraces R Janicki, DTM Lê Information and Computation 209 (11), 1355-1389, 2011 | 22 | 2011 |
| The complexity of the comparator circuit value problem SA Cook, Y Filmus, DTM Lê ACM Transactions on Computation Theory (TOCT) 6 (4), 1-44, 2014 | 20 | 2014 |
| Weakly submodular functions A Borodin, DTM Le, Y Ye arXiv preprint arXiv:1401.6697, 2014 | 14 | 2014 |
| On three alternative characterizations of combined traces DTM Lê Fundamenta Informaticae 113 (3-4), 265-293, 2011 | 13 | 2011 |
| A categorical approach to mereology and its application to modelling software components DTM Lê, R Janicki Transactions on rough sets VIII, 146-174, 2008 | 13* | 2008 |
| A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem DTM Le, SA Cook, Y Ye Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual …, 2011 | 9 | 2011 |
| Modelling concurrency with quotient monoids R Janicki, DTM Lê Applications and Theory of Petri Nets: 29th International Conference, PETRI …, 2008 | 6 | 2008 |
| Formalizing randomized matching algorithms SA Cook Logical Methods in Computer Science 8, 2012 | 5 | 2012 |
| Statechart verification with iState DTM Le arXiv preprint arXiv:0909.1361, 2009 | 4 | 2009 |
| The complexity of the comparator circuit value problem SA Cook, Y Filmus, DTM Le arXiv preprint arXiv:1208.2721, 2012 | 3 | 2012 |
| A characterization of combined traces using labeled stratified order structures DTM Lê Applications and Theory of Petri Nets: 31st International Conference, PETRI …, 2010 | 3 | 2010 |
| Bounded Arithmetic and Formalizing Probabilistic Proofs DTM Le University of Toronto, 2014 | 2 | 2014 |
| Closure operators for order structures R Janicki, DTM Le, N Zubkova Fundamentals of Computation Theory, 217-229, 2009 | 2 | 2009 |
| Studies in Comtrace Monoids D Le | | 2008 |
Stephen CookDepartment of Computer Science, University of TorontoVerified email at cs.toronto.edu
