Benjamin Rossman
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Formal Methods in Verification
- semigroups and automata theory
- Software top 5%
Papers in
-
- Complexity and Algorithms in Graphs 29
- Advanced Graph Theory Research 19
- semigroups and automata theory 7
- Formal Methods in Verification 6
-
- Machine Learning and Algorithms 9
- Logic, Reasoning, and Knowledge 5
- Logic, programming, and type systems 4
- Co-authors
- Oren Weimann (2 shared papers)Shay Mozes (2 shared papers)Erik D. Demaine (2 shared papers)Yuri G. Gurevich (5 shared papers)Wolfram Schulte (2 shared papers)Andreas R. Blass (4 shared papers)Dean Rosenzweig (3 shared papers)Swastik Kopparty (1 shared paper)
- Journals
- SIAM Journal on Computing (3 papers)Journal of the ACM (2 papers)Algorithmica (1 paper)European Journal of Combinatorics (1 paper)ACM Transactions on Algorithms (1 paper)
- Partner nations
- United StatesJapanCanada
In The Last Decade
Benjamin Rossman
38 papers receiving 698 citations
Peers
Comparison fields: 5 of 39
- Computational Theory and Mathematics 424
- Software 75
- Discrete Mathematics and Combinatorics 55
- Artificial Intelligence 398
- Computer Networks and Communications 203
Countries citing papers authored by Benjamin Rossman
This map shows the geographic impact of Benjamin Rossman'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 Benjamin Rossman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Benjamin Rossman more than expected).
Fields of papers citing papers by Benjamin Rossman
This network shows the impact of papers produced by Benjamin Rossman. 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 Benjamin Rossman. The network helps show where Benjamin Rossman may publish in the future.
Co-authors
The 20 scholars most cited alongside Benjamin Rossman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 42 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 147 | |
| 2 | 2008 | 92 | |
| 3 | 2005 | 86 | |
| 4 | 2007 | 73 | |
| 5 | 2008 | 48 | |
| 6 | 2006 | 42 | |
| 7 | 2016 | 27 | |
| 8 | 2014 | 20 | |
| 9 | Interactive small-step algorithms II: Abstract state machines and the characterization theorem | 2006 | 18 |
| 10 | 2008 | 18 | |
| 11 | 2011 | 17 | |
| 12 | 2007 | 16 | |
| 13 | 2007 | 13 | |
| 14 | 2010 | 13 | |
| 15 | 2017 | 11 | |
| 16 | 2003 | 11 | |
| 17 | 2016 | 10 | |
| 18 | 2004 | 10 | |
| 19 | 2019 | 8 | |
| 20 | General Interactive Small Step Algorithms | 2005 | 7 |
About Benjamin Rossman
Benjamin Rossman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Computer Networks and Communications and Computer Graphics and Computer-Aided Design, having authored 42 papers that have together received 750 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (29 papers), Advanced Graph Theory Research (19 papers), Machine Learning and Algorithms (9 papers), semigroups and automata theory (7 papers), Formal Methods in Verification (6 papers), Limits and Structures in Graph Theory (6 papers), Logic, Reasoning, and Knowledge (5 papers) and Logic, programming, and type systems (4 papers). The work is most often cited by research in Computational Theory and Mathematics (424 citations), Software (75 citations), Discrete Mathematics and Combinatorics (55 citations), Artificial Intelligence (398 citations) and Computer Networks and Communications (203 citations). Benjamin Rossman has collaborated with scholars based in United States, Japan and Canada. Frequent co-authors include Oren Weimann, Shay Mozes, Erik D. Demaine, Yuri G. Gurevich, Wolfram Schulte, Andreas R. Blass, Dean Rosenzweig, Swastik Kopparty, Toniann Pitassi and Anuj Dawar. Their work appears in journals such as SIAM Journal on Computing, Journal of the ACM, Algorithmica, European Journal of Combinatorics and ACM Transactions on Algorithms.
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.