Nicholas Q. Trân

Orcid: 0000-0002-3164-4330

Affiliations:
  • Santa Clara University, Department of Mathematics & Computer Science, Santa Clara, CA, USA


According to our database1, Nicholas Q. Trân authored at least 38 papers between 1992 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The Book Review Column.
SIGACT News, September, 2023

Separating Words from Every Start State with Horner Automata.
Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

2022
Review of "The Algorithm Design Manual, 3<sup>rd</sup> ed. by Steven S. Skiena Springer, 2020 793 pages, Hardcover, $99.99".
SIGACT News, 2022

Variations of the Separating Words Problem.
Proceedings of the Implementation and Application of Automata, 2022

2020
GeoSiteSearch: A Tool to Map Vietnamese Diaspora by Deducing Geographical Information of Web Pages about Our Lady of LaVang.
Proceedings of the Fourteenth International AAAI Conference on Web and Social Media, 2020

2016
A "Grand Tour" of Computer Science: Re-Designing CS1 for Breadth and Retention (Abstract Only).
Proceedings of the 47th ACM Technical Symposium on Computing Science Education, 2016

2014
Weak Synchronization and Synchronizability of Multi-tape Pushdown Automata and Turing Machines.
J. Autom. Lang. Comb., 2014

2013
How to synchronize the Heads of a Multitape Automaton.
Int. J. Found. Comput. Sci., 2013

2012
On synchronized multi-tape and multi-head automata.
Theor. Comput. Sci., 2012

Multitape NFA: Weak Synchronization of the Input Heads.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines.
Proceedings of the Language and Automata Theory and Applications, 2012

2011
Characterizations and Existence of Easy Sets without Hard Subsets.
Fundam. Informaticae, 2011

On Synchronized Multitape and Multihead Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010
A perceptual similarity measure based on smoothing filters and the normalized compression distance.
Proceedings of the Human Vision and Electronic Imaging XV, 2010

2007
Design and Analysis of a Watermarking System for Care Labels.
Proceedings of the Advances in Multimedia Information Processing, 2007

The normalized compression distance and image distinguishability.
Proceedings of the Human Vision and Electronic Imaging XII, San Jose, CA, USA, January 29, 2007

2002
On Universally Polynomial Context-Free Languages.
Int. J. Found. Comput. Sci., 2002

Asymptotic Analyses of Visual Distortions: A New Approach to Defining Transparency.
Proceedings of the Advances in Multimedia Information Processing, 2002

Hiding Functions and Computational Security of Image Watermarking Systems.
Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), 2002

Cluster: A Fast Tool to Identify Groups of Similar Programs.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2000
Efficient Representation and Algebraic Manipulation of Infinite Relations in Paraconsistent Databases.
Inf. Syst., 2000

1999
Sim: a utility for detecting similarity in computer programs.
Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

Generating Photomosaics: An Empirical Study.
Proceedings of the 1999 ACM Symposium on Applied Computing, 1999

Infinite Relations in Paraconsistent Databases.
Proceedings of the Advances in Databases and Information Systems, 1999

1998
An Easy Case of Sorting by Reversals.
J. Comput. Biol., 1998

1997
On the Parallel Complexity of Loops.
Theor. Comput. Sci., 1997

On P-Immunity of Exponential Time Complete Sets.
J. Comput. Syst. Sci., 1997

1995
New Decidability Results Concerning Two-Way Counter Machines.
SIAM J. Comput., 1995

On P-Immunity of Nondeterministic Complete Sets.
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994
On Communication-Bounded Synchronized Alternating Finite Automata.
Acta Informatica, 1994

On the Parallel Complexity of Solving Recurrence Equations.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
Synchronized Finite Automata and 2DFA Reductions.
Theor. Comput. Sci., 1993

A Note on Simple Programs with Two Variables.
Theor. Comput. Sci., 1993

On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages.
Int. J. Found. Comput. Sci., 1993

On the Communication Complexity of Parallel Computation.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

New Decidability Results Concerning Two-way Counter Machines and Applications.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
On Space-Bounded Synchronized Alternating Turing Machines.
Theor. Comput. Sci., 1992

New Results Concerning Synchronized Finite Automata.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992


  Loading...