Shalev Ben-David
Impact in
-
- Optimization and Search Problems
- Distributed systems and fault tolerance
-
- Complexity and Algorithms in Graphs
Papers in
-
- Machine Learning and Algorithms 13
- Cryptography and Data Security 5
- Quantum Computing Algorithms and Architecture 5
- Stochastic Gradient Optimization Techniques 3
-
- Complexity and Algorithms in Graphs 15
- Computability, Logic, AI Algorithms 6
- semigroups and automata theory 3
- Co-authors
- Allan Borodin (3 shared papers)Gábor Tardos (2 shared papers)Avi Wigderson (2 shared papers)Richard M. Karp (2 shared papers)Ihab F. Ilyas (1 shared paper)Mohamed A. Soliman (1 shared paper)Lang Tong (2 shared papers)David Haussler (2 shared papers)
- Journals
- Algorithmica (2 papers)IEEE Transactions on Signal Processing (2 papers)Information and Computation (2 papers)Journal of the ACM (1 paper)Journal of Combinatorial Theory Series B (1 paper)
- Partner nations
- CanadaUnited StatesIsrael
In The Last Decade
Shalev Ben-David
27 papers receiving 576 citations
Peers
Comparison fields: 5 of 55
- Computer Networks and Communications 404
- Computational Theory and Mathematics 188
- Management Science and Operations Research 139
- Industrial and Manufacturing Engineering 75
- Artificial Intelligence 198
Countries citing papers authored by Shalev Ben-David
This map shows the geographic impact of Shalev Ben-David'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 Shalev Ben-David with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shalev Ben-David more than expected).
Fields of papers citing papers by Shalev Ben-David
This network shows the impact of papers produced by Shalev Ben-David. 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 Shalev Ben-David. The network helps show where Shalev Ben-David may publish in the future.
Co-authors
The 25 scholars most cited alongside Shalev Ben-David, 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 29 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1994 | 153 | |
| 2 | 1990 | 116 | |
| 3 | 1994 | 73 | |
| 4 | 2010 | 53 | |
| 5 | 1995 | 46 | |
| 6 | 2006 | 38 | |
| 7 | Relating clustering stability to properties of cluster boundaries | 2008 | 32 |
| 8 | 1989 | 25 | |
| 9 | 2006 | 14 | |
| 10 | 2003 | 10 | |
| 11 | 1995 | 9 | |
| 12 | 2002 | 9 | |
| 13 | 2014 | 7 | |
| 14 | 2018 | 4 | |
| 15 | 2000 | 3 | |
| 16 | 2020 | 3 | |
| 17 | 2020 | 3 | |
| 18 | 2018 | 2 | |
| 19 | 1995 | 2 | |
| 20 | 2015 | 2 |
About Shalev Ben-David
Shalev Ben-David is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics and Management Science and Operations Research, having authored 29 papers that have together received 612 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (15 papers), Machine Learning and Algorithms (13 papers), Optimization and Search Problems (6 papers), Computability, Logic, AI Algorithms (6 papers), Cryptography and Data Security (5 papers), Quantum Computing Algorithms and Architecture (5 papers), Stochastic Gradient Optimization Techniques (3 papers) and semigroups and automata theory (3 papers). The work is most often cited by research in Computer Networks and Communications (404 citations), Computational Theory and Mathematics (188 citations), Management Science and Operations Research (139 citations), Industrial and Manufacturing Engineering (75 citations) and Artificial Intelligence (198 citations). Shalev Ben-David has collaborated with scholars based in Canada, United States and Israel. Frequent co-authors include Allan Borodin, Gábor Tardos, Avi Wigderson, Richard M. Karp, Ihab F. Ilyas, Mohamed A. Soliman, Lang Tong, David Haussler, Nicolò Cesa‐Bianchi and Philip M. Long. Their work appears in journals such as Algorithmica, IEEE Transactions on Signal Processing, Information and Computation, Journal of the ACM and Journal of Combinatorial Theory Series B.
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.