default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMing-wei Wang
Person information
- affiliation: Microsoft Corporation, Redmond, WA, USA
- affiliation (PhD 2004): University of Waterloo, Department of Computer Science, Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j13]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Inverse star, borders, and palstars. Inf. Process. Lett. 111(9): 420-422 (2011)- 2010
- [i3]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Inverse Star, Borders, and Palstars. CoRR abs/1008.2440 (2010)
2000 – 2009
- 2005
- [j12]Michael Domaratzki
, Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang:
Non-uniqueness and radius of cyclic unary NFAs. Int. J. Found. Comput. Sci. 16(5): 883-896 (2005) - [j11]Keith Ellul, Bryan Krawetz, Jeffrey O. Shallit, Ming-wei Wang:
Regular Expressions: New Results and Open Problems. J. Autom. Lang. Comb. 10(4): 407-437 (2005) - [j10]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Avoiding large squares in infinite binary words. Theor. Comput. Sci. 339(1): 19-34 (2005) - 2004
- [j9]Keith Ellul, Bryan Krawetz, Jeffrey O. Shallit, Ming-wei Wang:
Regular Expressions: New Results and Open Problems. J. Autom. Lang. Comb. 9(2/3): 233-256 (2004) - [c7]Michael Domaratzki, Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang:
Non-Uniqueness and Radius of Cyclic Unary NFAs. DCFS 2004: 178-190 - 2003
- [j8]Sabin Cautis, Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang, Soroosh Yazdani:
Periodicity, morphisms, and matrices. Theor. Comput. Sci. 295: 107-121 (2003) - [i2]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Cubefree binary words avoiding long squares. CoRR math.CO/0302303 (2003) - [i1]Narad Rampersad, Jeffrey O. Shallit, Ming-wei Wang:
Avoiding large squares in infinite binary words. CoRR math.CO/0306081 (2003) - 2002
- [j7]Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-colorings. Discret. Math. 254(1-3): 19-32 (2002) - [j6]Giovanni Pighizzini, Jeffrey O. Shallit, Ming-wei Wang:
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. J. Comput. Syst. Sci. 65(2): 393-414 (2002) - [j5]Jeffrey O. Shallit, Ming-wei Wang:
On two-sided infinite fixed points of morphisms. Theor. Comput. Sci. 270(1-2): 659-675 (2002) - [c6]Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang:
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG 2002: 105-108 - [c5]Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang:
Regular Expressions: New Results and Open Problems. DCFS 2002: 17-34 - 2001
- [j4]Jeffrey O. Shallit, Ming-wei Wang:
Weakly Self-Avoiding Words and a Construction of Friedman. Electron. J. Comb. 8(1) (2001) - [j3]Jeffrey O. Shallit, Ming-wei Wang:
Automatic Complexity of Strings. J. Autom. Lang. Comb. 6(4): 537-554 (2001) - [c4]Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang:
Variations on a Theorem of Fine & Wilf. MFCS 2001: 512-523 - 2000
- [j2]Ming-wei Wang:
On the Irregularity of the Duplication Closure. Bull. EATCS 70: 162-163 (2000) - [c3]Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-Colorings. MFCS 2000: 202-211
1990 – 1999
- 1999
- [c2]John Loftus, Jeffrey O. Shallit, Ming-wei Wang:
New problems of pattern avoidance. Developments in Language Theory 1999: 185-199 - [c1]Jeffrey O. Shallit, Ming-wei Wang:
On Two-Sided Infinite Fixed Points of Morphisms. FCT 1999: 488-499 - 1998
- [j1]Ming-wei Wang, Jeffrey O. Shallit:
On Minimal Words With Given Subword Complexity. Electron. J. Comb. 5 (1998)
Coauthor Index
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-07-03 20:42 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:
