Oscar H. Ibarra

Q: What Schools Are Affiliated With Oscar H. Ibarra

Oscar H. Ibarra is affiliated with the following schools: University of California, Santa Barbara, University of Minnesota

Oscar H. Ibarra's AcademicInfluence.com Rankings

Oscar H. Ibarra

Computer Science

#4375

World Rank

#4608

Historical Rank

computer-science Degrees

Oscar H. Ibarra

Mathematics

#5574

World Rank

#7835

Historical Rank

Measure Theory

#804

World Rank

#1067

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Oscar H. Ibarra's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Oscar H. Ibarra Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Oscar H. Ibarra's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems (1975) (969)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors (1977) (854)
On spiking neural P systems (2006) (531)
Reversal-Bounded Multicounter Machines and Their Decision Problems (1978) (413)
Bounds for LPT Schedules on Uniform Processors (1977) (268)
Polynomially Complete Fault Detection Problems (1975) (265)
Asynchronous spiking neural P systems (2009) (157)
SWEB: towards a scalable World Wide Web server on multicomputers (1996) (151)
A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications (1982) (151)
The Complexity of Decision Problems for Finite-Turn Multicounter Machines (1981) (120)
Normal forms for spiking neural P systems (2007) (108)
Automated composition of e-services: lookaheads (2004) (102)
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs (1983) (102)
Simple Matrix Languages (1970) (97)
The unsolvability of the equivalence problem for e-free NGSM's with unary input (output) alphabet and applications (1977) (90)
On Two-way Multihead Automata (1973) (88)
Symbolic String Verification: An Automata-Based Approach (2008) (87)
Sequential SNP systems based on min/max spike number (2009) (85)
Binary Reachability Analysis of Discrete Pushdown Timed Automata (2000) (83)
Characterizations and Computational Complexity of Systolic Trellis Automata (1984) (79)
Parallel Parsing on a One-Way Array of Finite-State Machines (1987) (77)
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation (1989) (75)
Some results concerning linear iterative (systolic) arrays (1985) (72)
A note on finite-valued and finitely ambiguous transducers (1983) (70)
On One-Way Cellular Arrays (1987) (69)
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications (1985) (67)
Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata (1971) (66)
Moving Objects: Logical Relationships and Queries (2001) (66)
Symbolic String Verification: Combining String Analysis and Size Analysis (2009) (65)
Multi-Tape and Multi-Head Pushdown Automata (1968) (65)
On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers (1986) (64)
Some Decision Problems Concerning Semilinearity and Commutation (2002) (60)
New Decidability Results Concerning Two-Way Counter Machines (1993) (60)
On the power one-way communication (1986) (56)
Automata-based symbolic string analysis for vulnerability detection (2014) (56)
Two-Way Pushdown Automata (1967) (56)
A Note on the Parallel Complexity of Computing the Rank of Order n Matrices (1980) (55)
Approximation Algorithms for Certain Scheduling Problems (1978) (55)
Relating the Power of Cellular Arrays to Their Closure Properties (1988) (55)
Learning regular languages from counterexamples (1988) (53)
Relational String Verification Using Multi-Track Automata (2010) (53)
On Moving Object Queries (2002) (53)
SPiDeR: P2P-Based Web Service Discovery (2005) (52)
A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata (1974) (52)
On the Computational Complexity of P Automata (2004) (50)
Toward a Scalable Distributed {WWW} Server on Workstation Clusters (1997) (47)
Trajectory queries and octagons in moving object databases (2002) (46)
Designing Systolic Algorithms Using Sequential Machines (1984) (46)
A Note Concerning Nondeterministic Tape Complexities (1972) (46)
Scalability issues for high performance digital libraries on the World Wide Web (1996) (45)
Simulating FAS-induced apoptosis by using P systems (2007) (44)
Catalytic P systems, semilinear sets, and vector addition systems (2004) (42)
Adaptive load sharing for clustered digital library servers (1998) (42)
Counter Machines and Verification Problems (2002) (42)
On Mapping Systolic Algorithms onto the Hypercube (1990) (41)
Finite Automata with Multiplication (1976) (40)
On moving object queries: (extended abstract) (2002) (40)
Two-way counter machines and Diophantine equations (1981) (39)
Some Subclasses of Context-Free Languages In NC1 (1988) (38)
On spiking neural P systems and partially blind counter machines (2006) (37)
Asynchronous Spiking Neural P Systems: Decidability and Undecidability (2007) (35)
The WWW Prototype of the Alexandria Digital Library (1995) (35)
Conter Machines: Decidable Properties and Applications to Verification Problems (2000) (35)
Fast Parallel Language Recognition by Cellular Automata (1985) (34)
Two-Dimensional Iterative Arrays: Characterizations and Applications (1988) (33)
Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines (2012) (32)
On stateless multihead automata: Hierarchies and the emptiness problem (2008) (32)
Characterizations of Some Restricted Spiking Neural P Systems (2006) (32)
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter (2001) (31)
Closure and decidability properties of some language classes with respect to ciliate bio-operations (2003) (30)
Matrix Languages, Register Machines, Vector Addition Systems (2005) (30)
On Stateless Automata and P Systems (2008) (30)
Some Observations Concerning Alternating Turing Machines Using Small Space (1987) (30)
Two-Dimensional Convolution on a Pyramid Computer (1988) (29)
On the Finite-Valuedness Problem for Sequential Machines (1988) (29)
A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems (2003) (28)
Characterizations of Catalytic Membrane Computing Systems (2003) (27)
On membrane hierarchy in P systems (2005) (27)
The Number of Membranes Matters (2003) (27)
Parallel Regognition and Parsing on the Hypercube (1991) (25)
On the Decidability of Model-Checking for P Systems (2006) (25)
Composability of Infinite-State Activity Automata (2004) (24)
Instance-Specific Solutions For Accelerating The Cky Parsing Of Large Context-Free Grammars (2004) (24)
A useful device for showing the solvability of some decision problems (1976) (23)
Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication (1981) (23)
On the solvability of a class of diophantine equations and applications (2006) (22)
VLSI algorithms for solving recurrence equations and applications (1987) (22)
On determinism versus nondeterminism in P systems (2005) (21)
On the containment and equivalence of database queries with linear constraints (extended abstract) (1997) (21)
A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries (1999) (20)
An NP-Complete Number-Theoretic Problem (1979) (20)
Systolic Tree Implementation of Data Structures (1988) (20)
Reachability Analysis for Some Models of Infinite-State Transition Systems (2000) (19)
Restricted one-counter machines with undecidable universe problems (1979) (19)
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems (2006) (18)
Membrane Computing: A General View (2007) (18)
Simple Counter Machines and Number-Theoretic Problems (1979) (18)
A note on parsing pattern languages (1995) (18)
On Pebble Automata (1986) (17)
On P Systems Operating in Sequential Mode (2004) (17)
Deterministic catalytic systems are not universal (2006) (17)
A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars (1992) (17)
On the computational complexity of membrane systems (2004) (17)
A Hierarchy Theorem for Polynomial-Space Recognition (1974) (17)
Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance (1998) (17)
One-reversal counter machines and multihead automata: Revisited (2011) (17)
On two-way FA with monotonic counters and quadratic Diophantine equations (2004) (17)
Tape-Bounded Turing Acceptors and Principal AFLs (1970) (16)
The Complexity of the Equivalence Problem for Simple Programs (1981) (16)
Automata with Reversal-Bounded Counters: A Survey (2014) (16)
On the overlap assembly of strings and languages (2017) (16)
Implementation and Application of Automata (2001) (16)
On the Decidability of Equivalence for Deterministic Pushdown Transducers (1981) (15)
Counting Time in Computing with Cells (2005) (15)
On the Simplification and Equivalence Problems for Straight-Line Programs (1983) (15)
The Power of Maximal Parallelism in P Systems (2004) (15)
On Space-Bounded Synchronized Alternating Turing Machines (1991) (14)
Online and minimum-cost ad hoc delegation in e-service composition (2005) (14)
Verification in loosely synchronous queue-connected discrete timed automata (2003) (14)
Characterizations of some classes of spiking neural P systems (2008) (14)
On Model-Checking of P Systems (2005) (14)
Some results concerning automata on two-dimensional tapes (1974) (13)
Similarity in languages and programs (2013) (13)
Execution information rate for some classes of automata (2013) (13)
Generalized discrete timed automata: decidable approximations for safety verificatio (2003) (13)
On Stateless Multihead Finite Automata and Multihead Pushdown Automata (2009) (13)
On various notions of parallelism in P Systems (2005) (13)
Parallel Parsing on a One-Way Linear Array of Finite-State Machines (1989) (12)
Iterative Algorithms for Planar Convex Hull on Mesh-Connected Arrays (1990) (12)
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages (2001) (12)
String Editing on a One-Way Linear Array of Finite-State Machines (1992) (12)
On partially blind multihead finite automata (2006) (12)
On Stateless Multicounter Machines (2009) (12)
On 3-head versus 2-head finite automata (1975) (12)
Spiking Neural P Systems: Some Characterizations (2007) (12)
Hierarchies and Characterizations of Stateless Multicounter Machines (2009) (12)
A Matrix q-Analogue of the Parikh Map (2004) (12)
Hypercube Algorithms for Some String Comparison Problems (1988) (12)
Past pushdown timed automata and safety verification (2004) (12)
Characterizing Regular Languages by Spiking Neural P Systems (2007) (12)
Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems (1981) (11)
Straight-Line Programs with One Input Variable (1982) (11)
Path Systems: Constructions, Solutions and Applications (1980) (11)
On Strong Reversibility in P Systems and Related Problems (2011) (11)
Hierarchies of Turing Machines with Restricted Tape Alphabet Size (1975) (11)
Iterative tree arrays with logarithmic depth (1986) (11)
On the containment and equivalence problems for two-way transducers (2012) (11)
The effect of end-markers on counter machines and commutativity (2016) (11)
Further remarks on DNA overlap assembly (2017) (10)
On Multi-way Spatial Joins with Direction Predicates (2001) (10)
Insertion Operations on Deterministic Reversal-Bounded Counter Machines (2015) (10)
The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets (1981) (10)
On Bounded Symport/Antiport P Systems (2005) (10)
On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages (1993) (10)
Minimum-cost delegation in service composition (2008) (10)
On Store Languages of Language Acceptors (2017) (10)
Some Classes of Languages in NC¹ (1991) (10)
Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval (1996) (10)
Single-Row Routing with Crossover Bound (1987) (10)
On Symport/Antiport P Systems and Semilinear Sets (2005) (9)
Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties (1988) (9)
On Some Languages in NC (1988) (9)
Toward spatial joins for polygons (2000) (9)
Deletion Operations on Deterministic Families of Automata (2015) (9)
On composition and lookahead delegation of e-services modeled by automata, (2005) (9)
On two-way nondeterministic finite automata with one reversal-bounded counter (2005) (9)
Some Efficient Algorithms for Permutation Graphs (1994) (9)
String processing on the hypercube (1990) (9)
On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints (1975) (9)
On the Complexity of Commutativity Analysis (1996) (9)
How to synchronize the Heads of a Multitape Automaton (2012) (8)
Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata (1991) (8)
On decidability and closure properties of language classes with respect to bio-operations (2014) (8)
Modeling affective responses in intelligent tutoring systems (2004) (8)
Multitape NFA: Weak Synchronization of the Input Heads (2012) (8)
On Deterministic Catalytic Systems (2005) (8)
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter (2002) (8)
Controlled pushdown automata (1973) (8)
Dense Counter Machines and Verification Problems (2003) (8)
Reachability and Safety in Queue Systems (2000) (8)
A Note on Simple Programs with Two Variables (1993) (8)
Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's (1983) (8)
Parallel Progressive Radiosity with Adaptive Meshing (1996) (8)
On Finite-Index Indexed Grammars and Their Restrictions (2016) (8)
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATMs and Space-Bounded TMs (1989) (8)
The LD and DLAD Bio-Operations on Formal Languages (2003) (8)
On one-membrane P systems operating in sequential mode (2005) (8)
On the Control Power of Integer Division (1983) (8)
On the Computing Power of One-Way Cellular Arrays (1987) (7)
A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval (1997) (7)
Discrete Nondeterministic Modeling of the Fas Pathway (2008) (7)
On Synchronized Multitape and Multihead Automata (2011) (7)
2DST Mapppings on Languages and Related Problems (1982) (7)
On Iterative and Cellular Tree Arrays (1989) (7)
Visibly Pushdown Automata and Transducers with Counters (2016) (7)
On Reachability and Safety in Infinite-State Systems (2001) (7)
Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing (2007) (6)
Simulating Apoptosis Using Discrete Methods: a Membrane System and a Stochastic Approach (2007) (6)
On the Density of Context-Free and Counter Languages (2015) (6)
On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L (2016) (6)
Signaling P Systems and Verification Problems (2005) (6)
Workshop on Advances in Parallel and Distributed Computational Models (2000) (6)
(Semi)alternating stack automata (1981) (6)
The Power of Alternating One-Reversal Counters and Stacks (1991) (6)
Quadtree building algorithms on an SIMD hypercube (1992) (6)
A q-Analogue of the Parikh Matrix Mapping (2007) (6)
Lossiness of communication channels modeled by transducers (2014) (6)
An NP-complete number-theoretic problem (1978) (6)
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract) (2014) (6)
On symbolic scheduling and parallel complexity of loops (1995) (6)
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata (2001) (6)
A flow based approach to the pin redistribution problem for multi-chip modules (1994) (6)
Generalizing the Discrete Timed Automaton (2000) (6)
Some Characterizations of Multihead Finite Automata (1986) (6)
On Removing the Pushdown Stack in Reachability Constructions (2009) (5)
Sampling a Two-Way Finite Automaton (2015) (5)
Systolic Arrays: Characterizations and Complexity (1996) (5)
The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications (2002) (5)
An Optimal Shortest Path Parallel Algorithm for Permutation Graphs (1995) (5)
Some Recent Results Concerning Deterministic P Systems (2005) (5)
Systolic algorithms for some scheduling and graph problems (1988) (5)
Information rate of some classes of non-regular languages: An automata-theoretic approach (2017) (5)
On the Computational Power of 1-Deterministic and Sequential P Systems (2006) (5)
Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines (2012) (5)
Sequentiality Induced by Spike Number in SNP Systems (2009) (5)
On Efficient Simulations of Systolic Arrays of Random-Access Machines (1987) (5)
Characterizations of Presburger Functions (1981) (5)
On the Equivalence of Finite-State Sequential Machine Models (1967) (5)
Extending Rectangle Join Algorithms for Rectilinear Polygons (2000) (5)
Triangulation in a plane and 3D convex hull on mesh-connected arrays and hypercubes (1991) (5)
The complexity of the equivalence problem for straight-line programs (1980) (5)
Simple Programming Languages and Restricted Classes of Turing Machines (1983) (5)
A hierarchy result for 2-dimensional TM's operating in small space (1992) (5)
On the open problem of Ginsburg concerning semilinear sets and related problems (2013) (4)
Fast parallel algorithms for solving triangular systems of linear equations on the hypercube (1991) (4)
On the Space Complexity of Recursive Algorithms (1979) (4)
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's (1988) (4)
On the Complexity and Decidability of Some Problems Involving Shuffle (2015) (4)
On Some Decision Questions Concerning Pushdown Machines (1983) (4)
A note on the complexity of program evaluation (1984) (4)
Image compression for fast wavelet-based subregion retrieval (2000) (4)
On Efficient Recognition of Transductions and Relations (1985) (4)
Finding Articulation Points and Bridges of Permutation Graphs (1993) (4)
Iterative algorithms for the planar convex hull problem on mesh-connected arrays (1992) (4)
An index structure for spatial joins in linear constraint databases (1999) (4)
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties (2017) (4)
On synchronized multi-tape and multi-head automata (2012) (4)
On bounded languages and reversal-bounded automata (2013) (4)
Counter machines and the safety and disjointness problems for database queries with linear constraints (2001) (4)
Past Pushdown Timed Automata (2001) (3)
Some independence results in complexity theory (1985) (3)
Electric routing and concurrent flow cutting (2009) (3)
Synchronized Finite Automata and 2DFA Reductions (1993) (3)
On symport/antiport P systems with one or two symbols (2005) (3)
Counter Machines: Decision Problems and Applications (1999) (3)
Proceedings of the 11th international conference on Implementation and Application of Automata (2003) (3)
On Two-Way Sequential Transductions of Full Semi-AFL's (1978) (3)
Real-Counter Automata and Their Decision Problems (2004) (3)
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs (1984) (3)
Modeling, analysis, and composition of business processes (2007) (3)
On the Space and Time Complexity of Functions Computable by Simple Programs (1983) (3)
The Complexity of the Equivalence Problem for Simple Loop-Free Programs (1982) (3)
On the shortest path problem for permutation graphs (1993) (3)
SPiDeR : P 2 P-Based Web Service Discovery (3)
Semilinearity of Families of Languages (2018) (3)
Advances in parallel and distributed computing models - APDCM (2010) (3)
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (1985) (3)
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach (2006) (3)
The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs (1979) (3)
On the Complexity of Simple Arithmetic Expressions (1981) (3)
New Results Concerning Synchronized Finite Automata (1992) (3)
On Counting Functions of Languages (2018) (3)
On Efficient Parallel Algorithms for Solving Set Recurrence Equations (1993) (3)
On symport/antiport P systems with a small number of objects (2006) (3)
Some Decision Problems Concerning Sequential Transducers and Checking Automata (1979) (3)
On Sequential and 1-Deterministic P Systems (2005) (3)
Deletion operations on deterministic families of automata (2017) (3)
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation (1987) (2)
Eliminating the storage tape in reachability constructions (2003) (2)
State Grammars with Stores (2018) (2)
On counting functions and slenderness of languages (2019) (2)
Accepting runs in a two-way finite automaton (2018) (2)
Proceedings of the 8th Annual International Conference on Computing and Combinatorics (2002) (2)
On the Zero-Inequivalence Problem for Loop Programs (1983) (2)
Transformations between boundary codes, run length codes, and linear quadtrees (1994) (2)
On the universe, disjointness, and containment problems for simple machines (2010) (2)
Some Simplified Undecidable and NP-Hard Problems for Simple Programs (1982) (2)
Safety Verification for Two-Way Finite Automata with Monotonic Counters (2002) (2)
Trading reversals for alternation (1988) (2)
On resetting DLBA's (1991) (2)
On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers (2014) (2)
On the Parikh Membership Problem for FAs, PDAs, and CMs (2014) (2)
Computability limits in membrane computing (2007) (2)
On Counter Machines, Reachability Problems, and Diophantine Equations (2008) (2)
On the Parallel Complexity of Solving Recurrence Equations (1994) (2)
Augmenting the discrete timed automaton with other data structures (2002) (2)
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (2020) (2)
On Families of Full Trios Containing Counter Machine Languages (2016) (2)
Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings (2006) (2)
On Two-Way Transducers (2011) (2)
Preface Program Committee Automaton Models Inspired by Peptide Computing (2007) (2)
Optimal Simulation of Tree Arrays by Linear Arrays (1989) (2)
Decision Questions Concerning Semilinearity Morphisms and (2000) (2)
On Two-Dimensional Via Assignment for Single-Row Routing (1988) (2)
On the Density of Languages Accepted by Turing Machines and Other Machine Models (2019) (2)
Generalizations of Checking Stack Automata: Characterizations and Hierarchies (2018) (2)
A characterization of systolic binary tree automata and applications (1984) (2)
On Languages Accepted by P/T Systems Composed of joins (2009) (2)
Verification of String Manipulating Programs Using Multi-Track Automata (2009) (1)
On store languages and applications (2019) (1)
Sheng Yu (2012) (1)
Some Computational Issues in Membrane Computing (2005) (1)
Some Decision Questions Concerning the Time Complexity of Language Acceptors (2014) (1)
Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings (2008) (1)
On the complexity and decidability of some problems involving shuffle (2017) (1)
Grammatical characterizations of NPDAs and VPDAs with counters (2018) (1)
An efficient all-parses systolic algorithm for general context-free parsing (1989) (1)
Unconventional Computation and Natural Computation (2014) (1)
P Systems: Some Recent Results and Research Problems (2004) (1)
Quantifying communication in synchronized languages (2015) (1)
Semilinear Sets and Counter Machines: a Brief Survey (2015) (1)
Triangulation Voronoi Diagram and Convex Hull in k-Space on Mesh-Connected Arrays and Hypercubes (1991) (1)
APDCM Introduction and Committees (2015) (1)
On Some Open Problems Concerning the Complexity of Cellular Arrays (1994) (1)
Space Complexity of Stack Automata Models (2020) (1)
Verification in Queue-Connected Multicounter Machines (2002) (1)
Characterizations of transductions defined by abstract families of transducers (1971) (1)
Efficient parallel algorithms for solving set recurrence equations and applications (1990) (1)
On Simple Programs with Primitive Conditional Statements (1985) (1)
Weak Synchronization and Synchronizability of Multi-tape Pushdown Automata and Turing Machines (2014) (1)
Computing with cells: membrane systems – some complexity issues (2008) (1)
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract) (1984) (1)
Proceedings of the 16th international conference on Developments in Language Theory (2006) (0)
Techniques for web service discovery and composition (2008) (0)
A Survey of Results on Stateless Multicounter Automata (2012) (0)
APDCM Introduction (2011) (0)
On Some Decision Problems for RAM Programs (1982) (0)
A Look Back at Some Early Results in Membrane Computing (2009) (0)
Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings (2006) (0)
Past Pushdown Timed Automata (Extended Abstract) (2002) (0)
Preface (2015) (0)
On communication-bounded synchronized alternating finite automata (1994) (0)
10th workshop on Advances in Parallel and Distributed Computational Models - APDCM'08 (2008) (0)
Characterizations of catalytic membrane computing systems: (Extended abstract) (2003) (0)
On the overlap assembly of strings and languages (2016) (0)
On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (2011) (0)
Counter Ma hines and Veri ation Problems 1 (2007) (0)
On the Parallel Complexity of Loops (1997) (0)
APDCM Introduction and Committees (2015) (0)
On sets of numbers accepted by P/T systems composed by join (2010) (0)
On the Complexity of Decision Problems for Some Classes of Machines and Applications (2022) (0)
On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's (1986) (0)
Parallel Parsing on the Hypercube (1988) (0)
Some Complexity Issues in Parallel Computing (Algorithm Engineering as a New Paradigm) (2001) (0)
Proceedings of the 13th international conference on Implementation and Applications of Automata (2008) (0)
On the Shortest Path Problems for Permutation Graphs. (1993) (0)
Automata-Theoretic Techniques for Analyzing Infinite-State Systems (2004) (0)
Technical Reports 11-20, 1984 (1984) (0)
Quadratic Diophantine Equations and Verification of Infinite-State Systems (2003) (0)
6項 Automata-Based Techniques for Verification of Infinite-State Systems(4節通研講演会)(第5章国際会議・シンポジウム等) (2003) (0)
Editorial (2004) (0)
Introduction to APDCM Workshop (2017) (0)
Algorithms and Computation: 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, Proceedings (1998) (0)
Performance Prediction in Symbolic Scheduling of Partitioned Programs with Weight Variation (1996) (0)
On restricted one-counter machines (1981) (0)
Computing with Cells: Membrane Systems (2008) (0)
Scene Labeling on the Hypercube (1989) (0)
Input-Position-Restricted Models of Language Acceptors (2018) (0)
Online and Minimum-Cost Delegation in Service Composition 1 , 2 (2007) (0)
On Nonuniversal Symport/Antiport P Systems (2009) (0)
On Decision Problems for Simple and Parameterized Machines (2010) (0)
On decision problems for parameterized machines (2010) (0)
Reachability Problems for Dense Counter Machines (2003) (0)
Sampling a Two-way Finite Automaton 1 (2016) (0)
On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers (2015) (0)
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages (2013) (0)
On counting functions and slenderness of languages I , II (2019) (0)
Keynote 3: Computing with Membranes: An Overview (2010) (0)
New Characterizations of Exponential, Elementary, and Non-Elementary Time-Bounded Turing Machines (2023) (0)
Caching and service differentiation for scalable network servers (2000) (0)
Reconfiguration for logic reuse (1998) (0)
TURING MACHINES AND OTHER MACHINE MODELS (2019) (0)
Computing And Combinatorics Conference -- Cocoon'02 (2004) (0)
Implementation and Application of Automata: 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings (Lecture Notes in Computer Science) (2006) (0)
Efficient algorithms for spatial queries (2003) (0)
Real-Counter Automata and Applications to Verification (2004) (0)
On the Boundedness Property of Semilinear Sets (2013) (0)
Real-Counter Automata and Their Decision Problems (Extended Abstract) (2004) (0)
Technical Report CoSBi 09 / 2007 Asynchronous Spiking Neural P Systems (2009) (0)
On Cellular Arrays and Other Topics in Parallel Computing (2002) (0)
Implementation and application of automata : 8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003 : proceedings (2003) (0)
Computing and combinatorics : 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 : proceedings (2002) (0)
Introduction to APDCM 2018 (2018) (0)
On the Communication Complexity of Parallel Computation (1993) (0)
On Resetiting DLBA's (1991) (0)
DNA Overlap Catenation by XPCR: A Theoretical Analysis (2015) (0)
NEW EDITORS AT IJFCS (1998) (0)
On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory (2022) (0)
On decidability and closure properties of language classes with respect to bio-operations (2015) (0)
Developments in language theory (2007) (0)
Implementation and Application of Automata (2003) (0)
APDCM Introduction (2013) (0)
Algorithms and computation : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009 : proceedings (2009) (0)
Automata-based symbolic string analysis for vulnerability detection (2013) (0)
Unconventional computation and natural computation : 13th international conference, UCNC 2014, London, ON, Canada, July 14-18, 2014 : proceedings (2014) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Oscar H. Ibarra?

Oscar H. Ibarra is affiliated with the following schools:

Oscar H. Ibarra's Academic­Influence.com Rankings

Oscar H. Ibarra's Degrees

Similar Degrees You Can Earn

Why Is Oscar H. Ibarra Influential?

Oscar H. Ibarra's Published Works

Published Works

What Schools Are Affiliated With Oscar H. Ibarra?

Oscar H. Ibarra's AcademicInfluence.com Rankings