We stand with Ukraine  

Timothy Ng

Orcid: 0000-0001-9980-6976

Affiliations:
  • University of Chicago, Department of Computer Science, IL, USA
  • University of Waterloo, ON, Canada (former)
  • Queen's University, Kingston, ON, Canada (PhD)


According to our database1, Timothy Ng authored at least 20 papers between 2016 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Closest substring problems for regular languages.
[BibTeX]
[DOI]
Yo-Sub Han
,
Sang-Ki Ko
,
Timothy Ng
,
Kai Salomaa
Theor. Comput. Sci., 2021

Conjugate word blending: formal model and experimental implementation by XPCR.
[BibTeX]
[DOI]
Francesco Bellamoli
,
Giuditta Franco
,
Lila Kari
,
Silvia Lampis
,
Timothy Ng
,
Zihao Wang
Nat. Comput., 2021

Descriptional Complexity of Semi-Simple Splicing Systems.
[BibTeX]
[DOI]
Lila Kari
,
Timothy Ng
Int. J. Found. Comput. Sci., 2021

Consensus string problem for multiple regular languages.
[BibTeX]
[DOI]
Yo-Sub Han
,
Sang-Ki Ko
,
Timothy Ng
,
Kai Salomaa
Inf. Comput., 2021

2020
Word Blending in Formal Languages.
[BibTeX]
[DOI]
Srujan Kumar Enaganti
,
Lila Kari
,
Timothy Ng
,
Zihao Wang
Fundam. Informaticae, 2020

2019
State Complexity of Suffix Distance.
[BibTeX]
[DOI]
Timothy Ng
,
David Rappaport
,
Kai Salomaa
Int. J. Found. Comput. Sci., 2019

State Complexity of Pseudocatenation.
[BibTeX]
[DOI]
Lila Kari
,
Timothy Ng
Proceedings of the Language and Automata Theory and Applications, 2019

State Complexity of Simple Splicing.
[BibTeX]
[DOI]
Lila Kari
,
Timothy Ng
Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018
State Complexity of Neighbourhoods and Approximate Pattern Matching.
[BibTeX]
[DOI]
Timothy Ng
,
David Rappaport
,
Kai Salomaa
Int. J. Found. Comput. Sci., 2018

Word Blending in Formal Languages: The Brangelina Effect.
[BibTeX]
[DOI]
Srujan Kumar Enaganti
,
Lila Kari
,
Timothy Ng
,
Zihao Wang
Proceedings of the Unconventional Computation and Natural Computation, 2018

2017
Distances Between Languages: Algorithms and Descriptional Complexity.
[BibTeX]
[DOI]
Timothy Ng
PhD thesis, 2017

State complexity of prefix distance.
[BibTeX]
[DOI]
Timothy Ng
,
David Rappaport
,
Kai Salomaa
Theor. Comput. Sci., 2017

Outfix-guided insertion.
[BibTeX]
[DOI]
Da-Jung Cho
,
Yo-Sub Han
,
Timothy Ng
,
Kai Salomaa
Theor. Comput. Sci., 2017

Pseudoknot-generating operation.
[BibTeX]
[DOI]
Da-Jung Cho
,
Yo-Sub Han
,
Timothy Ng
,
Kai Salomaa
Theor. Comput. Sci., 2017

State Complexity of Prefix Distance of Subregular Languages.
[BibTeX]
[DOI]
Timothy Ng
,
David Rappaport
,
Kai Salomaa
J. Autom. Lang. Comb., 2017

Relative Prefix Distance Between Languages.
[BibTeX]
[DOI]
Timothy Ng
,
David Rappaport
,
Kai Salomaa
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

Quasi-Distances and Weighted Finite Automata.
[BibTeX]
[DOI]
Timothy Ng
,
David Rappaport
,
Kai Salomaa
Proceedings of the Role of Theory in Computer Science, 2017

2016
State Complexity of Insertion.
[BibTeX]
[DOI]
Yo-Sub Han
,
Sang-Ki Ko
,
Timothy Ng
,
Kai Salomaa
Int. J. Found. Comput. Sci., 2016

Prefix Distance Between Regular Languages.
[BibTeX]
[DOI]
Timothy Ng
Proceedings of the Implementation and Application of Automata, 2016

Outfix-Guided Insertion - (Extended Abstract).
[BibTeX]
[DOI]
Da-Jung Cho
,
Yo-Sub Han
,
Timothy Ng
,
Kai Salomaa
Proceedings of the Developments in Language Theory - 20th International Conference, 2016


  Loading...