Mauricio Karchmer
- Computational Theory and Mathematics top 1%
- Artificial Intelligence top 5%
- Computer Networks and Communications top 10%
- Electrical and Electronic Engineering
- Discrete Mathematics and Combinatorics top 10%
- Co-authors
- Avi WigdersonRan RazNoam NisanEyal KushilevitzJoseph NaorNathan LinialIlan NewmanNoga Alon
- Topics
- Complexity and Algorithms in Graphs (12 papers)Coding theory and cryptography (5 papers)Advanced Graph Theory Research (5 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceDiscrete Mathematics and Combinatorics
- Journals
- SIAM Journal on ComputingTheoretical Computer ScienceJournal of Computer and System Sciences
- Partner nations
- IsraelUnited StatesSweden
In The Last Decade
Mauricio Karchmer
18 papers receiving 616 citations
Peers
Comparison fields: 5 of 40
- Computational Theory and Mathematics 544
- Artificial Intelligence 429
- Computer Networks and Communications 141
- Electrical and Electronic Engineering 107
- Discrete Mathematics and Combinatorics 33
Countries citing papers authored by Mauricio Karchmer
This map shows the geographic impact of Mauricio Karchmer'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 Mauricio Karchmer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mauricio Karchmer more than expected).
Fields of papers citing papers by Mauricio Karchmer
This network shows the impact of papers produced by Mauricio Karchmer. 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 Mauricio Karchmer. The network helps show where Mauricio Karchmer may publish in the future.
Co-authorship network of co-authors of Mauricio Karchmer
This figure shows the co-authorship network connecting the top 25 collaborators of Mauricio Karchmer. A scholar is included among the top collaborators of Mauricio Karchmer 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 Mauricio Karchmer. Mauricio Karchmer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 6 | |
| 2 | 1 | |
| 3 | 166 | |
| 4 | 7 | |
| 5 | 0 | |
| 6 | 24 | |
| 7 | 54 | |
| 8 | 38 | |
| 9 | 13 | |
| 10 | 30 | |
| 11 | 4 | |
| 12 | 143 | |
| 13 | 22 | |
| 14 | 18 | |
| 15 | 19 | |
| 16 | Communication Complexity: A New Approach to Circuit Depth | 24 |
| 17 | 85 | |
| 18 | 21 | |
| 19 | 21 |
About Mauricio Karchmer
Mauricio Karchmer is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence, having authored 19 papers that have together received 696 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (12 papers), Coding theory and cryptography (5 papers) and Advanced Graph Theory Research (5 papers). The work is most often cited by research in Computational Theory and Mathematics (544 citations), Artificial Intelligence (429 citations) and Discrete Mathematics and Combinatorics (33 citations). Mauricio Karchmer has collaborated with scholars based in Israel, United States and Sweden. Frequent co-authors include Avi Wigderson, Ran Raz, Noam Nisan, Eyal Kushilevitz, Joseph Naor, Nathan Linial, Ilan Newman, Noga Alon, Michael Saks and Allan Borodin. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science 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.