Nicholas Q. Trân

SIGACT News, September, 2023

Separating Words from Every Start State with Horner Automata.

[BibT_eX]

[DOI]

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".

[BibT_eX]

[DOI]

SIGACT News, 2022

Variations of the Separating Words Problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Madison G. Masten

Thien-Huong Ninh

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).

[BibT_eX]

[DOI]

Natalie Linnell

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.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2014

2013

How to synchronize the Heads of a Multitape Automaton.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

2012

On synchronized multi-tape and multi-head automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Multitape NFA: Weak Synchronization of the Input Heads.

[BibT_eX]

[DOI]

Ömer Egecioglu

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

2011

Characterizations and Existence of Easy Sets without Hard Subsets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

On Synchronized Multitape and Multihead Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010

A perceptual similarity measure based on smoothing filters and the normalized compression distance.

[BibT_eX]

[DOI]

Proceedings of the Human Vision and Electronic Imaging XV, 2010

2007

Design and Analysis of a Watermarking System for Care Labels.

[BibT_eX]

[DOI]

Benjamin Ragan-Kelley

Proceedings of the Advances in Multimedia Information Processing, 2007

The normalized compression distance and image distinguishability.

[BibT_eX]

[DOI]

Proceedings of the Human Vision and Electronic Imaging XII, San Jose, CA, USA, January 29, 2007

2002

On Universally Polynomial Context-Free Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2002

Asymptotic Analyses of Visual Distortions: A New Approach to Defining Transparency.

[BibT_eX]

[DOI]

Lianju Wang

Proceedings of the Advances in Multimedia Information Processing, 2002

Hiding Functions and Computational Security of Image Watermarking Systems.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), 2002

Cluster: A Fast Tool to Identify Groups of Similar Programs.

[BibT_eX]

[DOI]

Casey Carter

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2000

Efficient Representation and Algebraic Manipulation of Infinite Relations in Paraconsistent Databases.

[BibT_eX]

[DOI]

Rajiv Bagai

Inf. Syst., 2000

1999

Sim: a utility for detecting similarity in computer programs.

[BibT_eX]

[DOI]

David Gitchell

Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

Generating Photomosaics: An Empirical Study.

[BibT_eX]

[DOI]

Proceedings of the 1999 ACM Symposium on Applied Computing, 1999

Infinite Relations in Paraconsistent Databases.

[BibT_eX]

[DOI]

Rajiv Bagai

Proceedings of the Advances in Databases and Information Systems, 1999

1998

An Easy Case of Sorting by Reversals.

[BibT_eX]

[DOI]

J. Comput. Biol., 1998

1997

On the Parallel Complexity of Loops.

[BibT_eX]

[DOI]

Tao Yang

Theor. Comput. Sci., 1997

On P-Immunity of Exponential Time Complete Sets.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1997

1995

New Decidability Results Concerning Two-Way Counter Machines.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

On P-Immunity of Nondeterministic Complete Sets.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994

On Communication-Bounded Synchronized Alternating Finite Automata.

[BibT_eX]

[DOI]

Acta Informatica, 1994

On the Parallel Complexity of Solving Recurrence Equations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

Synchronized Finite Automata and 2DFA Reductions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

A Note on Simple Programs with Two Variables.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

On the Communication Complexity of Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

New Decidability Results Concerning Two-way Counter Machines and Applications.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

On Space-Bounded Synchronized Alternating Turing Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

New Results Concerning Synchronized Finite Automata.

[BibT_eX]

[DOI]