Research focus
About the research
How can probability theory and combinatorics be applied to the design and analysis of computer algorithms?
Read the full research overview
Eli Upfal's general research area is theory of computation, applying rigorous mathematical tools to the design and analysis of computer algorithms. Randomness comes up in the study of randomized algorithms and probabilistic analysis of algorithms. Probabilistic analysis of algorithms attempts to characterize the average-case performance of algorithms on typical inputs. Recent work includes probabilistic techniques for studying the long-term behavior of dynamic computer processes such as communication, load balancing, cashing, and paging.
Selected publications
3 listedReducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights
Data Mining and Knowledge Discovery
Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds
arXiv (Cornell University)
Tiered Sampling: An Efficient Method for Counting Sparse Motifs in Massive Graph Streams
ACM Transactions on Knowledge Discovery from Data
People & alumni
Team details haven’t been added. See the lab’s website for its current members.
Alumni details haven’t been added. Check the lab’s official website.
Sources & listing information
Find Research Labs maintains this page using public sources. The faculty member, lab, and university have not claimed or approved this listing. Listing a lab does not indicate endorsement, partnership, or a recruiting opportunity.
Request a correction or removal ↗ · About directory listings