Two-Way Pushdown Automata - Jim Gray 001; Michael A. Harrison; Oscar H. Ibarra (Inf. Control., 1967)

On the Equivalence of Finite-State Sequential Machine Models. - Oscar H. Ibarra (IEEE Trans. Electron. Comput., 1967)

Multi-Tape and Multi-Head Pushdown Automata - Michael A. Harrison; Oscar H. Ibarra (Inf. Control., 1968)

Tape-Bounded Turing Acceptors and Principal AFLs. - Ronald V. Book; Sheila A. Greibach; Oscar H. Ibarra; Ben Wegbreit (J. Comput. Syst. Sci., 1970)

Simple Matrix Languages - Oscar H. Ibarra (Inf. Control., 1970)

Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata. - Oscar H. Ibarra (J. Comput. Syst. Sci., 1971)

Characterizations of Transductions Defined by Abstract Families of Transducers. - Oscar H. Ibarra (Math. Syst. Theory, 1971)

A Note Concerning Nondeterministic Tape Complexities. - Oscar H. Ibarra (J. ACM, 1972)

Controlled pushdown automata. - Oscar H. Ibarra (Inf. Sci., 1973)

On Two-way Multihead Automata. - Oscar H. Ibarra (J. Comput. Syst. Sci., 1973)

On 3-Head Versus 2-Head Finite Automata. - Oscar H. Ibarra; Chul E. Kim (Acta Informatica, 1974)

A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata. - Oscar H. Ibarra (Inf. Process. Lett., 1974)

A Hierarchy Theorem for Polynomial-Space Recognition. - Oscar H. Ibarra (SIAM J. Comput., 1974)

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems. - Oscar H. Ibarra; Chul E. Kim (J. ACM, 1975)

Hierarchies of Turing Machines with Restricted Tape Alphabet Size. - Oscar H. Ibarra; Sartaj Sahni (J. Comput. Syst. Sci., 1975)

Polynomially Complete Fault Detection Problems. - Oscar H. Ibarra; Sartaj Sahni (IEEE Trans. Computers, 1975)

A Useful Device for Showing the Solvability of Some Decision Problems. - Oscar H. Ibarra; Chul E. Kim (J. Comput. Syst. Sci., 1976)

Finite Automata with Multiplication. - Oscar H. Ibarra; Sartaj Sahni; Chul E. Kim (Theor. Comput. Sci., 1976)

Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors. - Oscar H. Ibarra; Chul E. Kim (J. ACM, 1977)

Bounds for LPT Schedules on Uniform Processors. - Teofilo F. Gonzalez; Oscar H. Ibarra; Sartaj Sahni (SIAM J. Comput., 1977)

Reversal-Bounded Multicounter Machines and Their Decision Problems. - Oscar H. Ibarra (J. ACM, 1978)

Approximation Algorithms for Certain Scheduling Problems. - Oscar H. Ibarra; Chul E. Kim (Math. Oper. Res., 1978)

The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications. - Oscar H. Ibarra (SIAM J. Comput., 1978)

On Two-Way Sequential Transductions of Full Semi-AFL's. - Oscar H. Ibarra (Theor. Comput. Sci., 1978)

The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs - Eitan M. Gurari; Oscar H. Ibarra (STOC, 1979)

On the Space Complexity of Recursive Algorithms. - Eitan M. Gurari; Oscar H. Ibarra (Inf. Process. Lett., 1979)

An NP-Complete Number-Theoretic Problem. - Eitan M. Gurari; Oscar H. Ibarra (J. ACM, 1979)

Some Decision Problems Concerning Sequential Transducers and Checking Automata. - Eitan M. Gurari; Oscar H. Ibarra (J. Comput. Syst. Sci., 1979)

Simple Counter Machines and Number-Theoretic Problems. - Eitan M. Gurari; Oscar H. Ibarra (J. Comput. Syst. Sci., 1979)

Restricted One-Counter Machines with Undecidable Universe Problems. - Oscar H. Ibarra (Math. Syst. Theory, 1979)

The Complexity of the Equivalence Problem for Straight-Line Programs - Oscar H. Ibarra; Brian S. Leininger (STOC, 1980)

A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. - Oscar H. Ibarra; Shlomo Moran; Louis E. Rosier (Inf. Process. Lett., 1980)

Path Systems: Constructions, Solutions and Applications. - Eitan M. Gurari; Oscar H. Ibarra (SIAM J. Comput., 1980)

Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication. - Oscar H. Ibarra; Shlomo Moran (Inf. Process. Lett., 1981)

Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems. - Oscar H. Ibarra; Shlomo Moran; Louis E. Rosier (Inf. Process. Lett., 1981)

On the Decidability of Equivalence for Deterministic Pushdown Transducers. - Oscar H. Ibarra; Louis E. Rosier (Inf. Process. Lett., 1981)

The Complexity of the Equivalence Problem for Simple Programs. - Eitan M. Gurari; Oscar H. Ibarra (J. ACM, 1981)

The Complexity of Decision Problems for Finite-Turn Multicounter Machines. - Eitan M. Gurari; Oscar H. Ibarra (J. Comput. Syst. Sci., 1981)

On Restricted One-counter Machines. - Oscar H. Ibarra; Louis E. Rosier (Math. Syst. Theory, 1981)

Characterizations of Presburger Functions. - Oscar H. Ibarra; Brian S. Leininger (SIAM J. Comput., 1981)

The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets. - Eitan M. Gurari; Oscar H. Ibarra (Theor. Comput. Sci., 1981)

Two-Way Counter Machines and Diophantine Equations. - Eitan M. Gurari; Oscar H. Ibarra (J. ACM, 1982)

A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications. - Oscar H. Ibarra; Shlomo Moran; Roger Hui (J. Algorithms, 1982)

On Some Decision Problems for RAM Programs. - Oscar H. Ibarra; Shlomo Moran (J. Comput. Syst. Sci., 1982)

(Semi)Alternating Stack Automata. - Eitan M. Gurari; Oscar H. Ibarra (Math. Syst. Theory, 1982)

Straight-Line Programs with One Input Variable. - Oscar H. Ibarra; Brian S. Leininger (SIAM J. Comput., 1982)

The Complexity of the Equivalence Problem for Simple Loop-Free Programs. - Oscar H. Ibarra; Brian S. Leininger (SIAM J. Comput., 1982)

Some Simplified Undecidable and NP-Hard Problems for Simple Programs. - Eitan M. Gurari; Oscar H. Ibarra (Theor. Comput. Sci., 1982)

2DST Mapppings on Languages and Related Problems. - Oscar H. Ibarra (Theor. Comput. Sci., 1982)

On the Complexity of Simple Arithmetic Expressions. - Oscar H. Ibarra; Brian S. Leininger; Shlomo Moran (Theor. Comput. Sci., 1982)

On the Zero-Inequivalence Problem for Loop Programs. - Oscar H. Ibarra; Brian S. Leininger (J. Comput. Syst. Sci., 1983)

A Note on Finitely-Valued and Finitely Ambiguous Transducers. - Eitan M. Gurari; Oscar H. Ibarra (Math. Syst. Theory, 1983)

On the Space and Time Complexity of Functions Computable by Simple Programs. - Tat-hung Chan; Oscar H. Ibarra (SIAM J. Comput., 1983)

Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's. - Oscar H. Ibarra; Shlomo Moran (SIAM J. Comput., 1983)

On the Finite-Valuedness Problem for Sequential Machines. - Tat-hung Chan; Oscar H. Ibarra (Theor. Comput. Sci., 1983)

On Some Decision Questions Concerning Pushdown Machines. - Oscar H. Ibarra (Theor. Comput. Sci., 1983)

On the Control Power of Integer Division. - Oscar H. Ibarra; Shlomo Moran; Louis E. Rosier (Theor. Comput. Sci., 1983)

Simple Programming Languages and Restricted Classes of Turing Machines. - Oscar H. Ibarra; Louis E. Rosier (Theor. Comput. Sci., 1983)

Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs - Oscar H. Ibarra; Shlomo Moran (J. ACM, 1983)

On the Simplification and Equivalence Problems for Straight-Line Programs - Oscar H. Ibarra; Brian S. Leininger (J. ACM, 1983)

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs. - Oscar H. Ibarra; Sam M. Kim; Louis E. Rosier (ICALP, 1984)

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract). - Oscar H. Ibarra; Louis E. Rosier (MFCS, 1984)

A Characterization of Systolic Binary Tree Automata and Applications. - Oscar H. Ibarra; Sam M. Kim (Acta Informatica, 1984)

A Note on the Complexity of Program Evaluation. - Oscar H. Ibarra; Brian S. Leininger; Louis E. Rosier (Math. Syst. Theory, 1984)

Characterizations and Computational Complexity of Systolic Trellis Automata. - Oscar H. Ibarra; Sam M. Kim (Theor. Comput. Sci., 1984)

Some Characterizations of Multihead Finite Automata - Oscar H. Ibarra; Sam M. Kim; Louis E. Rosier (Inf. Control., 1985)

On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's - Oscar H. Ibarra; Sam M. Kim; Louis E. Rosier (Inf. Control., 1985)

Some results concerning linear iterative (systolic) arrays. - Oscar H. Ibarra; Michael A. Palis; Sam M. Kim (J. Parallel Distributed Comput., 1985)

Sequential Machine Characterizations of Trellis and Cellular Automata and Applications. - Oscar H. Ibarra; Sam M. Kim; Shlomo Moran (SIAM J. Comput., 1985)

On Efficient Recognition of Transductions and Relations. - Oscar H. Ibarra; Michael A. Palis; Jik H. Chang (Theor. Comput. Sci., 1985)

Fast Parallel Language Recognition by Cellular Automata. - Oscar H. Ibarra; Michael A. Palis; Sam M. Kim (Theor. Comput. Sci., 1985)

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs - Oscar H. Ibarra; Louis E. Rosier (Inf. Control., 1985)

On Simple Programs with Primitive Conditional Statements - Oscar H. Ibarra; Louis E. Rosier (Inf. Control., 1985)

Systolic Arrays: Characterizations and Complexity. - Oscar H. Ibarra (MFCS, 1986)

On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. - Oscar H. Ibarra; Bala Ravikumar (STACS, 1986)

Designing Systolic Algorithms Using Sequential Machines. - Oscar H. Ibarra; Sam M. Kim; Michael A. Palis (IEEE Trans. Computers, 1986)

On Pebble Automata. - Jik H. Chang; Oscar H. Ibarra; Michael A. Palis; Bala Ravikumar (Theor. Comput. Sci., 1986)

Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. - Oscar H. Ibarra; Bala Ravikumar (FSTTCS, 1987)

On the Computing Power of One-Way Cellular Arrays. - Oscar H. Ibarra; Tao Jiang 001 (ICALP, 1987)

Some Observations Concerning Alternating Turing Machines Using Small Space. - Jik H. Chang; Oscar H. Ibarra; Bala Ravikumar; Leonard Berman (Inf. Process. Lett., 1987)

On One-Way Cellular Arrays. - Oscar H. Ibarra; Tao Jiang 001 (SIAM J. Comput., 1987)

On Efficient Simulations of Systolic Arrays of Random-Access Machines. - Oscar H. Ibarra; Michael A. Palis (SIAM J. Comput., 1987)

Parallel Parsing on a One-Way Array of Finite-State Machines. - Jik H. Chang; Oscar H. Ibarra; Michael A. Palis (IEEE Trans. Computers, 1987)

Single-Row Routing with Crossover Bound. - David Hung-Chang Du; Oscar H. Ibarra; J. Fernando Naveda (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987)

VLSI algorithms for solving recurrence equations and applications. - Oscar H. Ibarra; Michael A. Palis (IEEE Trans. Acoust. Speech Signal Process., 1987)

On Some Languages in NC. - Oscar H. Ibarra; Tao Jiang 001; Bala Ravikumar; Jik H. Chang (AWOC, 1988)

Trading reversals for alternation. - Oscar H. Ibarra; Tao Jiang 001 (SCT, 1988)

Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's. - Jik H. Chang; Oscar H. Ibarra; Michael A. Palis (ICALP, 1988)

Some Subclasses of Context-Free Languages In NC1. - Oscar H. Ibarra; Tao Jiang 001; Bala Ravikumar (Inf. Process. Lett., 1988)

On the power of one-way communication. - Jik H. Chang; Oscar H. Ibarra; Anastasios Vergis (J. ACM, 1988)

Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties. - Oscar H. Ibarra; Bala Ravikumar (Math. Syst. Theory, 1988)

Two-Dimensional Convolution on a Pyramid Computer. - Jik H. Chang; Oscar H. Ibarra; Ting-Chuen Pong; Stephen M. Sohn (IEEE Trans. Pattern Anal. Mach. Intell., 1988)

Systolic Tree Implementation of Data Structures. - Jik H. Chang; Oscar H. Ibarra; Moon-Jung Chung; Kotesh K. Rao (IEEE Trans. Computers, 1988)

On Two-Dimensional Via Assignment for Single-Row Routing. - David Hung-Chang Du; Oscar H. Ibarra; J. Fernando Naveda (IEEE Trans. Computers, 1988)

Relating the Power of Cellular Arrays to Their Closure Properties. - Oscar H. Ibarra; Tao Jiang 001 (Theor. Comput. Sci., 1988)

Two-Dimensional Iterative Arrays: Characterizations and Applications. - Oscar H. Ibarra; Michael A. Palis (Theor. Comput. Sci., 1988)

Parallel Parsing on a One-way Linear Array of Finite-State Machines. - Oscar H. Ibarra; Tao Jiang 001; Hui Wang 008 (FSTTCS, 1989)

Optimal Simulation of Tree Arrays by Linear Arrays. - Oscar H. Ibarra; Tao Jiang 001 (Inf. Process. Lett., 1989)

On Iterative and Cellular Tree Arrays. - Oscar H. Ibarra; Tao Jiang 001; Jik H. Chang (J. Comput. Syst. Sci., 1989)

Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation. - Bala Ravikumar; Oscar H. Ibarra (SIAM J. Comput., 1989)

Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATMs and Space-Bounded TMs. - Jik H. Chang; Oscar H. Ibarra; Michael A. Palis (Theor. Comput. Sci., 1989)

Iterative Algorithms for Planar Convex Hull on Mesh-Connected Arrays. - J. Andrew Holey; Oscar H. Ibarra (ICPP (3), 1990)

Efficient parallel algorithms for solving set recurrence equations and applications. - Oscar H. Ibarra; Hui Wang 008; Tao Jiang 001 (SPDP, 1990)

An efficient all-parses systolic algorithm for general context-free parsing. - Oscar H. Ibarra; Michael A. Palis (Int. J. Parallel Program., 1990)

On Mapping Systolic Algorithms onto the Hypercube. - Oscar H. Ibarra; Stephen M. Sohn (IEEE Trans. Parallel Distributed Syst., 1990)

String processing on the hypercube. - Oscar H. Ibarra; Ting-Chuen Pong; Stephen M. Sohn (IEEE Trans. Acoust. Speech Signal Process., 1990)

Systolic algorithms for some scheduling and graph problems. - Oscar H. Ibarra; Tao Jiang 001; Jik H. Chang; Michael A. Palis (J. VLSI Signal Process., 1990)

Triangulation Voronoi Diagram and Convex Hull in k-Space on Mesh-Connected Arrays and Hypercubes. - J. Andrew Holey; Oscar H. Ibarra (ICPP (3), 1991)

Triangulation in a Plane and 3-D Convex Hull on Mesh-Connected Arrays and Hypercubes. - J. Andrew Holey; Oscar H. Ibarra (IPPS, 1991)

On Resetiting DLBA's. - Oscar H. Ibarra (Bull. EATCS, 1991)

Learning Regular Languages from Counterexamples. - Oscar H. Ibarra; Tao Jiang 001 (J. Comput. Syst. Sci., 1991)

The Power of Alternating One-Reversal Counters and Stacks. - Oscar H. Ibarra; Tao Jiang 001 (SIAM J. Comput., 1991)

On resetting DLBA's. - Oscar H. Ibarra (SIGACT News, 1991)

Parallel Regognition and Parsing on the Hypercube. - Oscar H. Ibarra; Ting-Chuen Pong; Stephen M. Sohn (IEEE Trans. Computers, 1991)

Parallel Parsing on a One-Way Linear Array of Finite-State Machines. - Oscar H. Ibarra; Hui Wang 008 (Theor. Comput. Sci., 1991)

Some Classes of Languages in NC¹ - Oscar H. Ibarra; Tao Jiang 001; Jik H. Chang; Bala Ravikumar (Inf. Comput., 1991)

New Results Concerning Synchronized Finite Automata. - Oscar H. Ibarra; Nicholas Q. Trân (ICALP, 1992)

A hierarchy result for 2-dimensional TM's operating in small space. - Tao Jiang 001; Oscar H. Ibarra; Hui Wang 008; Qi Zheng 001 (Inf. Sci., 1992)

Iterative algorithms for the planar convex hull problem on mesh-connected arrays. - J. Andrew Holey; Oscar H. Ibarra (Parallel Comput., 1992)

String Editing on a One-Way Linear Array of Finite-State Machines. - Oscar H. Ibarra; Tao Jiang 001; Hui Wang 008 (IEEE Trans. Computers, 1992)

A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars. - Oscar H. Ibarra; Tao Jiang 001; Hui Wang 008 (Theor. Comput. Sci., 1992)

On Space-Bounded Synchronized Alternating Turing Machines. - Oscar H. Ibarra; Nicholas Q. Trân (Theor. Comput. Sci., 1992)

New Decidability Results Concerning Two-way Counter Machines and Applications. - Oscar H. Ibarra; Tao Jiang 001; Nicholas Q. Trân; Hui Wang 008 (ICALP, 1993)

Finding Articulation Points and Bridges of Permutation Graphs. - Oscar H. Ibarra; Qi Zheng 001 (ICPP (3), 1993)

On the Shortest Path Problems for Permutation Graphs. - Oscar H. Ibarra; Qi Zheng 001 (IPPS, 1993)

On the Communication Complexity of Parallel Computation. - Oscar H. Ibarra; Nicholas Q. Trân (MFCS, 1993)

On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages. - Oscar H. Ibarra; Tao Jiang 001; Nicholas Q. Trân; Hui Wang 008 (Int. J. Found. Comput. Sci., 1993)

On Efficient Parallel Algorithms for Solving Set Recurrence Equations. - Oscar H. Ibarra; Hui Wang 008; Tao Jiang 001 (J. Algorithms, 1993)

Quadtree Building Algorithms on an SIMD Hypercube. - Oscar H. Ibarra; Myung Hee Kim (J. Parallel Distributed Comput., 1993)

A Note on Simple Programs with Two Variables. - Oscar H. Ibarra; Nicholas Q. Trân (Theor. Comput. Sci., 1993)

Synchronized Finite Automata and 2DFA Reductions. - Oscar H. Ibarra; Nicholas Q. Trân (Theor. Comput. Sci., 1993)

On Some Open Problems Concerning the Complexity of Cellular Arrays. - Oscar H. Ibarra; Tao Jiang 001 (Results and Trends in Theoretical Computer Science, 1994)

A flow based approach to the pin redistribution problem for multi-chip modules. - Douglas Chang; Teofilo F. Gonzalez; Oscar H. Ibarra (Great Lakes Symposium on VLSI, 1994)

Transformations Between Boundary Codes, Run Length Codes, and Linear Quadtrees. - Myung Hee Kim; Oscar H. Ibarra (IPPS, 1994)

On the Parallel Complexity of Solving Recurrence Equations. - Oscar H. Ibarra; Nicholas Q. Trân (ISAAC, 1994)

On Communication-Bounded Synchronized Alternating Finite Automata. - Oscar H. Ibarra; Nicholas Q. Trân (Acta Informatica, 1994)

Some Efficient Algorithms for Permutation Graphs. - Oscar H. Ibarra; Qi Zheng 001 (J. Algorithms, 1994)

Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube. - Oscar H. Ibarra; Myung Hee Kim (J. Parallel Distributed Comput., 1994)

Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata. - Tao Jiang 001; Oscar H. Ibarra; Hui Wang 008 (Theor. Comput. Sci., 1994)

On symbolic scheduling and parallel complexity of loops. - Tao Yang 009; Oscar H. Ibarra (SPDP, 1995)

An Optimal Shortest Path Parallel Algorithm for Permutation Graphs. - Oscar H. Ibarra; Qi Zheng 001 (J. Parallel Distributed Comput., 1995)

A note on parsing pattern languages. - Oscar H. Ibarra; Ting-Chuen Pong; Stephen M. Sohn (Pattern Recognit. Lett., 1995)

New Decidability Results Concerning Two-Way Counter Machines. - Oscar H. Ibarra; Tao Jiang 001; Nicholas Q. Trân; Hui Wang 008 (SIAM J. Comput., 1995)

Scalability Issues for High Performance Digital Libraries on the World Wide Web. - Daniel Andresen; Tao Yang 009; Ömer Egecioglu; Oscar H. Ibarra; Terence R. Smith (ADL, 1996)

Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval. - Athanassios S. Poulakidas; Ashok Srinivasan; Ömer Egecioglu; Oscar H. Ibarra; Tao Yang 009 (Data Compression Conference, 1996)

SWEB: Towards a Scalable World Wide Web Server on Multicomputers. - Daniel Andresen; Tao Yang 009; Vegard Holmedahl; Oscar H. Ibarra (IPPS, 1996)

Performance Prediction in Symbolic Scheduling of Partitioned Programs with Weight Variation. - Tao Yang 009; Oscar H. Ibarra (J. Parallel Distributed Comput., 1996)

A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval. - Athanassios S. Poulakidas; Ashok Srinivasan; Ömer Egecioglu; Oscar H. Ibarra; Tao Yang 009 (COCOON, 1997)

On the Containment and Equivalence of Database Queries with Linear Constraints. - Oscar H. Ibarra; Jianwen Su (PODS, 1997)

On the Complexity of Commutativity Analysis. - Oscar H. Ibarra; Pedro C. Diniz; Martin C. Rinard (Int. J. Found. Comput. Sci., 1997)

Toward a Scalable Distributed {WWW} Server on Workstation Clusters. - Daniel Andresen; Tao Yang 009; Oscar H. Ibarra (J. Parallel Distributed Comput., 1997)

Parallel Progressive Radiosity with Adaptive Meshing. - Yizhou Yu; Oscar H. Ibarra; Tao Yang 009 (J. Parallel Distributed Comput., 1997)

On the Parallel Complexity of Loops. - Oscar H. Ibarra; Nicholas Q. Trân; Tao Yang 009 (Theor. Comput. Sci., 1997)

Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance. - Daniel Andresen; Tao Yang 009; Oscar H. Ibarra; Ömer Egecioglu (J. Parallel Distributed Comput., 1998)

Counter Machines: Decision Problems and Applications. - Oscar H. Ibarra; Jianwen Su (Jewels are Forever, 1999)

An Index Structure for Spatial Joins in Linear Constraint Databases. - Hongjun Zhu; Jianwen Su; Oscar H. Ibarra (ICDE, 1999)

A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries. - Oscar H. Ibarra; Jianwen Su (J. Comput. Syst. Sci., 1999)

Binary Reachability Analysis of Discrete Pushdown Timed Automata. - Zhe Dang; Oscar H. Ibarra; Tevfik Bultan; Richard A. Kemmerer; Jianwen Su (CAV, 2000)

Reachability Analysis for Some Models of Infinite-State Transition Systems. - Oscar H. Ibarra; Tevfik Bultan; Jianwen Su (CONCUR, 2000)

Workshop on Advances in Parallel and Distributed Computational Models. - Oscar H. Ibarra; Koji Nakano; Stephan Olariu (IPDPS Workshops, 2000)

Conter Machines: Decidable Properties and Applications to Verification Problems. - Oscar H. Ibarra; Jianwen Su; Zhe Dang; Tevfik Bultan; Richard A. Kemmerer (MFCS, 2000)

Toward Spatial Joins for Polygons. - Hongjun Zhu; Jianwen Su; Oscar H. Ibarra (SSDBM, 2000)

Extending Rectangle Join Algorithms for Rectilinear Polygons. - Hongjun Zhu; Jianwen Su; Oscar H. Ibarra (Web-Age Information Management, 2000)

Reachability and Safety in Queue Systems. - Oscar H. Ibarra (CIAA, 2000)

Generalizing the Discrete Timed Automaton. - Oscar H. Ibarra; Jianwen Su (CIAA, 2000)

Adaptive Load Sharing for Clustered Digital Library Servers. - Huican Zhu; Tao Yang 009; Qi Zheng 001; David Watson; Oscar H. Ibarra; Terence R. Smith (Int. J. Digit. Libr., 2000)

Image compression for fast wavelet-based subregion retrieval. - Athanassios S. Poulakidas; Ashok Srinivasan; Ömer Egecioglu; Oscar H. Ibarra; Tao Yang 009 (Theor. Comput. Sci., 2000)

Counter machines and the safety and disjointness problems for database queries with linear constraints. - Oscar H. Ibarra; Jianwen Su; Constantinos Bartzis (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. - Zhe Dang; Oscar H. Ibarra; Richard A. Kemmerer (COCOON, 2001)

Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. - Zhe Dang; Oscar H. Ibarra; Pierluigi San Pietro (FSTTCS, 2001)

Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. - Tero Harju; Oscar H. Ibarra; Juhani Karhumäki; Arto Salomaa (ICALP, 2001)

On Removing the Pushdown Stack in Reachability Constructions. - Oscar H. Ibarra; Zhe Dang (ISAAC, 2001)

Moving Objects: Logical Relationships and Queries. - Jianwen Su; Haiyan Xu; Oscar H. Ibarra (SSTD, 2001)

On Multi-way Spatial Joins with Direction Predicates. - Hongjun Zhu; Jianwen Su; Oscar H. Ibarra (SSTD, 2001)

Past Pushdown Timed Automata. - Zhe Dang; Tevfik Bultan; Oscar H. Ibarra; Richard A. Kemmerer (CIAA, 2001)

On Reachability and Safety in Infinite-State Systems. - Oscar H. Ibarra; Tevfik Bultan; Jianwen Su (Int. J. Found. Comput. Sci., 2001)

Trajectory queries and octagons in moving object databases. - Hongjun Zhu; Jianwen Su; Oscar H. Ibarra (CIKM, 2002)

Safety Verification for Two-Way Finite Automata with Monotonic Counters. - Oscar H. Ibarra; Zhe Dang; Zhi-Wei Sun (Developments in Language Theory, 2002)

Workshop Introduction. - Oscar H. Ibarra; Stephan Olariu; Koji Nakano; Jie Wu 001 (IPDPS, 2002)

On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. - Zhe Dang; Oscar H. Ibarra; Zhi-Wei Sun (ISAAC, 2002)

On Moving Object Queries. - Hoda M. O. Mokhtar; Jianwen Su; Oscar H. Ibarra (PODS, 2002)

The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications. - Zhe Dang; Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2002)

Verification in Queue-Connected Multicounter Machines. - Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2002)

Some Decision Problems Concerning Semilinearity and Commutation. - Tero Harju; Oscar H. Ibarra; Juhani Karhumäki; Arto Salomaa (J. Comput. Syst. Sci., 2002)

Augmenting the discrete timed automaton with other data structures. - Oscar H. Ibarra; Jianwen Su (Theor. Comput. Sci., 2002)

Counter Machines and Verification Problems. - Oscar H. Ibarra; Jianwen Su; Zhe Dang; Tevfik Bultan; Richard A. Kemmerer (Theor. Comput. Sci., 2002)

Dense Counter Machines and Verification Problems. - Gaoyan Xie; Zhe Dang; Oscar H. Ibarra; Pierluigi San Pietro (CAV, 2003)

A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems. - Gaoyan Xie; Zhe Dang; Oscar H. Ibarra (ICALP, 2003)

The Number of Membranes Matters. - Oscar H. Ibarra (Workshop on Membrane Computing, 2003)

Characterizations of Catalytic Membrane Computing Systems. - Oscar H. Ibarra; Zhe Dang; Ömer Egecioglu; Gaurav Saxena (MFCS, 2003)

The LD and DLAD Bio-Operations on Formal Languages. - Mark Daley; Oscar H. Ibarra; Lila Kari; Ian McQuillan; Koji Nakano (J. Autom. Lang. Comb., 2003)

Closure and decidability properties of some language classes with respect to ciliate bio-operations. - Mark Daley; Oscar H. Ibarra; Lila Kari (Theor. Comput. Sci., 2003)

Generalized discrete timed automata: decidable approximations for safety verificatio. - Zhe Dang; Oscar H. Ibarra; Richard A. Kemmerer (Theor. Comput. Sci., 2003)

Eliminating the storage tape in reachability constructions. - Oscar H. Ibarra; Zhe Dang (Theor. Comput. Sci., 2003)

Verification in loosely synchronous queue-connected discrete timed automata. - Oscar H. Ibarra; Zhe Dang; Pierluigi San Pietro (Theor. Comput. Sci., 2003)

On P Systems Operating in Sequential Mode. - Zhe Dang; Oscar H. Ibarra (DCFS, 2004)

The Power of Maximal Parallelism in P Systems. - Oscar H. Ibarra; Hsu-Chun Yen; Zhe Dang (Developments in Language Theory, 2004)

Real-Counter Automata and Their Decision Problems. - Zhe Dang; Oscar H. Ibarra; Pierluigi San Pietro; Gaoyan Xie (FSTTCS, 2004)

Modeling Affective Responses in Intelligent Tutoring Systems. - Yasmín Pérez; Rafael Gamboa; Oscar H. Ibarra (ICALT, 2004)

Automated composition of e-services: lookaheads. - Cagdas Evren Gerede; Richard Hull 001; Oscar H. Ibarra; Jianwen Su (ICSOC, 2004)

A Matrix q-Analogue of the Parikh Map. - Ömer Egecioglu; Oscar H. Ibarra (IFIP TCS, 2004)

Composability of Infinite-State Activity Automata. - Zhe Dang; Oscar H. Ibarra; Jianwen Su (ISAAC, 2004)

P Systems: Some Recent Results and Research Problems. - Oscar H. Ibarra (UPP, 2004)

Automata-Theoretic Techniques for Analyzing Infinite-State Systems. - Oscar H. Ibarra (CIAA, 2004)

Instance-Specific Solutions For Accelerating The Cky Parsing Of Large Context-Free Grammars. - Jacir Luiz Bordim; Oscar H. Ibarra; Yasuaki Ito; Koji Nakano (Int. J. Found. Comput. Sci., 2004)

Computing And Combinatorics Conference – Cocoon'02. - Oscar H. Ibarra; Louxin Zhang (Int. J. Found. Comput. Sci., 2004)

Past pushdown timed automata and safety verification. - Zhe Dang; Tevfik Bultan; Oscar H. Ibarra; Richard A. Kemmerer (Theor. Comput. Sci., 2004)

On the computational complexity of membrane systems. - Oscar H. Ibarra (Theor. Comput. Sci., 2004)

Editorial. - Oscar H. Ibarra (Theor. Comput. Sci., 2004)

On two-way FA with monotonic counters and quadratic Diophantine equations. - Oscar H. Ibarra; Zhe Dang (Theor. Comput. Sci., 2004)

Catalytic P systems, semilinear sets, and vector addition systems. - Oscar H. Ibarra; Zhe Dang; Ömer Egecioglu (Theor. Comput. Sci., 2004)

Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition. - Cagdas Evren Gerede; Oscar H. Ibarra; Bala Ravikumar; Jianwen Su (IEEE SCC, 2005)

On Sequential and 1-Deterministic P Systems. - Oscar H. Ibarra; Sara Woodworth; Hsu-Chun Yen; Zhe Dang (COCOON, 2005)

Counting Time in Computing with Cells. - Oscar H. Ibarra; Andrei Paun (DNA, 2005)

On Bounded Symport/Antiport P Systems. - Oscar H. Ibarra; Sara Woodworth (DNA, 2005)

Signaling P Systems and Verification Problems. - Cheng Li; Zhe Dang; Oscar H. Ibarra; Hsu-Chun Yen (ICALP, 2005)

SPiDeR: P2P-Based Web Service Discovery. - Ozgur D. Sahin; Cagdas Evren Gerede; Divyakant Agrawal; Amr El Abbadi; Oscar H. Ibarra; Jianwen Su (ICSOC, 2005)

Some Recent Results Concerning Deterministic P Systems. - Oscar H. Ibarra (Workshop on Membrane Computing, 2005)

On Symport/Antiport P Systems and Semilinear Sets. - Oscar H. Ibarra; Sara Woodworth; Hsu-Chun Yen; Zhe Dang (Workshop on Membrane Computing, 2005)

Some Computational Issues in Membrane Computing. - Oscar H. Ibarra (MFCS, 2005)

On Symport/Antiport P Systems with One or Two Symbols. - Oscar H. Ibarra; Sara Woodworth (SYNASC, 2005)

On Model-Checking of P Systems. - Zhe Dang; Oscar H. Ibarra; Cheng Li; Gaoyan Xie (UC, 2005)

On Deterministic Catalytic Systems. - Oscar H. Ibarra; Hsu-Chun Yen (CIAA, 2005)

On one-membrane P systems operating in sequential mode. - Zhe Dang; Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2005)

On various notions of parallelism in P Systems. - Oscar H. Ibarra; Hsu-Chun Yen; Zhe Dang (Int. J. Found. Comput. Sci., 2005)

On two-way nondeterministic finite automata with one reversal-bounded counter. - Zhe Dang; Oscar H. Ibarra; Zhi-Wei Sun (Theor. Comput. Sci., 2005)

On composition and lookahead delegation of e-services modeled by automata, . - Zhe Dang; Oscar H. Ibarra; Jianwen Su (Theor. Comput. Sci., 2005)

On membrane hierarchy in P systems. - Oscar H. Ibarra (Theor. Comput. Sci., 2005)

On determinism versus nondeterminism in P systems. - Oscar H. Ibarra (Theor. Comput. Sci., 2005)

Characterizations of Some Restricted Spiking Neural P Systems. - Oscar H. Ibarra; Sara Woodworth (Workshop on Membrane Computing, 2006)

On the Computational Power of 1-Deterministic and Sequential P Systems. - Oscar H. Ibarra; Sara Woodworth; Hsu-Chun Yen; Zhe Dang (Fundam. Informaticae, 2006)

On symport/antiport P systems with a small number of objects. - Oscar H. Ibarra; Sara Woodworth (Int. J. Comput. Math., 2006)

On the Decidability of Model-Checking for P Systems. - Zhe Dang; Oscar H. Ibarra; Cheng Li; Gaoyan Xie (J. Autom. Lang. Comb., 2006)

Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach. - Oscar H. Ibarra; Bala Ravikumar; Cagdas Evren Gerede (J. Autom. Lang. Comb., 2006)

On the Computational Complexity of P Automata. - Erzsébet Csuhaj-Varjú; Oscar H. Ibarra; György Vaszil (Nat. Comput., 2006)

On the solvability of a class of diophantine equations and applications. - Oscar H. Ibarra; Zhe Dang (Theor. Comput. Sci., 2006)

Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems. - Oscar H. Ibarra; Gheorghe Paun (Theor. Comput. Sci., 2006)

On partially blind multihead finite automata. - Oscar H. Ibarra; Bala Ravikumar (Theor. Comput. Sci., 2006)

Deterministic catalytic systems are not universal. - Oscar H. Ibarra; Hsu-Chun Yen (Theor. Comput. Sci., 2006)

A q-Analogue of the Parikh Matrix Mapping. - Ömer Egecioglu; Oscar H. Ibarra (Formal Models, Languages and Applications, 2007)

Asynchronous Spiking Neural P Systems: Decidability and Undecidability. - Matteo Cavaliere; Ömer Egecioglu; Oscar H. Ibarra; Mihai Ionescu; Gheorghe Paun; Sara Woodworth (DNA, 2007)

Spiking Neural P Systems: Some Characterizations. - Oscar H. Ibarra; Sara Woodworth (FCT, 2007)

Characterizing Regular Languages by Spiking Neural P Systems. - Oscar H. Ibarra; Sara Woodworth (Int. J. Found. Comput. Sci., 2007)

Developments in language theory. - Oscar H. Ibarra (Theor. Comput. Sci., 2007)

Normal forms for spiking neural P systems. - Oscar H. Ibarra; Andrei Paun; Gheorghe Paun; Alfonso Rodríguez-Patón; Petr Sosík; Sara Woodworth (Theor. Comput. Sci., 2007)

Membrane Systems. - Andrei Paun; Oscar H. Ibarra (Handbook of Parallel Computing, 2007)

Sequentiality Induced by Spike Number in SNP Systems. - Oscar H. Ibarra; Andrei Paun; Alfonso Rodríguez-Patón (DNA, 2008)

Symbolic String Verification: An Automata-Based Approach. - Fang Yu 001; Tevfik Bultan; Marco Cova; Oscar H. Ibarra (SPIN, 2008)

On Counter Machines, Reachability Problems, and Diophantine Equations. - Oscar H. Ibarra; Zhe Dang; Linmin Yang (Int. J. Found. Comput. Sci., 2008)

Discrete Nondeterministic Modeling of the Fas Pathway. - John Jack; Alfonso Rodríguez-Patón; Oscar H. Ibarra; Andrei Paun (Int. J. Found. Comput. Sci., 2008)

On Stateless Automata and P Systems. - Linmin Yang; Zhe Dang; Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2008)

Characterizations of some classes of spiking neural P systems. - Oscar H. Ibarra; Sara Woodworth (Nat. Comput., 2008)

On spiking neural P systems and partially blind counter machines. - Oscar H. Ibarra; Sara Woodworth; Fang Yu 001; Andrei Paun (Nat. Comput., 2008)

Computing with cells: membrane systems - some complexity issues. - Oscar H. Ibarra; Andrei Paun (Int. J. Parallel Emergent Distributed Syst., 2008)

Minimum-cost delegation in service composition. - Cagdas Evren Gerede; Oscar H. Ibarra; Bala Ravikumar; Jianwen Su (Theor. Comput. Sci., 2008)

On Nonuniversal Symport/Antiport P Systems. - Oscar H. Ibarra; Sara Woodworth (Algorithmic Bioprocesses, 2009)

On Stateless Multicounter Machines. - Ömer Egecioglu; Oscar H. Ibarra (CiE, 2009)

Hierarchies and Characterizations of Stateless Multicounter Machines. - Oscar H. Ibarra; Ömer Egecioglu (COCOON, 2009)

On Stateless Multihead Finite Automata and Multihead Pushdown Automata. - Pierluigi Frisco; Oscar H. Ibarra (Developments in Language Theory, 2009)

A Look Back at Some Early Results in Membrane Computing. - Oscar H. Ibarra (Workshop on Membrane Computing, 2009)

Symbolic String Verification: Combining String Analysis and Size Analysis. - Fang Yu 001; Tevfik Bultan; Oscar H. Ibarra (TACAS, 2009)

On Languages Accepted by P/T Systems Composed of joins - Pierluigi Frisco; Oscar H. Ibarra (DCFS, 2009)

Preface. - Oscar H. Ibarra; Bala Ravikumar (Int. J. Found. Comput. Sci., 2009)

Asynchronous spiking neural P systems. - Matteo Cavaliere; Oscar H. Ibarra; Gheorghe Paun; Ömer Egecioglu; Mihai Ionescu; Sara Woodworth (Theor. Comput. Sci., 2009)

Sequential SNP systems based on min/max spike number. - Oscar H. Ibarra; Andrei Paun; Alfonso Rodríguez-Patón (Theor. Comput. Sci., 2009)

Computing with Cells: Membrane Systems. - Oscar H. Ibarra (COCOON, 2010)

On Decision Problems for Simple and Parameterized Machines. - Oscar H. Ibarra (Developments in Language Theory, 2010)

Advances in parallel and distributed computing models - APDCM. - Oscar H. Ibarra (IPDPS Workshops, 2010)

On the universe, disjointness, and containment problems for simple machines. - Oscar H. Ibarra (Inf. Comput., 2010)

On spiking neural P systems. - Oscar H. Ibarra; Mario J. Pérez-Jiménez; Takashi Yokomori (Nat. Comput., 2010)

Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing. - Linmin Yang; Zhe Dang; Oscar H. Ibarra (Nat. Comput., 2010)

On sets of numbers accepted by P/T systems composed by join. - Pierluigi Frisco; Oscar H. Ibarra (Theor. Comput. Sci., 2010)

On stateless multihead automata: Hierarchies and the emptiness problem. - Oscar H. Ibarra; Juhani Karhumäki; Alexander Okhotin (Theor. Comput. Sci., 2010)

On decision problems for parameterized machines. - Oscar H. Ibarra; Igor Potapov; Hsu-Chun Yen (Theor. Comput. Sci., 2010)

On Synchronized Multitape and Multihead Automata. - Oscar H. Ibarra; Nicholas Q. Trân (DCFS, 2011)

On Two-Way Transducers. - Oscar H. Ibarra; Hsu-Chun Yen (Developments in Language Theory, 2011)

On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs. - Oscar H. Ibarra (CIAA, 2011)

On Strong Reversibility in P Systems and Related Problems. - Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2011)

Relational String Verification Using Multi-Track Automata. - Fang Yu 001; Tevfik Bultan; Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2011)

APDCM Introduction. - Oscar H. Ibarra (IPDPS Workshops, 2012)

Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines. - Oscar H. Ibarra; Nicholas Q. Trân (LATA, 2012)

Multitape NFA: Weak Synchronization of the Input Heads. - Ömer Egecioglu; Oscar H. Ibarra; Nicholas Q. Trân (SOFSEM, 2012)

A Survey of Results on Stateless Multicounter Automata. - Oscar H. Ibarra; Ömer Egecioglu (Fundam. Informaticae, 2012)

Sheng Yu. - Francis Y. L. Chin; Oscar H. Ibarra; Sartaj Sahni; Arto Salomaa (Int. J. Found. Comput. Sci., 2012)

Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines. - Oscar H. Ibarra; Shinnosuke Seki 001 (Int. J. Found. Comput. Sci., 2012)

One-reversal counter machines and multihead automata: Revisited. - Ehsan Chiniforooshan; Mark Daley; Oscar H. Ibarra; Lila Kari; Shinnosuke Seki 001 (Theor. Comput. Sci., 2012)

On synchronized multi-tape and multi-head automata. - Oscar H. Ibarra; Nicholas Q. Trân (Theor. Comput. Sci., 2012)

On the containment and equivalence problems for two-way transducers. - Oscar H. Ibarra; Hsu-Chun Yen (Theor. Comput. Sci., 2012)

On the Boundedness Property of Semilinear Sets. - Oscar H. Ibarra; Shinnosuke Seki 001 (TAMC, 2013)

Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages. - Oscar H. Ibarra; Bala Ravikumar (CIAA, 2013)

How to synchronize the Heads of a Multitape Automaton. - Oscar H. Ibarra; Nicholas Q. Trân (Int. J. Found. Comput. Sci., 2013)

Preface. - Hsu-Chun Yen; Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2013)

Similarity in languages and programs. - Cewei Cui; Zhe Dang; Thomas R. Fischer; Oscar H. Ibarra (Theor. Comput. Sci., 2013)

On the open problem of Ginsburg concerning semilinear sets and related problems. - Oscar H. Ibarra; Shinnosuke Seki 001 (Theor. Comput. Sci., 2013)

Automata with Reversal-Bounded Counters: A Survey. - Oscar H. Ibarra (DCFS, 2014)

APDCM Introduction and Committees. - Oscar H. Ibarra (IPDPS Workshops, 2014)

On the Parikh Membership Problem for FAs, PDAs, and CMs. - Oscar H. Ibarra; Bala Ravikumar (LATA, 2014)

Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract). - Cewei Cui; Zhe Dang; Thomas R. Fischer; Oscar H. Ibarra (MFCS (1), 2014)

On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers. - Oscar H. Ibarra (CIAA, 2014)

Automata-based symbolic string analysis for vulnerability detection. - Fang Yu 001; Muath Alkhalaf; Tevfik Bultan; Oscar H. Ibarra (Formal Methods Syst. Des., 2014)

Some Decision Questions Concerning the Time Complexity of Language Acceptors. - Oscar H. Ibarra; Bala Ravikumar (Int. J. Found. Comput. Sci., 2014)

Weak Synchronization and Synchronizability of Multi-tape Pushdown Automata and Turing Machines. - Oscar H. Ibarra; Nicholas Q. Trân (J. Autom. Lang. Comb., 2014)

APDCM Introduction and Committees. - Oscar H. Ibarra; Koji Nakano; Akihiro Fujiwara; Susumu Matsumae (IPDPS Workshops, 2015)

Semilinear Sets and Counter Machines: a Brief Survey. - Oscar H. Ibarra; Shinnosuke Seki 001 (Fundam. Informaticae, 2015)

On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers. - Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2015)

Alberto Apostolico. - Arto Salomaa; Francis Y. L. Chin; Oscar H. Ibarra; Sartaj Sahni (Int. J. Found. Comput. Sci., 2015)

On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L. - Oscar H. Ibarra; Ian McQuillan (CIAA, 2016)

Visibly Pushdown Automata and Transducers with Counters. - Oscar H. Ibarra (Fundam. Informaticae, 2016)

Execution information rate for some classes of automata. - Cewei Cui; Zhe Dang; Thomas R. Fischer; Oscar H. Ibarra (Inf. Comput., 2016)

On bounded languages and reversal-bounded automata. - Oscar H. Ibarra; Bala Ravikumar (Inf. Comput., 2016)

Announcement. - Francis Y. L. Chin; Oscar H. Ibarra; Sartaj K. Sahni (Int. J. Found. Comput. Sci., 2016)

On decidability and closure properties of language classes with respect to bio-operations. - Oscar H. Ibarra (Nat. Comput., 2016)

Preface. - Oscar H. Ibarra; Lila Kari; Steffen Kopecki (Nat. Comput., 2016)

Quantifying communication in synchronized languages. - Zhe Dang; Thomas R. Fischer; William J. Hutton III; Oscar H. Ibarra; Qin Li (Theor. Comput. Sci., 2016)

The effect of end-markers on counter machines and commutativity. - Oscar H. Ibarra; Ian McQuillan (Theor. Comput. Sci., 2016)

Introduction to APDCM Workshop. - Oscar H. Ibarra; Koji Nakano (IPDPS Workshops, 2017)

Lossiness of communication channels modeled by transducers. - Oscar H. Ibarra; Cewei Cui; Zhe Dang; Thomas R. Fischer (Comput., 2017)

Information rate of some classes of non-regular languages: An automata-theoretic approach. - Cewei Cui; Zhe Dang; Thomas R. Fischer; Oscar H. Ibarra (Inf. Comput., 2017)

Further remarks on DNA overlap assembly. - Srujan Kumar Enaganti; Oscar H. Ibarra; Lila Kari; Steffen Kopecki (Inf. Comput., 2017)

Deletion operations on deterministic families of automata. - Joey Eremondi; Oscar H. Ibarra; Ian McQuillan (Inf. Comput., 2017)

On the overlap assembly of strings and languages. - Srujan Kumar Enaganti; Oscar H. Ibarra; Lila Kari; Steffen Kopecki (Nat. Comput., 2017)

Input-Position-Restricted Models of Language Acceptors. - Oscar H. Ibarra; Ian McQuillan (Reversibility and Universality, 2018)

On Counting Functions of Languages. - Oscar H. Ibarra; Ian McQuillan; Bala Ravikumar (DLT, 2018)

Introduction to APDCM 2018. - Oscar H. Ibarra; Koji Nakano; Akihiro Fujiwara; Susumu Matsumae (IPDPS Workshops, 2018)

On the complexity and decidability of some problems involving shuffle. - Joey Eremondi; Oscar H. Ibarra; Ian McQuillan (Inf. Comput., 2018)

Accepting runs in a two-way finite automaton. - Oscar H. Ibarra; Zhe Dang; Qin Li (Inf. Comput., 2018)

On the Density of Context-Free and Counter Languages. - Joey Eremondi; Oscar H. Ibarra; Ian McQuillan (Int. J. Found. Comput. Sci., 2018)

On the Density of Languages Accepted by Turing Machines and Other Machine Models. - Oscar H. Ibarra; Ian McQuillan (J. Autom. Lang. Comb., 2018)

Grammatical characterizations of NPDAs and VPDAs with counters. - Oscar H. Ibarra (Theor. Comput. Sci., 2018)

Variations of checking stack automata: Obtaining unexpected decidability properties. - Oscar H. Ibarra; Ian McQuillan (Theor. Comput. Sci., 2018)

On store languages of language acceptors. - Oscar H. Ibarra; Ian McQuillan (Theor. Comput. Sci., 2018)

On store languages and applications. - Oscar H. Ibarra; Ian McQuillan (Inf. Comput., 2019)

Insertion operations on deterministic reversal-bounded counter machines. - Joey Eremondi; Oscar H. Ibarra; Ian McQuillan (J. Comput. Syst. Sci., 2019)

State grammars with stores. - Oscar H. Ibarra; Ian McQuillan (Theor. Comput. Sci., 2019)

On families of full trios containing counter machine languages. - Oscar H. Ibarra; Ian McQuillan (Theor. Comput. Sci., 2019)

On counting functions and slenderness of languages. - Oscar H. Ibarra; Ian McQuillan; Bala Ravikumar (Theor. Comput. Sci., 2019)

Semilinearity of Families of Languages. - Oscar H. Ibarra; Ian McQuillan (Int. J. Found. Comput. Sci., 2020)

On finite-index indexed grammars and their restrictions. - Flavio D'Alessandro; Oscar H. Ibarra; Ian McQuillan (Inf. Comput., 2021)

Space Complexity of Stack Automata Models. - Oscar H. Ibarra; Jozef Jirásek 002; Ian McQuillan; Luca Prigioniero (Int. J. Found. Comput. Sci., 2021)

Generalizations of Checking Stack Automata: Characterizations and Hierarchies. - Oscar H. Ibarra; Ian McQuillan (Int. J. Found. Comput. Sci., 2021)

Announcement. - Oscar H. Ibarra; Sartaj K. Sahni (Int. J. Found. Comput. Sci., 2021)

Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity. - Arturo Carpi; Flavio D'Alessandro; Oscar H. Ibarra; Ian McQuillan (Theor. Comput. Sci., 2021)

On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory. - Oscar H. Ibarra; Ian McQuillan (DLT, 2022)

On the Containment Problem for Deterministic Multicounter Machine Models. - Oscar H. Ibarra; Ian McQuillan (ATVA (1), 2023)

Unboundedness Problems for Machines with Reversal-Bounded Counters. - Pascal Baumann 001; Flavio D'Alessandro; Moses Ganardi; Oscar H. Ibarra; Ian McQuillan; Lia Schütze; Georg Zetzsche (FoSSaCS, 2023)

New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines. - Oscar H. Ibarra; Ian McQuillan (Inf. Comput., 2023)

On the complexity of decision problems for some classes of machines and applications. - Oscar H. Ibarra; Ian McQuillan (Inf. Comput., 2023)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. - Oscar H. Ibarra; Ian McQuillan (DLT, 2024)

Restrictions on Multicounter and Partially-Blind Multicounter Languages. - Oscar H. Ibarra; Ian McQuillan (Comput. Sci. J. Moldova, 2024)

Relativized Codes, Finite Decodability, and Bounded Languages. - Oscar H. Ibarra; Ian McQuillan (DLT, 2025)

Language Acceptors with a Pushdown: Characterizations and Complexity. - Oscar H. Ibarra; Ian McQuillan (Int. J. Found. Comput. Sci., 2025)

On decision problems concerning contextual insertions and deletions. - Oscar H. Ibarra; Ian McQuillan (Theor. Comput. Sci., 2025)