D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 44 Citations 10,166 141 World Ranking 3711 National Ranking 1895

Research.com Recognitions

Awards & Achievements

2012 - ACM Fellow For algorithms for Boolean Satisfiability that advanced the state-of-the-art of hardware verification.

1998 - IEEE Fellow For contributions to the modeling, analysis, and optimization of digital system timing.

Overview

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.

Best Publications

GRASP: a search algorithm for propositional satisfiability

J.P. Marques-Silva;K.A. Sakallah.
IEEE Transactions on Computers (1999)

1788 Citations

GRASP—a new search algorithm for satisfiability

João P. Marques Silva;Karem A. Sakallah.
international conference on computer aided design (1996)

1353 Citations

Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints

Mark H. Liffiton;Karem A. Sakallah.
Journal of Automated Reasoning (2008)

372 Citations

SATIRE: a new incremental satisfiability engine

Jesse Whittemore;Joonyoung Kim;Karem Sakallah.
design automation conference (2001)

252 Citations

Generic ILP versus specialized 0-1 ILP: an update

Fadi A. Aloul;Arathi Ramani;Igor L. Markov;Karem A. Sakallah.
international conference on computer aided design (2002)

249 Citations

Solving difficult instances of Boolean satisfiability in the presence of symmetry

F.A. Aloul;A. Ramani;I.L. Markov;K.A. Sakallah.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2003)

243 Citations

Efficient symmetry breaking for Boolean satisfiability

F.A. Aloul;K.A. Sakallah;I.L. Markov.
IEEE Transactions on Computers (2006)

216 Citations

Theory and Applications of Satisfiability Testing (SAT 2007)

João Marques-Silva;Karem A. Sakallah.
(2007)

214 Citations

Exploiting structure in symmetry detection for CNF

Paul T. Darga;Mark H. Liffiton;Karem A. Sakallah;Igor L. Markov.
design automation conference (2004)

191 Citations

A comparative study of two Boolean formulations of FPGA detailed routing constraints

G.-J. Nam;F. Aloul;K.A. Sakallah;R.A. Rutenbar.
IEEE Transactions on Computers (2004)

187 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Karem A. Sakallah

Joao Marques-Silva

Joao Marques-Silva

Centre national de la recherche scientifique, CNRS

Publications: 148

Rolf Drechsler

Rolf Drechsler

University of Bremen

Publications: 92

Steven Teig

Steven Teig

Cadence Design Systems (United States)

Publications: 61

Armin Biere

Armin Biere

Johannes Kepler University of Linz

Publications: 51

Sharad Malik

Sharad Malik

Princeton University

Publications: 49

Aarti Gupta

Aarti Gupta

Princeton University

Publications: 43

Michael S. Hsiao

Michael S. Hsiao

Virginia Tech

Publications: 39

Bernd Becker

Bernd Becker

University of Freiburg

Publications: 38

Robert K. Brayton

Robert K. Brayton

University of California, Berkeley

Publications: 35

Edmund M. Clarke

Edmund M. Clarke

Carnegie Mellon University

Publications: 30

Daniel Kroening

Daniel Kroening

Amazon (United States)

Publications: 29

Igor L. Markov

Igor L. Markov

Facebook (United States)

Publications: 28

Chao Wang

Chao Wang

Chinese Academy of Sciences

Publications: 26

Ofer Strichman

Ofer Strichman

Technion – Israel Institute of Technology

Publications: 26

Robert Wille

Robert Wille

Johannes Kepler University of Linz

Publications: 24

Roberto Sebastiani

Roberto Sebastiani

University of Trento

Publications: 21

Trending Scientists

Thomas Zellweger

Thomas Zellweger

University of St. Gallen

Victor Wray

Victor Wray

Heinrich Heine University Düsseldorf

Masahiro Tatsumisago

Masahiro Tatsumisago

Osaka Prefecture University

Manuel Mattheisen

Manuel Mattheisen

Aarhus University

Lloyd S. Davis

Lloyd S. Davis

University of Otago

Gudmar Thorleifsson

Gudmar Thorleifsson

deCODE Genetics (Iceland)

Dietmar Kültz

Dietmar Kültz

University of California, Davis

Fritz A. Mühlschlegel

Fritz A. Mühlschlegel

University of Kent

Sue Goo Rhee

Sue Goo Rhee

National Institutes of Health

Jürgen Pätzold

Jürgen Pätzold

University of Bremen

Gary L. Wenk

Gary L. Wenk

The Ohio State University

Giuliano Geminiani

Giuliano Geminiani

University of Turin

William M. Baldwin

William M. Baldwin

Cleveland Clinic Lerner College of Medicine

Oliver Tucha

Oliver Tucha

University of Rostock

Sharon M. Moe

Sharon M. Moe

Indiana University

Jean-Marc Dumonceau

Jean-Marc Dumonceau

Geneva College

Something went wrong. Please try again later.