default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOscar H. Ibarra
Person information
- affiliation: University of California, Santa Barbara, USA
- award (2001): Harry H. Goode Memorial Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c169]Oscar H. Ibarra, Ian McQuillan:
Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. DLT 2024: 156-172- [i18]Oscar H. Ibarra, Ian McQuillan:
Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. CoRR abs/2405.08988 (2024) - 2023
- [j231]Oscar H. Ibarra, Ian McQuillan
:
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines. Inf. Comput. 292: 105027 (2023) - [j230]Oscar H. Ibarra, Ian McQuillan:
On the complexity of decision problems for some classes of machines and applications. Inf. Comput. 294: 105080 (2023) - [c168]Oscar H. Ibarra, Ian McQuillan:
On the Containment Problem for Deterministic Multicounter Machine Models. ATVA (1) 2023: 74-94 - [c167]Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche:
Unboundedness Problems for Machines with Reversal-Bounded Counters. FoSSaCS 2023: 240-264 - [i17]Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche:
Unboundedness problems for machines with reversal-bounded counters. CoRR abs/2301.10198 (2023) - 2022
- [c166]Oscar H. Ibarra, Ian McQuillan:
On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory. DLT 2022: 177-188 - [i16]Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero:
Space Complexity of Stack Automata Models. CoRR abs/2212.00891 (2022) - [i15]Oscar H. Ibarra, Ian McQuillan:
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. CoRR abs/2212.00897 (2022) - [i14]Oscar H. Ibarra, Ian McQuillan:
Semilinearity of Families of Languages. CoRR abs/2212.01301 (2022) - [i13]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) - [i12]Oscar H. Ibarra, Ian McQuillan:
On Families of Full Trios Containing Counter Machine Languages. CoRR abs/2212.03791 (2022) - [i11]Oscar H. Ibarra, Ian McQuillan:
State Grammars with Stores. CoRR abs/2212.03992 (2022) - 2021
- [j229]Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
On finite-index indexed grammars and their restrictions. Inf. Comput. 279: 104613 (2021) - [j228]Oscar H. Ibarra, Ian McQuillan:
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. Int. J. Found. Comput. Sci. 32(5): 481-508 (2021) - [j227]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) - [j226]Oscar H. Ibarra, Sartaj K. Sahni:
Announcement. Int. J. Found. Comput. Sci. 32(7): 825 (2021) - [j225]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
- [j224]Oscar H. Ibarra, Ian McQuillan:
Semilinearity of Families of Languages. Int. J. Found. Comput. Sci. 31(8): 1179-1198 (2020) - [c165]Oscar H. Ibarra, Jozef Jirásek Jr., Ian McQuillan, Luca Prigioniero:
Space Complexity of Stack Automata Models. DLT 2020: 137-149 - [i10]Oscar H. Ibarra, Ian McQuillan:
On Store Languages and Applications. CoRR abs/2010.00523 (2020)
2010 – 2019
- 2019
- [j223]Oscar H. Ibarra, Ian McQuillan:
On store languages and applications. Inf. Comput. 267: 28-48 (2019) - [j222]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion operations on deterministic reversal-bounded counter machines. J. Comput. Syst. Sci. 104: 244-257 (2019) - [j221]Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar:
On counting functions and slenderness of languages. Theor. Comput. Sci. 777: 356-378 (2019) - [j220]Oscar H. Ibarra, Ian McQuillan:
State grammars with stores. Theor. Comput. Sci. 798: 23-39 (2019) - [j219]Oscar H. Ibarra, Ian McQuillan:
On families of full trios containing counter machine languages. Theor. Comput. Sci. 799: 71-93 (2019) - [i9]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. CoRR abs/1903.03001 (2019) - [i8]Oscar H. Ibarra, Ian McQuillan:
On the Density of Languages Accepted by Turing Machines and Other Machine Models. CoRR abs/1903.03018 (2019) - [i7]Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar:
On counting functions and slenderness of languages. CoRR abs/1903.03504 (2019) - [i6]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion Operations on Deterministic Reversal-Bounded Counter Machines. CoRR abs/1903.03518 (2019) - 2018
- [j218]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the complexity and decidability of some problems involving shuffle. Inf. Comput. 259(2): 214-224 (2018) - [j217]Oscar H. Ibarra, Zhe Dang, Qin Li:
Accepting runs in a two-way finite automaton. Inf. Comput. 260: 1-8 (2018) - [j216]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. Int. J. Found. Comput. Sci. 29(2): 233-250 (2018) - [j215]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) - [j214]Oscar H. Ibarra, Ian McQuillan:
Variations of checking stack automata: Obtaining unexpected decidability properties. Theor. Comput. Sci. 738: 1-12 (2018) - [j213]Oscar H. Ibarra, Ian McQuillan:
On store languages of language acceptors. Theor. Comput. Sci. 745: 114-132 (2018) - [j212]Oscar H. Ibarra:
Grammatical characterizations of NPDAs and VPDAs with counters. Theor. Comput. Sci. 746: 136-150 (2018) - [c164]Oscar H. Ibarra, Ian McQuillan:
State Grammars with Stores. DCFS 2018: 163-174 - [c163]Oscar H. Ibarra, Ian McQuillan:
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. DLT 2018: 416-428 - [c162]Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar:
On Counting Functions of Languages. DLT 2018: 429-440 - [c161]Oscar H. Ibarra, Koji Nakano, Akihiro Fujiwara, Susumu Matsumae:
Introduction to APDCM 2018. IPDPS Workshops 2018: 730-731 - [c160]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
- [j211]Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer:
Lossiness of communication channels modeled by transducers. Comput. 6(2): 165-181 (2017) - [j210]Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Further remarks on DNA overlap assembly. Inf. Comput. 253: 143-154 (2017) - [j209]Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Information rate of some classes of non-regular languages: An automata-theoretic approach. Inf. Comput. 256: 45-61 (2017) - [j208]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Deletion operations on deterministic families of automata. Inf. Comput. 256: 237-252 (2017) - [j207]Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
On the overlap assembly of strings and languages. Nat. Comput. 16(1): 175-185 (2017) - [c159]Oscar H. Ibarra, Ian McQuillan:
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties. DLT 2017: 235-246 - [c158]Oscar H. Ibarra, Koji Nakano:
Introduction to APDCM Workshop. IPDPS Workshops 2017: 832 - [c157]Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
On Finite-Index Indexed Grammars and Their Restrictions. LATA 2017: 287-298 - [i5]Oscar H. Ibarra, Ian McQuillan:
On Store Languages of Language Acceptors. CoRR abs/1702.07388 (2017) - [i4]Oscar H. Ibarra, Ian McQuillan:
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties. CoRR abs/1705.09732 (2017) - 2016
- [j206]Oscar H. Ibarra:
Visibly Pushdown Automata and Transducers with Counters. Fundam. Informaticae 148(3-4): 291-308 (2016) - [j205]Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Execution information rate for some classes of automata. Inf. Comput. 246: 20-29 (2016) - [j204]Oscar H. Ibarra, Bala Ravikumar:
On bounded languages and reversal-bounded automata. Inf. Comput. 246: 30-42 (2016) - [j203]Francis Y. L. Chin, Oscar H. Ibarra, Sartaj K. Sahni:
Announcement. Int. J. Found. Comput. Sci. 27(8): 895-896 (2016) - [j202]Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Preface. Nat. Comput. 15(1): 1-3 (2016) - [j201]Oscar H. Ibarra:
On decidability and closure properties of language classes with respect to bio-operations. Nat. Comput. 15(2): 225-234 (2016) - [j200]Oscar H. Ibarra, Ian McQuillan:
The effect of end-markers on counter machines and commutativity. Theor. Comput. Sci. 627: 71-81 (2016) - [j199]Zhe Dang, Thomas R. Fischer, William J. Hutton III, Oscar H. Ibarra, Qin Li:
Quantifying communication in synchronized languages. Theor. Comput. Sci. 654: 33-44 (2016) - [c156]Oscar H. Ibarra, Ian McQuillan:
On Families of Full Trios Containing Counter Machine Languages. DLT 2016: 216-228 - [c155]Oscar H. Ibarra, Koji Nakano, Akihiro Fujiwara, Susumu Matsumae:
APDCM Introduction and Committees. IPDPS Workshops 2016: 479 - [c154]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
- [j198]Oscar H. Ibarra, Shinnosuke Seki:
Semilinear Sets and Counter Machines: a Brief Survey. Fundam. Informaticae 138(1-2): 61-76 (2015) - [j197]Arto Salomaa, Francis Y. L. Chin, Oscar H. Ibarra, Sartaj Sahni:
Alberto Apostolico. Int. J. Found. Comput. Sci. 26(5) (2015) - [j196]Oscar H. Ibarra:
On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers. Int. J. Found. Comput. Sci. 26(7): 967-986 (2015) - [c153]Zhe Dang, Thomas R. Fischer, William J. Hutton III, Oscar H. Ibarra, Qin Li:
Quantifying Communication in Synchronized Languages. COCOON 2015: 635-647 - [c152]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Complexity and Decidability of Some Problems Involving Shuffle. DCFS 2015: 105-116 - [c151]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. DLT 2015: 228-239 - [c150]Oscar H. Ibarra, Koji Nakano, Akihiro Fujiwara, Susumu Matsumae:
APDCM Introduction and Committees. IPDPS Workshops 2015: 384 - [c149]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion Operations on Deterministic Reversal-Bounded Counter Machines. LATA 2015: 200-211 - [c148]Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Deletion Operations on Deterministic Families of Automata. TAMC 2015: 388-399 - 2014
- [j195]Fang Yu, Muath Alkhalaf, Tevfik Bultan, Oscar H. Ibarra:
Automata-based symbolic string analysis for vulnerability detection. Formal Methods Syst. Des. 44(1): 44-70 (2014) - [j194]Oscar H. Ibarra, Bala Ravikumar:
Some Decision Questions Concerning the Time Complexity of Language Acceptors. Int. J. Found. Comput. Sci. 25(8): 1127-1140 (2014) - [j193]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) - [c147]Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer:
Lossiness of Communication Channels Modeled by Transducers. CiE 2014: 224-233 - [c146]Oscar H. Ibarra:
Automata with Reversal-Bounded Counters: A Survey. DCFS 2014: 5-22 - [c145]Oscar H. Ibarra:
On Decidability and Closure Properties of Language Classes with Respect to Bio-operations. DNA 2014: 148-160 - [c144]Oscar H. Ibarra:
APDCM Introduction and Committees. IPDPS Workshops 2014: 585 - [c143]Oscar H. Ibarra, Bala Ravikumar:
On the Parikh Membership Problem for FAs, PDAs, and CMs. LATA 2014: 14-31 - [c142]Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract). MFCS (1) 2014: 232-243 - [c141]Oscar H. Ibarra:
On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers. CIAA 2014: 211-225 - [e9]Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, London, ON, Canada, July 14-18, 2014, Proceedings. Lecture Notes in Computer Science 8553, Springer 2014, ISBN 978-3-319-08122-9 [contents] - 2013
- [j192]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) - [j191]Hsu-Chun Yen, Oscar H. Ibarra:
Preface. Int. J. Found. Comput. Sci. 24(7): 941-944 (2013) - [j190]Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Similarity in languages and programs. Theor. Comput. Sci. 498: 58-75 (2013) - [j189]Oscar H. Ibarra, Shinnosuke Seki:
On the open problem of Ginsburg concerning semilinear sets and related problems. Theor. Comput. Sci. 501: 11-19 (2013) - [c140]Oscar H. Ibarra, Bala Ravikumar:
Some Decision Questions Concerning the Time Complexity of Language Acceptors. Developments in Language Theory 2013: 264-276 - [c139]Oscar H. Ibarra:
APDCM Introduction. IPDPS Workshops 2013: 589-590 - [c138]Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Execution Information Rate for Some Classes of Automata. LATA 2013: 226-237 - [c137]Oscar H. Ibarra, Bala Ravikumar:
On Bounded Languages and Reversal-Bounded Automata. LATA 2013: 359-370 - [c136]Oscar H. Ibarra, Shinnosuke Seki:
On the Boundedness Property of Semilinear Sets. TAMC 2013: 156-168 - [c135]Oscar H. Ibarra, Bala Ravikumar:
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages. CIAA 2013: 193-207 - 2012
- [j188]Oscar H. Ibarra, Ömer Egecioglu:
A Survey of Results on Stateless Multicounter Automata. Fundam. Informaticae 116(1-4): 129-140 (2012) - [j187]Francis Y. L. Chin, Oscar H. Ibarra, Sartaj Sahni, Arto Salomaa:
Sheng Yu. Int. J. Found. Comput. Sci. 23(2) (2012) - [j186]Oscar H. Ibarra, Shinnosuke Seki:
Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines. Int. J. Found. Comput. Sci. 23(6): 1291-1306 (2012) - [j185]Oscar H. Ibarra, Hsu-Chun Yen:
On the containment and equivalence problems for two-way transducers. Theor. Comput. Sci. 429: 155-163 (2012) - [j184]Oscar H. Ibarra, Nicholas Q. Trân:
On synchronized multi-tape and multi-head automata. Theor. Comput. Sci. 449: 74-84 (2012) - [j183]Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki:
One-reversal counter machines and multihead automata: Revisited. Theor. Comput. Sci. 454: 81-87 (2012) - [c134]Oscar H. Ibarra:
APDCM Introduction. IPDPS Workshops 2012: 761 - [c133]Oscar H. Ibarra, Nicholas Q. Trân:
Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines. LATA 2012: 337-350 - [c132]Ömer Egecioglu, Oscar H. Ibarra, Nicholas Q. Trân:
Multitape NFA: Weak Synchronization of the Input Heads. SOFSEM 2012: 238-250 - [c131]Oscar H. Ibarra, Nicholas Q. Trân:
How to Synchronize the Heads of a Multitape Automaton. CIAA 2012: 192-204 - [e8]Hsu-Chun Yen, Oscar H. Ibarra:
Developments in Language Theory - 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings. Lecture Notes in Computer Science 7410, Springer 2012, ISBN 978-3-642-31652-4 [contents] - 2011
- [j182]Oscar H. Ibarra:
On Strong Reversibility in P Systems and Related Problems. Int. J. Found. Comput. Sci. 22(1): 7-14 (2011) - [j181]Fang Yu, Tevfik Bultan, Oscar H. Ibarra:
Relational String Verification Using Multi-Track Automata. Int. J. Found. Comput. Sci. 22(8): 1909-1924 (2011) - [c130]Oscar H. Ibarra, Shinnosuke Seki:
Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines. AFL 2011: 211-224 - [c129]Oscar H. Ibarra, Nicholas Q. Trân:
On Synchronized Multitape and Multihead Automata. DCFS 2011: 184-197 - [c128]Oscar H. Ibarra, Hsu-Chun Yen:
On Two-Way Transducers. Developments in Language Theory 2011: 300-311 - [c127]Oscar H. Ibarra:
APDCM Introduction. IPDPS Workshops 2011: 531 - [c126]Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki:
One-Reversal Counter Machines and Multihead Automata: Revisited. SOFSEM 2011: 166-177 - [c125]Oscar H. Ibarra:
On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs. CIAA 2011: 190-202 - 2010
- [j180]Oscar H. Ibarra:
On the universe, disjointness, and containment problems for simple machines. Inf. Comput. 208(11): 1273-1282 (2010) - [j179]Oscar H. Ibarra, Hsu-Chun Yen:
Preface. Int. J. Found. Comput. Sci. 21(6): 873-874 (2010) - [j178]Linmin Yang, Zhe Dang, Oscar H. Ibarra:
Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing. Nat. Comput. 9(2): 347-364 (2010) - [j177]Oscar H. Ibarra, Mario J. Pérez-Jiménez, Takashi Yokomori:
On spiking neural P systems. Nat. Comput. 9(2): 475-491 (2010) - [j176]