| 2025 | AISTATS | An Adaptive Method for Weak Supervision with Drifting Data. | Alessio Mazzetto, Reza Esfandiarpoor, Akash Singirikonda, Eli Upfal, Stephen H. Bach |
| 2025 | ALT | Center-Based Approximation of a Drifting Distribution. | Alessio Mazzetto, Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal |
| 2024 | TCC | Bruisable Onions: Anonymous Communication in the Asynchronous Model. | Megumi Ando, Anna Lysyanskaya, Eli Upfal |
| 2023 | ICML | Nonparametric Density Estimation under Distribution Drift. | Alessio Mazzetto, Eli Upfal |
| 2021 | AISTATS | Semi-Supervised Aggregation of Dependent Weak Supervision Sources With Performance Guarantees. | Alessio Mazzetto, Dylan Sam, Andrew Park, Eli Upfal, Stephen H. Bach |
| 2021 | ICML | Adversarial Multi Class Learning under Weak Supervision with Performance Guarantees. | Alessio Mazzetto, Cyrus Cousins, Dylan Sam, Stephen H. Bach, Eli Upfal |
| 2021 | WSDM | RePBubLik: Reducing Polarized Bubble Radius with Link Insertions. | Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal |
| 2019 | DSAA | VizCertify: A Framework for Secure Visual Data Exploration. | Lorenzo De Stefani, Leonhard F. Spiegelberg, Eli Upfal, Tim Kraska |
| 2019 | DSAA | A Rademacher Complexity Based Method for Controlling Power and Confidence Level in Adaptive Statistical Analysis. | Lorenzo De Stefani, Eli Upfal |
| 2019 | SIGMOD | Democratizing Data Science through Interactive Curation of ML Pipelines. | Zeyuan Shang, Emanuel Zgraggen, Benedetto Buratti, Ferdinand Kossmann, Philipp Eichmann, Yeounoh Chung, Carsten Binnig, Eli Upfal, Tim Kraska |
| 2018 | ICALP | Practical and Provably Secure Onion Routing. | Megumi Ando, Anna Lysyanskaya, Eli Upfal |
| 2018 | SIGMOD | Towards Interactive Curation & Automatic Tuning of ML Pipelines. | Carsten Binnig, Benedetto Buratti, Yeounoh Chung, Cyrus Cousins, Tim Kraska, Zeyuan Shang, Eli Upfal, Robert C. Zeleznik, Emanuel Zgraggen |
| 2018 | WABI | Differentially Mutated Subnetworks Discovery. | Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin |
| 2017 | CIDR | Toward Sustainable Insights, or Why Polygamy is Bad for You. | Carsten Binnig, Lorenzo De Stefani, Tim Kraska, Eli Upfal, Emanuel Zgraggen, Zheguang Zhao |
| 2017 | DSAA | The k-Nearest Representatives Classifier: A Distance-Based Classifier with Strong Generalization Bounds. | Cyrus Cousins, Eli Upfal |
| 2017 | SIGMOD | Controlling False Discoveries During Interactive Data Exploration. | Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska |
| 2017 | SIGMOD | Safe Visual Data Exploration. | Zheguang Zhao, Emanuel Zgraggen, Lorenzo De Stefani, Carsten Binnig, Eli Upfal, Tim Kraska |
| 2016 | AAAI | Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic. | Lorenzo De Stefani, Alessandro Epasto, Eli Upfal, Fabio Vandin |
| 2016 | KDD | Scalable Betweenness Centrality Maximization via Sampling. | Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal |
| 2016 | KDD | ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages. | Matteo Riondato, Eli Upfal |
| 2016 | KDD | TRIST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size. | Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal |
| 2016 | SODA | Balanced Allocation: Patience is not a Virtue. | John Augustine, William K. Moses Jr., Amanda Redlich, Eli Upfal |
| 2016 | WSDM | Wiggins: Detecting Valuable Information in Dynamic Networks Using Limited Resources. | Ahmad Mahmoody, Matteo Riondato, Eli Upfal |
| 2015 | COCOA | Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection. | Ahmad Mahmoody, Evgenios M. Kornaropoulos, Eli Upfal |
| 2015 | DATE | Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles. | Guru Prakash Arumugam, Prashanth Srikanthan, John Augustine, Krishna V. Palem, Eli Upfal, Ayush Bhargava, Parishkrati, Sreelatha Yenugula |
| 2015 | FOCS | Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. | John Augustine, Gopal Pandurangan, Peter Robinson, Scott T. Roche, Eli Upfal |
| 2015 | KDD | Mining Frequent Itemsets through Progressive Sampling with Rademacher Averages. | Matteo Riondato, Eli Upfal |
| 2015 | KDD | VC-Dimension and Rademacher Averages: From Statistical Learning Theory to Sampling Algorithms. | Matteo Riondato, Eli Upfal |
| 2015 | RECOMB | On the Sample Complexity of Cancer Pathways Identification. | Fabio Vandin, Benjamin J. Raphael, Eli Upfal |
| 2015 | SPAA | Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. | Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal |
| 2014 | EDBT | Contender: A Resource Modeling Approach for Concurrent Query Performance Prediction. | Jennie Duggan, Olga Papaemmanouil, Ugur etintemel, Eli Upfal |
| 2014 | ICALP | The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. | Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal |
| 2013 | ICDCN | Fast Distributed PageRank Computation. | Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal |
| 2013 | RECOMB | Genome-Wide Survival Analysis of Somatic Mutations in Cancer. | Fabio Vandin, Alexandra Papoutsaki, Benjamin J. Raphael, Eli Upfal |
| 2013 | SPAA | Storage and search in dynamic peer-to-peer networks. | John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal |
| 2012 | CIKM | PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce. | Matteo Riondato, Justin A. DeBrabant, Rodrigo Fonseca, Eli Upfal |
| 2012 | ICDE | Learning-based Query Performance Modeling and Prediction. | Mert Akdere, Ugur etintemel, Matteo Riondato, Eli Upfal, Stanley B. Zdonik |
| 2012 | ICS | Space-round tradeoffs for MapReduce computations. | Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal |
| 2012 | KDD | PageRank on an evolving graph. | Bahman Bahmani, Ravi Kumar, Mohammad Mahdian, Eli Upfal |
| 2012 | PSB | Discovery of Mutated Subnetworks Associated with Clinical Data in Cancer. | Fabio Vandin, Patrick Clay, Eli Upfal, Benjamin J. Raphael |
| 2012 | SODA | Towards robust and efficient computation in dynamic peer-to-peer networks. | John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal |
| 2011 | CIDR | The Case for Predictive Database Systems: Opportunities and Challenges. | Mert Akdere, Ugur etintemel, Matteo Riondato, Eli Upfal, Stanley B. Zdonik |
| 2011 | PODC | Tight bounds on information dissemination in sparse mobile networks. | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal |
| 2011 | RECOMB | Untitled record | Fabio Vandin, Eli Upfal, Benjamin J. Raphael |
| 2011 | SIGMOD | Performance prediction for concurrent database workloads. | Jennie Duggan, Ugur etintemel, Olga Papaemmanouil, Eli Upfal |
| 2011 | WABI | Finding Driver Pathways in Cancer: Models and Algorithms. | Fabio Vandin, Eli Upfal, Benjamin J. Raphael |
| 2010 | RECOMB | Algorithms for Detecting Significantly Mutated Pathways in Cancer. | Fabio Vandin, Eli Upfal, Benjamin J. Raphael |
| 2009 | ICALP | Sort Me If You Can: How to Sort Dynamic Data. | Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal |
| 2009 | PODS | An efficient rigorous approach for identifying statistically significant frequent itemsets. | Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin |
| 2009 | WABI | MADMX: A Novel Strategy for Maximal Dense Motif Extraction. | Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin |
| 2008 | COLT | Adapting to a Changing Environment: the Brownian Restless Bandits. | Aleksandrs Slivkins, Eli Upfal |
| 2008 | SODA | The hiring problem and Lake Wobegon strategies. | Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii |
| 2008 | STOC | Multi-armed bandits in metric spaces. | Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal |
| 2007 | AAAI | Propagating Knapsack Constraints in Sublinear Time. | Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck |
| 2007 | ICALP | Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. | Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal |
| 2007 | PODS | Finding near neighbors through cluster pruning. | Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal |
| 2003 | FOCS | Stability and Efficiency of a Random Local Load Balancing Protocol. | Aris Anagnostopoulos, Adam Kirsch, Eli Upfal |
| 2003 | FOCS | Performance Analysis of Dynamic Network Processes. | Eli Upfal |
| 2002 | COCOON | Using PageRank to Characterize Web Structure. | Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal |
| 2001 | FOCS | Building Low-Diameter P2P Networks. | Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal |
| 2001 | SODA | Can entropy characterize performance of online algorithms?. | Gopal Pandurangan, Eli Upfal |
| 2001 | UAI | A Clustering Approach to Solving Large Stochastic Matching Problems. | Milos Hauskrecht, Eli Upfal |
| 2000 | FOCS | Random graph models for the web graph. | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal |
| 2000 | PODS | The Web as a Graph. | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal |
| 2000 | RECOMB | Sequencing-by-hybridization at the information-theory bound: an optimal algorithm. | Franco P. Preparata, Eli Upfal |
| 1999 | FOCS | Reducing Network Congestion and Blocking Probability Through Balanced Allocation. | Malwina J. Luczak, Eli Upfal |
| 1999 | IJCAI | Computing Near Optimal Strategies for Stochastic Investment Planning Problems. | Milos Hauskrecht, Gopal Pandurangan, Eli Upfal |
| 1999 | RECOMB | On the power of universal bases in sequencing by hybridization. | Franco P. Preparata, Alan M. Frieze, Eli Upfal |
| 1999 | STOC | Static and Dynamic Evaluation of QoS Properties. | Gopal Pandurangan, Eli Upfal |
| 1998 | ESA | Design and Analysis of Dynamic Processes: A Stochastic Approach. | Eli Upfal |
| 1998 | LATIN | Dynamic Packet Routing on Arrays with Bounded Buffers. | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
| 1997 | FCT | Stochastic Analysis of Dynamic Processes. | Eli Upfal |
| 1997 | PODC | A Wait-Free Sorting Algorithm. | Nir Shavit, Eli Upfal, Asaph Zemach |
| 1997 | STOC | Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
| 1996 | FOCS | A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
| 1996 | PODC | Efficient Traffic Laws for Mobile Robots - Work in Progress (Avstract). | Sonne Preminger, Eli Upfal |
| 1996 | SODA | An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. | Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal |
| 1996 | STOC | Dynamic Deflection Routing on Arrays (Preliminary Version). | Andrei Z. Broder, Eli Upfal |
| 1996 | SPAA | A Steady State Analysis of Diffracting Trees (Extended Abstract). | Nir Shavit, Eli Upfal, Asaph Zemach |
| 1995 | STOC | Stochastic contention resolution with short delays. | Prabhakar Raghavan, Eli Upfal |
| 1994 | ICALP | On the Theory of Interconnection Networks for Parallel Computers. | Eli Upfal |
| 1994 | SODA | Optimal Construction of Edge-Disjoint Paths in Random Graphs. | Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal |
| 1994 | STOC | Balanced allocations (extended abstract). | Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal |
| 1994 | STOC | Efficient routing in all-optical networks. | Prabhakar Raghavan, Eli Upfal |
| 1993 | SODA | On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
| 1993 | STOC | How much can hardware help routing? | Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal |
| 1993 | SPAA | Randomized routing with shorter paths. | Eli Upfal, Sergio A. Felperin, Marc Snir |
| 1992 | FOCS | A Theory of Wormhole Routing in Parallel Computers (Extended Abstract) | Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal |
| 1992 | ICALP | Near-perfect Token Distribution. | Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal |
| 1992 | PODC | Tolerating Linear Number of Faults in Networks of Bounded Degree. | Eli Upfal |
| 1992 | STOC | Existence and Construction of Edge Disjoint Paths on Expander Graphs | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
| 1991 | SODA | On the Parallel Complexity of Evaluating Game Trees. | Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal |
| 1991 | SPAA | A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. | Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal |
| 1990 | FOCS | Fault Tolerant Sorting Network | Shay Assaf, Eli Upfal |
| 1990 | STOC | Computing with Unreliable Information (Preliminary Version) | Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal |
| 1989 | STOC | Trading Space for Time in Undirected s-t Connectivity | Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal |
| 1989 | STOC | An O(log N) Deterministic Packet Routing Scheme (Preliminary Version) | Eli Upfal |
| 1988 | STOC | A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) | Danny Krizanc, David Peleg, Eli Upfal |
| 1988 | STOC | A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract) | David Peleg, Eli Upfal |
| 1987 | STOC | Constructing Disjoint Paths on Expander Graphs (Extended Abstract) | David Peleg, Eli Upfal |
| 1986 | FOCS | The Token Distribution Problem (Preliminary Version) | David Peleg, Eli Upfal |
| 1986 | ICALP | A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. | Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson |
| 1986 | STOC | Fault Tolerance in Networks of Bounded Degree (Preliminary Version) | Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal |
| 1986 | STOC | Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version) | Anna R. Karlin, Eli Upfal |
| 1986 | STACS | A Time-Space Tradeoff for Element Distinctness. | Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson |
| 1985 | FOCS | The Complexity of Parallel Computation on Matroids | Richard M. Karp, Eli Upfal, Avi Wigderson |
| 1985 | STOC | Constructing a Perfect Matching is in Random NC | Richard M. Karp, Eli Upfal, Avi Wigderson |
| 1985 | STOC | Are Search and Decision Problems Computationally Equivalent? | Richard M. Karp, Eli Upfal, Avi Wigderson |
| 1984 | FOCS | How to Share Memory in a Distributed System (A Preliminary Version) | Eli Upfal, Avi Wigderson |
| 1984 | STOC | A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version) | Eli Upfal |
| 1983 | FCT | A Fast Construction oF Disjoint Paths in Communication Networks. | Eli Shamir, Eli Upfal |
| 1982 | PODC | N-Processors Graph Distributively Achieve Perfect Matchings in O(log | Eli Shamir, Eli Upfal |
| 1982 | PODC | Efficient Schemes for Parallel Communication. | Eli Upfal |