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 22 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Survey of Undergraduate Theory of Computation Curricula in the United States.
Proceedings of the 2024 Working Group Reports on 1st ACM Virtual Global Computing Education Conference, 2024

A Survey of Undergraduate Theory of Computing Curricula.
Proceedings of the 2024 ACM Virtual Global Computing Education Conference V. 2, 2024

2021
Conjugate word blending: formal model and experimental implementation by XPCR.
Nat. Comput., 2021

2020
Word Blending in Formal Languages.
Fundam. Informaticae, 2020

Descriptional Complexity of Semi-simple Splicing Systems.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019
State Complexity of Pseudocatenation.
Proceedings of the Language and Automata Theory and Applications, 2019

State Complexity of Simple Splicing.
Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018
Word Blending in Formal Languages: The Brangelina Effect.
Proceedings of the Unconventional Computation and Natural Computation, 2018

Closest Substring Problems for Regular Languages.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017
Distances Between Languages: Algorithms and Descriptional Complexity.
PhD thesis, 2017

Outfix-guided insertion.
Theor. Comput. Sci., 2017

Consensus String Problem for Multiple Regular Languages.
Proceedings of the Language and Automata Theory and Applications, 2017

Relative Prefix Distance Between Languages.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

State Complexity of Suffix Distance.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
State Complexity of Insertion.
Int. J. Found. Comput. Sci., 2016

Prefix Distance Between Regular Languages.
Proceedings of the Implementation and Application of Automata, 2016

Pseudoknot-Generating Operation.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Outfix-Guided Insertion - (Extended Abstract).
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

State Complexity of Prefix Distance of Subregular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015
State Complexity of Prefix Distance.
Proceedings of the Implementation and Application of Automata, 2015

State Complexity of Neighbourhoods and Approximate Pattern Matching.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Quasi-Distances and Weighted Finite Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2015


  Loading...