Ofer Strichman

106 papers receiving 3k citations

Ofer Strichman's Hit Papers

Bounded Model Checking 2003 · 688 citations
6880+7+15Years since publication200400600

Peers

Ofer Strichman
Comparison fields: 5 of 44
  • Computational Theory and Mathematics 2.1k
  • Software 523
  • Artificial Intelligence 931
  • Hardware and Architecture 137
  • Computer Networks and Communications 344
Replace Yunshan Zhu with:
Yunshan Zhu United States
Michaël Leuschel Germany
Alberto Griggio Italy
Hubert Garavel France
Heike Wehrheim Germany
Doron Peled Israel
Javier Esparza Germany
Helmut Veith Austria
Ansgar Fehnker Australia
Sagar Chaki United States
Ofer Strichman relative to Yunshan Zhu United States Yunshan Zhu's profile →
Citations per field
00.5×1.5×
Yunshan Zhu · 1×
Citations per year

Countries citing papers authored by Ofer Strichman

Since Specialization
Citations

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

Fields of papers citing papers by Ofer Strichman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authors

The 25 scholars most cited alongside Ofer Strichman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Ofer Strichman Line = papers co-authored together Ofer Strichman links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 111 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Bounded Model Checking
Hit paper breakdown →
2003688
2 2008211
3 2005152
4 2002112
5 200993
6 201092
7 200791
8 200485
9 201680
10 200279
11 201276
12 200271
13 200463
14 200258
15 200348
16 200448
17 200547
18 200845
19 200241
20 200441

About Ofer Strichman

Ofer Strichman is a scholar working on Computational Theory and Mathematics, Software, Artificial Intelligence, Computer Networks and Communications and Hardware and Architecture, having authored 111 papers that have together received 3.2k indexed citations. Recurring topics across this work include Formal Methods in Verification (80 papers), Logic, programming, and type systems (25 papers), Constraint Satisfaction and Optimization (19 papers), Software Testing and Debugging Techniques (11 papers), Logic, Reasoning, and Knowledge (5 papers), Advanced Graph Theory Research (3 papers), Complexity and Algorithms in Graphs (3 papers) and Robotic Path Planning Algorithms (2 papers). The work is most often cited by research in Computational Theory and Mathematics (2.1k citations), Software (523 citations), Artificial Intelligence (931 citations), Hardware and Architecture (137 citations) and Computer Networks and Communications (344 citations). Ofer Strichman has collaborated with scholars based in Israel, United States and United Kingdom. Frequent co-authors include Daniel Kroening, Edmund M. Clarke, Alessandro Cimatti, Armin Biere, Yunshan Zhu, Sagar Chaki, Benny Godlin, Alex Groce, Joël Ouaknine and Sanjit Arunkumar Seshia. Their work appears in journals such as Formal Methods in System Design, Lecture notes in computer science, International Journal on Software Tools for Technology Transfer, Information and Computation and IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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