Ehud D. Karnin
- Artificial Intelligence top 2%
- Computer Vision and Pattern Recognition top 5%
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications top 10%
- Electrical and Electronic Engineering
- Topics
- Chaos-based Image/Signal Encryption (5 papers)Cryptography and Data Security (4 papers)Mathematical Dynamics and Fractals (3 papers)
- Cited by
- Artificial IntelligenceComputer Vision and Pattern RecognitionComputational Theory and Mathematics
- Journals
- IEEE Transactions on Information TheoryJournal of Applied ProbabilityIEEE Transactions on Neural Networks
- Partner nations
- United StatesIsrael
In The Last Decade
Ehud D. Karnin
10 papers receiving 752 citations
Peers
Comparison fields: 5 of 95
- Artificial Intelligence 606
- Computer Vision and Pattern Recognition 262
- Computational Theory and Mathematics 138
- Computer Networks and Communications 131
- Electrical and Electronic Engineering 117
Countries citing papers authored by Ehud D. Karnin
This map shows the geographic impact of Ehud D. Karnin'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 Ehud D. Karnin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ehud D. Karnin more than expected).
Fields of papers citing papers by Ehud D. Karnin
This network shows the impact of papers produced by Ehud D. Karnin. 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 Ehud D. Karnin. The network helps show where Ehud D. Karnin may publish in the future.
Co-authorship network of co-authors of Ehud D. Karnin
This figure shows the co-authorship network connecting the top 25 collaborators of Ehud D. Karnin. A scholar is included among the top collaborators of Ehud D. Karnin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ehud D. Karnin. Ehud D. Karnin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 3 | |
| 2 | 20 | |
| 3 | 15 | |
| 4 | 6 | |
| 5 | 444 | |
| 6 | 2 | |
| 7 | 0 | |
| 8 | 2 | |
| 9 | 1 | |
| 10 | 9 | |
| 11 | 3 | |
| 12 | 332 | |
| 13 | On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis. | 0 |
About Ehud D. Karnin
Ehud D. Karnin is a scholar working on Mathematical Physics, Computational Theory and Mathematics and Computer Vision and Pattern Recognition, having authored 13 papers that have together received 837 indexed citations. Recurring topics across this work include Chaos-based Image/Signal Encryption (5 papers), Cryptography and Data Security (4 papers) and Mathematical Dynamics and Fractals (3 papers). The work is most often cited by research in Artificial Intelligence (606 citations), Computer Vision and Pattern Recognition (262 citations) and Computational Theory and Mathematics (138 citations). Ehud D. Karnin has collaborated with scholars based in United States and Israel. Frequent co-authors include Martin E. Hellman, Jonathan Greene, Eugene Walach, D. Malah, Z. Baharav and Geir E. Øien. Their work appears in journals such as IEEE Transactions on Information Theory, Journal of Applied Probability and IEEE Transactions on Neural Networks.
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.