default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicholas Q. Trân
Person information
- affiliation: Santa Clara University, Department of Mathematics & Computer Science, Santa Clara, CA, USA
Other persons with the same name
- Nicholas Tran — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Nicholas Tran:
The Book Review Column. SIGACT News 55(1): 6-19 (2024)- [j21]Nicholas Tran:
The Book Review Column. SIGACT News 55(2) (2024) - 2023
- [j20]Nicholas Tran:
The Book Review Column. SIGACT News 54(1): 6-8 (2023) - [j19]Nicholas Q. Tran:
The Book Review Column. SIGACT News 54(2): 3-14 (2023) - [j18]Nicholas Tran:
The Book Review Column. SIGACT News 54(3): 3-21 (2023) - [j17]Nicholas Q. Tran:
The Book Review Column. SIGACT News 54(4): 7-26 (2023) - [c26]Nicholas Tran:
Separating Words from Every Start State with Horner Automata. AFL 2023: 243-252 - [e1]Henning Bordihn
, Nicholas Q. Tran, György Vaszil:
Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings. Lecture Notes in Computer Science 13918, Springer 2023, ISBN 978-3-031-34325-4 [contents] - 2022
- [j16]Nicholas Q. Tran:
Review of "The Algorithm Design Manual, 3rd ed. by Steven S. Skiena Springer, 2020 793 pages, Hardcover, $99.99". SIGACT News 53(3): 21-23 (2022) - [c25]Nicholas Q. Tran:
Variations of the Separating Words Problem. CIAA 2022: 165-176 - 2020
- [c24]Madison G. Masten, Thien-Huong Ninh, Nicholas Tran:
GeoSiteSearch: A Tool to Map Vietnamese Diaspora by Deducing Geographical Information of Web Pages about Our Lady of LaVang. ICWSM 2020: 986-988
2010 – 2019
- 2016
- [c23]Natalie Linnell, Nicholas Q. Tran:
A "Grand Tour" of Computer Science: Re-Designing CS1 for Breadth and Retention (Abstract Only). SIGCSE 2016: 496-497 - 2014
- [j15]Oscar H. Ibarra, Nicholas Q. Trân:
Weak Synchronization and Synchronizability of Multi-tape Pushdown Automata and Turing Machines. J. Autom. Lang. Comb. 19(1-4): 119-132 (2014) - 2013
- [j14]Oscar H. Ibarra, Nicholas Q. Trân:
How to synchronize the Heads of a Multitape Automaton. Int. J. Found. Comput. Sci. 24(6): 799-814 (2013) - 2012
- [j13]Oscar H. Ibarra, Nicholas Q. Trân:
On synchronized multi-tape and multi-head automata. Theor. Comput. Sci. 449: 74-84 (2012) - [c22]Oscar H. Ibarra, Nicholas Q. Trân:
Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines. LATA 2012: 337-350 - [c21]Ömer Egecioglu, Oscar H. Ibarra, Nicholas Q. Trân:
Multitape NFA: Weak Synchronization of the Input Heads. SOFSEM 2012: 238-250 - [c20]Oscar H. Ibarra, Nicholas Q. Trân:
How to Synchronize the Heads of a Multitape Automaton. CIAA 2012: 192-204 - 2011
- [j12]Nicholas Q. Tran:
Characterizations and Existence of Easy Sets without Hard Subsets. Fundam. Informaticae 110(1-4): 321-328 (2011) - [c19]Oscar H. Ibarra, Nicholas Q. Trân:
On Synchronized Multitape and Multihead Automata. DCFS 2011: 184-197 - 2010
- [c18]Nicholas Q. Tran:
A perceptual similarity measure based on smoothing filters and the normalized compression distance. Human Vision and Electronic Imaging 2010: 75270
2000 – 2009
- 2007
- [c17]Nicholas Q. Tran:
The normalized compression distance and image distinguishability. Human Vision and Electronic Imaging 2007: 64921D - [c16]Benjamin Ragan-Kelley, Nicholas Q. Tran:
Design and Analysis of a Watermarking System for Care Labels. PCM 2007: 724-733 - 2002
- [j11]Nicholas Q. Tran:
On Universally Polynomial Context-Free Languages. Int. J. Found. Comput. Sci. 13(6): 829-835 (2002) - [c15]Casey Carter, Nicholas Q. Tran:
Cluster: A Fast Tool to Identify Groups of Similar Programs. COCOON 2002: 191-199 - [c14]Nicholas Tran:
Hiding Functions and Computational Security of Image Watermarking Systems. CSFW 2002: 295- - [c13]Nicholas Q. Tran, Lianju Wang:
Asymptotic Analyses of Visual Distortions: A New Approach to Defining Transparency. IEEE Pacific Rim Conference on Multimedia 2002: 451-459 - 2001
- [c12]Nicholas Q. Tran:
On Universally Polynomial Context-Free Languages. COCOON 2001: 21-27 - 2000
- [j10]Nicholas Q. Trân, Rajiv Bagai:
Efficient Representation and Algebraic Manipulation of Infinite Relations in Paraconsistent Databases. Inf. Syst. 25(8): 491-502 (2000)
1990 – 1999
- 1999
- [c11]Nicholas Q. Trân, Rajiv Bagai:
Infinite Relations in Paraconsistent Databases. ADBIS 1999: 275-287 - [c10]Nicholas Tran:
Generating Photomosaics: An Empirical Study. SAC 1999: 105-109 - [c9]David Gitchell, Nicholas Tran:
Sim: a utility for detecting similarity in computer programs. SIGCSE 1999: 266-270 - 1998
- [j9]Nicholas Q. Trân:
An Easy Case of Sorting by Reversals. J. Comput. Biol. 5(4): 741-746 (1998) - 1997
- [j8]Nicholas Q. Trân:
On P-Immunity of Exponential Time Complete Sets. J. Comput. Syst. Sci. 54(3): 437-440 (1997) - [j7]Oscar H. Ibarra, Nicholas Q. Trân, Tao Yang:
On the Parallel Complexity of Loops. Theor. Comput. Sci. 179(1-2): 381-395 (1997) - [c8]Nicholas Q. Trân:
An Easy Case of Sorting by Reversals. CPM 1997: 83-89 - 1995
- [j6]Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang:
New Decidability Results Concerning Two-Way Counter Machines. SIAM J. Comput. 24(1): 123-137 (1995) - [c7]Nicholas Q. Trân:
On P-Immunity of Nondeterministic Complete Sets. SCT 1995: 262-263 - 1994
- [j5]Oscar H. Ibarra, Nicholas Q. Trân:
On Communication-Bounded Synchronized Alternating Finite Automata. Acta Informatica 31(4): 315-327 (1994) - [c6]Oscar H. Ibarra, Nicholas Q. Trân:
On the Parallel Complexity of Solving Recurrence Equations. ISAAC 1994: 469-477 - 1993
- [j4]Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang:
On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages. Int. J. Found. Comput. Sci. 4(2): 135-146 (1993) - [j3]Oscar H. Ibarra, Nicholas Q. Trân:
A Note on Simple Programs with Two Variables. Theor. Comput. Sci. 112(2): 391-397 (1993) - [j2]Oscar H. Ibarra, Nicholas Q. Trân:
Synchronized Finite Automata and 2DFA Reductions. Theor. Comput. Sci. 115(2): 261-275 (1993) - [c5]Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang:
New Decidability Results Concerning Two-way Counter Machines and Applications. ICALP 1993: 313-324 - [c4]Oscar H. Ibarra, Nicholas Q. Trân:
On the Communication Complexity of Parallel Computation. MFCS 1993: 517-526 - [c3]Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang:
On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages. STACS 1993: 354-364 - 1992
- [j1]Oscar H. Ibarra, Nicholas Q. Trân:
On Space-Bounded Synchronized Alternating Turing Machines. Theor. Comput. Sci. 99(2): 243-264 (1992) - [c2]Oscar H. Ibarra, Nicholas Q. Trân:
New Results Concerning Synchronized Finite Automata. ICALP 1992: 126-137 - 1991
- [c1]Oscar H. Ibarra, Nicholas Q. Trân:
On Space-bounded Synchronized Alternating Turing Machines. FCT 1991: 248-257
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-10-25 20:16 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:
