2008 - Member of Academia Europaea
1995 - ACM Fellow For contributions to the design and analysis of algorithms, the theory of computation, computational complexity, and parallel computing.
1993 - Fellow of the American Association for the Advancement of Science (AAAS)
1984 - Fellow of John Simon Guggenheim Memorial Foundation
His primary areas of investigation include Discrete mathematics, Algorithm, Theoretical computer science, Combinatorics and Nondeterministic algorithm. His work carried out in the field of Discrete mathematics brings together such families of science as Finite-state machine, Decision problem and Regular language. His Time complexity, Membrane computing, Computational complexity theory and Alternating Turing machine study in the realm of Algorithm interacts with subjects such as Power.
His studies in Theoretical computer science integrate themes in fields like Context-free language and Turing machine. His biological study spans a wide range of topics, including Rank, Class, Parallel algorithm, Order and Pushdown automaton. In his research on the topic of Pushdown automaton, Counter machine and Mathematical optimization is strongly related with Bounded function.
His scientific interests lie mostly in Discrete mathematics, Combinatorics, Theoretical computer science, Decidability and Algorithm. His Discrete mathematics research is multidisciplinary, incorporating perspectives in Automaton, Pushdown automaton and Bounded function. His Combinatorics study incorporates themes from Nondeterministic finite automaton, Set and Counter machine.
His Theoretical computer science research is multidisciplinary, relying on both Computational complexity theory, Formal language and Turing machine. His research in Decidability intersects with topics in Diophantine equation, Equivalence, Decision problem and Reachability. His work on Time complexity, Parallel algorithm and Computation as part of general Algorithm research is often related to Systolic array, thus linking different fields of science.
Oscar H. Ibarra focuses on Discrete mathematics, Decidability, Pushdown automaton, Automaton and Theoretical computer science. His Discrete mathematics research is multidisciplinary, incorporating elements of Bounded function, Set and Combinatorics. He focuses mostly in the field of Combinatorics, narrowing it down to matters related to State and, in some cases, Integer.
The study incorporates disciplines such as Closure, Decision problem, Nondeterministic finite automaton and Computation in addition to Decidability. His Automaton research incorporates themes from Head, Stack, String and Turing machine. His study explores the link between Theoretical computer science and topics such as Finite-state machine that cross with problems in Automata theory.
His primary areas of study are Discrete mathematics, Decidability, Theoretical computer science, Nondeterministic algorithm and Automaton. His Discrete mathematics research includes themes of Bounded function, Set and Combinatorics. His Decidability study integrates concerns from other disciplines, such as Reduction, State, Decision problem and Pushdown automaton.
His Theoretical computer science study combines topics in areas such as Finite-state machine and Formal language. The various areas that Oscar H. Ibarra examines in his Nondeterministic algorithm study include Deterministic pushdown automaton, Suffix, Regular language and Quotient. Oscar H. Ibarra has included themes like Similarity and String in his Automaton study.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Oscar H. Ibarra;Chul E. Kim.
Journal of the ACM (1975)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Oscar H. Ibarra;Chul E. Kim.
Journal of the ACM (1977)
Reversal-Bounded Multicounter Machines and Their Decision Problems
Oscar H. Ibarra.
Journal of the ACM (1978)
Polynomially Complete Fault Detection Problems
O.H. Ibarra;S.K. Sahni.
IEEE Transactions on Computers (1975)
Bounds for LPT Schedules on Uniform Processors
Teofilo F. Gonzalez;Oscar H. Ibarra;Sartaj Sahni.
SIAM Journal on Computing (1977)
SWEB: towards a scalable World Wide Web server on multicomputers
D. Andresen;Tao Yang;V. Holmedahl;O.H. Ibarra.
international conference on parallel processing (1996)
Asynchronous spiking neural P systems
Matteo Cavaliere;Oscar H. Ibarra;Gheorghe Pun;Omer Egecioglu.
Theoretical Computer Science (2009)
A generalization of the fast LUP matrix decomposition algorithm and applications
Oscar H Ibarra;Shlomo Moran;Roger Hui.
Journal of Algorithms (1982)
The complexity of decision problems for finite-turn multicounter machines
Eitan M. Gurari;Oscar H. Ibarra.
Journal of Computer and System Sciences (1981)
Automated composition of e-services: lookaheads
Çagdaş Evren Gerede;Richard Hull;Oscar H. Ibarra;Jianwen Su.
international conference on service oriented computing (2004)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: