Alex Samorodnitsky
-
- Limits and Structures in Graph Theory 7
-
- Complexity and Algorithms in Graphs 21
- Advanced Graph Theory Research 10
- Computational Mathematics top 10%
- Statistics and Probability top 5%
- Markov Chains and Monte Carlo Methods 9
-
- Machine Learning and Algorithms 11
- Coding theory and cryptography 6
- Algorithms and Data Compression 6
-
- Wireless Communication Security Techniques 4
- Co-authors
- Luca TrevisanNathan LinialAvi WigdersonDana RonEldar FischerRonitt RubinfeldSofya RaskhodnikovaEric Lehman
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsComputational Mathematics
- Journals
- IEEE Transactions on Information Theory (3 papers)SIAM Journal on Computing (1 paper)Journal of Computer and System Sciences (1 paper)
- Partner nations
- IsraelUnited StatesSwitzerland
In The Last Decade
Alex Samorodnitsky
42 papers receiving 752 citations
Peers
Comparison fields: 5 of 52
- Discrete Mathematics and Combinatorics 128
- Computational Theory and Mathematics 571
- Computational Mathematics 12
- Computer Graphics and Computer-Aided Design 59
- Statistics and Probability 117
Countries citing papers authored by Alex Samorodnitsky
This map shows the geographic impact of Alex Samorodnitsky'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 Alex Samorodnitsky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alex Samorodnitsky more than expected).
Fields of papers citing papers by Alex Samorodnitsky
This network shows the impact of papers produced by Alex Samorodnitsky. 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 Alex Samorodnitsky. The network helps show where Alex Samorodnitsky may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Alex Samorodnitsky, 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 | 2023 | 1 | |
| 2 | 2023 | 0 | |
| 3 | 2016 | 16 | |
| 4 | 2016 | 1 | |
| 5 | On Coset Leader Graphs of LDPC codes | 2014 | 1 |
| 6 | 2014 | 8 | |
| 7 | 2013 | 1 | |
| 8 | 2011 | 8 | |
| 9 | 2011 | 6 | |
| 10 | 2008 | 14 | |
| 11 | 2007 | 6 | |
| 12 | 2007 | 6 | |
| 13 | 2006 | 5 | |
| 14 | Approximating the Entropy of Large Alphabets | 2005 | 2 |
| 15 | 2004 | 58 | |
| 16 | 2001 | 19 | |
| 17 | 2000 | 79 | |
| 18 | 2000 | 89 | |
| 19 | 2000 | 13 | |
| 20 | 1996 | 41 |
About Alex Samorodnitsky
Alex Samorodnitsky is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computational Mathematics, having authored 44 papers that have together received 857 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (21 papers), Machine Learning and Algorithms (11 papers), Advanced Graph Theory Research (10 papers), Markov Chains and Monte Carlo Methods (9 papers), Limits and Structures in Graph Theory (7 papers), Coding theory and cryptography (6 papers), Algorithms and Data Compression (6 papers) and Wireless Communication Security Techniques (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (128 citations), Computational Theory and Mathematics (571 citations) and Computational Mathematics (12 citations). Alex Samorodnitsky has collaborated with scholars based in Israel, United States and Switzerland. Frequent co-authors include Luca Trevisan, Nathan Linial, Avi Wigderson, Dana Ron, Eldar Fischer, Ronitt Rubinfeld, Sofya Raskhodnikova, Eric Lehman, Ilan Newman and Michal Parnas. Their work appears in journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and Journal of Computer and System Sciences.
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.