default search action
Ian McQuillan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j44]Oscar H. Ibarra, Ian McQuillan
:
On decision problems concerning contextual insertions and deletions. Theor. Comput. Sci. 1024: 114905 (2025) - 2024
- [c48]Oscar H. Ibarra, Ian McQuillan:
Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. DLT 2024: 156-172 - [i26]Nazifa Azam Khan, Mikolaj Cieslak, Ian McQuillan:
Improving Deep Learning Predictions with Simulated Images, and Vice Versa. CoRR abs/2404.05128 (2024) - [i25]Oscar H. Ibarra, Ian McQuillan:
Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. CoRR abs/2405.08988 (2024) - [i24]Ali Lotfi, Ian McQuillan:
Optimal L-Systems for Stochastic L-system Inference Problems. CoRR abs/2409.02259 (2024) - 2023
- [j43]Oscar H. Ibarra, Ian McQuillan
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines. Inf. Comput. 292: 105027 (2023) - [j42]Oscar H. Ibarra, Ian McQuillan
On the complexity of decision problems for some classes of machines and applications. Inf. Comput. 294: 105080 (2023) - [j41]Jozef Jirásek, Ian McQuillan:
Visit-Bounded Stack Automata. Theory Comput. Syst. 67(5): 956-975 (2023) - [j40]Jason Bernard
Stochastic L-system inference from multiple string sequence inputs. Soft Comput. 27(10): 6783-6798 (2023) - [c47]Oscar H. Ibarra, Ian McQuillan:
On the Containment Problem for Deterministic Multicounter Machine Models. ATVA (1) 2023: 74-94 - [c46]Pascal Baumann
Unboundedness Problems for Machines with Reversal-Bounded Counters. FoSSaCS 2023: 240-264 - [i23]Pascal Baumann
Unboundedness problems for machines with reversal-bounded counters. CoRR abs/2301.10198 (2023) - 2022
- [c45]Oscar H. Ibarra, Ian McQuillan:
On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory. DLT 2022: 177-188 - [c44]Jozef Jirásek, Ian McQuillan:
Visit-Bounded Stack Automata. DLT 2022: 189-200 - [i22]Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero
Space Complexity of Stack Automata Models. CoRR abs/2212.00891 (2022) - [i21]Oscar H. Ibarra, Ian McQuillan:
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. CoRR abs/2212.00897 (2022) - [i20]Oscar H. Ibarra, Ian McQuillan:
Semilinearity of Families of Languages. CoRR abs/2212.01301 (2022) - [i19]Arturo Carpi, Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
Relationships Between Bounded Languages, Counter Machines, Finite-Index Grammars, Ambiguity, and Commutative Regularity. CoRR abs/2212.03359 (2022) - [i18]Oscar H. Ibarra, Ian McQuillan:
On Families of Full Trios Containing Counter Machine Languages. CoRR abs/2212.03791 (2022) - [i17]Oscar H. Ibarra, Ian McQuillan:
State Grammars with Stores. CoRR abs/2212.03992 (2022) - 2021
- [j39]Katie L. Ovens
Juxtapose: a gene-embedding approach for comparing co-expression networks. BMC Bioinform. 22(1): 125 (2021) - [j38]Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
On finite-index indexed grammars and their restrictions. Inf. Comput. 279: 104613 (2021) - [j37]Oscar H. Ibarra, Ian McQuillan
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. Int. J. Found. Comput. Sci. 32(5): 481-508 (2021) - [j36]Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero
Space Complexity of Stack Automata Models. Int. J. Found. Comput. Sci. 32(6): 801-823 (2021) - [j35]Ian McQuillan, Shinnosuke Seki:
Preface. Nat. Comput. 20(2): 191-192 (2021) - [j34]Jason Bernard, Ian McQuillan
Techniques for inferring context-free Lindenmayer systems with genetic algorithm. Swarm Evol. Comput. 64: 100893 (2021) - [j33]Arturo Carpi, Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity. Theor. Comput. Sci. 862: 97-118 (2021) - 2020
- [j32]Oscar H. Ibarra, Ian McQuillan
Semilinearity of Families of Languages. Int. J. Found. Comput. Sci. 31(8): 1179-1198 (2020) - [c43]Katie L. Ovens, B. Frank Eames, Ian McQuillan
The impact of sample size and tissue type on the reproducibility of gene co-expression networks. BCB 2020: 12:1-12:10 - [c42]Nazifa Azam Khan
A Novel Technique Combining Image Processing, Plant Development Properties, and the Hungarian Algorithm, to Improve Leaf Detection in Maize. CVPR Workshops 2020: 330-339 - [c41]Oscar H. Ibarra, Jozef Jirásek Jr., Ian McQuillan
Space Complexity of Stack Automata Models. DLT 2020: 137-149 - [c40]Jason Bernard, Ian McQuillan
Inferring Temporal Parametric L-systems Using Cartesian Genetic Programming. ICTAI 2020: 580-588 - [i16]Jason Bernard, Ian McQuillan:
Stochastic L-system Inference from Multiple String Sequence Inputs. CoRR abs/2001.10922 (2020) - [i15]Rifat Zahan, Ian McQuillan, Nathaniel D. Osgood:
DNA Methylation Data to Predict Suicidal and Non-Suicidal Deaths: A Machine Learning Approach. CoRR abs/2004.01819 (2020) - [i14]Nazifa Azam Khan, Oliver A. S. Lyon, Mark G. Eramian, Ian McQuillan:
A Novel Technique Combining Image Processing, Plant Development Properties, and the Hungarian Algorithm, to Improve Leaf Detection in Maize. CoRR abs/2005.09022 (2020) - [i13]Oscar H. Ibarra, Ian McQuillan:
On Store Languages and Applications. CoRR abs/2010.00523 (2020)
2010 – 2019
- 2019
- [j31]Oscar H. Ibarra, Ian McQuillan
On store languages and applications. Inf. Comput. 267: 28-48 (2019) - [j30]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
Insertion operations on deterministic reversal-bounded counter machines. J. Comput. Syst. Sci. 104: 244-257 (2019) - [j29]Oscar H. Ibarra, Ian McQuillan
On counting functions and slenderness of languages. Theor. Comput. Sci. 777: 356-378 (2019) - [j28]Oscar H. Ibarra, Ian McQuillan
State grammars with stores. Theor. Comput. Sci. 798: 23-39 (2019) - [j27]Oscar H. Ibarra, Ian McQuillan
On families of full trios containing counter machine languages. Theor. Comput. Sci. 799: 71-93 (2019) - [c39]Farhad Maleki
Gene Set Databases: A Fountain of Knowledge or a Siren Call? BCB 2019: 269-278 - [e2]Ian McQuillan, Shinnosuke Seki:
Unconventional Computation and Natural Computation - 18th International Conference, UCNC 2019, Tokyo, Japan, June 3-7, 2019, Proceedings. Lecture Notes in Computer Science 11493, Springer 2019, ISBN 978-3-030-19310-2 [contents] - [i12]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. CoRR abs/1903.03001 (2019) - [i11]Oscar H. Ibarra, Ian McQuillan:
On the Density of Languages Accepted by Turing Machines and Other Machine Models. CoRR abs/1903.03018 (2019) - [i10]Mark Daley, Mark G. Eramian, Christopher Power, Ian McQuillan:
From Helmut Jürgensen's Former Students: The Game of Informatics Research. CoRR abs/1903.03405 (2019) - [i9]Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar:
On counting functions and slenderness of languages. CoRR abs/1903.03504 (2019) - [i8]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion Operations on Deterministic Reversal-Bounded Counter Machines. CoRR abs/1903.03518 (2019) - [i7]Jason Bernard, Ian McQuillan:
Techniques for Inferring Context-Free Lindenmayer Systems With Genetic Algorithm. CoRR abs/1906.08860 (2019) - 2018
- [j26]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
On the complexity and decidability of some problems involving shuffle. Inf. Comput. 259(2): 214-224 (2018) - [j25]Joey Eremondi
On the Density of Context-Free and Counter Languages. Int. J. Found. Comput. Sci. 29(2): 233-250 (2018) - [j24]Mark Daley, Mark G. Eramian, Christopher Power, Ian McQuillan
From Helmut Jürgensen's Former Students: The Game of Informatics Research. J. Autom. Lang. Comb. 23(1-3): 127-141 (2018) - [j23]Oscar H. Ibarra, Ian McQuillan
On the Density of Languages Accepted by Turing Machines and Other Machine Models. J. Autom. Lang. Comb. 23(1-3): 189-199 (2018) - [j22]Oscar H. Ibarra, Ian McQuillan
Variations of checking stack automata: Obtaining unexpected decidability properties. Theor. Comput. Sci. 738: 1-12 (2018) - [j21]Oscar H. Ibarra, Ian McQuillan
On store languages of language acceptors. Theor. Comput. Sci. 745: 114-132 (2018) - [c38]Farhad Maleki
Sample Size and Reproducibility of Gene Set Analysis. BIBM 2018: 122-129 - [c37]Lingling Jin
Prediction of transposable elements evolution using tabu search. BIBM 2018: 665-670 - [c36]Jason Bernard, Ian McQuillan
New Techniques for Inferring L-systems Using Genetic Algorithm. BIOMA 2018: 13-25 - [c35]Oscar H. Ibarra, Ian McQuillan
State Grammars with Stores. DCFS 2018: 163-174 - [c34]Oscar H. Ibarra, Ian McQuillan
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. DLT 2018: 416-428 - [c33]Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar:
On Counting Functions of Languages. DLT 2018: 429-440 - [c32]Rifat Zahan
DNA Methylation Data to Predict Suicidal and Non-Suicidal Deaths: A Machine Learning Approach. ICHI 2018: 363-365 - [c31]Jason Bernard, Ian McQuillan
Inferring Stochastic L-Systems Using a Hybrid Greedy Algorithm. ICTAI 2018: 600-607 - [c30]Jason Bernard, Ian McQuillan
A Fast and Reliable Hybrid Approach for Inferring L-systems . ALIFE 2018: 444-451 - [c29]Ian McQuillan
Algorithms for Inferring Context-Sensitive L-Systems. UCNC 2018: 117-130 - [c28]Oscar H. Ibarra, Ian McQuillan
Semilinearity of Families of Languages. CIAA 2018: 211-222 - [p1]Oscar H. Ibarra, Ian McQuillan
Input-Position-Restricted Models of Language Acceptors. Reversibility and Universality 2018: 357-372 - 2017
- [j20]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
Deletion operations on deterministic families of automata. Inf. Comput. 256: 237-252 (2017) - [c27]T. M. Rezwanul Islam, Ian McQuillan
CSA-X: Modularized Constrained Multiple Sequence Alignment. AlCoB 2017: 143-154 - [c26]Oscar H. Ibarra, Ian McQuillan:
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties. DLT 2017: 235-246 - [c25]Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
On Finite-Index Indexed Grammars and Their Restrictions. LATA 2017: 287-298 - [c24]Nazifa Azam Khan
Descrambling Order Analysis in Ciliates. UCNC 2017: 206-219 - [i6]Oscar H. Ibarra, Ian McQuillan:
On Store Languages of Language Acceptors. CoRR abs/1702.07388 (2017) - [i5]Oscar H. Ibarra, Ian McQuillan:
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties. CoRR abs/1705.09732 (2017) - [i4]Jason Bernard, Ian McQuillan:
New Techniques for Inferring L-Systems Using Genetic Algorithm. CoRR abs/1712.00180 (2017) - 2016
- [j19]Lingling Jin
Computational modelling of interruptional activities between transposable elements using grammars and the linear ordering problem. Soft Comput. 20(1): 19-35 (2016) - [j18]Oscar H. Ibarra, Ian McQuillan
The effect of end-markers on counter machines and commutativity. Theor. Comput. Sci. 627: 71-81 (2016) - [c23]Lingling Jin, Ian McQuillan, Longhai Li:
Computational identification of regions that influence activity of transposable elements in the human genome. BIBM 2016: 592-599 - [c22]Oscar H. Ibarra, Ian McQuillan
On Families of Full Trios Containing Counter Machine Languages. DLT 2016: 216-228 - [c21]Oscar H. Ibarra, Ian McQuillan
On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L. CIAA 2016: 138-149 - [i3]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Complexity and Decidability of Some Problems Involving Shuffle. CoRR abs/1606.01199 (2016) - [i2]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Deletion Operations on Deterministic Families of Automata. CoRR abs/1607.00931 (2016) - [i1]Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
On Finite-Index Indexed Grammars and Their Restrictions. CoRR abs/1610.06366 (2016) - 2015
- [c20]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Complexity and Decidability of Some Problems Involving Shuffle. DCFS 2015: 105-116 - [c19]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. DLT 2015: 228-239 - [c18]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion Operations on Deterministic Reversal-Bounded Counter Machines. LATA 2015: 200-211 - [c17]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Deletion Operations on Deterministic Families of Automata. TAMC 2015: 388-399 - [c16]Md. Sowgat Ibne Mahmud, Ian McQuillan
Simulation of the 2JLP Gene Assembly Process in Ciliates. UCNC 2015: 227-238 - 2014
- [c15]Franziska Biegler, Ian McQuillan
On Comparing Deterministic Finite Automata and the Shuffle of Words. CIAA 2014: 98-109 - 2013
- [c14]Lingling Jin, Ian McQuillan:
Computational Modelling of the Interruptional Activities between Transposable Elements. TPNC 2013: 108-120 - 2012
- [j17]Ian McQuillan, Giovanni Pighizzini:
Preface. Int. J. Found. Comput. Sci. 23(1) (2012) - [j16]Franziska Biegler, Mark Daley, Ian McQuillan
Algorithmic decomposition of shuffle on words. Theor. Comput. Sci. 454: 38-50 (2012) - [c13]Markus Holzer
Generalized Derivations with Synchronized Context-Free Grammars. Developments in Language Theory 2012: 109-120 - 2011
- [j15]Mark Daley, Ian McQuillan
Theoretical and computational properties of transpositions. Nat. Comput. 10(2): 795-804 (2011) - [c12]Jian Zhang, Ian McQuillan
Parallelizing Peptide-Spectrum scoring using modern graphics processing units. ICCABS 2011: 208-213 - 2010
- [j14]Franziska Biegler, Mark Daley, Ian McQuillan
On the Shuffle Automaton Size for Words. J. Autom. Lang. Comb. 15(1/2): 53-70 (2010) - [j13]Mark Daley, Ian McQuillan
Modelling programmed frameshifting with frameshift machines. Nat. Comput. 9(1): 239-261 (2010) - [j12]J. Mark Keil, Jing Liu, Ian McQuillan
Algorithmic properties of ciliate sequence alignment. Theor. Comput. Sci. 411(6): 919-925 (2010) - [c11]Jian Zhang, Ian McQuillan, Fang-Xiang Wu
Speed improvements of peptide-spectrum matching using SIMD instructions. BIBM Workshops 2010: 83-88 - [e1]Ian McQuillan, Giovanni Pighizzini:
Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8-10th August 2010. EPTCS 31, 2010 [contents]
2000 – 2009
- 2009
- [j11]Helmut Jürgensen, Ian McQuillan:
Homomorphisms Preserving Types of Density. Acta Cybern. 19(2): 499-516 (2009) - [j10]Franziska Biegler, Mark Daley, Markus Holzer
On the uniqueness of shuffle on words and finite languages. Theor. Comput. Sci. 410(38-40): 3711-3724 (2009) - [c10]Franziska Biegler, Mark Daley, Ian McQuillan:
On the Shuffle Automaton Size for Words. DCFS 2009: 79-89 - 2008
- [j9]Mark Daley, Mark G. Eramian, Ian McQuillan:
The Bag Automaton: A Model of Nondeterministic Storage. J. Autom. Lang. Comb. 13(3/4): 185-206 (2008) - [c9]Helmut Jürgensen, Ian McQuillan:
Homomorphisms Preserving Types of Density. AFL 2008: 183-194 - [c8]Christopher Power, Ian McQuillan, Helen Petrie
No Going Back: An Interactive Visualization Application for Trailblazing on the Web. IV 2008: 133-142 - 2007
- [j8]Franziska Biegler, Ian McQuillan, Kai Salomaa:
An infinite hierarchy induced by depth synchronization. Theor. Comput. Sci. 387(2): 113-124 (2007) - 2006
- [j7]Mark Daley, Ian McQuillan
Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates. Theory Comput. Syst. 39(5): 619-633 (2006) - [c7]Ian McQuillan, Kai Salomaa, Mark Daley:
Iterated TGR Languages: Membership Problem and Effective Closure Properties. COCOON 2006: 94-103 - [c6]Franziska Biegler, Ian McQuillan, Kai Salomaa:
An Infinite Hierarchy Induced by Depth Synchronization. DCFS 2006: 82-93 - 2005
- [j6]Mark Daley, Ian McQuillan:
Formal modelling of viral gene compression. Int. J. Found. Comput. Sci. 16(3): 453-469 (2005) - [j5]Mark Daley, Ian McQuillan
Template-guided DNA recombination. Theor. Comput. Sci. 330(2): 237-250 (2005) - [j4]Ian McQuillan
The generative capacity of block-synchronized context-free grammars. Theor. Comput. Sci. 337(1-3): 119-133 (2005) - [c5]Mark Daley, Ian McQuillan:
On Computational Properties of Template-Guided DNA Recombination. DNA 2005: 27-37 - 2004
- [j3]Ian McQuillan:
Descriptional Complexity of Block-Synchronization Context-Free Grammars. J. Autom. Lang. Comb. 9(2/3): 317-332 (2004) - [j2]Mark Daley, Lila Kari, Ian McQuillan
Families of languages defined by ciliate bio-operations. Theor. Comput. Sci. 320(1): 51-69 (2004) - [c4]Mark Daley, Ian McQuillan:
Viral Gene Compression: Complexity and Verification. CIAA 2004: 102-112 - 2003
- [j1]Mark Daley, Oscar H. Ibarra, Lila Kari, Ian McQuillan, Koji Nakano:
The LD and DLAD Bio-Operations on Formal Languages. J. Autom. Lang. Comb. 8(3): 477-498 (2003) - [c3]Mark Daley, Ian McQuillan:
Template-Guided DNA Recombination. DCFS 2003: 235-244 - [c2]Mark Daley, Mark G. Eramian, Ian McQuillan:
Bag Automata and Stochastic Retrieval of Biomolecules in Solution. CIAA 2003: 239-250 - 2002
- [c1]Ian McQuillan:
Descriptional Complexity of Block-Synchronization Context-Free Grammars. DCFS 2002: 188-203
Coauthor Index
[j44] [c48] [i25] [j43] [j42] [c47] [c46] [i23] [c45] [i22] [i21] [i20] [i19] [i18] [i17] [j38] [j37] [j36] [j33] [j32] [c41] [i13] [j31] [j30] [j29] [j28] [j27] [i12] [i11] [i9] [i8] [j26] [j25] [j23] [j22] [j21] [c35] [c34] [c33] [c28] [p1] [j20] [c26] [c25] [i6] [i5] [j18] [c22] [c21] [i3] [i2] [i1] [c20] [c19] [c18] [c17] [j1]
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-11-07 20:33 CET 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: