Amos Korman
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Optimization and Search Problems
- Distributed systems and fault tolerance
Papers in
-
- Complexity and Algorithms in Graphs 26
- Advanced Graph Theory Research 15
-
- Optimization and Search Problems 19
- Distributed systems and fault tolerance 16
- Co-authors
- David PelegOfer FeinermanShay KuttenPierre FraigniaudYuval EmekRoger WattenhoferStephan HolzerAtish Das Sarma
In The Last Decade
Amos Korman
58 papers receiving 889 citations
Peers
Comparison fields: 5 of 77
- Computational Theory and Mathematics 515
- Computer Networks and Communications 587
- Artificial Intelligence 223
- Ecology, Evolution, Behavior and Systematics 103
- Developmental Biology 10
Countries citing papers authored by Amos Korman
This map shows the geographic impact of Amos Korman'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 Amos Korman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Amos Korman more than expected).
Fields of papers citing papers by Amos Korman
This network shows the impact of papers produced by Amos Korman. 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 Amos Korman. The network helps show where Amos Korman may publish in the future.
Co-authors
The 25 scholars most cited alongside Amos Korman, 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 | 2024 | 5 | |
| 3 | 2023 | 3 | |
| 4 | 2021 | 3 | |
| 5 | 2020 | 10 | |
| 6 | 2020 | 35 | |
| 7 | 2020 | 1 | |
| 8 | 2018 | 4 | |
| 9 | 2017 | 7 | |
| 10 | 2014 | 18 | |
| 11 | 2013 | 40 | |
| 12 | 2012 | 2 | |
| 13 | 2011 | 1 | |
| 14 | 2011 | 51 | |
| 15 | 2010 | 57 | |
| 16 | 2010 | 57 | |
| 17 | 2008 | 1 | |
| 18 | 2004 | 45 | |
| 19 | 2003 | 18 | |
| 20 | 2002 | 16 |
About Amos Korman
Amos Korman is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Instrumentation, Artificial Intelligence and Management Science and Operations Research, having authored 60 papers that have together received 933 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (26 papers), Optimization and Search Problems (19 papers), Distributed systems and fault tolerance (16 papers), Advanced Graph Theory Research (15 papers), Cryptography and Data Security (7 papers), Animal Behavior and Reproduction (5 papers), Auction Theory and Applications (5 papers) and Insect and Arachnid Ecology and Behavior (4 papers). The work is most often cited by research in Computational Theory and Mathematics (515 citations), Computer Networks and Communications (587 citations), Artificial Intelligence (223 citations), Ecology, Evolution, Behavior and Systematics (103 citations) and Developmental Biology (10 citations). Amos Korman has collaborated with scholars based in Israel, France and Austria. Frequent co-authors include David Peleg, Ofer Feinerman, Shay Kutten, Pierre Fraigniaud, Pierre Fraigniaud, Yuval Emek, Roger Wattenhofer, Stephan Holzer, Atish Das Sarma and Danupon Nanongkai. Their work appears in journals such as Distributed Computing, ACM Transactions on Algorithms, Theory of Computing Systems, Journal of the ACM 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.