| 2009 |
|---|
| 276 | EE | Fang Yu,
Tevfik Bultan,
Oscar H. Ibarra:
Symbolic String Verification: Combining String Analysis and Size Analysis.
TACAS 2009: 322-336 |
| 2008 |
|---|
| 275 | | Oscar H. Ibarra,
Bala Ravikumar:
Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings
Springer 2008 |
| 274 | EE | Oscar H. Ibarra:
Computing with Cells: Membrane Systems.
ISPAN 2008: 3 |
| 273 | EE | Oscar H. Ibarra,
Juhani Karhumäki,
Alexander Okhotin:
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem.
LATIN 2008: 94-105 |
| 272 | EE | Fang Yu,
Tevfik Bultan,
Marco Cova,
Oscar H. Ibarra:
Symbolic String Verification: An Automata-Based Approach.
SPIN 2008: 306-324 |
| 271 | EE | Oscar H. Ibarra,
Andrei Paun:
Computing with cells: membrane systems - some complexity issues.
IJPEDS 23(5): 347-365 (2008) |
| 270 | EE | Oscar H. Ibarra,
Zhe Dang,
Linmin Yang:
On Counter Machines, Reachability Problems, and Diophantine Equations.
Int. J. Found. Comput. Sci. 19(4): 919-934 (2008) |
| 269 | EE | John Jack,
Alfonso Rodríguez-Patón,
Oscar H. Ibarra,
Andrei Paun:
Discrete Nondeterministic Modeling of the Fas Pathway.
Int. J. Found. Comput. Sci. 19(5): 1147-1162 (2008) |
| 268 | EE | Linmin Yang,
Zhe Dang,
Oscar H. Ibarra:
On Stateless Automata and P Systems.
Int. J. Found. Comput. Sci. 19(5): 1259-1276 (2008) |
| 267 | EE | Oscar H. Ibarra,
Sara Woodworth,
Fang Yu,
Andrei Paun:
On spiking neural P systems and partially blind counter machines.
Natural Computing 7(1): 3-19 (2008) |
| 266 | EE | Oscar H. Ibarra,
Sara Woodworth:
Characterizations of some classes of spiking neural P systems.
Natural Computing 7(4): 499-517 (2008) |
| 265 | EE | Cagdas Evren Gerede,
Oscar H. Ibarra,
Bala Ravikumar,
Jianwen Su:
Minimum-cost delegation in service composition.
Theor. Comput. Sci. 409(3): 417-431 (2008) |
| 2007 |
|---|
| 264 | EE | Matteo Cavaliere,
Ömer Egecioglu,
Oscar H. Ibarra,
Mihai Ionescu,
Gheorghe Paun,
Sara Woodworth:
Asynchronous Spiking Neural P Systems: Decidability and Undecidability.
DNA 2007: 246-255 |
| 263 | EE | Oscar H. Ibarra,
Sara Woodworth:
Spiking Neural P Systems: Some Characterizations.
FCT 2007: 23-37 |
| 262 | EE | Linmin Yang,
Zhe Dang,
Oscar H. Ibarra:
Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing.
UC 2007: 226-241 |
| 261 | EE | Oscar H. Ibarra,
Hsu-Chun Yen:
Preface.
Int. J. Found. Comput. Sci. 18(4): 667-668 (2007) |
| 260 | EE | Oscar H. Ibarra,
Sara Woodworth:
Characterizing Regular Languages by Spiking Neural P Systems.
Int. J. Found. Comput. Sci. 18(6): 1247-1256 (2007) |
| 259 | EE | Oscar H. Ibarra,
Andrei Paun,
Gheorghe Paun,
Alfonso Rodríguez-Patón,
Petr Sosík,
Sara Woodworth:
Normal forms for spiking neural P systems.
Theor. Comput. Sci. 372(2-3): 196-217 (2007) |
| 258 | EE | Oscar H. Ibarra:
Developments in language theory.
Theor. Comput. Sci. 376(1-2): 1-2 (2007) |
| 2006 |
|---|
| 257 | | Oscar H. Ibarra,
Zhe Dang:
Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings
Springer 2006 |
| 256 | | Oscar H. Ibarra,
Hsu-Chun Yen:
Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings
Springer 2006 |
| 255 | EE | Oscar H. Ibarra,
Sara Woodworth,
Fang Yu,
Andrei Paun:
On Spiking Neural P Systems and Partially Blind Counter Machines.
UC 2006: 113-129 |
| 254 | EE | Oscar H. Ibarra,
Sara Woodworth:
Characterizations of Some Restricted Spiking Neural P Systems.
Workshop on Membrane Computing 2006: 424-442 |
| 253 | EE | Oscar H. Ibarra,
Sara Woodworth,
Hsu-Chun Yen,
Zhe Dang:
On the Computational Power of 1-Deterministic and Sequential P Systems.
Fundam. Inform. 73(1-2): 133-152 (2006) |
| 252 | EE | Oscar H. Ibarra,
Sara Woodworth:
On symport/antiport P systems with a small number of objects.
Int. J. Comput. Math. 83(7): 613-629 (2006) |
| 251 | | Oscar H. Ibarra,
Bala Ravikumar,
Cagdas Evren Gerede:
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach.
Journal of Automata, Languages and Combinatorics 11(2): 169-188 (2006) |
| 250 | | Zhe Dang,
Oscar H. Ibarra,
Cheng Li,
Gaoyan Xie:
On the Decidability of Model-Checking for P Systems.
Journal of Automata, Languages and Combinatorics 11(3): 279-298 (2006) |
| 249 | EE | Erzsébet Csuhaj-Varjú,
Oscar H. Ibarra,
György Vaszil:
On the Computational Complexity of P Automata.
Natural Computing 5(2): 109-126 (2006) |
| 248 | EE | Oscar H. Ibarra,
Zhe Dang:
On the solvability of a class of diophantine equations and applications.
Theor. Comput. Sci. 352(1-3): 342-346 (2006) |
| 247 | EE | Oscar H. Ibarra,
Bala Ravikumar:
On partially blind multihead finite automata.
Theor. Comput. Sci. 356(1-2): 190-199 (2006) |
| 246 | EE | Oscar H. Ibarra,
Gheorghe Paun:
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems.
Theor. Comput. Sci. 358(1): 88-103 (2006) |
| 245 | EE | Oscar H. Ibarra,
Hsu-Chun Yen:
Deterministic catalytic systems are not universal.
Theor. Comput. Sci. 363(2): 149-161 (2006) |
| 2005 |
|---|
| 244 | EE | Oscar H. Ibarra,
Hsu-Chun Yen:
On Deterministic Catalytic Systems.
CIAA 2005: 163-175 |
| 243 | EE | Oscar H. Ibarra,
Sara Woodworth,
Hsu-Chun Yen,
Zhe Dang:
On Sequential and 1-Deterministic P Systems.
COCOON 2005: 905-914 |
| 242 | EE | Oscar H. Ibarra,
Andrei Paun:
Counting Time in Computing with Cells.
DNA 2005: 112-128 |
| 241 | EE | Oscar H. Ibarra,
Sara Woodworth:
On Bounded Symport/Antiport P Systems.
DNA 2005: 129-143 |
| 240 | EE | Cheng Li,
Zhe Dang,
Oscar H. Ibarra,
Hsu-Chun Yen:
Signaling P Systems and Verification Problems.
ICALP 2005: 1462-1473 |
| 239 | EE | Ozgur D. Sahin,
Cagdas Evren Gerede,
Divyakant Agrawal,
Amr El Abbadi,
Oscar H. Ibarra,
Jianwen Su:
SPiDeR: P2P-Based Web Service Discovery.
ICSOC 2005: 157-169 |
| 238 | EE | Cagdas Evren Gerede,
Oscar H. Ibarra,
Bala Ravikumar,
Jianwen Su:
Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition.
IEEE SCC 2005: 103-112 |
| 237 | EE | Oscar H. Ibarra:
Some Computational Issues in Membrane Computing.
MFCS 2005: 39-51 |
| 236 | EE | Oscar H. Ibarra,
Sara Woodworth:
On Symport/Antiport P Systems with One or Two Symbols.
SYNASC 2005: 431-439 |
| 235 | EE | Zhe Dang,
Oscar H. Ibarra,
Cheng Li,
Gaoyan Xie:
On Model-Checking of P Systems.
UC 2005: 82-93 |
| 234 | EE | Oscar H. Ibarra,
Sara Woodworth,
Hsu-Chun Yen,
Zhe Dang:
On Symport/Antiport P Systems and Semilinear Sets.
Workshop on Membrane Computing 2005: 253-271 |
| 233 | EE | Oscar H. Ibarra:
Some Recent Results Concerning Deterministic P Systems.
Workshop on Membrane Computing 2005: 49-54 |
| 232 | EE | Oscar H. Ibarra,
Hsu-Chun Yen,
Zhe Dang:
On various notions of parallelism in P Systems.
Int. J. Found. Comput. Sci. 16(4): 683-705 (2005) |
| 231 | EE | Zhe Dang,
Oscar H. Ibarra:
On one-membrane P systems operating in sequential mode.
Int. J. Found. Comput. Sci. 16(5): 867-881 (2005) |
| 230 | EE | Zhe Dang,
Oscar H. Ibarra,
Zhi-Wei Sun:
On two-way nondeterministic finite automata with one reversal-bounded counter.
Theor. Comput. Sci. 330(1): 59-79 (2005) |
| 229 | EE | Oscar H. Ibarra:
On membrane hierarchy in P systems.
Theor. Comput. Sci. 334(1-3): 115-129 (2005) |
| 228 | EE | Zhe Dang,
Oscar H. Ibarra,
Jianwen Su:
On composition and lookahead delegation of e-services modeled by automata, .
Theor. Comput. Sci. 341(1-3): 344-363 (2005) |
| 227 | EE | Oscar H. Ibarra:
On determinism versus nondeterminism in P systems.
Theor. Comput. Sci. 344(2-3): 120-133 (2005) |
| 2004 |
|---|
| 226 | EE | Oscar H. Ibarra:
Automata-Theoretic Techniques for Analyzing Infinite-State Systems.
CIAA 2004: 1 |
| 225 | EE | Erzsébet Csuhaj-Varjú,
Oscar H. Ibarra,
György Vaszil:
On the Computational Complexity of P Automata.
DNA 2004: 76-89 |
| 224 | EE | Oscar H. Ibarra,
Hsu-Chun Yen,
Zhe Dang:
The Power of Maximal Parallelism in P Systems.
Developments in Language Theory 2004: 212-224 |
| 223 | EE | Zhe Dang,
Oscar H. Ibarra,
Pierluigi San Pietro,
Gaoyan Xie:
Real-Counter Automata and Their Decision Problems.
FSTTCS 2004: 198-210 |
| 222 | | Yasmín Pérez,
Rafael Gamboa,
Oscar H. Ibarra:
Modeling Affective Responses in Intelligent Tutoring Systems.
ICALT 2004 |
| 221 | EE | Cagdas Evren Gerede,
Richard Hull,
Oscar H. Ibarra,
Jianwen Su:
Automated composition of e-services: lookaheads.
ICSOC 2004: 252-262 |
| 220 | | Ömer Egecioglu,
Oscar H. Ibarra:
A Matrix q-Analogue of the Parikh Map.
IFIP TCS 2004: 125-138 |
| 219 | EE | Zhe Dang,
Oscar H. Ibarra,
Jianwen Su:
Composability of Infinite-State Activity Automata.
ISAAC 2004: 377-388 |
| 218 | EE | Oscar H. Ibarra:
P Systems: Some Recent Results and Research Problems.
UPP 2004: 225-237 |
| 217 | EE | Oscar H. Ibarra,
Louxin Zhang:
Computing And Combinatorics Conference -- Cocoon'02.
Int. J. Found. Comput. Sci. 15(1): 1 (2004) |
| 216 | EE | Jacir Luiz Bordim,
Oscar H. Ibarra,
Yasuaki Ito,
Koji Nakano:
Instance-Specific Solutions For Accelerating The Cky Parsing Of Large Context-Free Grammars.
Int. J. Found. Comput. Sci. 15(2): 403-415 (2004) |
| 215 | EE | Oscar H. Ibarra,
Zhe Dang:
On two-way FA with monotonic counters and quadratic Diophantine equations.
Theor. Comput. Sci. 312(2-3): 359-378 (2004) |
| 214 | EE | Oscar H. Ibarra,
Zhe Dang,
Ömer Egecioglu:
Catalytic P systems, semilinear sets, and vector addition systems.
Theor. Comput. Sci. 312(2-3): 379-399 (2004) |
| 213 | EE | Zhe Dang,
Tevfik Bultan,
Oscar H. Ibarra,
Richard A. Kemmerer:
Past pushdown timed automata and safety verification.
Theor. Comput. Sci. 313(1): 57-71 (2004) |
| 212 | EE | Oscar H. Ibarra:
On the computational complexity of membrane systems.
Theor. Comput. Sci. 320(1): 89-109 (2004) |
| 211 | EE | Oscar H. Ibarra:
Editorial.
Theor. Comput. Sci. 328(1-2): 1- (2004) |
| 2003 |
|---|
| 210 | | Oscar H. Ibarra,
Zhe Dang:
Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings
Springer 2003 |
| 209 | EE | Gaoyan Xie,
Zhe Dang,
Oscar H. Ibarra,
Pierluigi San Pietro:
Dense Counter Machines and Verification Problems.
CAV 2003: 93-105 |
| 208 | EE | Gaoyan Xie,
Zhe Dang,
Oscar H. Ibarra:
A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems.
ICALP 2003: 668-680 |
| 207 | EE | Oscar H. Ibarra,
Zhe Dang,
Ömer Egecioglu,
Gaurav Saxena:
Characterizations of Catalytic Membrane Computing Systems.
MFCS 2003: 480-489 |
| 206 | EE | Oscar H. Ibarra:
The Number of Membranes Matters.
Workshop on Membrane Computing 2003: 218-231 |
| 205 | | Mark Daley,
Oscar H. Ibarra,
Lila Kari,
Ian McQuillan,
Koji Nakano:
The ld and dlad Bio-Operations on Formal Languages.
Journal of Automata, Languages and Combinatorics 8(3): 477-498 (2003) |
| 204 | EE | Oscar H. Ibarra,
Zhe Dang:
Eliminating the storage tape in reachability constructions.
Theor. Comput. Sci. 1-3(299): 687-706 (2003) |
| 203 | | Oscar H. Ibarra,
Zhe Dang,
Pierluigi San Pietro:
Verification in loosely synchronous queue-connected discrete timed automata.
Theor. Comput. Sci. 290(3): 1713-1735 (2003) |
| 202 | EE | Zhe Dang,
Oscar H. Ibarra,
Richard A. Kemmerer:
Generalized discrete timed automata: decidable approximations for safety verificatio.
Theor. Comput. Sci. 296(1): 59-74 (2003) |
| 201 | EE | Mark Daley,
Oscar H. Ibarra,
Lila Kari:
Closure and decidability properties of some language classes with respect to ciliate bio-operations.
Theor. Comput. Sci. 306(1-3): 19-38 (2003) |
| 2002 |
|---|
| 200 | | Oscar H. Ibarra,
Louxin Zhang:
Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings
Springer 2002 |
| 199 | EE | Hongjun Zhu,
Jianwen Su,
Oscar H. Ibarra:
Trajectory queries and octagons in moving object databases.
CIKM 2002: 413-421 |
| 198 | EE | Oscar H. Ibarra,
Zhe Dang,
Zhi-Wei Sun:
Safety Verification for Two-Way Finite Automata with Monotonic Counters.
Developments in Language Theory 2002: 326-338 |
| 197 | EE | Oscar H. Ibarra,
Stephan Olariu,
Koji Nakano,
Jie Wu:
Workshop Introduction.
IPDPS 2002 |
| 196 | EE | Zhe Dang,
Oscar H. Ibarra,
Zhi-Wei Sun:
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter.
ISAAC 2002: 103-114 |
| 195 | EE | Hoda Mokhtar,
Jianwen Su,
Oscar H. Ibarra:
On Moving Object Queries.
PODS 2002: 188-198 |
| 194 | EE | Oscar H. Ibarra:
Verification in Queue-Connected Multicounter Machines.
Int. J. Found. Comput. Sci. 13(1): 115-127 (2002) |
| 193 | EE | Zhe Dang,
Oscar H. Ibarra:
The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications.
Int. J. Found. Comput. Sci. 13(6): 911-936 (2002) |
| 192 | EE | Tero Harju,
Oscar H. Ibarra,
Juhani Karhumäki,
Arto Salomaa:
Some Decision Problems Concerning Semilinearity and Commutation.
J. Comput. Syst. Sci. 65(2): 278-294 (2002) |
| 191 | | Oscar H. Ibarra,
Jianwen Su,
Zhe Dang,
Tevfik Bultan,
Richard A. Kemmerer:
Counter Machines and Verification Problems.
Theor. Comput. Sci. 289(1): 165-189 (2002) |
| 190 | | Oscar H. Ibarra,
Jianwen Su:
Augmenting the discrete timed automaton with other data structures.
Theor. Comput. Sci. 289(1): 191-204 (2002) |
| 2001 |
|---|
| 189 | EE | Zhe Dang,
Tevfik Bultan,
Oscar H. Ibarra,
Richard A. Kemmerer:
Past Pushdown Timed Automata.
CIAA 2001: 74-86 |
| 188 | EE | Zhe Dang,
Oscar H. Ibarra,
Richard A. Kemmerer:
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata.
COCOON 2001: 529-539 |
| 187 | EE | Zhe Dang,
Oscar H. Ibarra,
Pierluigi San Pietro:
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter.
FSTTCS 2001: 132-143 |
| 186 | EE | Tero Harju,
Oscar H. Ibarra,
Juhani Karhumäki,
Arto Salomaa:
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.
ICALP 2001: 579-590 |
| 185 | EE | Oscar H. Ibarra,
Zhe Dang:
On Removing the Pushdown Stack in Reachability Constructions.
ISAAC 2001: 244-256 |
| 184 | EE | Hongjun Zhu,
Jianwen Su,
Oscar H. Ibarra:
On Multi-way Spatial Joins with Direction Predicates.
SSTD 2001: 217-235 |
| 183 | EE | Jianwen Su,
Haiyan Xu,
Oscar H. Ibarra:
Moving Objects: Logical Relationships and Queries.
SSTD 2001: 3-19 |
| 182 | | Oscar H. Ibarra,
Tevfik Bultan,
Jianwen Su:
On Reachability and Safety in Infinite-State Systems.
Int. J. Found. Comput. Sci. 12(6): 821-836 (2001) |
| 2000 |
|---|
| 181 | | Zhe Dang,
Oscar H. Ibarra,
Tevfik Bultan,
Richard A. Kemmerer,
Jianwen Su:
Binary Reachability Analysis of Discrete Pushdown Timed Automata.
CAV 2000: 69-84 |
| 180 | EE | Oscar H. Ibarra:
Reachability and Safety in Queue Systems.
CIAA 2000: 145-156 |
| 179 | EE | Oscar H. Ibarra,
Jianwen Su:
Generalizing the Discrete Timed Automaton.
CIAA 2000: 157-169 |
| 178 | EE | Oscar H. Ibarra,
Tevfik Bultan,
Jianwen Su:
Reachability Analysis for Some Models of Infinite-State Transition Systems.
CONCUR 2000: 183-198 |
| 177 | EE | Oscar H. Ibarra,
Koji Nakano,
Stephan Olariu:
Workshop on Advances in Parallel and Distributed Computational Models.
IPDPS Workshops 2000: 101 |
| 176 | EE | Oscar H. Ibarra,
Jianwen Su,
Zhe Dang,
Tevfik Bultan,
Richard A. Kemmerer:
Conter Machines: Decidable Properties and Applications to Verification Problems.
MFCS 2000: 426-435 |
| 175 | EE | Hongjun Zhu,
Jianwen Su,
Oscar H. Ibarra:
Toward Spatial Joins for Polygons.
SSDBM 2000: 231-244 |
| 174 | EE | Hongjun Zhu,
Jianwen Su,
Oscar H. Ibarra:
Extending Rectangle Join Algorithms for Rectilinear Polygons.
Web-Age Information Management 2000: 247-258 |
| 173 | EE | Huican Zhu,
Tao Yang,
Qi Zheng,
David Watson,
Oscar H. Ibarra,
Terence R. Smith:
Adaptive Load Sharing for Clustered Digital Library Servers.
Int. J. on Digital Libraries 2(4): 225-235 (2000) |
| 172 | EE | Athanassios S. Poulakidas,
Ashok Srinivasan,
Ömer Egecioglu,
Oscar H. Ibarra,
Tao Yang:
Image compression for fast wavelet-based subregion retrieval.
Theor. Comput. Sci. 240(2): 447-469 (2000) |
| 1999 |
|---|
| 171 | EE | Hongjun Zhu,
Jianwen Su,
Oscar H. Ibarra:
An Index Structure for Spatial Joins in Linear Constraint Databases.
ICDE 1999: 636-643 |
| 170 | | Oscar H. Ibarra,
Jianwen Su:
Counter Machines: Decision Problems and Applications.
Jewels are Forever 1999: 84-96 |
| 169 | | Oscar H. Ibarra,
Jianwen Su:
A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries.
J. Comput. Syst. Sci. 59(1): 1-28 (1999) |
| 1998 |
|---|
| 168 | | Kyung-Yong Chwa,
Oscar H. Ibarra:
Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings
Springer 1998 |
| 167 | EE | Huican Zhu,
Tao Yang,
Qi Zheng,
David Watson,
Oscar H. Ibarra,
Terence R. Smith:
Adaptive Load Sharing for Clustered Digital Library Servers.
HPDC 1998: 235-242 |
| 166 | | Daniel Andresen,
Tao Yang,
Oscar H. Ibarra,
Ömer Egecioglu:
Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance.
J. Parallel Distrib. Comput. 49(1): 57-85 (1998) |
| 1997 |
|---|
| 165 | | Athanassios S. Poulakidas,
Ashok Srinivasan,
Ömer Egecioglu,
Oscar H. Ibarra,
Tao Yang:
A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval.
COCOON 1997: 353-362 |
| 164 | EE | Oscar H. Ibarra,
Jianwen Su:
On the Containment and Equivalence of Database Queries with Linear Constraints.
PODS 1997: 32-43 |
| 163 | | Oscar H. Ibarra,
Pedro C. Diniz,
Martin C. Rinard:
On the Complexity of Commutativity Analysis.
Int. J. Found. Comput. Sci. 8(1): 81- (1997) |
| 162 | | Yizhou Yu,
Oscar H. Ibarra,
Tao Yang:
Parallel Progressive Radiosity with Adaptive Meshing.
J. Parallel Distrib. Comput. 42(1): 30-41 (1997) |
| 161 | | Daniel Andresen,
Tao Yang,
Oscar H. Ibarra:
Toward a Scalable Distributed {WWW} Server on Workstation Clusters.
J. Parallel Distrib. Comput. 42(1): 91-100 (1997) |
| 160 | EE | Oscar H. Ibarra,
Nicholas Q. Trân,
Tao Yang:
On the Parallel Complexity of Loops.
Theor. Comput. Sci. 179(1-2): 381-395 (1997) |
| 1996 |
|---|
| 159 | | Daniel Andresen,
Tao Yang,
Ömer Egecioglu,
Oscar H. Ibarra,
Terence R. Smith:
Scalability Issues for High Performance Digital Libraries on the World Wide Web.
ADL 1996: 139-148 |
| 158 | | Oscar H. Ibarra,
Pedro C. Diniz,
Martin C. Rinard:
On the Complexity of Commutativity Analysis.
COCOON 1996: 323-332 |
| 157 | | Athanassios S. Poulakidas,
Ashok Srinivasan,
Ömer Egecioglu,
Oscar H. Ibarra,
Tao Yang:
Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval.
Data Compression Conference 1996: 465 |
| 156 | EE | Daniel Andresen,
Tao Yang,
Vegard Holmedahl,
Oscar H. Ibarra:
SWEB: Towards a Scalable World Wide Web Server on Multicomputers.
IPPS 1996: 850-856 |
| 155 | | Yizhou Yu,
Oscar H. Ibarra,
Tao Yang:
Parallel Progressive Radiosity with Adaptive Meshing.
IRREGULAR 1996: 159-170 |
| 154 | | Tao Yang,
Oscar H. Ibarra:
Performance Prediction in Symbolic Scheduling of Partitioned Programs with Weight Variation.
J. Parallel Distrib. Comput. 34(2): 171-182 (1996) |
| 1995 |
|---|
| 153 | | Oscar H. Ibarra,
Qi Zheng:
An Optimal Shortest Path Parallel Algorithm for Permutation Graphs.
J. Parallel Distrib. Comput. 24(1): 94-99 (1995) |
| 152 | EE | Oscar H. Ibarra,
Ting-Chuen Pong,
Stephen M. Sohn:
A note on parsing pattern languages.
Pattern Recognition Letters 16(2): 179-182 (1995) |
| 151 | | Oscar H. Ibarra,
Tao Jiang,
Nicholas Q. Trân,
Hui Wang:
New Decidability Results Concerning Two-Way Counter Machines.
SIAM J. Comput. 24(1): 123-137 (1995) |
| 1994 |
|---|
| 150 | | Myung Hee Kim,
Oscar H. Ibarra:
Transformations Between Boundary Codes, Run Length Codes, and Linear Quadtrees.
IPPS 1994: 120-125 |
| 149 | | Oscar H. Ibarra,
Nicholas Q. Trân:
On the Parallel Complexity of Solving Recurrence Equations.
ISAAC 1994: 469-477 |
| 148 | | Oscar H. Ibarra,
Tao Jiang:
On Some Open Problems Concerning the Complexity of Cellular Arrays.
Results and Trends in Theoretical Computer Science 1994: 183-196 |
| 147 | | Oscar H. Ibarra,
Nicholas Q. Trân:
On Communication-Bounded Synchronized Alternating Finite Automata.
Acta Inf. 31(4): 315-327 (1994) |
| 146 | | Oscar H. Ibarra,
Qi Zheng:
Some Efficient Algorithms for Permutation Graphs.
J. Algorithms 16(3): 453-469 (1994) |
| 145 | | Oscar H. Ibarra,
Myung Hee Kim:
Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube.
J. Parallel Distrib. Comput. 20(3): 303-316 (1994) |
| 144 | | Tao Jiang,
Oscar H. Ibarra,
Hui Wang:
Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata.
Theor. Comput. Sci. 125(2): 243-257 (1994) |
| 1993 |
|---|
| 143 | | Oscar H. Ibarra,
Tao Jiang,
Nicholas Q. Trân,
Hui Wang:
New Decidability Results Concerning Two-way Counter Machines and Applications.
ICALP 1993: 313-324 |
| 142 | | Oscar H. Ibarra,
Qi Zheng:
Finding Articulation Points and Bridges of Permutation Graphs.
ICPP 1993: 77-80 |
| 141 | | Oscar H. Ibarra,
Qi Zheng:
On the Shortest Path Problems for Permutation Graphs.
IPPS 1993: 198-204 |
| 140 | | Oscar H. Ibarra,
Nicholas Q. Trân:
On the Communication Complexity of Parallel Computation.
MFCS 1993: 517-526 |
| 139 | | Oscar H. Ibarra,
Tao Jiang,
Nicholas Q. Trân,
Hui Wang:
On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages.
STACS 1993: 354-364 |
| 138 | | Oscar H. Ibarra,
Tao Jiang,
Nicholas Q. Trân,
Hui Wang:
On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages.
Int. J. Found. Comput. Sci. 4(2): 135-146 (1993) |
| 137 | | Oscar H. Ibarra,
Hui Wang,
Tao Jiang:
On Efficient Parallel Algorithms for Solving Set Recurrence Equations.
J. Algorithms 14(2): 244-257 (1993) |
| 136 | | Oscar H. Ibarra,
M. H. Kim:
Quadtree Building Algorithms on an SIMD Hypercube.
J. Parallel Distrib. Comput. 18(1): 71-76 (1993) |
| 135 | | Oscar H. Ibarra,
Nicholas Q. Trân:
A Note on Simple Programs with Two Variables.
Theor. Comput. Sci. 112(2): 391-397 (1993) |
| 134 | | Oscar H. Ibarra,
Nicholas Q. Trân:
Synchronized Finite Automata and 2DFA Reductions.
Theor. Comput. Sci. 115(2): 261-275 (1993) |
| 1992 |
|---|
| 133 | | Oscar H. Ibarra,
Nicholas Q. Trân:
New Results Concerning Synchronized Finite Automata.
ICALP 1992: 126-137 |
| 132 | | Oscar H. Ibarra,
Myung Hee Kim:
Quadtree Building Algorithms on an SIMD Hypercube.
IPPS 1992: 22-27 |
| 131 | | Oscar H. Ibarra,
Tao Jiang,
Hui Wang:
String Editing on a One-Way Linear Array of Finite-State Machines.
IEEE Trans. Computers 41(1): 112-118 (1992) |
| 130 | EE | Tao Jiang,
Oscar H. Ibarra,
Hui Wang,
Qi Zheng:
A hierarchy result for 2-dimensional TM's operating in small space.
Inf. Sci. 64(1-2): 49-56 (1992) |
| 129 | | J. Andrew Holey,
Oscar H. Ibarra:
Iterative algorithms for the planar convex hull problem on mesh-connected arrays.
Parallel Computing 18(3): 281-296 (1992) |
| 128 | | Oscar H. Ibarra,
Nicholas Q. Trân:
On Space-Bounded Synchronized Alternating Turing Machines.
Theor. Comput. Sci. 99(2): 243-264 (1992) |
| 127 | | Oscar H. Ibarra,
Tao Jiang,
Hui Wang:
A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars.
Theor. Comput. Sci. 99(2): 301-313 (1992) |
| 1991 |
|---|
| 126 | | Oscar H. Ibarra,
Nicholas Q. Trân:
On Space-bounded Synchronized Alternating Turing Machines.
FCT 1991: 248-257 |
| 125 | | J. Andrew Holey,
Oscar H. Ibarra:
Triangulation Voronoi Diagram and Convex Hull in k-Space on Mesh-Connected Arrays and Hypercubes.
ICPP (3) 1991: 147-150 |
| 124 | | J. Andrew Holey,
Oscar H. Ibarra:
Triangulation in a Plane and 3-D Convex Hull on Mesh-Connected Arrays and Hypercubes.
IPPS 1991: 10-17 |
| 123 | | Oscar H. Ibarra,
Myung Hee Kim:
Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube.
IPPS 1991: 76-83 |
| 122 | | Oscar H. Ibarra,
Tao Jiang,
Hui Wang:
Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata.
MFCS 1991: 221-230 |
| 121 | | Oscar H. Ibarra:
On Resetiting DLBA's.
Bulletin of the EATCS 44: 190-191 (1991) |
| 120 | | Oscar H. Ibarra,
Ting-Chuen Pong,
Stephen M. Sohn:
Parallel Regognition and Parsing on the Hypercube.
IEEE Trans. Computers 40(6): 764-770 (1991) |
| 119 | | Oscar H. Ibarra,
Tao Jiang,
Jik H. Chang,
Bala Ravikumar:
Some Classes of Languages in NC¹
Inf. Comput. 90(1): 86-106 (1991) |
| 118 | | Oscar H. Ibarra,
Tao Jiang:
Learning Regular Languages from Counterexamples.
J. Comput. Syst. Sci. 43(2): 299-316 (1991) |
| 117 | | Oscar H. Ibarra,
Tao Jiang:
The Power of Alternating One-Reversal Counters and Stacks.
SIAM J. Comput. 20(2): 278-290 (1991) |
| 116 | | Oscar H. Ibarra,
Hui Wang:
Parallel Parsing on a One-Way Linear Array of Finite-State Machines.
Theor. Comput. Sci. 85(1): 53-74 (1991) |
| 1990 |
|---|
| 115 | | J. Andrew Holey,
Oscar H. Ibarra:
Iterative Algorithms for Planar Convex Hull on Mesh-Connected Arrays.
ICPP (3) 1990: 102-109 |
| 114 | | Oscar H. Ibarra,
Tao Jiang,
Hui Wang:
String Editing on a One-Way Linear Array of Finite-State Machines.
ICPP (3) 1990: 173-176 |
| 113 | EE | Oscar H. Ibarra,
Hui Wang,
Tao Jiang:
Efficient parallel algorithms for solving set recurrence equations and applications.
SPDP 1990: 480-487 |
| 112 | EE | Oscar H. Ibarra,
Stephen M. Sohn:
On Mapping Systolic Algorithms onto the Hypercube.
IEEE Trans. Parallel Distrib. Syst. 1(1): 48-63 (1990) |
| 111 | EE | Oscar H. Ibarra,
Tao Jiang,
Jik H. Chang,
Michael A. Palis:
Systolic algorithms for some scheduling and graph problems.
VLSI Signal Processing 1(4): 307-320 (1990) |
| 1989 |
|---|
| 110 | | Oscar H. Ibarra,
Tao Jiang,
Hui Wang:
Parallel Parsing on a One-way Linear Array of Finite-State Machines.
FSTTCS 1989: 291-300 |
| 109 | | Oscar H. Ibarra,
Stephen M. Sohn:
On Mapping Systolic Algorithms onto the Hypercube.
ICPP (1) 1989: 121-124 |
| 108 | | Oscar H. Ibarra,
Michael A. Palis:
An Efficient All-Parses Systolic Algorithm for General Context-Free Parsing.
WADS 1989: 403-419 |
| 107 | | Oscar H. Ibarra,
Tao Jiang:
Optimal Simulation of Tree Arrays by Linear Arrays.
Inf. Process. Lett. 30(6): 295-302 (1989) |
| 106 | | Oscar H. Ibarra,
Tao Jiang,
Jik H. Chang:
On Iterative and Cellular Tree Arrays.
J. Comput. Syst. Sci. 38(3): 452-473 (1989) |
| 105 | | Bala Ravikumar,
Oscar H. Ibarra:
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation.
SIAM J. Comput. 18(6): 1263-1282 (1989) |
| 104 | | Jik H. Chang,
Oscar H. Ibarra,
Michael A. Palis:
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATMs and Space-Bounded TMs.
Theor. Comput. Sci. 68(1): 19-36 (1989) |
| 1988 |
|---|
| 103 | | Oscar H. Ibarra,
Tao Jiang,
Bala Ravikumar,
Jik H. Chang:
On Some Languages in NC.
AWOC 1988: 64-73 |
| 102 | EE | Oscar H. Ibarra,
Tao Jiang:
Learning Regular Languages From Counterexamples.
COLT 1988: 371-385 |
| 101 | | Jik H. Chang,
Oscar H. Ibarra,
Michael A. Palis:
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's.
ICALP 1988: 119-132 |
| 100 | | David Hung-Chang Du,
Oscar H. Ibarra,
J. Fernando Naveda:
On Two-Dimensional Via Assignment for Single-Row Routing.
IEEE Trans. Computers 37(6): 721-727 (1988) |
| 99 | | Jik H. Chang,
Oscar H. Ibarra,
Moon-Jung Chung,
Kotesh K. Rao:
Systolic Tree Implementation of Data Structures.
IEEE Trans. Computers 37(6): 727-735 (1988) |
| 98 | EE | Jik H. Chang,
Oscar H. Ibarra,
Ting-Chuen Pong,
Stephen M. Sohn:
Two-Dimensional Convolution on a Pyramid Computer.
IEEE Trans. Pattern Anal. Mach. Intell. 10(4): 590-593 (1988) |
| 97 | | Oscar H. Ibarra,
Tao Jiang,
Bala Ravikumar:
Some Subclasses of Context-Free Languages In NC1.
Inf. Process. Lett. 29(3): 111-117 (1988) |
| 96 | EE | Jik H. Chang,
Oscar H. Ibarra,
Anastasios Vergis:
On the power of one-way communication.
J. ACM 35(3): 697-726 (1988) |
| 95 | | Oscar H. Ibarra,
Bala Ravikumar:
Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties.
Mathematical Systems Theory 21(1): 1-17 (1988) |
| 94 | | Oscar H. Ibarra,
Tao Jiang:
Relating the Power of Cellular Arrays to Their Closure Properties.
Theor. Comput. Sci. 57: 225-238 (1988) |
| 93 | | Oscar H. Ibarra,
Michael A. Palis:
Two-Dimensional Iterative Arrays: Characterizations and Applications.
Theor. Comput. Sci. 57: 47-86 (1988) |
| 1987 |
|---|
| 92 | | Oscar H. Ibarra,
Bala Ravikumar:
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation.
FSTTCS 1987: 26-43 |
| 91 | | Oscar H. Ibarra,
Tao Jiang:
On the Computing Power of One-Way Cellular Arrays.
ICALP 1987: 550-562 |
| 90 | | Jik H. Chang,
Oscar H. Ibarra,
Ting-Chuen Pong,
Stephen M. Sohn:
Two-Dimensional Convolution on a Pyramid Computer.
ICPP 1987: 780-782 |
| 89 | | Jik H. Chang,
Oscar H. Ibarra,
Michael A. Palis:
Parallel Parsing on a One-Way Array of Finite-State Machines.
IEEE Trans. Computers 36(1): 64-75 (1987) |
| 88 | EE | David Hung-Chang Du,
Oscar H. Ibarra,
J. Fernando Naveda:
Single-Row Routing with Crossover Bound.
IEEE Trans. on CAD of Integrated Circuits and Systems 6(2): 190-201 (1987) |
| 87 | | Jik H. Chang,
Oscar H. Ibarra,
Bala Ravikumar,
Leonard Berman:
Some Observations Concerning Alternating Turing Machines Using Small Space.
Inf. Process. Lett. 25(1): 1-9 (1987) |
| 86 | | Oscar H. Ibarra,
Michael A. Palis:
On Efficient Simulations of Systolic Arrays of Random-Access Machines.
SIAM J. Comput. 16(2): 367-377 (1987) |
| 85 | | Oscar H. Ibarra,
Tao Jiang:
On One-Way Cellular Arrays.
SIAM J. Comput. 16(6): 1135-1154 (1987) |
| 1986 |
|---|
| 84 | | Jik H. Chang,
Oscar H. Ibarra,
Anastasios Vergis:
On the Power of One-Way Communication
FOCS 1986: 455-464 |
| 83 | | Jik H. Chang,
Moon-Jung Chung,
Oscar H. Ibarra,
Kotesh K. Rao:
Systolic Tree Implementation of Data Structures.
ICPP 1986: 669-671 |
| 82 | | Jik H. Chang,
Oscar H. Ibarra,
Michael A. Palis:
Parallel Parsing on a One-Way Array of Finite-State Machines.
ICPP 1986: 887-894 |
| 81 | | Oscar H. Ibarra:
Systolic Arrays: Characterizations and Complexity.
MFCS 1986: 140-153 |
| 80 | | Oscar H. Ibarra,
Bala Ravikumar:
On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers.
STACS 1986: 171-179 |
| 79 | | Oscar H. Ibarra,
Sam M. Kim,
Michael A. Palis:
Designing Systolic Algorithms Using Sequential Machines.
IEEE Trans. Computers 35(6): 531-542 (1986) |
| 78 | | Jik H. Chang,
Oscar H. Ibarra,
Michael A. Palis,
Bala Ravikumar:
On Pebble Automata.
Theor. Comput. Sci. 44: 111-121 (1986) |
| 1985 |
|---|
| 77 | | Oscar H. Ibarra,
Louis E. Rosier:
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs
Information and Control 65(1): 18-41 (1985) |
| 76 | | Oscar H. Ibarra,
Louis E. Rosier:
On Simple Programs with Primitive Conditional Statements
Information and Control 65(1): 42-62 (1985) |
| 75 | | Oscar H. Ibarra,
Sam M. Kim,
Louis E. Rosier:
Some Characterizations of Multihead Finite Automata
Information and Control 67(1-3): 114-125 (1985) |
| 74 | | Oscar H. Ibarra,
Sam M. Kim,
Louis E. Rosier:
On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's
Information and Control 67(1-3): 126-143 (1985) |
| 73 | | Oscar H. Ibarra,
Sam M. Kim,
Shlomo Moran:
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications.
SIAM J. Comput. 14(2): 426-447 (1985) |
| 72 | | Oscar H. Ibarra,
Michael A. Palis,
Jik H. Chang:
On Efficient Recognition of Transductions and Relations.
Theor. Comput. Sci. 39: 89-106 (1985) |
| 71 | | Oscar H. Ibarra,
Michael A. Palis,
Sam M. Kim:
Fast Parallel Language Recognition by Cellular Automata.
Theor. Comput. Sci. 41: 231-246 (1985) |
| 1984 |
|---|
| 70 | | Oscar H. Ibarra,
Michael A. Palis,
Sam M. Kim:
Designing Systolic Algorithms Using Sequential Machines
FOCS 1984: 46-55 |
| 69 | | Oscar H. Ibarra,
Sam M. Kim,
Louis E. Rosier:
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs.
ICALP 1984: 247-259 |
| 68 | | Oscar H. Ibarra,
Louis E. Rosier:
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract).
MFCS 1984: 330-338 |
| 67 | | Oscar H. Ibarra,
Sam M. Kim:
A Characterization of Systolic Binary Tree Automata and Applications.
Acta Inf. 21: 193-207 (1984) |
| 66 | | Oscar H. Ibarra,
Brian S. Leininger,
Louis E. Rosier:
A Note on the Complexity of Program Evaluation.
Mathematical Systems Theory 17(2): 85-96 (1984) |
| 65 | | Oscar H. Ibarra,
Sam M. Kim:
Characterizations and Computational Complexity of Systolic Trellis Automata.
Theor. Comput. Sci. 29: 123-153 (1984) |
| 1983 |
|---|
| 64 | EE | Oscar H. Ibarra,
Shlomo Moran:
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
J. ACM 30(1): 217-228 (1983) |
| 63 | EE | Oscar H. Ibarra,
Brian S. Leininger:
On the Simplification and Equivalence Problems for Straight-Line Programs
J. ACM 30(3): 641-656 (1983) |
| 62 | | Oscar H. Ibarra,
Brian S. Leininger:
On the Zero-Inequivalence Problem for Loop Programs.
J. Comput. Syst. Sci. 26(1): 47-64 (1983) |
| 61 | | Eitan M. Gurari,
Oscar H. Ibarra:
A Note on Finitely-Valued and Finitely Ambiguous Transducers.
Mathematical Systems Theory 16(1): 61-66 (1983) |
| 60 | | Oscar H. Ibarra,
Shlomo Moran:
Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's.
SIAM J. Comput. 12(2): 388-394 (1983) |
| 59 | | Tat-hung Chan,
Oscar H. Ibarra:
On the Space and Time Complexity of Functions Computable by Simple Programs.
SIAM J. Comput. 12(4): 708-716 (1983) |
| 58 | | Tat-hung Chan,
Oscar H. Ibarra:
On the Finite-Valuedness Problem for Sequential Machines.
Theor. Comput. Sci. 23: 95-101 (1983) |
| 57 | | Oscar H. Ibarra:
On Some Decision Questions Concerning Pushdown Machines.
Theor. Comput. Sci. 24: 313-322 (1983) |
| 56 | | Oscar H. Ibarra,
Shlomo Moran,
Louis E. Rosier:
On the Control Power of Integer Division.
Theor. Comput. Sci. 24: 35-52 (1983) |
| 55 | | Oscar H. Ibarra,
Louis E. Rosier:
Simple Programming Languages and Restricted Classes of Turing Machines.
Theor. Comput. Sci. 26: 197-220 (1983) |
| 1982 |
|---|
| 54 | EE | Eitan M. Gurari,
Oscar H. Ibarra:
Two-Way Counter Machines and Diophantine Equations.
J. ACM 29(3): 863-873 (1982) |
| 53 | | Oscar H. Ibarra,
Shlomo Moran,
Roger Hui:
A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications.
J. Algorithms 3(1): 45-56 (1982) |
| 52 | | Oscar H. Ibarra,
Shlomo Moran:
On Some Decision Problems for RAM Programs.
J. Comput. Syst. Sci. 24(1): 69-81 (1982) |
| 51 | | Eitan M. Gurari,
Oscar H. Ibarra:
(Semi)Alternating Stack Automata.
Mathematical Systems Theory 15(3): 211-224 (1982) |
| 50 | | Oscar H. Ibarra,
Brian S. Leininger:
Straight-Line Programs with One Input Variable.
SIAM J. Comput. 11(1): 1-14 (1982) |
| 49 | | Oscar H. Ibarra,
Brian S. Leininger:
The Complexity of the Equivalence Problem for Simple Loop-Free Programs.
SIAM J. Comput. 11(1): 15-27 (1982) |
| 48 | | Eitan M. Gurari,
Oscar H. Ibarra:
Some Simplified Undecidable and NP-Hard Problems for Simple Programs.
Theor. Comput. Sci. 17: 55-73 (1982) |
| 47 | | Oscar H. Ibarra,
Brian S. Leininger,
Shlomo Moran:
On the Complexity of Simple Arithmetic Expressions.
Theor. Comput. Sci. 19: 17-28 (1982) |
| 46 | | Oscar H. Ibarra:
2DST Mapppings on Languages and Related Problems.
Theor. Comput. Sci. 19: 219-227 (1982) |
| 1981 |
|---|
| 45 | | Eitan M. Gurari,
Oscar H. Ibarra:
Two-Way Counter Machines and Diophantine Equations
FOCS 1981: 45-52 |
| 44 | | Oscar H. Ibarra,
Brian S. Leininger,
Shlomo Moran:
On the Complexity of Simple Arithmetic Expressions.
ICALP 1981: 294-304 |
| 43 | | Eitan M. Gurari,
Oscar H. Ibarra:
The Complexity of Decision Problems for Finite-Turn Multicounter Machines.
ICALP 1981: 495-505 |
| 42 | | Oscar H. Ibarra,
Shlomo Moran,
Louis E. Rosier:
Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems.
Inf. Process. Lett. 12(5): 227-232 (1981) |
| 41 | | Oscar H. Ibarra,
Shlomo Moran:
Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication.
Inf. Process. Lett. 13(1): 12-15 (1981) |
| 40 | | Oscar H. Ibarra,
Louis E. Rosier:
On the Decidability of Equivalence for Deterministic Pushdown Transducers.
Inf. Process. Lett. 13(3): 89-93 (1981) |
| 39 | EE | Eitan M. Gurari,
Oscar H. Ibarra:
The Complexity of the Equivalence Problem for Simple Programs.
J. ACM 28(3): 535-560 (1981) |
| 38 | | Eitan M. Gurari,
Oscar H. Ibarra:
The Complexity of Decision Problems for Finite-Turn Multicounter Machines.
J. Comput. Syst. Sci. 22(2): 220-229 (1981) |
| 37 | | Oscar H. Ibarra,
Louis E. Rosier:
On Restricted One-counter Machines.
Mathematical Systems Theory 14: 241-245 (1981) |
| 36 | | Oscar H. Ibarra,
Brian S. Leininger:
Characterizations of Presburger Functions.
SIAM J. Comput. 10(1): 22-39 (1981) |
| 35 | | Eitan M. Gurari,
Oscar H. Ibarra:
The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets.
Theor. Comput. Sci. 13: 295-314 (1981) |
| 1980 |
|---|
| 34 | | Oscar H. Ibarra,
Brian S. Leininger:
The Complexity of the Equivalence Problem for Straight-Line Programs
STOC 1980: 273-280 |
| 33 | | Oscar H. Ibarra,
Shlomo Moran,
Louis E. Rosier:
A Note on the Parallel Complexity of Computing the Rank of Order n Matrices.
Inf. Process. Lett. 11(4/5): 162 (1980) |
| 32 | | Eitan M. Gurari,
Oscar H. Ibarra:
Path Systems: Constructions, Solutions and Applications.
SIAM J. Comput. 9(2): 348-374 (1980) |
| 1979 |
|---|
| 31 | | Eitan M. Gurari,
Oscar H. Ibarra:
The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs
STOC 1979: 142-152 |
| 30 | | Eitan M. Gurari,
Oscar H. Ibarra:
On the Space Complexity of Recursive Algorithms.
Inf. Process. Lett. 8(5): 267-271 (1979) |
| 29 | EE | Eitan M. Gurari,
Oscar H. Ibarra:
An NP-Complete Number-Theoretic Problem.
J. ACM 26(3): 567-581 (1979) |
| 28 | | Eitan M. Gurari,
Oscar H. Ibarra:
Some Decision Problems Concerning Sequential Transducers and Checking Automata.
J. Comput. Syst. Sci. 18(1): 18-34 (1979) |
| 27 | | Eitan M. Gurari,
Oscar H. Ibarra:
Simple Counter Machines and Number-Theoretic Problems.
J. Comput. Syst. Sci. 19(2): 145-162 (1979) |
| 26 | | Oscar H. Ibarra:
Restricted One-Counter Machines with Undecidable Universe Problems.
Mathematical Systems Theory 13: 181-186 (1979) |
| 1978 |
|---|
| 25 | | Eitan M. Gurari,
Oscar H. Ibarra:
An NP-Complete Number-Theoretic Problem
STOC 1978: 205-215 |
| 24 | EE | Oscar H. Ibarra:
Reversal-Bounded Multicounter Machines and Their Decision Problems.
J. ACM 25(1): 116-133 (1978) |
| 23 | | Oscar H. Ibarra:
The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications.
SIAM J. Comput. 7(4): 524-532 (1978) |
| 22 | | Oscar H. Ibarra:
On Two-Way Sequential Transductions of Full Semi-AFL's.
Theor. Comput. Sci. 7: 287-309 (1978) |
| 1977 |
|---|
| 21 | | Oscar H. Ibarra:
The Unsolvability of the Equivalence Problem for epsilon-free NGSM's with Unary Input (Output) Alphabet and Applications
FOCS 1977: 74-81 |
| 20 | EE | Oscar H. Ibarra,
Chul E. Kim:
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors.
J. ACM 24(2): 280-289 (1977) |
| 19 | | Teofilo F. Gonzalez,
Oscar H. Ibarra,
Sartaj Sahni:
Bounds for LPT Schedules on Uniform Processors.
SIAM J. Comput. 6(1): 155-166 (1977) |
| 1976 |
|---|
| 18 | | Oscar H. Ibarra,
Chul E. Kim:
A Useful Device for Showing the Solvability of Some Decision Problems
STOC 1976: 135-140 |
| 17 | | Oscar H. Ibarra,
Chul E. Kim:
A Useful Device for Showing the Solvability of Some Decision Problems.
J. Comput. Syst. Sci. 13(2): 153-160 (1976) |
| 16 | | Oscar H. Ibarra,
Sartaj Sahni,
Chul E. Kim:
Finite Automata with Multiplication.
Theor. Comput. Sci. 2(3): 271-294 (1976) |
| 1975 |
|---|
| 15 | | Oscar H. Ibarra,
Sartaj Sahni:
Polynomially Complete Fault Detection Problems.
IEEE Trans. Computers 24(3): 242-249 (1975) |
| 14 | EE | Oscar H. Ibarra,
Chul E. Kim:
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems.
J. ACM 22(4): 463-468 (1975) |
| 13 | | Oscar H. Ibarra,
Sartaj Sahni:
Hierarchies of Turing Machines with Restricted Tape Alphabet Size.
J. Comput. Syst. Sci. 11(1): 56-67 (1975) |
| 1974 |
|---|
| 12 | | Oscar H. Ibarra,
Chul E. Kim:
On 3-Head Versus 2-Head Finite Automata
Acta Inf. 4: 193-200 (1974) |
| 11 | | Oscar H. Ibarra:
A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata.
Inf. Process. Lett. 3(1): 25-28 (1974) |
| 10 | | Oscar H. Ibarra:
A Hierarchy Theorem for Polynomial-Space Recognition.
SIAM J. Comput. 3(3): 184-187 (1974) |
| 1973 |
|---|
| 9 | EE | Oscar H. Ibarra:
Controlled pushdown automata.
Inf. Sci. 6: 327-342 (1973) |
| 8 | | Oscar H. Ibarra:
On Two-way Multihead Automata.
J. Comput. Syst. Sci. 7(1): 28-36 (1973) |
| 1972 |
|---|
| 7 | EE | Oscar H. Ibarra:
A Note Concerning Nondeterministic Tape Complexities.
J. ACM 19(4): 608-612 (1972) |
| 1971 |
|---|
| 6 | | Oscar H. Ibarra:
Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata.
J. Comput. Syst. Sci. 5(2): 88-117 (1971) |
| 5 | | Oscar H. Ibarra:
Characterizations of Transductions Defined by Abstract Families of Transducers.
Mathematical Systems Theory 5(3): 271-281 (1971) |
| 1970 |
|---|
| 4 | | Oscar H. Ibarra:
Simple Matrix Languages
Information and Control 17(4): 359-394 (1970) |
| 3 | | Ronald V. Book,
Sheila A. Greibach,
Oscar H. Ibarra,
Ben Wegbreit:
Tape-Bounded Turing Acceptors and Principal AFLs.
J. Comput. Syst. Sci. 4(6): 622-625 (1970) |
| 1968 |
|---|
| 2 | | Michael A. Harrison,
Oscar H. Ibarra:
Multi-Tape and Multi-Head Pushdown Automata
Information and Control 13(5): 433-470 (1968) |
| 1967 |
|---|
| 1 | | Jim Gray,
Michael A. Harrison,
Oscar H. Ibarra:
Two-Way Pushdown Automata
Information and Control 11(1/2): 30-70 (1967) |
