Eli Upfal | Academic Influence

Eli Upfal's AcademicInfluence.com Rankings

Eli Upfal

Computer Science

#1409

World Rank

#1458

Historical Rank

Distributed Computing

#13

World Rank

#14

Historical Rank

Database

#2239

World Rank

#2354

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Eli Upfal's Degrees

PhD Computer Science Stanford University
Masters Computer Science Weizmann Institute of Science

Similar Degrees You Can Earn

Why Is Eli Upfal Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Eli Upfal is a computer science researcher, currently the Rush C. Hawkins Professor of Computer Science at Brown University. He completed his undergraduate studies in mathematics and statistics at the Hebrew University, Israel in 1978, received an M.Sc. in computer science from the Feinberg Graduate School of the Weizmann Institute of Science, Israel in 1980, and completed his PhD in computer science at the Hebrew University in 1983 under Eli Shamir. He has made contributions in a variety of areas. Most of his work involves randomized and/or online algorithms, stochastic processes, or the probabilistic analysis of deterministic algorithms. Particular applications include routing and communications networks, computational biology, and computational finance.

(See a Problem?)

Eli Upfal's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Probability and Computing: Randomized Algorithms and Probabilistic Analysis (2005) (2021)
Balanced Allocations (1999) (768)
Stochastic models for the Web graph (2000) (743)
Algorithms for Detecting Significantly Mutated Pathways in Cancer (2010) (443)
Multi-armed bandits in metric spaces (2008) (427)
A trade-off between space and efficiency for routing tables (1989) (364)
The Web as a graph (2000) (354)
Constructing a perfect matching is in random NC (1985) (315)
Computing with Noisy Information (1994) (294)
Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems (1997) (288)
Using PageRank to Characterize Web Structure (2002) (275)
Randomized Broadcast in Networks (1990) (271)
De Novo Discovery of Mutated Driver Pathways in Cancer (2011) (269)
Efficient routing in all-optical networks (1994) (243)
Building low-diameter P2P networks (2001) (219)
A simple load balancing scheme for task allocation in parallel machines (1991) (217)
Learning-based Query Performance Modeling and Prediction (2012) (188)
How to share memory in a distributed system (1984) (181)
Fault tolerance in networks of bounded degree (1986) (169)
De novo discovery of mutated driver pathways in cancer. (2012) (167)
A tradeoff between space and efficiency for routing tables (1988) (167)
On the satisfiability and maximum satisfiability of random 3-CNF formulas (1993) (164)
Building low-diameter peer-to-peer networks (2003) (155)
Machine Learning in High Energy Physics Community White Paper (2018) (153)
PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce (2012) (146)
Adapting to a Changing Environment: the Brownian Restless Bandits (2008) (142)
Performance prediction for concurrent database workloads (2011) (141)
Mortal Multi-Armed Bandits (2008) (134)
Fast Distributed PageRank Computation (2012) (134)
Web search using automatic classification (1996) (133)
On factors in random graphs (1981) (128)
An O(log N) deterministic packet-routing scheme (1992) (120)
Parallel hashing: an efficient implementation of shared memory (1988) (120)
TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size (2016) (119)
Balanced allocations (extended abstract) (1994) (116)
The token distribution problem (1989) (113)
Discovery of Mutated Subnetworks Associated with Clinical Data in Cancer (2011) (108)
Efficient schemes for parallel communication (1982) (103)
Efficient Schemes for Parallel Communication (1984) (101)
ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages (2016) (96)
The Complexity of Parallel Search (1988) (94)
Stochastic contention resolution with short delays (1995) (92)
A theory of wormhole routing in parallel computers (1992) (88)
Trading space for time in undirected s-t connectivity (1989) (88)
Updates to the QBIC system (1997) (87)
Tolerating linear number of faults in networks of bounded degree (1992) (86)
PageRank on an evolving graph (2012) (83)
Bandits and Experts in Metric Spaces (2013) (83)
Space-round tradeoffs for MapReduce computations (2011) (79)
Optimal construction of edge-disjoint paths in random graphs (1994) (78)
An O(logN) deterministic packet routing scheme (1989) (72)
Computing with unreliable information (1990) (71)
Towards robust and efficient computation in dynamic peer-to-peer networks (2011) (70)
Parallel hashing—an efficient implementation of shared memory (1986) (69)
Constructing disjoint paths on expander graphs (1987) (67)
Existence and Construction of Edge-Disjoint Paths on Expander Graphs (1994) (65)
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (2014) (64)
Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees (2011) (61)
Controlling False Discoveries During Interactive Data Exploration (2016) (61)
Democratizing Data Science through Interactive Curation of ML Pipelines (2019) (61)
Online stochastic optimization under time constraints (2005) (60)
Probability and Computing: Chernoff Bounds (2005) (55)
Existence and construction of edge disjoint paths on expander graphs (1992) (54)
A simple and deterministic competitive algorithm for online facility location (2004) (53)
Mining Frequent Itemsets through Progressive Sampling with Rademacher Averages (2015) (53)
On Balls and Bins with Deletions (1998) (51)
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm (2000) (50)
Tight bounds on information dissemination in sparse mobile networks (2011) (49)
A Time-Space Tradeoff for Element Distinctness (1987) (48)
A time-randomness tradeoff for oblivious routing (1988) (47)
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (1999) (47)
Mining top-K frequent itemsets through progressive sampling (2010) (47)
The Case for Predictive Database Systems: Opportunities and Challenges (2011) (46)
Commitment under uncertainty: Two-stage stochastic matching problems (2007) (46)
Are search and decision programs computationally equivalent? (1985) (46)
The hiring problem and Lake Wobegon strategies (2008) (44)
Fault Tolerant Sorting Networks (1991) (43)
Finding near neighbors through cluster pruning (2007) (41)
An efficient rigorous approach for identifying statistically significant frequent itemsets (2009) (41)
Optimal Reconstruction of a Sequence from its Probes (1999) (41)
Scalable Betweenness Centrality Maximization via Sampling (2016) (41)
Storage and search in dynamic peer-to-peer networks (2013) (40)
Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks (2015) (40)
Fault tolerant sorting network (1990) (39)
The Generalized Packet Routing Problem (1987) (39)
A general approach to dynamic packet routing with bounded buffers (1996) (39)
Algorithms on evolving graphs (2012) (36)
A probabilistic relation between desirable and feasible, models of parallel computation (1984) (36)
Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces (1984) (35)
On the power of universal bases in sequencing by hybridization (1999) (34)
Toward Sustainable Insights, or Why Polygamy is Bad for You (2017) (32)
Contender: A Resource Modeling Approach for Concurrent Query Performance Prediction (2014) (31)
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension (2016) (31)
TRIÈST (2017) (31)
The VC-Dimension of SQL Queries and Selectivity Estimation through Sampling (2011) (30)
Tolerating a Linear Number of Faults in Networks of Bounded Degree (1994) (29)
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem (1986) (28)
Random hypergraph coloring algorithms and the weak chromatic number (1985) (27)
A Steady State Analysis of Diffracting Trees (1998) (26)
Accurate Computation of Survival Statistics in Genome-Wide Studies (2013) (26)
An efficient algorithm for the vertex-disjoint paths problem in random graphs (1996) (26)
One-factor in random graphs based on vertex choice (1982) (25)
A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems (1987) (24)
Dynamic deflection routing on arrays (preliminary version) (1996) (23)
ABRA (2018) (21)
How much can hardware help routing? (1997) (21)
Adversarial Multi Class Learning under Weak Supervision with Performance Guarantees (2021) (21)
Unknown Examples & Machine Learning Model Generalization (2018) (21)
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height (1995) (20)
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation (2014) (19)
Reducing network congestion and blocking probability through balanced allocation (1999) (19)
Towards Interactive Curation & Automatic Tuning of ML Pipelines (2018) (18)
RePBubLik: Reducing Polarized Bubble Radius with Link Insertions (2021) (18)
Near-perfect Token Distribution (1992) (17)
Semi-Supervised Aggregation of Dependent Weak Supervision Sources With Performance Guarantees (2021) (17)
MADMX: A Strategy for Maximal Dense Motif Extraction (2011) (16)
Finding driver pathways in cancer: models and algorithms (2011) (16)
Large Regular Factors in Random Graphs (1984) (15)
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs (2015) (14)
Infectious Random Walks (2010) (14)
Database-support for continuous prediction queries over streaming data (2010) (14)
Algorithms and Genome Sequencing: Identifying Driver Pathways in Cancer (2012) (13)
Stability and efficiency of a random local load balancing protocol (2003) (13)
A Steady State Analysis of Diiracting Trees (1997) (13)
The Parallel Complexity of Scheduling with Precedence Constraints (1986) (13)
A Time-Randomness Trade-Off for Oblivious Routing (1990) (13)
On-line routing of random calls in networks (2003) (13)
The Token Distribution Problem (Preliminary Version) (1986) (12)
Can entropy characterize performance of online algorithms? (2001) (12)
How much can hardware help routing? (1993) (12)
Learning Simulation-Based Games from Data (2019) (12)
The complexity of parallel computation on matroids (1985) (12)
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input (2005) (12)
N-processors graphs distributively achieve perfect matchings in O(log2N) beats (1982) (11)
Propagating Knapsack Constraints in Sublinear Time (2007) (11)
Sorting and selection on dynamic data (2011) (11)
Practical and Provably Secure Onion Routing (2017) (11)
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach (1997) (10)
A steady state analysis of diffracting trees (extended abstract) (1996) (10)
Fault Tolerance in Networks of Bounded Degree (Preliminary Version) (1986) (9)
Distributed agreement in dynamic peer-to-peer networks (2011) (9)
Entropy-based bounds for online algorithms (2007) (9)
Differentially mutated subnetworks discovery (2019) (9)
MADMX: A Novel Strategy for Maximal Dense Motif Extraction (2009) (9)
Random graph models for the web graph (2000) (9)
On the parallel complexity of evaluating game trees (1991) (9)
Probability and Computing: Martingales (2005) (8)
A learned comparative expression measure for Affymetrix genechip DNA microarrays (2005) (8)
Randomized routing with shorter paths (1993) (8)
Safe Visual Data Exploration (2017) (8)
Steady state analysis of balanced‐allocation routing (2002) (7)
On the Complexity of Anonymous Communication Through Public Networks (2019) (7)
Learning Equilibria of Simulation-Based Games (2019) (7)
Efficient Approximation for Restricted Biclique Cover Problems (2018) (7)
On the Sample Complexity of Cancer Pathways Identification (2015) (7)
A Clustering Approach to Solving Large Stochastic Matching Problems (2001) (6)
Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams (2017) (6)
A Fast Construction oF Disjoint Paths in Communication Networks (1983) (6)
A Wait-Free Sorting Algorithm (1997) (6)
Efficient communication in an ad-hoc network (2004) (6)
Probability and Computing: Events and Probability (2005) (6)
A Steady State Analysis of Di racting Trees (1997) (5)
A Rademacher Complexity Based Method for Controlling Power and Confidence Level in Adaptive Statistical Analysis (2019) (5)
Reliable Fault Diagnosis with Few Tests (1998) (5)
Sort Me If You Can: How to Sort Dynamic Data (2009) (5)
Probability and computing : an introduction to randomizedalgorithms and probabilistic analysis (2005) (5)
Making mean-estimation more efficient using an MCMC trace variance approach: DynaMITE (2020) (5)
Hierarchical Preferences in a Broad-Coverage Lexical Taxonomy (2005) (4)
Computing with Unreliable Information (Preliminary Version) (1990) (4)
Wiggins: Detecting Valuable Information in Dynamic Networks Using Limited Resources (2015) (4)
VC-Dimension and Rademacher Averages: From Statistical Learning Theory to Sampling Algorithms (2015) (4)
Stochastic Analysis of the $k$-Server Problem on the Circle (2010) (4)
Distributed Graph Diameter Approximation (2020) (4)
Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles (2015) (4)
Computing Near Optimal Strategies for Stochastic Investment Planning Problems (1999) (4)
Dynamic Packet Routing on Arrays with Bounded Buffers (1998) (4)
An Experimental Study of Wormhole Routing in Parallel Computers (1992) (4)
A fast parallel construction of disjoint paths in networks (1985) (3)
Safe and Efficient Traffic Laws for Mobile Robots (1996) (3)
On the Theory of Interconnection Networks for Parallel Computers (1994) (3)
Balanced Allocation: Patience is not a Virtue (2016) (3)
Sequence Reconstruction from Nucleic Acid Microarray Data (2005) (2)
Probability and Computing: Coupling of Markov Chains (2005) (2)
Real-Time Communication Scheduling in a Multicomputer Video Server (1999) (2)
The k-Nearest Representatives Classifier: A Distance-Based Classifier with Strong Generalization Bounds (2017) (2)
A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) (1988) (2)
A rigorous statistical approach for identifying significant itemsets (2009) (2)
Static and dynamic evaluation of QoS properties (1999) (2)
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). (1997) (2)
Real-Time Targeted-Influence Queries over Large Graphs (2017) (2)
Wikipedia Polarization and Its Effects on Navigation Paths (2019) (2)
Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic (2016) (2)
Wikipedia's Network Bias on Controversial Topics (2020) (2)
Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds (2021) (2)
Efficient methods for computing investment strategies for multi-market commodity trading (2001) (2)
Tiered Sampling (2021) (1)
Finding driver pathways in cancer: models and algorithms (2012) (1)
VizRec: A framework for secure data exploration via visual representation (2018) (1)
Design and Analysis of Dynamic Processes: A Stocastic Approach (1998) (1)
Ordalia: Deep Learning Hyperparameter Search via Generalization Error Bounds Extrapolation (2019) (1)
Design and Analysis of Dynamic Processes: A Stochastic Approach (1998) (1)
The advantage of balanced-allocation routing for ATM networks (2003) (1)
Stochastic Analysis of Dynamic Processes (1997) (1)
Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space (2014) (1)
Computing Global Strategies for Multi-Market Commodity Trading (2000) (1)
Genome-Wide Survival Analysis of Somatic Mutations in Cancer (2013) (1)
Nonparametric Density Estimation under Distribution Drift (2023) (1)
Pairwise Independence and Universal Hash Functions (2005) (1)
אלגוריתמים הסתברותיים מבזרים לבעיות בתורת הגרפים, תקשורת תאום ותזמון (Distributed probabilistic algorithms for problems in graph theory.) (1983) (0)
Stochastic Analyses of Dynamic Computer Processes (2002) (0)
Markov Chains and Random Walks (2005) (0)
Differentially mutated subnetworks discovery (2019) (0)
Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007 (2007) (0)
22 17141 – Probabilistic Methods in the Design and Analysis of Algorithms Participants (2017) (0)
THE COlVIPLEXITY 014 -' PARALLEIJ COMPUTATION ON MATROlDS (1985) (0)
Cryptic Population Substructure and Fuzzy Clustering Senior Honors Thesis Department of Computer Science (2012) (0)
Dynamic Packet Rout ing on Arrays with B o u n d e d Buffers (0)
Continuous Distributions and the Poisson Process (2005) (0)
Tight Lower Bounds on Worst-Case Guarantees for Zero-Shot Learning with Attributes (2022) (0)
Entropy, Randomness, and Information (2005) (0)
Performance analysis of dynamic processes (2003) (0)
Algorithmic Principles1 (2015) (0)
Ja n 20 18 BALANCED ALLOCATION : PATIENCE IS NOT A VIRTUE (2021) (0)
VizCertify: A Framework for Secure Visual Data Exploration (2019) (0)
Brain Functional Connectivity Estimation Utilizing Diffusion Kernels on a Structural Connectivity Graph (2021) (0)
Constructing Disjoint Paths on Expander Graphs (Extended Abstract) (1987) (0)
Identifying significant mutations in large cohorts of cancer genomes (2013) (0)
Learning Stochastically Evolving Networks via Local Probing (2017) (0)
Can Entropy Chara terize Performan e of Online Algorithms ? (2001) (0)
Uniform Convergence Bounds for Codec Selection (2018) (0)
Information Processing Letters running time of the random simplex algorithm is exponential in the height (1995) (0)
Scalable and Provably Secure P2P Communication Protocols (2017) (0)
The Probabilistic Hitting Set Paradigm: a General Framework for Search and Detection in Dynamic Social Networks (2015) (0)
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141) (2017) (0)
Efficient traffic laws for mobile robots—work in progress (1996) (0)
PROBABILISTIC ANALYSIS OF THE K-SERVER PROBLEM ON THE CIRCLE (2010) (0)
Workshop: Algorithms for discovery of mutated pathways in cancer (2012) (0)
Formal Correctness Proofs of a Nondeterministic Program (1982) (0)
An Adaptive Algorithm for Learning with Unknown Distribution Drift (2023) (0)
Algorithmic Principles 1 (2015) (0)
Probability and Computing: Balls, Bins, and Random Graphs (2005) (0)
Some Practical Randomized Algorithms and Data Structures (2014) (0)
Moments and Deviations (2005) (0)
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms (2007) (0)
Minimizing operational cost for zero information leakage (2017) (0)
The Monte Carlo Method (2005) (0)
Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights (2022) (0)
How Inclusive Are Wikipedia’s Hyperlinks in Articles Covering Polarizing Topics? (2020) (0)
Probability and Computing: Discrete Random Variables and Expectation (2005) (0)
The Probabilistic Method (2005) (0)
Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection (2015) (0)
Neuro-Hotnet: A Graph Theoretic Approach for Brain FC Estimation (2021) (0)

This paper list is powered by the following services:

Other Resources About Eli Upfal

en.wikipedia.org

What Schools Are Affiliated With Eli Upfal?

Eli Upfal is affiliated with the following schools: