default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDai Tri Man Le
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[b1]Dai Tri Man Le:
Bounded Arithmetic and Formalizing Probabilistic Proofs. University of Toronto, Canada, 2019- 2014
- [j6]Stephen A. Cook, Yuval Filmus, Dai Tri Man Le:
The complexity of the comparator circuit value problem. ACM Trans. Comput. Theory 6(4): 15:1-15:44 (2014) - 2012
- [i7]Stephen A. Cook, Yuval Filmus, Dai Tri Man Le:
The Complexity of the Comparator Circuit Value Problem. CoRR abs/1208.2721 (2012) - 2011
- [j5]Dai Tri Man Le, Stephen A. Cook:
Formalizing Randomized Matching Algorithms. Log. Methods Comput. Sci. 8(3) (2011) - [j4]Dai Tri Man Le:
On Three Alternative Characterizations of Combined Traces. Fundam. Informaticae 113(3-4): 265-293 (2011) - [j3]Ryszard Janicki, Dai Tri Man Le:
Modelling concurrency with comtraces and generalized comtraces. Inf. Comput. 209(11): 1355-1389 (2011) - [c6]Dai Tri Man Le, Stephen A. Cook, Yuli Ye:
A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem. CSL 2011: 381-395 - [c5]Dai Tri Man Le, Stephen A. Cook:
Formalizing Randomized Matching Algorithms. LICS 2011: 185-194 - [i6]Dai Tri Man Le, Stephen A. Cook, Yuli Ye:
Complexity Classes and Theories for the Comparator Circuit Value Problem. CoRR abs/1106.4142 (2011) - 2010
- [c4]Dai Tri Man Le:
A Characterization of Combined Traces Using Labeled Stratified Order Structures. Petri Nets 2010: 104-124 - [i5]Dai Tri Man Le:
A Characterization of Combined Traces Using Labeled Stratified Order Structures. CoRR abs/1004.0056 (2010) - [i4]Dai Tri Man Le:
On Three Alternative Characterizations of Combined Traces. CoRR abs/1011.1030 (2010)
2000 – 2009
- 2009
- [c3]Ryszard Janicki, Dai Tri Man Le, Nadezhda Zubkova:
Closure Operators for Order Structures. FCT 2009: 217-229 - [i3]Ryszard Janicki, Dai Tri Man Le:
Modelling Concurrency with Comtraces and Generalized Comtraces. CoRR abs/0907.1722 (2009) - [i2]Dai Tri Man Le:
Modelling Concurrent Behaviors in the Process Specification Language. CoRR abs/0907.2775 (2009) - [i1]Dai Tri Man Le:
Statechart Verification with iState. CoRR abs/0909.1361 (2009) - 2008
- [j2]Dai Tri Man Le, Ryszard Janicki:
A Categorical Approach to Mereology and Its Application to Modelling Software Components. Trans. Rough Sets 8: 146-174 (2008) - [c2]Ryszard Janicki, Dai Tri Man Le:
Modelling Concurrency with Quotient Monoids. Petri Nets 2008: 251-269 - 2007
- [j1]Ryszard Janicki, Dai Tri Man Le:
Towards a Pragmatic Mereology. Fundam. Informaticae 75(1-4): 295-314 (2007) - 2006
- [c1]Dai Tri Man Le, Ryszard Janicki:
On a Parthood Specification Method for Component Software. RSCTC 2006: 537-546
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
