Limor Fix

1.5k total citations
20 papers, 424 citations indexed

About

Limor Fix is a scholar working on Computational Theory and Mathematics, Software and Hardware and Architecture. According to data from OpenAlex, Limor Fix has authored 20 papers receiving a total of 424 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 8 papers in Software and 7 papers in Hardware and Architecture. Recurrent topics in Limor Fix's work include Formal Methods in Verification (13 papers), Software Testing and Debugging Techniques (8 papers) and Logic, programming, and type systems (5 papers). Limor Fix is often cited by papers focused on Formal Methods in Verification (13 papers), Software Testing and Debugging Techniques (8 papers) and Logic, programming, and type systems (5 papers). Limor Fix collaborates with scholars based in United States, Israel and United Kingdom. Limor Fix's co-authors include Rajeev Alur, Thomas A. Henzinger, Todd C. Mowry, Phillip B. Gibbons, Shimin Chen, Babak Falsafi, Anastassia Ailamaki, Michael A. Kozuch, Nikos Hardavellas and Chris Wilkerson and has published in prestigious journals such as IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Theoretical Computer Science and Journal of Logic and Computation.

In The Last Decade

Limor Fix

18 papers receiving 375 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Limor Fix United States 9 216 184 176 121 106 20 424
Michael Tautschnig United Kingdom 10 250 1.2× 149 0.8× 173 1.0× 153 1.3× 133 1.3× 34 404
Marius Minea United States 12 175 0.8× 236 1.3× 88 0.5× 90 0.7× 163 1.5× 24 414
Tomáš Vojnar Czechia 11 112 0.5× 132 0.7× 87 0.5× 137 1.1× 154 1.5× 61 346
Oliver Rüthing Germany 8 418 1.9× 143 0.8× 210 1.2× 318 2.6× 175 1.7× 17 562
Per Bjesse United States 9 284 1.3× 264 1.4× 60 0.3× 147 1.2× 134 1.3× 18 452
Natasha Sharygina Switzerland 12 143 0.7× 362 2.0× 88 0.5× 224 1.9× 306 2.9× 57 539
Benjamin Goldberg United States 14 300 1.4× 234 1.3× 178 1.0× 373 3.1× 103 1.0× 40 531
William S. Beebee United States 5 167 0.8× 49 0.3× 232 1.3× 254 2.1× 91 0.9× 6 424
Karen Yorav Israel 7 134 0.6× 300 1.6× 51 0.3× 146 1.2× 244 2.3× 21 424
Azadeh Farzan Canada 12 191 0.9× 217 1.2× 175 1.0× 227 1.9× 221 2.1× 40 476

Countries citing papers authored by Limor Fix

Since Specialization
Citations

This map shows the geographic impact of Limor Fix'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 Limor Fix with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Limor Fix more than expected).

Fields of papers citing papers by Limor Fix

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Limor Fix. 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 Limor Fix. The network helps show where Limor Fix may publish in the future.

Co-authorship network of co-authors of Limor Fix

This figure shows the co-authorship network connecting the top 25 collaborators of Limor Fix. A scholar is included among the top collaborators of Limor Fix 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 Limor Fix. Limor Fix 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.
Armoni, Roy, Limor Fix, Ranan Fraer, et al.. (2007). Deeper Bound in BMC by Combining Constant Propagation and Abstraction. 304–309. 1 indexed citations
2.
Fix, Limor, et al.. (2007). VERIFYING VERY LARGE INDUSTRIAL CIRCUITS USING 100 PROCESSES AND BEYOND. International Journal of Foundations of Computer Science. 18(1). 45–61. 2 indexed citations
3.
Chen, Shimin, Phillip B. Gibbons, Michael A. Kozuch, et al.. (2007). Scheduling threads for constructive cache sharing on CMPs. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 105–115. 114 indexed citations
4.
Goode, Adam, Mahadev Satyanarayanan, Mei Chen, et al.. (2007). Interactive Search of Adipocytes in Large Collections of Digital Cellular Images. 695–698. 5 indexed citations
5.
Chen, Shimin, Phillip B. Gibbons, Anastassia Ailamaki, et al.. (2006). Parallel depth first vs. work stealing schedulers on CMP architectures. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 330–330. 4 indexed citations
6.
Chen, Shimin, Babak Falsafi, Phillip B. Gibbons, et al.. (2006). Log-based architectures for general-purpose monitoring of deployed code. The HKU Scholars Hub (University of Hong Kong). 63–65. 56 indexed citations
7.
Chen, Shimin, Phillip B. Gibbons, Anastassia Ailamaki, et al.. (2006). Brief announcement: Parallel depth first vs. work stealing schedulers on CMP architectures. 1 indexed citations
8.
Basu, Parthiba, Susobhan Das, Ansuman Banerjee, et al.. (2006). Design-Intent Coverage—A New Paradigm for Formal Property Verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 25(10). 1922–1934. 8 indexed citations
9.
Armoni, Roy, et al.. (2005). SAT-based Induction for Temporal Safety Properties. Electronic Notes in Theoretical Computer Science. 119(2). 3–16. 17 indexed citations
10.
Basu, Parthiba, Ansuman Banerjee, Pallab Dasgupta, et al.. (2005). Formal verification coverage: computing the coverage gap between temporal specifications. 198–203. 4 indexed citations
11.
Banerjee, Ansuman, et al.. (2005). Formal methods for analyzing the completeness of an assertion suite against a high-level fault model. 201–206. 16 indexed citations
12.
Malik, Sharad, Limor Fix, & Andrew B. Kahng. (2004). Proceedings of the 41st annual Design Automation Conference. Design Automation Conference. 15 indexed citations
13.
Getreu, Ian, Limor Fix, & Luciano Lavagno. (2003). Proceedings of the 40th annual Design Automation Conference. Design Automation Conference. 22 indexed citations
14.
Dill, David L., Gérard Berry, Limor Fix, et al.. (2002). Formal verification methods. Proceedings - ACM IEEE Design Automation Conference. 1 indexed citations
15.
Hazelhurst, Scott, et al.. (2002). A hybrid verification approach. Proceedings - ACM IEEE Design Automation Conference. 111–111. 23 indexed citations
16.
Alur, Rajeev, Limor Fix, & Thomas A. Henzinger. (1999). Event-clock automata: a determinizable class of timed automata. Theoretical Computer Science. 211(1-2). 253–273. 116 indexed citations
17.
Kamhi, Gila & Limor Fix. (1998). Adaptive variable reordering for symbolic model checking. 359–365. 6 indexed citations
18.
Fix, Limor. (1996). Verification of temporal properties. Journal of Logic and Computation. 6(3). 343–361. 8 indexed citations
19.
Fix, Limor, Nissim Francez, & Orna Grümberg. (1994). Program composition via unification. Theoretical Computer Science. 131(1). 139–179.
20.
Alur, Rajeev, Limor Fix, & Thomas A. Henzinger. (1993). A determinizable class of timed automata. Defense Technical Information Center (DTIC). 5 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