Benjamin Rossman
-
- Complexity and Algorithms in Graphs 25
- Advanced Graph Theory Research 15
- semigroups and automata theory 5
- Formal Methods in Verification 5
- Software top 10%
-
- Limits and Structures in Graph Theory 5
- Artificial Intelligence top 5%
- Machine Learning and Algorithms 6
- Cryptography and Data Security 5
- Logic, Reasoning, and Knowledge 4
- Signal Processing top 10%
Benjamin Rossman
31 papers receiving 386 citations
Peers
Comparison fields: 5 of 34
- Computational Theory and Mathematics 250
- Software 47
- Discrete Mathematics and Combinatorics 39
- Artificial Intelligence 215
- Signal Processing 55
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-authorship network
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
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 0 | |
| 2 | 2022 | 0 | |
| 3 | 2021 | 3 | |
| 4 | 2020 | 1 | |
| 5 | 2020 | 0 | |
| 6 | 2019 | 4 | |
| 7 | 2017 | 5 | |
| 8 | 2016 | 2 | |
| 9 | 2015 | 1 | |
| 10 | 2014 | 18 | |
| 11 | 2014 | 3 | |
| 12 | Query Complexity and Error Tolerance of Witness Finding Algorithms. | 2012 | 3 |
| 13 | 2011 | 13 | |
| 14 | 2008 | 11 | |
| 15 | 2007 | 6 | |
| 16 | 2007 | 10 | |
| 17 | Explicit Graphs with Extension Properties. | 2005 | 6 |
| 18 | 2005 | 55 | |
| 19 | General Interactive Small Step Algorithms | 2005 | 2 |
| 20 | 2005 | 3 |
About Benjamin Rossman
Benjamin Rossman is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Artificial Intelligence and Algebra and Number Theory, having authored 34 papers that have together received 427 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (25 papers), Advanced Graph Theory Research (15 papers), Machine Learning and Algorithms (6 papers), Cryptography and Data Security (5 papers), semigroups and automata theory (5 papers), Limits and Structures in Graph Theory (5 papers), Formal Methods in Verification (5 papers) and Logic, Reasoning, and Knowledge (4 papers). The work is most often cited by research in Computational Theory and Mathematics (250 citations), Software (47 citations), Discrete Mathematics and Combinatorics (39 citations), Artificial Intelligence (215 citations) and Signal Processing (55 citations). Benjamin Rossman has collaborated with scholars based in United States, Japan and Canada. Frequent co-authors include Shay Mozes, Erik D. Demaine, Oren Weimann, Yuri Gurevich, Wolfram Schulte, Swastik Kopparty, Andreas Blass, Toniann Pitassi, David Richerby and Anuj Dawar. Their work appears in journals such as SIAM Journal on Computing, Journal of the ACM, Logical Methods in Computer Science, Theory of Computing Systems and Algorithmica.
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.