Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy Ng 0001
Person information
- affiliation: University of Chicago, Department of Computer Science, IL, USA
- affiliation (former): University of Waterloo, ON, Canada
- affiliation (PhD): Queen's University, Kingston, ON, Canada
Other persons with the same name
- Timothy Ng 0002 (aka: Timothy W. Ng) — Emory University, School of Medicine, Atlanta, GA, USA
- Timothy Ng 0003 — University of Warwick, Coventry, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
[b1]Timothy Ng:
Distances Between Languages: Algorithms and Descriptional Complexity. Queen's University at Kingston, Ontario, Canada, 2017
Journal Articles
- 2021
- [j12]Yo-Sub Han, Sang-Ki Ko
, Timothy Ng, Kai Salomaa:
Consensus string problem for multiple regular languages. Inf. Comput. 279: 104615 (2021) - [j11]Lila Kari, Timothy Ng:
Descriptional Complexity of Semi-Simple Splicing Systems. Int. J. Found. Comput. Sci. 32(6): 685-711 (2021) - [j10]Francesco Bellamoli, Giuditta Franco, Lila Kari, Silvia Lampis, Timothy Ng, Zihao Wang:
Conjugate word blending: formal model and experimental implementation by XPCR. Nat. Comput. 20(4): 647-658 (2021) - [j9]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Closest substring problems for regular languages. Theor. Comput. Sci. 862: 144-154 (2021) - 2020
- [j8]Srujan Kumar Enaganti, Lila Kari, Timothy Ng, Zihao Wang:
Word Blending in Formal Languages. Fundam. Informaticae 171(1-4): 151-173 (2020) - 2019
- [j7]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Suffix Distance. Int. J. Found. Comput. Sci. 30(6-7): 1197-1216 (2019) - 2018
- [j6]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Neighbourhoods and Approximate Pattern Matching. Int. J. Found. Comput. Sci. 29(2): 315-329 (2018) - 2017
- [j5]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance of Subregular Languages. J. Autom. Lang. Comb. 22(1-3): 169-188 (2017) - [j4]Timothy Ng, David Rappaport, Kai Salomaa:
State complexity of prefix distance. Theor. Comput. Sci. 679: 107-117 (2017) - [j3]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Pseudoknot-generating operation. Theor. Comput. Sci. 696: 52-64 (2017) - [j2]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Outfix-guided insertion. Theor. Comput. Sci. 701: 70-84 (2017) - 2016
- [j1]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
State Complexity of Insertion. Int. J. Found. Comput. Sci. 27(7): 863-878 (2016)
Conference and Workshop Papers
- 2020
- [c16]Lila Kari, Timothy Ng:
Descriptional Complexity of Semi-simple Splicing Systems. DLT 2020: 150-163 - 2019
- [c15]Lila Kari, Timothy Ng:
State Complexity of Simple Splicing. DCFS 2019: 197-209 - [c14]Lila Kari, Timothy Ng:
State Complexity of Pseudocatenation. LATA 2019: 203-214 - 2018
- [c13]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Closest Substring Problems for Regular Languages. DLT 2018: 392-403 - [c12]Srujan Kumar Enaganti, Lila Kari, Timothy Ng, Zihao Wang:
Word Blending in Formal Languages: The Brangelina Effect. UCNC 2018: 72-85 - 2017
- [c11]Timothy Ng, David Rappaport, Kai Salomaa:
Quasi-Distances and Weighted Finite Automata. The Role of Theory in Computer Science 2017: 135-152 - [c10]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Suffix Distance. DCFS 2017: 287-298 - [c9]Timothy Ng, David Rappaport, Kai Salomaa:
Relative Prefix Distance Between Languages. DLT 2017: 284-295 - [c8]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Consensus String Problem for Multiple Regular Languages. LATA 2017: 196-207 - 2016
- [c7]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance of Subregular Languages. DCFS 2016: 192-204 - [c6]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Outfix-Guided Insertion - (Extended Abstract). DLT 2016: 102-113 - [c5]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Pseudoknot-Generating Operation. SOFSEM 2016: 241-252 - [c4]Timothy Ng:
Prefix Distance Between Regular Languages. CIAA 2016: 224-235 - 2015
- [c3]Timothy Ng, David Rappaport, Kai Salomaa:
Quasi-Distances and Weighted Finite Automata. DCFS 2015: 209-219 - [c2]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Neighbourhoods and Approximate Pattern Matching. DLT 2015: 389-400 - [c1]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance. CIAA 2015: 238-249
Informal and Other Publications
- 2019
- [i2]Lila Kari, Timothy Ng:
Descriptional Complexity of Semi-Simple Splicing Systems. CoRR abs/1909.02512 (2019) - 2017
- [i1]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Outfix-guided insertion. CoRR abs/1707.04651 (2017)
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-04-25 05:59 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:
