The following pages link to Oscar H. Ibarra (Q243823):
Displayed 50 items.
- (Q3505127) (← links)
- ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS (Q3526543) (← links)
- Computing with cells: membrane systems – some complexity issues (Q3532791) (← links)
- DISCRETE NONDETERMINISTIC MODELING OF THE FAS PATHWAY (Q3542876) (← links)
- ON STATELESS AUTOMATA AND P SYSTEMS (Q3542882) (← links)
- On Stateless Multicounter Machines (Q3576050) (← links)
- Characterizations of Some Restricted Spiking Neural P Systems (Q3591023) (← links)
- Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing (Q3603418) (← links)
- Symbolic String Verification: Combining String Analysis and Size Analysis (Q3617765) (← links)
- Counting Time in Computing with Cells (Q3618683) (← links)
- On Bounded Symport/Antiport P Systems (Q3618684) (← links)
- On Stateless Multihead Finite Automata and Multihead Pushdown Automata (Q3637229) (← links)
- Sequentiality Induced by Spike Number in SNP Systems (Q3643101) (← links)
- Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM’<scp>s</scp> (Q3657434) (← links)
- (Q3685230) (← links)
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications (Q3692872) (← links)
- The equivalence problem and correctness formulas for a simple class of programs (Q3694664) (← links)
- On simple programs with primitive conditional statements (Q3694665) (← links)
- Some characterizations of multihead finite automata (Q3716303) (← links)
- On space and time efficient TM simulations of some restricted classes of PDA's (Q3716304) (← links)
- (Q3742754) (← links)
- Some independence results in complexity theory<sup>†</sup> (Q3751002) (← links)
- On the Simplification and Equivalence Problems for Straight-Line Programs (Q3763569) (← links)
- On Efficient Simulations of Systolic Arrays by Random-Access Machines (Q3769966) (← links)
- (Q3769969) (← links)
- Parallel Parsing on a One-Way Array of Finite-State Machines (Q3773378) (← links)
- (Q3786002) (← links)
- On One-Way Cellular Arrays (Q3790658) (← links)
- (Q3795230) (← links)
- Iterative tree arrays with logarithmic depth<sup>†</sup> (Q3802619) (← links)
- (Q3811706) (← links)
- Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties (Q3811712) (← links)
- Restricted one-counter machines with undecidable universe problems (Q3864502) (← links)
- Path Systems: Constructions, Solutions and Applications (Q3893308) (← links)
- The Complexity of the Equivalence Problem for Simple Programs (Q3912019) (← links)
- (Q3912020) (← links)
- Characterizations of Presburger Functions (Q3926041) (← links)
- On restricted one-counter machines (Q3926065) (← links)
- The Complexity of the Equivalence Problem for Simple Loop-Free Programs (Q3939215) (← links)
- (Q3940845) (← links)
- Straight-Line Programs with One Input Variable (Q3947097) (← links)
- A generalization of the fast LUP matrix decomposition algorithm and applications (Q3954737) (← links)
- (Semi)alternating stack automata (Q3959454) (← links)
- Two-Way Counter Machines and Diophantine Equations (Q3960829) (← links)
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs (Q3962460) (← links)
- A note on finite-valued and finitely ambiguous transducers (Q3968472) (← links)
- (Q4028904) (← links)
- On Efficient Parallel Algorithms for Solving Set Recurrence Equations (Q4033767) (← links)
- (Q4035243) (← links)
- A Hierarchy Theorem for Polynomial-Space Recognition (Q4046031) (← links)