| Year |
Citation |
Score |
| 2019 |
Ibarra OH, McQuillan I. On families of full trios containing counter machine languages Theoretical Computer Science. 799: 71-93. DOI: 10.1016/J.Tcs.2019.09.045 |
0.332 |
|
| 2019 |
Ibarra OH, McQuillan I, Ravikumar B. On counting functions and slenderness of languages Theoretical Computer Science. 777: 356-378. DOI: 10.1016/J.Tcs.2018.11.021 |
0.339 |
|
| 2019 |
Ibarra OH, McQuillan I. On store languages and applications Information & Computation. 267: 28-48. DOI: 10.1016/J.Ic.2019.03.003 |
0.377 |
|
| 2018 |
Ibarra OH. Grammatical characterizations of NPDAs and VPDAs with counters Theoretical Computer Science. 746: 136-150. DOI: 10.1016/J.Tcs.2018.06.035 |
0.337 |
|
| 2018 |
Ibarra OH, McQuillan I. On store languages of language acceptors Theoretical Computer Science. 745: 114-132. DOI: 10.1016/J.Tcs.2018.05.036 |
0.331 |
|
| 2018 |
Ibarra OH, McQuillan I. Variations of checking stack automata: Obtaining unexpected decidability properties Theoretical Computer Science. 738: 1-12. DOI: 10.1016/J.Tcs.2018.04.024 |
0.32 |
|
| 2017 |
Cui C, Dang Z, Fischer TR, Ibarra OH. Information rate of some classes of non-regular languages: An automata-theoretic approach Information & Computation. 256: 45-61. DOI: 10.1016/J.Ic.2017.04.008 |
0.337 |
|
| 2017 |
Enaganti SK, Ibarra OH, Kari L, Kopecki S. Further remarks on DNA overlap assembly Information & Computation. 253: 143-154. DOI: 10.1016/J.Ic.2017.01.009 |
0.305 |
|
| 2016 |
Ibarra OH, McQuillan I. The effect of end-markers on counter machines and commutativity Theoretical Computer Science. 627: 71-81. DOI: 10.1016/J.Tcs.2016.02.034 |
0.36 |
|
| 2016 |
Enaganti SK, Ibarra OH, Kari L, Kopecki S. On the overlap assembly of strings and languages Natural Computing. 1-11. DOI: 10.1007/S11047-015-9538-X |
0.315 |
|
| 2015 |
Ibarra OH, Seki S. Semilinear sets and counter machines: A brief survey Fundamenta Informaticae. 138: 61-76. DOI: 10.3233/Fi-2015-1198 |
0.345 |
|
| 2015 |
Eremondi J, Ibarra OH, McQuillan I. On the density of context-free and counter languages Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9168: 228-239. DOI: 10.1142/S0129054118400051 |
0.303 |
|
| 2015 |
Eremondi J, Ibarra OH, McQuillan I. Insertion operations on deterministic reversal-bounded counter machines Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8977: 200-211. DOI: 10.1016/J.Jcss.2018.02.003 |
0.359 |
|
| 2015 |
Eremondi J, Ibarra OH, McQuillan I. Deletion operations on deterministic families of automata Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9076: 388-399. DOI: 10.1016/J.Ic.2017.07.009 |
0.333 |
|
| 2015 |
Ibarra OH. On decidability and closure properties of language classes with respect to bio-operations Natural Computing. DOI: 10.1007/S11047-015-9500-Y |
0.33 |
|
| 2013 |
Ibarra OH, Tran NQ. How to synchronize the heads of a multitape automaton International Journal of Foundations of Computer Science. 24: 799-813. DOI: 10.1142/S0129054113400194 |
0.307 |
|
| 2013 |
Ibarra OH, Seki S. On the open problem of Ginsburg concerning semilinear sets and related problems Theoretical Computer Science. 501: 11-19. DOI: 10.1016/J.Tcs.2013.07.025 |
0.36 |
|
| 2013 |
Cui C, Dang Z, Fischer TR, Ibarra OH. Similarity in languages and programs Theoretical Computer Science. 498: 58-75. DOI: 10.1016/J.Tcs.2013.05.040 |
0.314 |
|
| 2013 |
Ibarra OH, Ravikumar B. On bounded languages and reversal-bounded automata Information and Computation. DOI: 10.1016/J.Ic.2015.11.007 |
0.33 |
|
| 2012 |
Ibarra OH, Eǧecioǧlu O. A survey of results on stateless multicounter automata Fundamenta Informaticae. 116: 129-140. DOI: 10.3233/Fi-2012-674 |
0.325 |
|
| 2012 |
Ibarra OH, Seki S. Characterizations of bounded semilinear languages by one-way and two-way deterministic machines International Journal of Foundations of Computer Science. 23: 1291-1305. DOI: 10.1142/S0129054112400539 |
0.329 |
|
| 2012 |
Ibarra OH, Tran NQ. On synchronized multi-tape and multi-head automata Theoretical Computer Science. 449: 74-84. DOI: 10.1016/J.Tcs.2012.04.006 |
0.328 |
|
| 2012 |
Chiniforooshan E, Daley M, Ibarra OH, Kari L, Seki S. One-reversal counter machines and multihead automata: Revisited Theoretical Computer Science. 454: 81-87. DOI: 10.1016/J.Tcs.2012.04.002 |
0.361 |
|
| 2011 |
Yu F, Bultan T, Ibarra OH. Relational string verification using multi-track automata International Journal of Foundations of Computer Science. 22: 1909-1924. DOI: 10.1142/S0129054111009112 |
0.318 |
|
| 2011 |
Ibarra OH. On strong reversibility in P systems and related problems International Journal of Foundations of Computer Science. 22: 7-14. DOI: 10.1142/S0129054111007782 |
0.372 |
|
| 2010 |
Frisco P, Ibarra OH. On sets of numbers accepted by P/T systems composed by join Theoretical Computer Science. 411: 3905-3916. DOI: 10.1016/J.Tcs.2010.07.016 |
0.358 |
|
| 2010 |
Ibarra OH, Potapov I, Yen HC. On decision problems for parameterized machines Theoretical Computer Science. 411: 1192-1201. DOI: 10.1016/J.Tcs.2009.12.013 |
0.337 |
|
| 2010 |
Ibarra OH. On the universe, disjointness, and containment problems for simple machines Information and Computation. 208: 1273-1282. DOI: 10.1016/J.Ic.2010.07.004 |
0.355 |
|
| 2010 |
Ibarra OH, Pérez-Jiménez MJ, Yokomori T. On spiking neural P systems Natural Computing. 9: 475-491. DOI: 10.1007/S11047-009-9159-3 |
0.397 |
|
| 2010 |
Yang L, Dang Z, Ibarra OH. Bond computing systems: A biologically inspired and high-level dynamics model for pervasive computing Natural Computing. 9: 347-364. DOI: 10.1007/S11047-009-9134-Z |
0.33 |
|
| 2009 |
Ibarra OH, Pǎun A, Rodríguez-Patón A. Sequential SNP systems based on min/max spike number Theoretical Computer Science. 410: 2982-2991. DOI: 10.1016/J.Tcs.2009.03.004 |
0.354 |
|
| 2009 |
Cavaliere M, Ibarra OH, Pǎun G, Egecioglu O, Ionescu M, Woodworth S. Asynchronous spiking neural P systems Theoretical Computer Science. 410: 2352-2364. DOI: 10.1016/J.Tcs.2009.02.031 |
0.678 |
|
| 2008 |
Yang L, Dang Z, Ibarra OH. On stateless automata and P systems International Journal of Foundations of Computer Science. 19: 1259-1276. DOI: 10.1142/S0129054108006261 |
0.356 |
|
| 2008 |
Ibarra OH, Dang Z, Yang L. On counter machines, reachability problems, and Diophantine equations International Journal of Foundations of Computer Science. 19: 919-934. DOI: 10.1142/S0129054108006042 |
0.314 |
|
| 2008 |
Ibarra OH, P̌un A. Computing with cells: Membrane systems - Some complexity issues International Journal of Parallel, Emergent and Distributed Systems. 23: 347-365. DOI: 10.1080/17445760701640266 |
0.343 |
|
| 2008 |
Gerede CE, Ibarra OH, Ravikumar B, Su J. Minimum-cost delegation in service composition Theoretical Computer Science. 409: 417-431. DOI: 10.1016/J.Tcs.2008.08.040 |
0.739 |
|
| 2008 |
Ibarra OH, Woodworth S. Characterizations of some classes of spiking neural P systems Natural Computing. 7: 499-517. DOI: 10.1007/S11047-008-9084-X |
0.684 |
|
| 2008 |
Ibarra OH, Woodworth S, Yu F, Pǎun A. On spiking neural P systems and partially blind counter machines Natural Computing. 7: 3-19. DOI: 10.1007/S11047-007-9043-Y |
0.652 |
|
| 2008 |
Cavaliere M, Egecioglu O, Ibarra OH, Ionescu M, Pǎun G, Woodworth S. Asynchronous spiking neural P systems: Decidability and undecidability Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4848: 246-255. DOI: 10.1007/978-3-540-77962-9_26 |
0.617 |
|
| 2007 |
Ibarra OH, Woodworth S. Characterizing regular languages by spiking neural P systems International Journal of Foundations of Computer Science. 18: 1247-1256. DOI: 10.1142/S0129054107005297 |
0.673 |
|
| 2007 |
Ibarra OH, Pǎun A, Pǎun G, Rodríguez-Patón A, Sosík P, Woodworth S. Normal forms for spiking neural P systems Theoretical Computer Science. 372: 196-217. DOI: 10.1016/J.Tcs.2006.11.025 |
0.667 |
|
| 2007 |
Ibarra OH, Woodworth S. Spiking neural P systems: Some characterizations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4639: 23-37. |
0.659 |
|
| 2006 |
Cheruku S, Paun A, Romero-Campero FJ, Perez-Jimenez MJ, Ibarra OH. Simulating FAS-induced apoptosis by using P systems Pre-Proceedings of the International Conference On Bio-Inspired Computing - Theory and Applications: Membrane Computing Section, Bic-Ta 2006. 71-81. DOI: 10.1080/10020070708541019 |
0.327 |
|
| 2006 |
Ibarra OH, Woodworth S. On symport/antiport P systems with a small number of objects International Journal of Computer Mathematics. 83: 613-629. DOI: 10.1080/00207160601065439 |
0.642 |
|
| 2006 |
Ibarra OH, Yen HC. Deterministic catalytic systems are not universal Theoretical Computer Science. 363: 149-161. DOI: 10.1016/J.Tcs.2006.07.029 |
0.373 |
|
| 2006 |
Ibarra OH, Pǎun G. Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems Theoretical Computer Science. 358: 88-103. DOI: 10.1016/J.Tcs.2006.03.003 |
0.395 |
|
| 2006 |
Ibarra OH, Dang Z. On the solvability of a class of diophantine equations and applications Theoretical Computer Science. 352: 342-346. DOI: 10.1016/J.Tcs.2005.12.001 |
0.332 |
|
| 2006 |
Csuhaj-Varjú E, Ibarra OH, Vaszil G. On the computational complexity of P automata Natural Computing. 5: 109-126. DOI: 10.1007/S11047-005-4461-1 |
0.404 |
|
| 2006 |
Ibarra OH, Woodworth S. Characterizations of some restricted spiking neural P systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4361: 424-442. DOI: 10.1007/11963516_27 |
0.618 |
|
| 2006 |
Ibarra OH, Woodworth S. On bounded symport/antiport P systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3892: 129-143. DOI: 10.1007/11753681_10 |
0.618 |
|
| 2006 |
Ibarra OH, Woodworth S, Yen HC, Dang Z. On symport/antiport P systems and semilinear sets Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3850: 253-271. DOI: 10.1007/11603047_18 |
0.614 |
|
| 2006 |
Ibarra OH, Woodworth S, Yen HC, Dang Z. On the computational power of 1-deterministic and sequential P systems Fundamenta Informaticae. 73: 133-152. |
0.645 |
|
| 2005 |
Dang Z, Ibarra OH. On one-membrane P systems operating in sequential mode International Journal of Foundations of Computer Science. 16: 867-881. DOI: 10.1142/S0129054105003340 |
0.38 |
|
| 2005 |
Ibarra OH, Yen HC, Dang Z. On various notions of parallelism in P systems International Journal of Foundations of Computer Science. 16: 683-705. DOI: 10.1142/S0129054105003236 |
0.389 |
|
| 2005 |
Ibarra OH, Woodworth S. On symport/antiport P systems with one or two symbols Proceedings - Seventh International Symposium On Symbolic and Numeric Algorithms For Scientific Computing, Synasc 2005. 2005: 431-439. DOI: 10.1109/SYNASC.2005.52 |
0.614 |
|
| 2005 |
Gerede CE, Ibarra OH, Ravikumar B, Su J. Online and minimum-cost ad hoc delegation in e-service composition Proceedings - 2005 Ieee International Conference Onservices Computing, Scc 2005. 103-110. DOI: 10.1109/SCC.2005.69 |
0.735 |
|
| 2005 |
Dang Z, Ibarra OH, Su J. On composition and lookahead delegation of e-services modeled by automata Theoretical Computer Science. 341: 344-363. DOI: 10.1016/J.Tcs.2005.06.009 |
0.346 |
|
| 2005 |
Ibarra OH. On determinism versus nondeterminism in P systems Theoretical Computer Science. 344: 120-133. DOI: 10.1016/J.Tcs.2005.03.052 |
0.404 |
|
| 2005 |
Dang Z, Ibarra OH, Sun ZW. On two-way nondeterministic finite automata with one reversal-bounded counter Theoretical Computer Science. 330: 59-79. DOI: 10.1016/J.Tcs.2004.09.010 |
0.373 |
|
| 2005 |
Ibarra OH. On membrane hierarchy in P systems Theoretical Computer Science. 334: 115-129. DOI: 10.1016/J.Tcs.2004.05.007 |
0.354 |
|
| 2005 |
Ibarra OH, Woodworth S, Yen HC, Dang Z. On sequential and 1-deterministic P systems Lecture Notes in Computer Science. 3595: 905-914. |
0.646 |
|
| 2004 |
Ibarra OH. On the computational complexity of membrane systems Theoretical Computer Science. 320: 89-109. DOI: 10.1016/J.Tcs.2004.03.045 |
0.417 |
|
| 2004 |
Ibarra OH, Dang Z, Egecioglu O. Catalytic P systems, semilinear sets, and vector addition systems Theoretical Computer Science. 312: 379-399. DOI: 10.1016/J.Tcs.2003.10.028 |
0.366 |
|
| 2004 |
Ibarra OH, Dang Z. On two-way FA with monotonic counters and quadratic Diophantine equations Theoretical Computer Science. 312: 359-378. DOI: 10.1016/J.Tcs.2003.10.027 |
0.349 |
|
| 2004 |
Dang Z, Bultan T, Ibarra OH, Kemmerer RA. Past pushdown timed automata and safety verification Theoretical Computer Science. 313: 57-71. DOI: 10.1016/J.Tcs.2003.10.004 |
0.366 |
|
| 2004 |
Ibarra OH. The number of membranes matters Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2933: 218-231. DOI: 10.1007/978-3-540-24619-0_16 |
0.357 |
|
| 2004 |
Gerede CE, Hull R, Ibarra OH, Su J. Automated composition of e-services: Lookaheads Icsoc '04: Proceedings of the Second International Conference On Service Oriented Computing. 252-262. |
0.737 |
|
| 2003 |
Daley M, Ibarra OH, Kari L. Closure and decidability properties of some language classes with respect to ciliate bio-operations Theoretical Computer Science. 306: 19-38. DOI: 10.1016/S0304-3975(03)00139-7 |
0.303 |
|
| 2003 |
Ibarra OH, Dang Z. Eliminating the storage tape in reachability constructions Theoretical Computer Science. 299: 687-706. DOI: 10.1016/S0304-3975(02)00545-5 |
0.341 |
|
| 2003 |
Dang Z, Ibarra OH, Kemmerer RA. Generalized discrete timed automata: Decidable approximations for safety verification Theoretical Computer Science. 296: 59-74. DOI: 10.1016/S0304-3975(02)00432-2 |
0.325 |
|
| 2002 |
Dang Z, Ibarra OH. The existence of ω-chains for transitive mixed linear relations and its applications International Journal of Foundations of Computer Science. 13: 911-936. DOI: 10.1142/S0129054102001539 |
0.311 |
|
| 2002 |
Ibarra OH. Verification in queue-connected multicounter machines International Journal of Foundations of Computer Science. 13: 115-127. DOI: 10.1142/S0129054102000984 |
0.328 |
|
| 2002 |
Ibarra OH, Su J. Augmenting the discrete timed automaton with other data structures Theoretical Computer Science. 289: 191-204. DOI: 10.1016/S0304-3975(01)00269-9 |
0.344 |
|
| 2002 |
Ibarra OH, Su J, Dang Z, Bultan T, Kemmerer RA. Counter machines and verification problems Theoretical Computer Science. 289: 165-189. DOI: 10.1016/S0304-3975(01)00268-7 |
0.333 |
|
| 2002 |
Harju T, Ibarra OH, Karhumäki J, Salomaa A. Some Decision Problems Concerning Semilinearity and Commutation Journal of Computer and System Sciences. 65: 278-294. DOI: 10.1006/Jcss.2002.1836 |
0.353 |
|
| 2001 |
Ibarra OH, Bultan T, Su J. On reachability and safety in infinite-state systems International Journal of Foundations of Computer Science. 12: 821-836. DOI: 10.1142/S0129054101000898 |
0.361 |
|
| 2000 |
Zhu H, Yang T, Zheng Q, Watson D, Ibarra OH, Smith T. Adaptive load sharing for clustered digital library servers International Journal On Digital Libraries. 2: 225-235. DOI: 10.1007/Pl00021467 |
0.534 |
|
| 1999 |
Ibarra OH, Su J. Technique for proving decidability of containment and equivalence of linear constraint queries Journal of Computer and System Sciences. 59: 1-28. DOI: 10.1006/Jcss.1999.1624 |
0.357 |
|
| 1997 |
Ibarra OH, Diniz PC, Rinard MC. On the Complexity of Commutativity Analysis International Journal of Foundations of Computer Science. 8: 81-94. DOI: 10.1142/S0129054197000069 |
0.326 |
|
| 1995 |
Ibarra OH, Jiang T, Tran N, Wang H. New Decidability Results Concerning Two-Way Counter Machines Siam Journal On Computing. 24: 123-137. DOI: 10.1137/S0097539792240625 |
0.382 |
|
| 1995 |
Ibarra OH, Pong TC, Sohn SM. A note on parsing pattern languages Pattern Recognition Letters. 16: 179-182. DOI: 10.1016/0167-8655(94)00091-G |
0.317 |
|
| 1994 |
Ibarra OH, Tran NQ. On communication-bounded synchronized alternating finite automata Acta Informatica. 31: 315-327. DOI: 10.1007/Bf01178509 |
0.327 |
|
| 1994 |
Ibarra OH, Kim MH. Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube Journal of Parallel and Distributed Computing. 20: 303-316. DOI: 10.1006/Jpdc.1994.1029 |
0.333 |
|
| 1994 |
Ibarra OH, Zheng Q. Some Efficient Algorithms for Permutation Graphs Journal of Algorithms. 16: 453-469. DOI: 10.1006/Jagm.1994.1021 |
0.305 |
|
| 1993 |
Ibarra OH, Jiang T, Tran N, Wang H. On The Equivalence Of Two-Way Pushdown Automata And Counter Machines Over Bounded Languages International Journal of Foundations of Computer Science. 4: 135-146. DOI: 10.1142/S0129054193000092 |
0.373 |
|
| 1993 |
Ibarra OH, Trân NQ. Synchronized finite automata and 2DFA reductions Theoretical Computer Science. 115: 261-275. DOI: 10.1016/0304-3975(93)90119-E |
0.305 |
|
| 1992 |
Ibarra OH, Wang H, Jiang T. String Editing on a One-Way Linear Array of Finite-State Machines Ieee Transactions On Computers. 41: 112-118. DOI: 10.1109/12.123389 |
0.348 |
|
| 1992 |
Ibarra OH, Jiang T, Wang H. A characterization of exponential-time languages by alternating context-free grammars Theoretical Computer Science. 99: 301-313. DOI: 10.1016/0304-3975(92)90355-J |
0.345 |
|
| 1991 |
Ibarra OH, Jiang T. The power of alternating one-reversal counters and stacks Siam Journal On Computing. 20: 278-290. DOI: 10.1137/0220018 |
0.343 |
|
| 1991 |
Ibarra OH, Pong TC, Sohn SM. Parallel Recognition and Parsing on the Hypercube Ieee Transactions On Computers. 40: 764-770. DOI: 10.1109/12.90253 |
0.35 |
|
| 1991 |
Ibarra OH, Jiang T, Chang JH, Ravikumar B. Some classes of languages in NC1 Information and Computation. 90: 86-106. DOI: 10.1016/0890-5401(91)90061-6 |
0.316 |
|
| 1991 |
Ibarra OH, Jiang T, Wang H. Parallel parsing on a one-way linear array of finite-state machines Theoretical Computer Science. 85: 53-74. DOI: 10.1016/0304-3975(91)90047-6 |
0.384 |
|
| 1990 |
Ibarra OH, Pong TC, Sohn SM. String Processing on the Hypercube Ieee Transactions On Acoustics, Speech, and Signal Processing. 38: 160-164. DOI: 10.1109/29.45630 |
0.31 |
|
| 1990 |
Ibarra OH, Palis MA. An efficient all-parses systolic algorithm for general context-free parsing International Journal of Parallel Programming. 19: 295-331. DOI: 10.1007/Bf01379361 |
0.31 |
|
| 1990 |
Ibarra OH, Jiang T, Chang JH, Palis MA. Systolic algorithms for some scheduling and graph problems Journal of Vlsi Signal Processing. 1: 307-320. DOI: 10.1007/Bf00929924 |
0.302 |
|
| 1989 |
Ravikumar B, Ibarra OH. Relating the type of ambiguity of finite automata to the succinctness of their representation Siam Journal On Computing. 18: 1263-1282. DOI: 10.1137/0218083 |
0.366 |
|
| 1989 |
Ibarra OH, Jiang T, Chang JH. On iterative and cellular tree arrays Journal of Computer and System Sciences. 38: 452-473. DOI: 10.1016/0022-0000(89)90011-1 |
0.377 |
|
| 1988 |
Chang JH, Ibarra OH, Pong TC, Sohn SM. Two-Dimensional Convolution on a Pyramid Computer Ieee Transactions On Pattern Analysis and Machine Intelligence. 10: 590-593. DOI: 10.1109/34.3920 |
0.3 |
|
| 1988 |
Chan T, Ibarra OH. On the finite-valuedness problem for sequential machines Theoretical Computer Science. 23: 95-101. DOI: 10.1016/0304-3975(88)90012-6 |
0.339 |
|
| 1987 |
Ibarra OH, Jiang T. On one-way cellular arrays Siam Journal On Computing. 16: 1135-1154. DOI: 10.1137/0216072 |
0.325 |
|
| 1987 |
Chang JH, Ibarra OH, Palis MA. Parallel Parsing on a One-Way Array of Finite-State Machines Ieee Transactions On Computers. 36: 64-75. DOI: 10.1109/Tc.1987.5009449 |
0.354 |
|
| 1987 |
Ibarra O, Palis M. VLSI algorithms for solving recurrence equations and applications Ieee Transactions On Acoustics, Speech, and Signal Processing. 35: 1046-1064. DOI: 10.1109/Tassp.1987.1165233 |
0.316 |
|
| 1987 |
Chang JH, Ibarra OH, Ravikumar B, Berman L. Some observations concerning alternating Turing machines using small space Information Processing Letters. 25: 1-9. DOI: 10.1016/0020-0190(87)90085-8 |
0.312 |
|
| 1986 |
Ibarra OH, Kim SM, Palis MA. Designing Systolic Algorithms Using Sequential Machines Ieee Transactions On Computers. 35: 531-542. DOI: 10.1109/Tc.1986.5009430 |
0.33 |
|
| 1986 |
Culik K, Yu S, Ibarra OH. Iterative tree arrays with logarithmic depth International Journal of Computer Mathematics. 20: 187-204. DOI: 10.1080/00207168608803543 |
0.306 |
|
| 1986 |
Ibarra OH, Kim SM, Rosier LE. Characterizations of multihead finite automata Information & Computation. 67: 114-125. DOI: 10.1016/S0019-9958(85)80029-2 |
0.325 |
|
| 1985 |
Ibarra OH, Kim SM, Moran S. Sequential Machine Characterizations of Trellis and Cellular Automata and Applications Siam Journal On Computing. 14: 426-447. DOI: 10.1137/0214033 |
0.353 |
|
| 1985 |
Ibarra OH, Moran S. Some independence results in complexity theory International Journal of Computer Mathematics. 17: 113-122. DOI: 10.1080/00207168508803454 |
0.301 |
|
| 1985 |
Ibarra OH, Rosier LE. The equivalence problem and correctness formulas for a simple class of programs Information & Computation. 65: 18-41. DOI: 10.1016/S0019-9958(85)80018-8 |
0.33 |
|
| 1985 |
Ibarra OH, Palis MA, Chang JH. On efficient recognition of transductions and relations Theoretical Computer Science. 39: 89-106. DOI: 10.1016/0304-3975(85)90132-X |
0.345 |
|
| 1984 |
Ibarra OH, Kim SM. Characterizations and computational complexity of systolic trellis automata Theoretical Computer Science. 29: 123-153. DOI: 10.1016/0304-3975(84)90015-X |
0.318 |
|
| 1984 |
Ibarra OH, Kim SM. A characterization of systolic binary tree automata and applications Acta Informatica. 21: 193-207. DOI: 10.1007/Bf00289240 |
0.335 |
|
| 1983 |
Ibarra OH, Moran S. Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs Journal of the Acm. 30: 217-228. DOI: 10.1145/322358.322373 |
0.314 |
|
| 1983 |
Chan T, Ibarra OH. On the Space and Time Complexity of Functions Computable by Simple Programs Siam Journal On Computing. 12: 708-716. DOI: 10.1137/0212048 |
0.316 |
|
| 1983 |
Ibarra OH, Rosier LE. Simple programming languages and restricted classes of turing machines Theoretical Computer Science. 26: 197-220. DOI: 10.1016/0304-3975(83)90085-3 |
0.336 |
|
| 1983 |
Ibarra OH. On some decision questions concerning pushdown machines Theoretical Computer Science. 24: 313-322. DOI: 10.1016/0304-3975(83)90006-3 |
0.347 |
|
| 1982 |
Ibarra OH. 2DST mappings on languages and related problems Theoretical Computer Science. 19: 219-227. DOI: 10.1016/0304-3975(82)90061-5 |
0.307 |
|
| 1982 |
Ibarra OH, Leininger BS, Moran S. On the complexity of simple arithmetic expressions Theoretical Computer Science. 19: 17-28. DOI: 10.1016/0304-3975(82)90012-3 |
0.321 |
|
| 1982 |
Ibarra OH, Moran S, Hui R. A generalization of the fast LUP matrix decomposition algorithm and applications Journal of Algorithms. 3: 45-56. DOI: 10.1016/0196-6774(82)90007-4 |
0.302 |
|
| 1981 |
Gurari EM, Ibarra OH. The complexity of the equivalence problem for two characterizations of presburger sets Theoretical Computer Science. 13: 295-314. DOI: 10.1016/S0304-3975(81)80003-5 |
0.372 |
|
| 1981 |
Gurari EM, Ibarra OH. The complexity of decision problems for finite-turn multicounter machines Journal of Computer and System Sciences. 22: 220-229. DOI: 10.1016/0022-0000(81)90028-3 |
0.349 |
|
| 1981 |
Gurari EM, Ibarra OH. Semi)alternating stack automata Theory of Computing Systems \/ Mathematical Systems Theory. 15: 211-224. DOI: 10.1007/Bf01786980 |
0.318 |
|
| 1981 |
Ibarra OH, Rosier LE. On restricted one-counter machines Theory of Computing Systems \/ Mathematical Systems Theory. 14: 241-245. DOI: 10.1007/Bf01752400 |
0.35 |
|
| 1980 |
Gurari EM, Ibarra OH. Path Systems: Constructions, Solutions and Applications Siam Journal On Computing. 9: 348-374. DOI: 10.1137/0209029 |
0.365 |
|
| 1979 |
Gurari EM, Ibarra OH. Some decision problems concerning sequential transducers and checking automata Journal of Computer and System Sciences. 18: 18-34. DOI: 10.1016/0022-0000(79)90049-7 |
0.313 |
|
| 1979 |
Gurari EM, Ibarra OH. Simple counter machines and number-theoretic problems Journal of Computer and System Sciences. 19: 145-162. DOI: 10.1016/0022-0000(79)90025-4 |
0.359 |
|
| 1979 |
Ibarra OH. Restricted One-Counter Machines with Undecidable Universe Problems* Theory of Computing Systems \/ Mathematical Systems Theory. 13: 181-186. DOI: 10.1007/Bf01744294 |
0.322 |
|
| 1978 |
Ibarra OH. The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications Siam Journal On Computing. 7: 524-532. DOI: 10.1137/0207042 |
0.336 |
|
| 1978 |
Ibarra OH. On two-way sequential transductions of full semi-AFL's☆ Theoretical Computer Science. 7: 287-309. DOI: 10.1016/0304-3975(78)90019-1 |
0.362 |
|
| 1977 |
Ibarra OH, Kim CE. Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors Journal of the Acm. 24: 280-289. DOI: 10.1145/322003.322011 |
0.312 |
|
| 1976 |
Ibarra OH, Kim CE. A useful device for showing the solvability of some decision problems Journal of Computer and System Sciences. 13: 153-160. DOI: 10.1016/S0022-0000(76)80026-8 |
0.31 |
|
| 1976 |
Ibarra OH, Sahni SK, Kim CE. Finite automata with multiplication Theoretical Computer Science. 2: 271-294. DOI: 10.1016/0304-3975(76)90081-5 |
0.367 |
|
| 1975 |
Ibarra OH, Sahni SK. Hierarchies of turing machines with restricted tape alphabet size Journal of Computer and System Sciences. 11: 56-67. DOI: 10.1016/S0022-0000(75)80049-3 |
0.308 |
|
| 1974 |
Ibarra OH. A Hierarchy Theorem for Polynomial-Space Recognition Siam Journal On Computing. 3: 184-187. DOI: 10.1137/0203014 |
0.312 |
|
| 1973 |
Ibarra OH. Controlled pushdown automata Information Sciences. 6: 327-342. DOI: 10.1016/0020-0255(73)90047-9 |
0.312 |
|
| 1971 |
Ibarra OH. Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata Journal of Computer and System Sciences. 5: 88-117. DOI: 10.1016/S0022-0000(71)80029-6 |
0.315 |
|
| 1970 |
Book RV, Greibach SA, Ibarra OH, Wegbreit B. Tape-bounded turing acceptors and principal AFLs Journal of Computer and System Sciences. 4: 622-625. DOI: 10.1016/S0022-0000(70)80032-0 |
0.329 |
|
| 1970 |
Ibarra OH. Simple matrix languages Information & Computation. 17: 359-394. DOI: 10.1016/S0019-9958(70)80034-1 |
0.317 |
|
| 1968 |
Harrison MA, Ibarra OH. Multi-tape and multi-head pushdown automata Information & Computation. 13: 433-470. DOI: 10.1016/S0019-9958(68)90901-7 |
0.31 |
|
| Show low-probability matches. |