What is he best known for?
The fields of study he is best known for:
- Algorithm
- Programming language
- Operating system
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 most cited work include:
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems (816 citations)
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors (716 citations)
- Reversal-Bounded Multicounter Machines and Their Decision Problems (403 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Discrete mathematics (46.64%)
- Combinatorics (28.03%)
- Theoretical computer science (23.99%)
What were the highlights of his more recent work (between 2010-2021)?
- Discrete mathematics (46.64%)
- Decidability (22.42%)
- Pushdown automaton (13.68%)
In recent papers he was focusing on the following fields of study:
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.
Between 2010 and 2021, his most popular works were:
- Automata-based symbolic string analysis for vulnerability detection (46 citations)
- RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA (36 citations)
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES (31 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Operating system
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.
