Karem A. Sakallah

7.4k total citations · 1 hit paper
148 papers, 3.6k citations indexed

About

Karem A. Sakallah is a scholar working on Electrical and Electronic Engineering, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, Karem A. Sakallah has authored 148 papers receiving a total of 3.6k indexed citations (citations by other indexed papers that have themselves been cited), including 79 papers in Electrical and Electronic Engineering, 72 papers in Computational Theory and Mathematics and 66 papers in Hardware and Architecture. Recurrent topics in Karem A. Sakallah's work include Formal Methods in Verification (71 papers), Low-power high-performance VLSI design (50 papers) and VLSI and Analog Circuit Testing (46 papers). Karem A. Sakallah is often cited by papers focused on Formal Methods in Verification (71 papers), Low-power high-performance VLSI design (50 papers) and VLSI and Analog Circuit Testing (46 papers). Karem A. Sakallah collaborates with scholars based in United States, Portugal and United Arab Emirates. Karem A. Sakallah's co-authors include João Marques‐Silva, Igor L. Markov, Fadi Aloul, Mark H. Liffiton, Trevor Mudge, Rob A. Rutenbar, В. В. Кравец, Arathi Ramani, Gi-Joon Nam and Kunle Olukotun and has published in prestigious journals such as IEEE Journal of Solid-State Circuits, IEEE Transactions on Microwave Theory and Techniques and Computer.

In The Last Decade

Karem A. Sakallah

139 papers receiving 3.3k citations

Hit Papers

GRASP: a search algorithm for propositional satisfiability 1999 2026 2008 2017 1999 200 400 600

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Karem A. Sakallah United States 32 1.9k 1.5k 1.5k 1.1k 806 148 3.6k
Bryant United States 5 3.6k 1.9× 1.9k 1.3× 2.5k 1.7× 1.6k 1.5× 589 0.7× 6 5.7k
João Marques‐Silva Portugal 29 1.8k 0.9× 557 0.4× 725 0.5× 1.6k 1.5× 799 1.0× 167 3.2k
Fabio Somenzi United States 32 1.9k 1.0× 1.5k 1.0× 1.7k 1.2× 740 0.7× 273 0.3× 160 3.3k
Kenneth L. McMillan United States 29 4.5k 2.3× 858 0.6× 2.0k 1.4× 1.9k 1.8× 852 1.1× 63 5.8k
James B. Saxe United States 21 1.8k 0.9× 1.2k 0.8× 1.4k 1.0× 1.9k 1.7× 1.4k 1.8× 37 4.7k
D. Long United States 8 2.7k 1.4× 476 0.3× 623 0.4× 1.8k 1.7× 570 0.7× 12 4.3k
Armin Biere Austria 23 1.8k 0.9× 367 0.3× 651 0.4× 1.2k 1.1× 535 0.7× 124 2.7k
David E. Long United States 21 1.8k 0.9× 744 0.5× 692 0.5× 791 0.7× 183 0.2× 45 2.6k
Alan Mishchenko United States 27 1.6k 0.8× 1.8k 1.2× 1.6k 1.1× 872 0.8× 144 0.2× 173 3.1k
Lintao Zhang United States 25 1.8k 0.9× 551 0.4× 852 0.6× 1.9k 1.7× 1.7k 2.1× 55 4.0k

Countries citing papers authored by Karem A. Sakallah

Since Specialization
Citations

This map shows the geographic impact of Karem A. Sakallah's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Karem A. Sakallah with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Karem A. Sakallah more than expected).

Fields of papers citing papers by Karem A. Sakallah

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Karem A. Sakallah. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Karem A. Sakallah. The network helps show where Karem A. Sakallah may publish in the future.

Co-authorship network of co-authors of Karem A. Sakallah

This figure shows the co-authorship network connecting the top 25 collaborators of Karem A. Sakallah. A scholar is included among the top collaborators of Karem A. Sakallah based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Karem A. Sakallah. Karem A. Sakallah is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Sakallah, Karem A., et al.. (2013). Generalized Boolean symmetries through nested partition refinement. International Conference on Computer Aided Design. 763–770. 1 indexed citations
2.
Marques‐Silva, João & Karem A. Sakallah. (2007). Theory and applications of satisfiability testing - SAT 2007 : 10th International Conference, Lisbon, Portugal, May 28-31, 2007 : proceedings. Springer eBooks. 1 indexed citations
3.
Sakallah, Karem A., et al.. (2006). Pueblo: A Hybrid Pseudo-Boolean SAT Solver. 2(1-4). 165–189. 57 indexed citations
4.
Liffiton, Mark H., Michael D. Moffitt, Martha E. Pollack, & Karem A. Sakallah. (2005). Identifying conflicts in overconstrained temporal problems. International Joint Conference on Artificial Intelligence. 205–211. 11 indexed citations
5.
Ramani, Arathi, et al.. (2004). ShatterPB: symmetry-breaking for pseudo-Boolean formulas. Asia and South Pacific Design Automation Conference. 883–886. 9 indexed citations
6.
Sakallah, Karem A., et al.. (2004). Preserving synchronizing sequences of sequential circuits after retiming. Asia and South Pacific Design Automation Conference. 579–584. 4 indexed citations
7.
Ramani, Arathi, Fadi Aloul, Igor L. Markov, & Karem A. Sakallah. (2004). Breaking instance-independent symmetries in exact graph coloring. Design, Automation, and Test in Europe. 1. 10324. 8 indexed citations
8.
Sakallah, Karem A., et al.. (2003). Computing vertex eccentricity in exponentially large graphs: QBF formulation and solution. 1 indexed citations
9.
Aloul, Fadi, et al.. (2002). Search-Based SAT Using Zero-Suppressed BDDs. Design, Automation, and Test in Europe. 1082. 1 indexed citations
10.
Yook, Jong‐Gwan, V. Chandramouli, L.P.B. Katehi, & Karem A. Sakallah. (2002). Computation of switching noise in PCBs for digital packages. 37–39. 2 indexed citations
11.
Aloul, Fadi, et al.. (2001). Backtrack Search Using ZBDDs. 5 indexed citations
12.
Кравец, В. В. & Karem A. Sakallah. (2001). Constructive multi-level synthesis by way of functional properties. Deep Blue (University of Michigan). 22 indexed citations
13.
Aloul, Fadi, Igor L. Markov, & Karem A. Sakallah. (2001). Faster SAT and smaller BDDs via common function structure. International Conference on Computer Aided Design. 443–448. 35 indexed citations
14.
Кравец, В. В. & Karem A. Sakallah. (2000). Generalized symmetries in boolean functions. International Conference on Computer Aided Design. 526–532. 30 indexed citations
15.
Marques‐Silva, João & Karem A. Sakallah. (2000). Boolean satisfiability in electronic design automation. 675–680. 64 indexed citations
16.
Yalcin, Hakan, John P. Hayes, & Karem A. Sakallah. (1996). An approximate timing analysis method for datapath circuits. International Conference on Computer Aided Design. 114–118. 17 indexed citations
17.
Sakallah, Karem A., et al.. (1993). Min-max linear programming and the timing analysis of digital circuits. International Conference on Computer Aided Design. 152–155. 21 indexed citations
18.
Kayssi, Ayman & Karem A. Sakallah. (1992). Delay macromodels for the timing analysis of GaAs DCFL. European Design Automation Conference. 142–145. 2 indexed citations
19.
Davidson, Edward S., et al.. (1992). Using constraint geometry to determine maximum rate pipeline clocking. International Conference on Computer Aided Design. 142–148. 2 indexed citations
20.
Sakallah, Karem A., et al.. (1992). Ravel: assigned-delay compiled-code logic simulation. International Conference on Computer Aided Design. 364–368. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026