Michael Stepp

656 total citations
11 papers, 346 citations indexed

About

Michael Stepp is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Michael Stepp has authored 11 papers receiving a total of 346 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 6 papers in Computational Theory and Mathematics and 5 papers in Information Systems. Recurrent topics in Michael Stepp's work include Logic, programming, and type systems (6 papers), Formal Methods in Verification (5 papers) and Advanced Malware Detection Techniques (4 papers). Michael Stepp is often cited by papers focused on Logic, programming, and type systems (6 papers), Formal Methods in Verification (5 papers) and Advanced Malware Detection Techniques (4 papers). Michael Stepp collaborates with scholars based in United States. Michael Stepp's co-authors include Ross Tate, Sorin Lerner, Zachary Tatlock, Christian Collberg, S. Debray, John Kececioglu, Ginger Myles, Beth Simon, Gregg M. Townsend and Edward Carter and has published in prestigious journals such as Information and Software Technology, ACM SIGPLAN Notices and Software Practice and Experience.

In The Last Decade

Michael Stepp

11 papers receiving 320 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Michael Stepp United States 9 185 159 149 92 91 11 346
S. Debray United States 10 368 2.0× 224 1.4× 326 2.2× 105 1.1× 164 1.8× 19 558
Ravi Chugh United States 9 246 1.3× 207 1.3× 148 1.0× 58 0.6× 97 1.1× 21 382
Francesco Ranzato Italy 14 385 2.1× 68 0.4× 79 0.5× 36 0.4× 154 1.7× 44 492
Ilya Sergey Singapore 12 297 1.6× 179 1.1× 57 0.4× 105 1.1× 113 1.2× 53 461
Sébastien Bardin France 11 131 0.7× 113 0.7× 132 0.9× 57 0.6× 176 1.9× 32 321
Vijay D’Silva United Kingdom 9 198 1.1× 120 0.8× 153 1.0× 146 1.6× 195 2.1× 24 493
Sebastian Bănescu Germany 10 147 0.8× 159 1.0× 218 1.5× 39 0.4× 103 1.1× 26 337
Kihong Heo South Korea 13 257 1.4× 274 1.7× 178 1.2× 81 0.9× 307 3.4× 29 495
Hila Peleg Israel 9 115 0.6× 192 1.2× 111 0.7× 43 0.5× 221 2.4× 15 327
Yoav Zibin Israel 7 225 1.2× 196 1.2× 113 0.8× 97 1.1× 200 2.2× 17 443

Countries citing papers authored by Michael Stepp

Since Specialization
Citations

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

Fields of papers citing papers by Michael Stepp

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Michael Stepp

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Stepp. A scholar is included among the top collaborators of Michael Stepp 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 Michael Stepp. Michael Stepp is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

11 of 11 papers shown
1.
Tate, Ross, Michael Stepp, Zachary Tatlock, & Sorin Lerner. (2011). Equality Saturation: A New Approach to Optimization. Logical Methods in Computer Science. Volume 7, Issue 1. 18 indexed citations
2.
Tate, Ross, Michael Stepp, & Sorin Lerner. (2010). Generating compiler optimizations from proofs. 389–402. 18 indexed citations
3.
Stepp, Michael & Beth Simon. (2010). Introductory computing students' conceptions of illegal student-student collaboration. 295–299. 15 indexed citations
4.
Tate, Ross, Michael Stepp, & Sorin Lerner. (2010). Generating compiler optimizations from proofs. ACM SIGPLAN Notices. 45(1). 389–402. 3 indexed citations
5.
Tate, Ross, Michael Stepp, Zachary Tatlock, & Sorin Lerner. (2009). Equality saturation. 264–276. 100 indexed citations
6.
Tate, Ross, Michael Stepp, Zachary Tatlock, & Sorin Lerner. (2009). Equality saturation. ACM SIGPLAN Notices. 44(1). 264–276. 28 indexed citations
7.
Collberg, Christian, et al.. (2008). More on graph theoretic software watermarks: Implementation, analysis, and attacks. Information and Software Technology. 51(1). 56–67. 27 indexed citations
8.
Collberg, Christian, Ginger Myles, & Michael Stepp. (2006). An empirical study of Java bytecode programs. Software Practice and Experience. 37(6). 581–641. 30 indexed citations
9.
Collberg, Christian, et al.. (2004). Dynamic path-based software watermarking. 107–118. 91 indexed citations
10.
Collberg, Christian, et al.. (2004). Dynamic path-based software watermarking. ACM SIGPLAN Notices. 39(6). 107–118. 12 indexed citations
11.
Efrat, Alon, Stephen Kobourov, Michael Stepp, & Carola Wenk. (2002). Growing fat graphs. 277–278. 4 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