Eli Upfal
About
In The Last Decade
Eli Upfal
171 papers receiving 7.6k citations
Hit Papers
Peers
Comparison fields: 5 of 142
- Computer Networks and Communications 4.3k
- Artificial Intelligence 2.3k
- Computational Theory and Mathematics 2.0k
- Molecular Biology 968
- Statistical and Nonlinear Physics 911
Countries citing papers authored by Eli Upfal
This map shows the geographic impact of Eli Upfal'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 Eli Upfal with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eli Upfal more than expected).
Fields of papers citing papers by Eli Upfal
This network shows the impact of papers produced by Eli Upfal. 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 Eli Upfal. The network helps show where Eli Upfal may publish in the future.
Co-authorship network of co-authors of Eli Upfal
This figure shows the co-authorship network connecting the top 25 collaborators of Eli Upfal. A scholar is included among the top collaborators of Eli Upfal 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 Eli Upfal. Eli Upfal is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Practical and Provably Secure Onion Routing. | 1 |
| 2 | Toward Sustainable Insights, or Why Polygamy is Bad for You. | 17 |
| 3 | 1 | |
| 4 | 43 | |
| 5 | 31 | |
| 6 | 23 | |
| 7 | 281 | |
| 8 | 307 | |
| 9 | Adapting to a Changing Environment: the Brownian Restless Bandits. | 44 |
| 10 | Mortal Multi-Armed Bandits | 56 |
| 11 | Propagating knapsack constraints in sublinear time | 4 |
| 12 | Probability and computing: randomized algorithms and probabilistic analysis breakdown → | 984 |
| 13 | Hierarchical Preferences in a Broad-Coverage Lexical Taxonomy | 3 |
| 14 | 23 | |
| 15 | 6 | |
| 16 | Computing Near Optimal Strategies for Stochastic Investment Planning Problems | 1 |
| 17 | Computing with Unreliable Information (Preliminary Version) | 1 |
| 18 | Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version) | 1 |
| 19 | How to Share Memory in a Distributed System (A Preliminary Version) | 1 |
| 20 | A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version) | 1 |
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.