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
- 2025
[j232]Oscar H. Ibarra, Ian McQuillan
:
On decision problems concerning contextual insertions and deletions. Theor. Comput. Sci. 1024: 114905 (2025)- 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]Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin:
On stateless multihead automata: Hierarchies and the emptiness problem. Theor. Comput. Sci. 411(3): 581-593 (2010) - [j175]Oscar H. Ibarra, Igor Potapov, Hsu-Chun Yen:
On decision problems for parameterized machines. Theor. Comput. Sci. 411(7-9): 1192-1201 (2010) - [j174]Pierluigi Frisco, Oscar H. Ibarra:
On sets of numbers accepted by P/T systems composed by join. Theor. Comput. Sci. 411(44-46): 3905-3916 (2010) - [c124]Oscar H. Ibarra:
Computing with Cells: Membrane Systems. COCOON 2010: 2 - [c123]Oscar H. Ibarra:
On Decision Problems for Simple and Parameterized Machines. Developments in Language Theory 2010: 31 - [c122]Oscar H. Ibarra:
Advances in parallel and distributed computing models - APDCM. IPDPS Workshops 2010: 1 - [c121]Fang Yu, Tevfik Bultan, Oscar H. Ibarra:
Relational String Verification Using Multi-track Automata. CIAA 2010: 290-299
2000 – 2009
- 2009
- [j173]Oscar H. Ibarra, Bala Ravikumar:
Preface. Int. J. Found. Comput. Sci. 20(4): 559-561 (2009) - [j172]Matteo Cavaliere, Oscar H. Ibarra, Gheorghe Paun, Ömer Egecioglu, Mihai Ionescu, Sara Woodworth:
Asynchronous spiking neural P systems. Theor. Comput. Sci. 410(24-25): 2352-2364 (2009) - [j171]Oscar H. Ibarra, Andrei Paun, Alfonso Rodríguez-Patón:
Sequential SNP systems based on min/max spike number. Theor. Comput. Sci. 410(30-32): 2982-2991 (2009) - [c120]Oscar H. Ibarra, Sara Woodworth:
On Nonuniversal Symport/Antiport P Systems. Algorithmic Bioprocesses 2009: 229-272 - [c119]Ömer Egecioglu, Oscar H. Ibarra:
On Stateless Multicounter Machines. CiE 2009: 178-187 - [c118]Oscar H. Ibarra, Ömer Egecioglu:
Hierarchies and Characterizations of Stateless Multicounter Machines. COCOON 2009: 408-417 - [c117]Pierluigi Frisco, Oscar H. Ibarra:
On Stateless Multihead Finite Automata and Multihead Pushdown Automata. Developments in Language Theory 2009: 240-251 - [c116]Oscar H. Ibarra:
A Look Back at Some Early Results in Membrane Computing. Workshop on Membrane Computing 2009: 66-73 - [c115]Fang Yu, Tevfik Bultan, Oscar H. Ibarra:
Symbolic String Verification: Combining String Analysis and Size Analysis. TACAS 2009: 322-336 - [c114]Pierluigi Frisco, Oscar H. Ibarra:
On Languages Accepted by P/T Systems Composed of joins. DCFS 2009: 111-120 - [e7]Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra:
Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Lecture Notes in Computer Science 5878, Springer 2009, ISBN 978-3-642-10630-9 [contents] - 2008
- [j170]Oscar H. Ibarra, Zhe Dang, Linmin Yang:
On Counter Machines, Reachability Problems, and Diophantine Equations. Int. J. Found. Comput. Sci. 19(4): 919-934 (2008) - [j169]John Jack, Alfonso Rodríguez-Patón, Oscar H. Ibarra, Andrei Paun:
Discrete Nondeterministic Modeling of the Fas Pathway. Int. J. Found. Comput. Sci. 19(5): 1147-1162 (2008) - [j168]Linmin Yang, Zhe Dang, Oscar H. Ibarra:
On Stateless Automata and P Systems. Int. J. Found. Comput. Sci. 19(5): 1259-1276 (2008) - [j167]Oscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun:
On spiking neural P systems and partially blind counter machines. Nat. Comput. 7(1): 3-19 (2008) - [j166]Oscar H. Ibarra, Sara Woodworth:
Characterizations of some classes of spiking neural P systems. Nat. Comput. 7(4): 499-517 (2008) - [j165]Oscar H. Ibarra, Andrei Paun:
Computing with cells: membrane systems - some complexity issues. Int. J. Parallel Emergent Distributed Syst. 23(5): 347-365 (2008) - [j164]Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su:
Minimum-cost delegation in service composition. Theor. Comput. Sci. 409(3): 417-431 (2008) - [c113]Oscar H. Ibarra, Andrei Paun, Alfonso Rodríguez-Patón:
Sequentiality Induced by Spike Number in SNP Systems. DNA 2008: 179-190 - [c112]Oscar H. Ibarra:
Computing with Cells: Membrane Systems. ISPAN 2008: 3 - [c111]Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin:
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. LATIN 2008: 94-105 - [c110]Fang Yu, Tevfik Bultan, Marco Cova, Oscar H. Ibarra:
Symbolic String Verification: An Automata-Based Approach. SPIN 2008: 306-324 - [e6]Oscar H. Ibarra, Bala Ravikumar:
Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings. Lecture Notes in Computer Science 5148, Springer 2008, ISBN 978-3-540-70843-8 [contents] - 2007
- [j163]Oscar H. Ibarra, Hsu-Chun Yen:
Preface. Int. J. Found. Comput. Sci. 18(4): 667-668 (2007) - [j162]Oscar H. Ibarra, Sara Woodworth:
Characterizing Regular Languages by Spiking Neural P Systems. Int. J. Found. Comput. Sci. 18(6): 1247-1256 (2007) - [j161]Oscar H. Ibarra, Andrei Paun, Gheorghe Paun, Alfonso Rodríguez-Patón, Petr Sosík, Sara Woodworth:
Normal forms for spiking neural P systems. Theor. Comput. Sci. 372(2-3): 196-217 (2007) - [j160]Oscar H. Ibarra:
Developments in language theory. Theor. Comput. Sci. 376(1-2): 1-2 (2007) - [c109]Ömer Egecioglu, Oscar H. Ibarra:
A q-Analogue of the Parikh Matrix Mapping. Formal Models, Languages and Applications 2007: 97-111 - [c108]Matteo Cavaliere, Ömer Egecioglu, Oscar H. Ibarra, Mihai Ionescu, Gheorghe Paun, Sara Woodworth:
Asynchronous Spiking Neural P Systems: Decidability and Undecidability. DNA 2007: 246-255 - [c107]Oscar H. Ibarra, Sara Woodworth:
Spiking Neural P Systems: Some Characterizations. FCT 2007: 23-37 - [c106]Linmin Yang, Zhe Dang, Oscar H. Ibarra:
Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing. UC 2007: 226-241 - [r1]Andrei Paun, Oscar H. Ibarra:
Membrane Systems. Handbook of Parallel Computing 2007 - 2006
- [j159]Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang:
On the Computational Power of 1-Deterministic and Sequential P Systems. Fundam. Informaticae 73(1-2): 133-152 (2006) - [j158]Oscar H. Ibarra, Sara Woodworth:
On symport/antiport P systems with a small number of objects. Int. J. Comput. Math. 83(7): 613-629 (2006) - [j157]Oscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gerede:
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach. J. Autom. Lang. Comb. 11(2): 169-188 (2006) - [j156]Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie:
On the Decidability of Model-Checking for P Systems. J. Autom. Lang. Comb. 11(3): 279-298 (2006) - [j155]Erzsébet Csuhaj-Varjú, Oscar H. Ibarra, György Vaszil:
On the Computational Complexity of P Automata. Nat. Comput. 5(2): 109-126 (2006) - [j154]Oscar H. Ibarra, Zhe Dang:
On the solvability of a class of diophantine equations and applications. Theor. Comput. Sci. 352(1-3): 342-346 (2006) - [j153]Oscar H. Ibarra, Bala Ravikumar:
On partially blind multihead finite automata. Theor. Comput. Sci. 356(1-2): 190-199 (2006) - [j152]Oscar H. Ibarra, Gheorghe Paun:
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems. Theor. Comput. Sci. 358(1): 88-103 (2006) - [j151]Oscar H. Ibarra, Hsu-Chun Yen:
Deterministic catalytic systems are not universal. Theor. Comput. Sci. 363(2): 149-161 (2006) - [c105]Oscar H. Ibarra, Sara Woodworth:
Characterizations of Some Restricted Spiking Neural P Systems. Workshop on Membrane Computing 2006: 424-442 - [c104]Oscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun:
On Spiking Neural P Systems and Partially Blind Counter Machines. UC 2006: 113-129 - [e5]Oscar H. Ibarra, Zhe Dang:
Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings. Lecture Notes in Computer Science 4036, Springer 2006, ISBN 3-540-35428-X [contents] - [e4]Oscar H. Ibarra, Hsu-Chun Yen:
Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings. Lecture Notes in Computer Science 4094, Springer 2006, ISBN 3-540-37213-X [contents] - 2005
- [j150]Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang:
On various notions of parallelism in P Systems. Int. J. Found. Comput. Sci. 16(4): 683-705 (2005) - [j149]Zhe Dang, Oscar H. Ibarra:
On one-membrane P systems operating in sequential mode. Int. J. Found. Comput. Sci. 16(5): 867-881 (2005) - [j148]Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun:
On two-way nondeterministic finite automata with one reversal-bounded counter. Theor. Comput. Sci. 330(1): 59-79 (2005) - [j147]Oscar H. Ibarra:
On membrane hierarchy in P systems. Theor. Comput. Sci. 334(1-3): 115-129 (2005) - [j146]Zhe Dang, Oscar H. Ibarra, Jianwen Su:
On composition and lookahead delegation of e-services modeled by automata, . Theor. Comput. Sci. 341(1-3): 344-363 (2005) - [j145]Oscar H. Ibarra:
On determinism versus nondeterminism in P systems. Theor. Comput. Sci. 344(2-3): 120-133 (2005) - [c103]Cagdas Evren Gerede, Oscar H. Ibarra, Bala Ravikumar, Jianwen Su:
Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition. IEEE SCC 2005: 103-112 - [c102]Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang:
On Sequential and 1-Deterministic P Systems. COCOON 2005: 905-914 - [c101]Oscar H. Ibarra, Andrei Paun:
Counting Time in Computing with Cells. DNA 2005: 112-128 - [c100]Oscar H. Ibarra, Sara Woodworth:
On Bounded Symport/Antiport P Systems. DNA 2005: 129-143 - [c99]Cheng Li, Zhe Dang, Oscar H. Ibarra, Hsu-Chun Yen:
Signaling P Systems and Verification Problems. ICALP 2005: 1462-1473 - [c98]Ozgur D. Sahin, Cagdas Evren Gerede, Divyakant Agrawal, Amr El Abbadi, Oscar H. Ibarra, Jianwen Su:
SPiDeR: P2P-Based Web Service Discovery. ICSOC 2005: 157-169 - [c97]Oscar H. Ibarra:
Some Recent Results Concerning Deterministic P Systems. Workshop on Membrane Computing 2005: 49-54 - [c96]Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang:
On Symport/Antiport P Systems and Semilinear Sets. Workshop on Membrane Computing 2005: 253-271 - [c95]Oscar H. Ibarra:
Some Computational Issues in Membrane Computing. MFCS 2005: 39-51 - [c94]Oscar H. Ibarra, Sara Woodworth:
On Symport/Antiport P Systems with One or Two Symbols. SYNASC 2005: 431-439 - [c93]Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie:
On Model-Checking of P Systems. UC 2005: 82-93 - [c92]Oscar H. Ibarra, Hsu-Chun Yen:
On Deterministic Catalytic Systems. CIAA 2005: 163-175 - 2004
- [j144]Oscar H. Ibarra, Louxin Zhang:
Computing And Combinatorics Conference -- Cocoon'02. Int. J. Found. Comput. Sci. 15(1): 1 (2004) - [j143]Jacir Luiz Bordim, Oscar H. Ibarra, Yasuaki Ito, Koji Nakano:
Instance-Specific Solutions For Accelerating The Cky Parsing Of Large Context-Free Grammars. Int. J. Found. Comput. Sci. 15(2): 403-415 (2004) - [j142]Oscar H. Ibarra, Zhe Dang:
On two-way FA with monotonic counters and quadratic Diophantine equations. Theor. Comput. Sci. 312(2-3): 359-378 (2004) - [j141]Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu:
Catalytic P systems, semilinear sets, and vector addition systems. Theor. Comput. Sci. 312(2-3): 379-399 (2004) - [j140]Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer:
Past pushdown timed automata and safety verification. Theor. Comput. Sci. 313(1): 57-71 (2004) - [j139]Oscar H. Ibarra:
On the computational complexity of membrane systems. Theor. Comput. Sci. 320(1): 89-109 (2004) - [j138]Oscar H. Ibarra:
Editorial. Theor. Comput. Sci. 328(1-2): 1 (2004) - [c91]Zhe Dang, Oscar H. Ibarra:
On P Systems Operating in Sequential Mode. DCFS 2004: 164-177 - [c90]Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang:
The Power of Maximal Parallelism in P Systems. Developments in Language Theory 2004: 212-224 - [c89]Erzsébet Csuhaj-Varjú, Oscar H. Ibarra, György Vaszil:
On the Computational Complexity of P Automata. DNA 2004: 76-89 - [c88]Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie:
Real-Counter Automata and Their Decision Problems. FSTTCS 2004: 198-210 - [c87]Yasmín Pérez, Rafael Gamboa, Oscar H. Ibarra:
Modeling Affective Responses in Intelligent Tutoring Systems. ICALT 2004 - [c86]Cagdas Evren Gerede, Richard Hull, Oscar H. Ibarra, Jianwen Su:
Automated composition of e-services: lookaheads. ICSOC 2004: 252-262 - [c85]Ömer Egecioglu, Oscar H. Ibarra:
A Matrix q-Analogue of the Parikh Map. IFIP TCS 2004: 125-138 - [c84]Zhe Dang, Oscar H. Ibarra, Jianwen Su:
Composability of Infinite-State Activity Automata. ISAAC 2004: 377-388 - [c83]Oscar H. Ibarra:
P Systems: Some Recent Results and Research Problems. UPP 2004: 225-237 - [c82]Oscar H. Ibarra:
Automata-Theoretic Techniques for Analyzing Infinite-State Systems. CIAA 2004: 1 - 2003
- [j137]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) - [j136]Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro:
Verification in loosely synchronous queue-connected discrete timed automata. Theor. Comput. Sci. 290(3): 1713-1735 (2003) - [j135]Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer:
Generalized discrete timed automata: decidable approximations for safety verificatio. Theor. Comput. Sci. 296(1): 59-74 (2003) - [j134]Oscar H. Ibarra, Zhe Dang:
Eliminating the storage tape in reachability constructions. Theor. Comput. Sci. 299(1-3): 687-706 (2003) - [j133]Mark Daley, Oscar H. Ibarra, Lila Kari:
Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theor. Comput. Sci. 306(1-3): 19-38 (2003) - [c81]Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro:
Dense Counter Machines and Verification Problems. CAV 2003: 93-105 - [c80]Gaoyan Xie, Zhe Dang, Oscar H. Ibarra:
A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems. ICALP 2003: 668-680 - [c79]Oscar H. Ibarra:
The Number of Membranes Matters. Workshop on Membrane Computing 2003: 218-231 - [c78]Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena:
Characterizations of Catalytic Membrane Computing Systems. MFCS 2003: 480-489 - [e3]Oscar H. Ibarra, Zhe Dang:
Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings. Lecture Notes in Computer Science 2759, Springer 2003, ISBN 3-540-40561-5 [contents] - 2002
- [j132]Oscar H. Ibarra:
Verification in Queue-Connected Multicounter Machines. Int. J. Found. Comput. Sci. 13(1): 115-127 (2002) - [j131]Zhe Dang, Oscar H. Ibarra:
The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications. Int. J. Found. Comput. Sci. 13(6): 911-936 (2002) - [j130]Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa:
Some Decision Problems Concerning Semilinearity and Commutation. J. Comput. Syst. Sci. 65(2): 278-294 (2002) - [j129]Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer:
Counter Machines and Verification Problems. Theor. Comput. Sci. 289(1): 165-189 (2002) - [j128]Oscar H. Ibarra, Jianwen Su:
Augmenting the discrete timed automaton with other data structures. Theor. Comput. Sci. 289(1): 191-204 (2002) - [c77]Hongjun Zhu, Jianwen Su, Oscar H. Ibarra:
Trajectory queries and octagons in moving object databases. CIKM 2002: 413-421 - [c76]Oscar H. Ibarra, Zhe Dang, Zhi-Wei Sun:
Safety Verification for Two-Way Finite Automata with Monotonic Counters. Developments in Language Theory 2002: 326-338 - [c75]Oscar H. Ibarra, Stephan Olariu, Koji Nakano, Jie Wu:
Workshop Introduction. IPDPS 2002 - [c74]Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun:
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. ISAAC 2002: 103-114 - [c73]Hoda M. O. Mokhtar, Jianwen Su, Oscar H. Ibarra:
On Moving Object Queries. PODS 2002: 188-198 - [e2]Oscar H. Ibarra, Louxin Zhang:
Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings. Lecture Notes in Computer Science 2387, Springer 2002, ISBN 3-540-43996-X [contents] - 2001
- [j127]Oscar H. Ibarra, Tevfik Bultan, Jianwen Su:
On Reachability and Safety in Infinite-State Systems. Int. J. Found. Comput. Sci. 12(6): 821-836 (2001) - [c72]Oscar H. Ibarra, Jianwen Su, Constantinos Bartzis:
Counter machines and the safety and disjointness problems for database queries with linear constraints. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 127-137 - [c71]Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer:
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. COCOON 2001: 529-539 - [c70]Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro:
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. FSTTCS 2001: 132-143 - [c69]Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa:
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. ICALP 2001: 579-590 - [c68]Oscar H. Ibarra, Zhe Dang:
On Removing the Pushdown Stack in Reachability Constructions. ISAAC 2001: 244-256 - [c67]Jianwen Su, Haiyan Xu, Oscar H. Ibarra:
Moving Objects: Logical Relationships and Queries. SSTD 2001: 3-19 - [c66]Hongjun Zhu, Jianwen Su, Oscar H. Ibarra:
On Multi-way Spatial Joins with Direction Predicates. SSTD 2001: 217-235 - [c65]Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer:
Past Pushdown Timed Automata. CIAA 2001: 74-86 - 2000
- [j126]Huican Zhu, Tao Yang, Qi Zheng, David Watson, Oscar H. Ibarra, Terence R. Smith:
Adaptive Load Sharing for Clustered Digital Library Servers. Int. J. Digit. Libr. 2(4): 225-235 (2000) - [j125]Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang:
Image compression for fast wavelet-based subregion retrieval. Theor. Comput. Sci. 240(2): 447-469 (2000) - [c64]Zhe Dang, Oscar H. Ibarra, Tevfik Bultan, Richard A. Kemmerer, Jianwen Su:
Binary Reachability Analysis of Discrete Pushdown Timed Automata. CAV 2000: 69-84 - [c63]Oscar H. Ibarra, Tevfik Bultan, Jianwen Su:
Reachability Analysis for Some Models of Infinite-State Transition Systems. CONCUR 2000: 183-198 - [c62]Oscar H. Ibarra, Koji Nakano, Stephan Olariu:
Workshop on Advances in Parallel and Distributed Computational Models. IPDPS Workshops 2000: 101 - [c61]Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer:
Conter Machines: Decidable Properties and Applications to Verification Problems. MFCS 2000: 426-435 - [c60]Hongjun Zhu, Jianwen Su, Oscar H. Ibarra:
Toward Spatial Joins for Polygons. SSDBM 2000: 231-244 - [c59]Hongjun Zhu, Jianwen Su, Oscar H. Ibarra:
Extending Rectangle Join Algorithms for Rectilinear Polygons. Web-Age Information Management 2000: 247-258 - [c58]Oscar H. Ibarra:
Reachability and Safety in Queue Systems. CIAA 2000: 145-156 - [c57]Oscar H. Ibarra, Jianwen Su:
Generalizing the Discrete Timed Automaton. CIAA 2000: 157-169
1990 – 1999
- 1999
- [j124]Oscar H. Ibarra, Jianwen Su:
A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries. J. Comput. Syst. Sci. 59(1): 1-28 (1999) - [c56]Oscar H. Ibarra, Jianwen Su:
Counter Machines: Decision Problems and Applications. Jewels are Forever 1999: 84-96 - [c55]Hongjun Zhu, Jianwen Su, Oscar H. Ibarra:
An Index Structure for Spatial Joins in Linear Constraint Databases. ICDE 1999: 636-643 - 1998
- [j123]Daniel Andresen, Tao Yang, Oscar H. Ibarra, Ömer Egecioglu:
Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance. J. Parallel Distributed Comput. 49(1): 57-85 (1998) - [c54]Huican Zhu, Tao Yang, Qi Zheng, David Watson, Oscar H. Ibarra, Terence R. Smith:
Adaptive Load Sharing for Clustered Digital Library Servers. HPDC 1998: 235-242 - [e1]Kyung-Yong Chwa, Oscar H. Ibarra:
Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings. Lecture Notes in Computer Science 1533, Springer 1998, ISBN 3-540-65385-6 [contents] - 1997
- [j122]Oscar H. Ibarra, Pedro C. Diniz, Martin C. Rinard:
On the Complexity of Commutativity Analysis. Int. J. Found. Comput. Sci. 8(1): 81-94 (1997) - [j121]Yizhou Yu, Oscar H. Ibarra, Tao Yang:
Parallel Progressive Radiosity with Adaptive Meshing. J. Parallel Distributed Comput. 42(1): 30-41 (1997) - [j120]Daniel Andresen, Tao Yang, Oscar H. Ibarra:
Toward a Scalable Distributed {WWW} Server on Workstation Clusters. J. Parallel Distributed Comput. 42(1): 91-100 (1997) - [j119]Oscar H. Ibarra, Nicholas Q. Trân, Tao Yang:
On the Parallel Complexity of Loops. Theor. Comput. Sci. 179(1-2): 381-395 (1997) - [c53]Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang:
A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval. COCOON 1997: 353-362 - [c52]Oscar H. Ibarra, Jianwen Su:
On the Containment and Equivalence of Database Queries with Linear Constraints. PODS 1997: 32-43 - 1996
- [j118]Tao Yang, Oscar H. Ibarra:
Performance Prediction in Symbolic Scheduling of Partitioned Programs with Weight Variation. J. Parallel Distributed Comput. 34(2): 171-182 (1996) - [c51]Daniel Andresen, Tao Yang, Ömer Egecioglu, Oscar H. Ibarra, Terence R. Smith:
Scalability Issues for High Performance Digital Libraries on the World Wide Web. ADL 1996: 139-148 - [c50]Oscar H. Ibarra, Pedro C. Diniz, Martin C. Rinard:
On the Complexity of Commutativity Analysis. COCOON 1996: 323-332 - [c49]Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang:
Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval. Data Compression Conference 1996: 465 - [c48]Daniel Andresen, Tao Yang, Vegard Holmedahl, Oscar H. Ibarra:
SWEB: Towards a Scalable World Wide Web Server on Multicomputers. IPPS 1996: 850-856 - [c47]Yizhou Yu, Oscar H. Ibarra, Tao Yang:
Parallel Progressive Radiosity with Adaptive Meshing. IRREGULAR 1996: 159-170 - 1995
- [j117]Oscar H. Ibarra, Qi Zheng:
An Optimal Shortest Path Parallel Algorithm for Permutation Graphs. J. Parallel Distributed Comput. 24(1): 94-99 (1995) - [j116]Oscar H. Ibarra, Ting-Chuen Pong, Stephen M. Sohn:
A note on parsing pattern languages. Pattern Recognit. Lett. 16(2): 179-182 (1995) - [j115]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) - [c46]Tao Yang, Oscar H. Ibarra:
On symbolic scheduling and parallel complexity of loops. SPDP 1995: 360-367 - 1994
- [j114]Oscar H. Ibarra, Nicholas Q. Trân:
On Communication-Bounded Synchronized Alternating Finite Automata. Acta Informatica 31(4): 315-327 (1994) - [j113]Oscar H. Ibarra, Qi Zheng:
Some Efficient Algorithms for Permutation Graphs. J. Algorithms 16(3): 453-469 (1994) - [j112]Oscar H. Ibarra, Myung Hee Kim:
Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube. J. Parallel Distributed Comput. 20(3): 303-316 (1994) - [j111]Tao Jiang, Oscar H. Ibarra, Hui Wang:
Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata. Theor. Comput. Sci. 125(2): 243-257 (1994) - [c45]Oscar H. Ibarra, Tao Jiang:
On Some Open Problems Concerning the Complexity of Cellular Arrays. Results and Trends in Theoretical Computer Science 1994: 183-196 - [c44]Douglas Chang, Teofilo F. Gonzalez, Oscar H. Ibarra:
A flow based approach to the pin redistribution problem for multi-chip modules. Great Lakes Symposium on VLSI 1994: 114-119 - [c43]Myung Hee Kim, Oscar H. Ibarra:
Transformations Between Boundary Codes, Run Length Codes, and Linear Quadtrees. IPPS 1994: 120-125 - [c42]Oscar H. Ibarra, Nicholas Q. Trân:
On the Parallel Complexity of Solving Recurrence Equations. ISAAC 1994: 469-477 - 1993
- [j110]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) - [j109]Oscar H. Ibarra, Hui Wang, Tao Jiang:
On Efficient Parallel Algorithms for Solving Set Recurrence Equations. J. Algorithms 14(2): 244-257 (1993) - [j108]Oscar H. Ibarra, Myung Hee Kim:
Quadtree Building Algorithms on an SIMD Hypercube. J. Parallel Distributed Comput. 18(1): 71-76 (1993) - [j107]Oscar H. Ibarra, Nicholas Q. Trân:
A Note on Simple Programs with Two Variables. Theor. Comput. Sci. 112(2): 391-397 (1993) - [j106]Oscar H. Ibarra, Nicholas Q. Trân:
Synchronized Finite Automata and 2DFA Reductions. Theor. Comput. Sci. 115(2): 261-275 (1993) - [c41]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 - [c40]Oscar H. Ibarra, Qi Zheng:
Finding Articulation Points and Bridges of Permutation Graphs. ICPP (3) 1993: 77-80 - [c39]Oscar H. Ibarra, Qi Zheng:
On the Shortest Path Problems for Permutation Graphs. IPPS 1993: 198-204 - [c38]Oscar H. Ibarra, Nicholas Q. Trân:
On the Communication Complexity of Parallel Computation. MFCS 1993: 517-526 - [c37]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
- [j105]Tao Jiang, Oscar H. Ibarra, Hui Wang, Qi Zheng:
A hierarchy result for 2-dimensional TM's operating in small space. Inf. Sci. 64(1-2): 49-56 (1992) - [j104]J. Andrew Holey, Oscar H. Ibarra:
Iterative algorithms for the planar convex hull problem on mesh-connected arrays. Parallel Comput. 18(3): 281-296 (1992) - [j103]Oscar H. Ibarra, Tao Jiang, Hui Wang:
String Editing on a One-Way Linear Array of Finite-State Machines. IEEE Trans. Computers 41(1): 112-118 (1992) - [j102]Oscar H. Ibarra, Nicholas Q. Trân:
On Space-Bounded Synchronized Alternating Turing Machines. Theor. Comput. Sci. 99(2): 243-264 (1992) - [j101]Oscar H. Ibarra, Tao Jiang, Hui Wang:
A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars. Theor. Comput. Sci. 99(2): 301-313 (1992) - [c36]Oscar H. Ibarra, Nicholas Q. Trân:
New Results Concerning Synchronized Finite Automata. ICALP 1992: 126-137 - [c35]Oscar H. Ibarra, Myung Hee Kim:
Quadtree Building Algorithms on an SIMD Hypercube. IPPS 1992: 22-27 - 1991
- [j100]Oscar H. Ibarra:
On Resetiting DLBA's. Bull. EATCS 44: 190-191 (1991) - [j99]Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Bala Ravikumar:
Some Classes of Languages in NC¹. Inf. Comput. 90(1): 86-106 (1991) - [j98]Oscar H. Ibarra, Tao Jiang:
Learning Regular Languages from Counterexamples. J. Comput. Syst. Sci. 43(2): 299-316 (1991) - [j97]Oscar H. Ibarra, Tao Jiang:
The Power of Alternating One-Reversal Counters and Stacks. SIAM J. Comput. 20(2): 278-290 (1991) - [j96]Oscar H. Ibarra:
On resetting DLBA's. SIGACT News 22(1): 62-63 (1991) - [j95]Oscar H. Ibarra, Ting-Chuen Pong, Stephen M. Sohn:
Parallel Regognition and Parsing on the Hypercube. IEEE Trans. Computers 40(6): 764-770 (1991) - [j94]Oscar H. Ibarra, Hui Wang:
Parallel Parsing on a One-Way Linear Array of Finite-State Machines. Theor. Comput. Sci. 85(1): 53-74 (1991) - [c34]Oscar H. Ibarra, Nicholas Q. Trân:
On Space-bounded Synchronized Alternating Turing Machines. FCT 1991: 248-257 - [c33]J. Andrew Holey, Oscar H. Ibarra:
Triangulation Voronoi Diagram and Convex Hull in k-Space on Mesh-Connected Arrays and Hypercubes. ICPP (3) 1991: 147-150 - [c32]J. Andrew Holey, Oscar H. Ibarra:
Triangulation in a Plane and 3-D Convex Hull on Mesh-Connected Arrays and Hypercubes. IPPS 1991: 10-17 - [c31]Oscar H. Ibarra, Myung Hee Kim:
Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube. IPPS 1991: 76-83 - [c30]Oscar H. Ibarra, Tao Jiang, Hui Wang:
Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata. MFCS 1991: 221-230 - 1990
- [j93]Oscar H. Ibarra, Michael A. Palis:
An efficient all-parses systolic algorithm for general context-free parsing. Int. J. Parallel Program. 19(4): 295-331 (1990) - [j92]Oscar H. Ibarra, Stephen M. Sohn:
On Mapping Systolic Algorithms onto the Hypercube. IEEE Trans. Parallel Distributed Syst. 1(1): 48-63 (1990) - [j91]Oscar H. Ibarra, Ting-Chuen Pong, Stephen M. Sohn:
String processing on the hypercube. IEEE Trans. Acoust. Speech Signal Process. 38(1): 160-164 (1990) - [j90]Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Michael A. Palis:
Systolic algorithms for some scheduling and graph problems. J. VLSI Signal Process. 1(4): 307-320 (1990) - [c29]J. Andrew Holey, Oscar H. Ibarra:
Iterative Algorithms for Planar Convex Hull on Mesh-Connected Arrays. ICPP (3) 1990: 102-109 - [c28]Oscar H. Ibarra, Tao Jiang, Hui Wang:
String Editing on a One-Way Linear Array of Finite-State Machines. ICPP (3) 1990: 173-176 - [c27]Oscar H. Ibarra, Hui Wang, Tao Jiang:
Efficient parallel algorithms for solving set recurrence equations and applications. SPDP 1990: 480-487
1980 – 1989
- 1989
- [j89]Oscar H. Ibarra, Tao Jiang:
Optimal Simulation of Tree Arrays by Linear Arrays. Inf. Process. Lett. 30(6): 295-302 (1989) - [j88]Oscar H. Ibarra, Tao Jiang, Jik H. Chang:
On Iterative and Cellular Tree Arrays. J. Comput. Syst. Sci. 38(3): 452-473 (1989) - [j87]Bala Ravikumar, Oscar H. Ibarra:
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation. SIAM J. Comput. 18(6): 1263-1282 (1989) - [j86]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis:
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATMs and Space-Bounded TMs. Theor. Comput. Sci. 68(1): 19-36 (1989) - [c26]Oscar H. Ibarra, Tao Jiang, Hui Wang:
Parallel Parsing on a One-way Linear Array of Finite-State Machines. FSTTCS 1989: 291-300 - [c25]Oscar H. Ibarra, Stephen M. Sohn:
On Mapping Systolic Algorithms onto the Hypercube. ICPP (1) 1989: 121-124 - [c24]Oscar H. Ibarra, Michael A. Palis:
An Efficient All-Parses Systolic Algorithm for General Context-Free Parsing. WADS 1989: 403-419 - 1988
- [j85]Oscar H. Ibarra, Tao Jiang, Bala Ravikumar:
Some Subclasses of Context-Free Languages In NC1. Inf. Process. Lett. 29(3): 111-117 (1988) - [j84]Jik H. Chang, Oscar H. Ibarra, Anastasios Vergis:
On the power of one-way communication. J. ACM 35(3): 697-726 (1988) - [j83]Oscar H. Ibarra, Bala Ravikumar:
Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties. Math. Syst. Theory 21(1): 1-17 (1988) - [j82]Jik H. Chang, Oscar H. Ibarra, Ting-Chuen Pong, Stephen M. Sohn:
Two-Dimensional Convolution on a Pyramid Computer. IEEE Trans. Pattern Anal. Mach. Intell. 10(4): 590-593 (1988) - [j81]David Hung-Chang Du, Oscar H. Ibarra, J. Fernando Naveda:
On Two-Dimensional Via Assignment for Single-Row Routing. IEEE Trans. Computers 37(6): 721-727 (1988) - [j80]Jik H. Chang, Oscar H. Ibarra, Moon-Jung Chung, Kotesh K. Rao:
Systolic Tree Implementation of Data Structures. IEEE Trans. Computers 37(6): 727-735 (1988) - [j79]Oscar H. Ibarra, Michael A. Palis:
Two-Dimensional Iterative Arrays: Characterizations and Applications. Theor. Comput. Sci. 57: 47-86 (1988) - [j78]Oscar H. Ibarra, Tao Jiang:
Relating the Power of Cellular Arrays to Their Closure Properties. Theor. Comput. Sci. 57: 225-238 (1988) - [c23]Oscar H. Ibarra, Tao Jiang, Bala Ravikumar, Jik H. Chang:
On Some Languages in NC. AWOC 1988: 64-73 - [c22]Oscar H. Ibarra, Tao Jiang:
Trading reversals for alternation. SCT 1988: 70-77 - [c21]Oscar H. Ibarra, Tao Jiang:
Learning Regular Languages From Counterexamples. COLT 1988: 371-385 - [c20]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis:
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's. ICALP 1988: 119-132 - 1987
- [j77]Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman:
Some Observations Concerning Alternating Turing Machines Using Small Space. Inf. Process. Lett. 25(1): 1-9 (1987) - [j76]Oscar H. Ibarra, Michael A. Palis:
On Efficient Simulations of Systolic Arrays of Random-Access Machines. SIAM J. Comput. 16(2): 367-377 (1987) - [j75]Oscar H. Ibarra, Tao Jiang:
On One-Way Cellular Arrays. SIAM J. Comput. 16(6): 1135-1154 (1987) - [j74]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis:
Parallel Parsing on a One-Way Array of Finite-State Machines. IEEE Trans. Computers 36(1): 64-75 (1987) - [j73]David Hung-Chang Du, Oscar H. Ibarra, J. Fernando Naveda:
Single-Row Routing with Crossover Bound. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 6(2): 190-201 (1987) - [j72]Oscar H. Ibarra, Michael A. Palis:
VLSI algorithms for solving recurrence equations and applications. IEEE Trans. Acoust. Speech Signal Process. 35(7): 1046-1064 (1987) - [c19]Oscar H. Ibarra, Bala Ravikumar:
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. FSTTCS 1987: 26-43 - [c18]Oscar H. Ibarra, Tao Jiang:
On the Computing Power of One-Way Cellular Arrays. ICALP 1987: 550-562 - [c17]Jik H. Chang, Oscar H. Ibarra, Ting-Chuen Pong, Stephen M. Sohn:
Two-Dimensional Convolution on a Pyramid Computer. ICPP 1987: 780-782 - 1986
- [j71]Oscar H. Ibarra, Sam M. Kim, Michael A. Palis:
Designing Systolic Algorithms Using Sequential Machines. IEEE Trans. Computers 35(6): 531-542 (1986) - [j70]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis, Bala Ravikumar:
On Pebble Automata. Theor. Comput. Sci. 44: 111-121 (1986) - [c16]Jik H. Chang, Oscar H. Ibarra, Anastasios Vergis:
On the Power of One-Way Communication. FOCS 1986: 455-464 - [c15]Jik H. Chang, Moon-Jung Chung, Oscar H. Ibarra, Kotesh K. Rao:
Systolic Tree Implementation of Data Structures. ICPP 1986: 669-671 - [c14]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis:
Parallel Parsing on a One-Way Array of Finite-State Machines. ICPP 1986: 887-894 - [c13]Oscar H. Ibarra:
Systolic Arrays: Characterizations and Complexity. MFCS 1986: 140-153 - [c12]Oscar H. Ibarra, Bala Ravikumar:
On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. STACS 1986: 171-179 - 1985
- [j69]Oscar H. Ibarra, Louis E. Rosier:
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs. Inf. Control. 65(1): 18-41 (1985) - [j68]Oscar H. Ibarra, Louis E. Rosier:
On Simple Programs with Primitive Conditional Statements. Inf. Control. 65(1): 42-62 (1985) - [j67]Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier:
Some Characterizations of Multihead Finite Automata. Inf. Control. 67(1-3): 114-125 (1985) - [j66]Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier:
On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's. Inf. Control. 67(1-3): 126-143 (1985) - [j65]Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
Some results concerning linear iterative (systolic) arrays. J. Parallel Distributed Comput. 2(2): 182-218 (1985) - [j64]Oscar H. Ibarra, Sam M. Kim, Shlomo Moran:
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications. SIAM J. Comput. 14(2): 426-447 (1985) - [j63]Oscar H. Ibarra, Michael A. Palis, Jik H. Chang:
On Efficient Recognition of Transductions and Relations. Theor. Comput. Sci. 39: 89-106 (1985) - [j62]Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
Fast Parallel Language Recognition by Cellular Automata. Theor. Comput. Sci. 41: 231-246 (1985) - 1984
- [j61]Oscar H. Ibarra, Sam M. Kim:
A Characterization of Systolic Binary Tree Automata and Applications. Acta Informatica 21: 193-207 (1984) - [j60]Oscar H. Ibarra, Brian S. Leininger, Louis E. Rosier:
A Note on the Complexity of Program Evaluation. Math. Syst. Theory 17(2): 85-96 (1984) - [j59]Oscar H. Ibarra, Sam M. Kim:
Characterizations and Computational Complexity of Systolic Trellis Automata. Theor. Comput. Sci. 29: 123-153 (1984) - [c11]Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
Designing Systolic Algorithms Using Sequential Machines. FOCS 1984: 46-55 - [c10]Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier:
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs. ICALP 1984: 247-259 - [c9]Oscar H. Ibarra, Louis E. Rosier:
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract). MFCS 1984: 330-338 - 1983
- [j58]Oscar H. Ibarra, Shlomo Moran:
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs. J. ACM 30(1): 217-228 (1983) - [j57]Oscar H. Ibarra, Brian S. Leininger:
On the Simplification and Equivalence Problems for Straight-Line Programs. J. ACM 30(3): 641-656 (1983) - [j56]Oscar H. Ibarra, Brian S. Leininger:
On the Zero-Inequivalence Problem for Loop Programs. J. Comput. Syst. Sci. 26(1): 47-64 (1983) - [j55]Eitan M. Gurari, Oscar H. Ibarra:
A Note on Finitely-Valued and Finitely Ambiguous Transducers. Math. Syst. Theory 16(1): 61-66 (1983) - [j54]Oscar H. Ibarra, Shlomo Moran:
Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's. SIAM J. Comput. 12(2): 388-394 (1983) - [j53]Tat-hung Chan, Oscar H. Ibarra:
On the Space and Time Complexity of Functions Computable by Simple Programs. SIAM J. Comput. 12(4): 708-716 (1983) - [j52]Tat-hung Chan, Oscar H. Ibarra:
On the Finite-Valuedness Problem for Sequential Machines. Theor. Comput. Sci. 23: 95-101 (1983) - [j51]Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier:
On the Control Power of Integer Division. Theor. Comput. Sci. 24: 35-52 (1983) - [j50]Oscar H. Ibarra:
On Some Decision Questions Concerning Pushdown Machines. Theor. Comput. Sci. 24: 313-322 (1983) - [j49]Oscar H. Ibarra, Louis E. Rosier:
Simple Programming Languages and Restricted Classes of Turing Machines. Theor. Comput. Sci. 26: 197-220 (1983) - 1982
- [j48]Eitan M. Gurari, Oscar H. Ibarra:
Two-Way Counter Machines and Diophantine Equations. J. ACM 29(3): 863-873 (1982) - [j47]Oscar H. Ibarra, Shlomo Moran, Roger Hui:
A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications. J. Algorithms 3(1): 45-56 (1982) - [j46]Oscar H. Ibarra, Shlomo Moran:
On Some Decision Problems for RAM Programs. J. Comput. Syst. Sci. 24(1): 69-81 (1982) - [j45]Eitan M. Gurari, Oscar H. Ibarra:
(Semi)Alternating Stack Automata. Math. Syst. Theory 15(3): 211-224 (1982) - [j44]Oscar H. Ibarra, Brian S. Leininger:
Straight-Line Programs with One Input Variable. SIAM J. Comput. 11(1): 1-14 (1982) - [j43]Oscar H. Ibarra, Brian S. Leininger:
The Complexity of the Equivalence Problem for Simple Loop-Free Programs. SIAM J. Comput. 11(1): 15-27 (1982) - [j42]Eitan M. Gurari, Oscar H. Ibarra:
Some Simplified Undecidable and NP-Hard Problems for Simple Programs. Theor. Comput. Sci. 17: 55-73 (1982) - [j41]Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran:
On the Complexity of Simple Arithmetic Expressions. Theor. Comput. Sci. 19: 17-28 (1982) - [j40]Oscar H. Ibarra:
2DST Mapppings on Languages and Related Problems. Theor. Comput. Sci. 19: 219-227 (1982) - 1981
- [j39]Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier:
Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems. Inf. Process. Lett. 12(5): 227-232 (1981) - [j38]Oscar H. Ibarra, Shlomo Moran:
Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication. Inf. Process. Lett. 13(1): 12-15 (1981) - [j37]Oscar H. Ibarra, Louis E. Rosier:
On the Decidability of Equivalence for Deterministic Pushdown Transducers. Inf. Process. Lett. 13(3): 89-93 (1981) - [j36]Eitan M. Gurari, Oscar H. Ibarra:
The Complexity of the Equivalence Problem for Simple Programs. J. ACM 28(3): 535-560 (1981) - [j35]Eitan M. Gurari, Oscar H. Ibarra:
The Complexity of Decision Problems for Finite-Turn Multicounter Machines. J. Comput. Syst. Sci. 22(2): 220-229 (1981) - [j34]Oscar H. Ibarra, Louis E. Rosier:
On Restricted One-counter Machines. Math. Syst. Theory 14: 241-245 (1981) - [j33]Oscar H. Ibarra, Brian S. Leininger:
Characterizations of Presburger Functions. SIAM J. Comput. 10(1): 22-39 (1981) - [j32]Eitan M. Gurari, Oscar H. Ibarra:
The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets. Theor. Comput. Sci. 13: 295-314 (1981) - [c8]Eitan M. Gurari, Oscar H. Ibarra:
Two-Way Counter Machines and Diophantine Equations. FOCS 1981: 45-52 - [c7]Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran:
On the Complexity of Simple Arithmetic Expressions. ICALP 1981: 294-304 - [c6]Eitan M. Gurari, Oscar H. Ibarra:
The Complexity of Decision Problems for Finite-Turn Multicounter Machines. ICALP 1981: 495-505 - 1980
- [j31]Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier:
A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. Inf. Process. Lett. 11(4/5): 162 (1980) - [j30]Eitan M. Gurari, Oscar H. Ibarra:
Path Systems: Constructions, Solutions and Applications. SIAM J. Comput. 9(2): 348-374 (1980) - [c5]Oscar H. Ibarra, Brian S. Leininger:
The Complexity of the Equivalence Problem for Straight-Line Programs. STOC 1980: 273-280
1970 – 1979
- 1979
- [j29]Eitan M. Gurari, Oscar H. Ibarra:
On the Space Complexity of Recursive Algorithms. Inf. Process. Lett. 8(5): 267-271 (1979) - [j28]Eitan M. Gurari, Oscar H. Ibarra:
An NP-Complete Number-Theoretic Problem. J. ACM 26(3): 567-581 (1979) - [j27]Eitan M. Gurari, Oscar H. Ibarra:
Some Decision Problems Concerning Sequential Transducers and Checking Automata. J. Comput. Syst. Sci. 18(1): 18-34 (1979) - [j26]Eitan M. Gurari, Oscar H. Ibarra:
Simple Counter Machines and Number-Theoretic Problems. J. Comput. Syst. Sci. 19(2): 145-162 (1979) - [j25]Oscar H. Ibarra:
Restricted One-Counter Machines with Undecidable Universe Problems. Math. Syst. Theory 13: 181-186 (1979) - [c4]Eitan M. Gurari, Oscar H. Ibarra:
The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs. STOC 1979: 142-152 - 1978
- [j24]Oscar H. Ibarra:
Reversal-Bounded Multicounter Machines and Their Decision Problems. J. ACM 25(1): 116-133 (1978) - [j23]Oscar H. Ibarra, Chul E. Kim:
Approximation Algorithms for Certain Scheduling Problems. Math. Oper. Res. 3(3): 197-204 (1978) - [j22]Oscar H. Ibarra:
The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications. SIAM J. Comput. 7(4): 524-532 (1978) - [j21]Oscar H. Ibarra:
On Two-Way Sequential Transductions of Full Semi-AFL's. Theor. Comput. Sci. 7: 287-309 (1978) - [c3]Eitan M. Gurari, Oscar H. Ibarra:
An NP-Complete Number-Theoretic Problem. STOC 1978: 205-215 - 1977
- [j20]Oscar H. Ibarra, Chul E. Kim:
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors. J. ACM 24(2): 280-289 (1977) - [j19]Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni:
Bounds for LPT Schedules on Uniform Processors. SIAM J. Comput. 6(1): 155-166 (1977) - [c2]Oscar H. Ibarra:
The Unsolvability of the Equivalence Problem for epsilon-free NGSM's with Unary Input (Output) Alphabet and Applications. FOCS 1977: 74-81 - 1976
- [j18]Oscar H. Ibarra, Chul E. Kim:
A Useful Device for Showing the Solvability of Some Decision Problems. J. Comput. Syst. Sci. 13(2): 153-160 (1976) - [j17]Oscar H. Ibarra, Sartaj Sahni, Chul E. Kim:
Finite Automata with Multiplication. Theor. Comput. Sci. 2(3): 271-294 (1976) - [c1]Oscar H. Ibarra, Chul E. Kim:
A Useful Device for Showing the Solvability of Some Decision Problems. STOC 1976: 135-140 - 1975
- [j16]Oscar H. Ibarra, Chul E. Kim:
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems. J. ACM 22(4): 463-468 (1975) - [j15]Oscar H. Ibarra, Sartaj Sahni:
Hierarchies of Turing Machines with Restricted Tape Alphabet Size. J. Comput. Syst. Sci. 11(1): 56-67 (1975) - [j14]Oscar H. Ibarra, Sartaj Sahni:
Polynomially Complete Fault Detection Problems. IEEE Trans. Computers 24(3): 242-249 (1975) - 1974
- [j13]Oscar H. Ibarra, Chul E. Kim:
On 3-Head Versus 2-Head Finite Automata. Acta Informatica 4: 193-200 (1974) - [j12]Oscar H. Ibarra:
A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata. Inf. Process. Lett. 3(1): 25-28 (1974) - [j11]Oscar H. Ibarra:
A Hierarchy Theorem for Polynomial-Space Recognition. SIAM J. Comput. 3(3): 184-187 (1974) - 1973
- [j10]Oscar H. Ibarra:
Controlled pushdown automata. Inf. Sci. 6: 327-342 (1973) - [j9]Oscar H. Ibarra:
On Two-way Multihead Automata. J. Comput. Syst. Sci. 7(1): 28-36 (1973) - 1972
- [j8]Oscar H. Ibarra:
A Note Concerning Nondeterministic Tape Complexities. J. ACM 19(4): 608-612 (1972) - 1971
- [j7]Oscar H. Ibarra:
Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata. J. Comput. Syst. Sci. 5(2): 88-117 (1971) - [j6]Oscar H. Ibarra:
Characterizations of Transductions Defined by Abstract Families of Transducers. Math. Syst. Theory 5(3): 271-281 (1971) - 1970
- [j5]Oscar H. Ibarra:
Simple Matrix Languages. Inf. Control. 17(4): 359-394 (1970) - [j4]Ronald V. Book, Sheila A. Greibach, Oscar H. Ibarra, Ben Wegbreit:
Tape-Bounded Turing Acceptors and Principal AFLs. J. Comput. Syst. Sci. 4(6): 622-625 (1970)
1960 – 1969
- 1968
- [j3]Michael A. Harrison, Oscar H. Ibarra:
Multi-Tape and Multi-Head Pushdown Automata. Inf. Control. 13(5): 433-470 (1968) - 1967
- [j2]Jim Gray, Michael A. Harrison, Oscar H. Ibarra:
Two-Way Pushdown Automata. Inf. Control. 11(1/2): 30-70 (1967) - [j1]Oscar H. Ibarra:
On the Equivalence of Finite-State Sequential Machine Models. IEEE Trans. Electron. Comput. 16(1): 88-90 (1967)
Coauthor Index
[j217] [j211] [j209] [j205] [j199] [c153] [c147] [c142] [j190] [c138] [j178] [j170] [j168] [c106] [j159] [j156] [j154] [e5] [j150] [j149] [j148] [j146] [c102] [c99] [c96] [c93] [j142] [j141] [j140] [c91] [c90] [c88] [c84] [j136] [j135] [j134] [c81] [c80] [c78] [e3] [j131] [j129] [c76] [c74] [c71] [c70] [c68] [c65] [c64] [c61]
[j232] [c169] [i18] [j231] [j230] [c168] [c167] [i17] [c166] [i16] [i15] [i14] [i13] [i12] [i11] [j229] [j228] [j227] [j225] [j224] [c165] [i10] [j223] [j222] [j221] [j220] [j219] [i9] [i8] [i7] [i6] [j218] [j216] [j215] [j214] [j213] [c164] [c163] [c162] [c160] [p1] [j208] [c159] [c157] [i5] [i4] [j200] [c156] [c154] [i3] [i2] [i1] [c152] [c151] [c149] [c148] [j137]
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-12-17 21:54 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:
