What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Quantum mechanics
Karem A. Sakallah mainly investigates Boolean satisfiability problem, Theoretical computer science, Algorithm, Boolean function and #SAT.
In the field of Boolean satisfiability problem, his study on Unsatisfiable core overlaps with subjects such as Graph automorphism.
His Theoretical computer science research includes themes of Routing and Optimization problem.
His Algorithm research integrates issues from Equivalence, Electronic circuit, Pruning, Topology and Nonlinear system.
His #SAT research is multidisciplinary, incorporating perspectives in Combinational logic, Backtracking, And-inverter graph and Artificial intelligence.
His Search algorithm research incorporates elements of Search tree, Machine learning, Conflict-Driven Clause Learning and GRASP.
His most cited work include:
- GRASP: a search algorithm for propositional satisfiability (1141 citations)
- GRASP—a new search algorithm for satisfiability (857 citations)
- Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints (255 citations)
What are the main themes of his work throughout his whole career to date?
Karem A. Sakallah spends much of his time researching Theoretical computer science, Algorithm, Boolean satisfiability problem, Satisfiability and Boolean function.
The study incorporates disciplines such as Boolean circuit, And-inverter graph, Electronic design automation and Search algorithm in addition to Theoretical computer science.
As part of one scientific family, Karem A. Sakallah deals mainly with the area of Search algorithm, narrowing it down to issues related to the Artificial intelligence, and often GRASP and Search tree.
Karem A. Sakallah focuses mostly in the field of Algorithm, narrowing it down to matters related to Static timing analysis and, in some cases, Delay calculation and Transistor.
Karem A. Sakallah interconnects #SAT, Maximum satisfiability problem, Computability, Solver and Integer programming in the investigation of issues within Boolean satisfiability problem.
His Boolean function study incorporates themes from Routing, Logic synthesis and Boolean algebra.
He most often published in these fields:
- Theoretical computer science (36.70%)
- Algorithm (34.86%)
- Boolean satisfiability problem (34.40%)
What were the highlights of his more recent work (between 2009-2021)?
- Theoretical computer science (36.70%)
- Programming language (7.34%)
- Satisfiability (17.43%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Theoretical computer science, Programming language, Satisfiability, Model checking and Reachability.
His research in Theoretical computer science is mostly concerned with Boolean satisfiability problem.
His research integrates issues of Maximum satisfiability problem, Boolean function and And-inverter graph in his study of Boolean satisfiability problem.
In his research, Modulo, Test vector, First-order logic and Satisfiability modulo theories is intimately related to Symbolic data analysis, which falls under the overarching field of Programming language.
His study in Satisfiability is interdisciplinary in nature, drawing from both Decision tree, Propositional calculus, Computation and Backtracking.
His Model checking study combines topics from a wide range of disciplines, such as Syntax, Set and Verilog.
Between 2009 and 2021, his most popular works were:
- Theory and Applications of Satisfiability Testing - SAT 2011 (69 citations)
- Generating data race witnesses by an SMT-based analysis (65 citations)
- Empirical study of the anatomy of modern sat solvers (61 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Quantum mechanics
His primary scientific interests are in Theoretical computer science, Satisfiability, Boolean satisfiability problem, Suite and Principal.
His Theoretical computer science research is multidisciplinary, incorporating elements of Graph, Homogeneous space, Software, Speedup and Search algorithm.
His Satisfiability study integrates concerns from other disciplines, such as Decision tree, Backtracking, Computation and Heuristics.
Many of his studies on Decision tree apply to Algorithm as well.
Karem A. Sakallah has included themes like Range, Artificial intelligence and Decision problem in his Boolean satisfiability problem study.
A majority of his Suite research is a blend of other scientific areas, such as Empirical research and Relation.
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.
