Oscar H. Ibarra

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