Eli Upfal - RankMe

269 papers A* 70A 16B 19C 4Misc 3Journal 124Unranked 28

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Balanced allocation: considerations from large scale service environments. CoRR Amer Diwan, Prabhakar Raghavan, Eli Upfal
2025	A	`conf`	An Adaptive Method for Weak Supervision with Drifting Data. AISTATS Alessio Mazzetto, Reza Esfandiarpoor, Akash Singirikonda, Eli Upfal, Stephen H. Bach
2025	B	`conf`	Center-Based Approximation of a Drifting Distribution. ALT Alessio Mazzetto, Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2025	—	`conf`	DiNgHy: Null Models for Non-degenerate Directed Hypergraphs. ECML/PKDD (3) Maryam Abuissa, Matteo Riondato, Eli Upfal
2024	—	`conf`	Bruisable Onions: Anonymous Communication in the Asynchronous Model. TCC (1) Megumi Ando, Anna Lysyanskaya, Eli Upfal
2024	J	`jnl`	Bruisable Onions: Anonymous Communication in the Asynchronous Model. IACR Cryptol. ePrint Arch. Megumi Ando, Anna Lysyanskaya, Eli Upfal
2024	J	`jnl`	Statistical and Probabilistic Methods in Algorithmic Data Analysis (Dagstuhl Seminar 24391). Dagstuhl Reports Aristides Gionis, Matteo Riondato, Eli Upfal
2023	A*	`conf`	An Adaptive Algorithm for Learning with Unknown Distribution Drift. NeurIPS Alessio Mazzetto, Eli Upfal
2023	J	`jnl`	An Adaptive Algorithm for Learning with Unknown Distribution Drift. CoRR Alessio Mazzetto, Eli Upfal
2023	J	`jnl`	An Adaptive Method for Weak Supervision with Drifting Data. CoRR Alessio Mazzetto, Reza Esfandiarpoor, Eli Upfal, Stephen H. Bach
2023	A*	`conf`	Nonparametric Density Estimation under Distribution Drift. ICML Alessio Mazzetto, Eli Upfal
2023	J	`jnl`	Nonparametric Density Estimation under Distribution Drift. CoRR Alessio Mazzetto, Eli Upfal
2022	J	`jnl`	Balanced Allocation: Patience Is Not a Virtue. SIAM J. Comput. John Augustine, William K. Moses Jr., Amanda Redlich, Eli Upfal
2022	J	`jnl`	Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights. Data Min. Knowl. Discov. Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal
2022	A*	`conf`	Tight Lower Bounds on Worst-Case Guarantees for Zero-Shot Learning with Attributes. NeurIPS Alessio Mazzetto, Cristina Menghini, Andrew Yuan, Eli Upfal, Stephen H. Bach
2022	J	`jnl`	Tight Lower Bounds on Worst-Case Guarantees for Zero-Shot Learning with Attributes. CoRR Alessio Mazzetto, Cristina Menghini, Andrew Yuan, Eli Upfal, Stephen H. Bach
2021	A*	`conf`	Adversarial Multi Class Learning under Weak Supervision with Performance Guarantees. ICML Alessio Mazzetto, Cyrus Cousins, Dylan Sam, Stephen H. Bach, Eli Upfal
2021	A*	`conf`	Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds. NeurIPS Shahrzad Haddadan, Yue Zhuang, Cyrus Cousins, Eli Upfal
2021	J	`jnl`	Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds. CoRR Shahrzad Haddadan, Yue Zhuang, Cyrus Cousins, Eli Upfal
2021	—	`conf`	How Inclusive Are Wikipedia's Hyperlinks in Articles Covering Polarizing Topics? IEEE BigData Cristina Menghini, Aris Anagnostopoulos, Eli Upfal
2021	J	`jnl`	Neuro-Hotnet: A Graph Theoretic Approach for Brain FC Estimation. CoRR Nathan Tung, Eli Upfal, Jerome N. Sanes, Ani Eloyan
2021	A	`conf`	On the Complexity of Anonymous Communication Through Public Networks. ITC Megumi Ando, Anna Lysyanskaya, Eli Upfal
2021	A	`conf`	RePBubLik: Reducing Polarized Bubble Radius with Link Insertions. WSDM Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal
2021	J	`jnl`	RePBubLik: Reducing the Polarized Bubble Radius with Link Insertions. CoRR Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal
2021	A	`conf`	Semi-Supervised Aggregation of Dependent Weak Supervision Sources With Performance Guarantees. AISTATS Alessio Mazzetto, Dylan Sam, Andrew Park, Eli Upfal, Stephen H. Bach
2021	J	`jnl`	Tiered Sampling: An Efficient Method for Counting Sparse Motifs in Massive Graph Streams. ACM Trans. Knowl. Discov. Data Lorenzo De Stefani, Erisa Terolli, Eli Upfal
2020	J	`jnl`	Distributed Graph Diameter Approximation. Algorithms Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2020	J	`jnl`	Making mean-estimation more efficient using an MCMC trace variance approach: DynaMITE. CoRR Cyrus Cousins, Shahrzad Haddadan, Eli Upfal
2020	J	`jnl`	Wikipedia's Network Bias on Controversial Topics. CoRR Cristina Menghini, Aris Anagnostopoulos, Eli Upfal
2019	J	`jnl`	A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis. CoRR Lorenzo De Stefani, Eli Upfal
2019	B	`conf`	A Rademacher Complexity Based Method for Controlling Power and Confidence Level in Adaptive Statistical Analysis. DSAA Lorenzo De Stefani, Eli Upfal
2019	J	`jnl`	Bandits and Experts in Metric Spaces. J. ACM Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
2019	—	`conf`	Democratizing Data Science through Interactive Curation of ML Pipelines. SIGMOD Conference Zeyuan Shang, Emanuel Zgraggen, Benedetto Buratti, Ferdinand Kossmann, Philipp Eichmann, Yeounoh Chung, Carsten Binnig, Eli Upfal, Tim Kraska
2019	J	`jnl`	Differentially mutated subnetworks discovery. Algorithms Mol. Biol. Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin
2019	J	`jnl`	Learning Equilibria of Simulation-Based Games. CoRR Enrique Areyan Viqueira, Cyrus Cousins, Eli Upfal, Amy Greenwald
2019	A	`conf`	Learning Simulation-Based Games from Data. AAMAS Enrique Areyan Viqueira, Amy Greenwald, Cyrus Cousins, Eli Upfal
2019	J	`jnl`	On the Complexity of Anonymous Communication Through Public Networks. CoRR Megumi Ando, Anna Lysyanskaya, Eli Upfal
2019	J	`jnl`	Optimizing static and adaptive probing schedules for rapid event detection. Theor. Comput. Sci. Ahmad Mahmoody, Eli Upfal
2019	—	`conf`	Ordalia: Deep Learning Hyperparameter Search via Generalization Error Bounds Extrapolation. IEEE BigData Benedetto Buratti, Eli Upfal
2019	B	`conf`	VizCertify: A Framework for Secure Visual Data Exploration. DSAA Lorenzo De Stefani, Leonhard F. Spiegelberg, Eli Upfal, Tim Kraska
2019	—	`conf`	Wikipedia Polarization and Its Effects on Navigation Paths. IEEE BigData Cristina Menghini, Aris Anagnostopoulos, Eli Upfal
2018	J	`jnl`	ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages. ACM Trans. Knowl. Discov. Data Matteo Riondato, Eli Upfal
2018	C	`conf`	Differentially Mutated Subnetworks Discovery. WABI Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin
2018	J	`jnl`	Efficient Approximation for Restricted Biclique Cover Problems. Algorithms Alessandro Epasto, Eli Upfal
2018	A*	`conf`	Practical and Provably Secure Onion Routing. ICALP Megumi Ando, Anna Lysyanskaya, Eli Upfal
2018	—	`conf`	Towards Interactive Curation & Automatic Tuning of ML Pipelines. DEEM@SIGMOD Carsten Binnig, Benedetto Buratti, Yeounoh Chung, Cyrus Cousins, Tim Kraska, Zeyuan Shang, Eli Upfal, Robert C. Zeleznik, Emanuel Zgraggen
2018	J	`jnl`	Uniform Convergence Bounds for Codec Selection. CoRR Clayton Sanford, Cyrus Cousins, Eli Upfal
2018	J	`jnl`	Unknown Examples & Machine Learning Model Generalization. CoRR Yeounoh Chung, Peter J. Haas, Eli Upfal, Tim Kraska
2018	J	`jnl`	VizRec: A framework for secure data exploration via visual representation. CoRR Lorenzo De Stefani, Leonhard F. Spiegelberg, Tim Kraska, Eli Upfal
2017	—	`conf`	Controlling False Discoveries During Interactive Data Exploration. SIGMOD Conference Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska
2017	J	`jnl`	MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. Proc. VLDB Endow. Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2017	—	`conf`	Minimizing operational cost for zero information leakage. ICC Megumi Ando, Eli Upfal
2017	J	`jnl`	Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). Dagstuhl Reports Bodo Manthey, Claire Mathieu, Heiko Röglin, Eli Upfal
2017	B	`conf`	Real-Time Targeted-Influence Queries over Large Graphs. ASONAM Alessandro Epasto, Ahmad Mahmoody, Eli Upfal
2017	—	`conf`	Safe Visual Data Exploration. SIGMOD Conference Zheguang Zhao, Emanuel Zgraggen, Lorenzo De Stefani, Carsten Binnig, Eli Upfal, Tim Kraska
2017	J	`jnl`	Scalable and Provably Secure P2P Communication Protocols. CoRR Megumi Ando, Anna Lysyanskaya, Eli Upfal
2017	J	`jnl`	TRIÈST: Counting Local and Global Triangles in Fully Dynamic Streams with Fixed Memory Size. ACM Trans. Knowl. Discov. Data Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal
2017	B	`conf`	The k-Nearest Representatives Classifier: A Distance-Based Classifier with Strong Generalization Bounds. DSAA Cyrus Cousins, Eli Upfal
2017	J	`jnl`	Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams. CoRR Lorenzo De Stefani, Erisa Terolli, Eli Upfal
2017	—	`conf`	Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams. IEEE BigData Lorenzo De Stefani, Erisa Terolli, Eli Upfal
2017	A	`conf`	Toward Sustainable Insights, or Why Polygamy is Bad for You. CIDR Carsten Binnig, Lorenzo De Stefani, Tim Kraska, Eli Upfal, Emanuel Zgraggen, Zheguang Zhao
2017	—	`conf`	Towards Interactive Data Exploration. BIRTE (Revised Selected Papers) Carsten Binnig, Fuat Basik, Benedetto Buratti, Ugur Çetintemel, Yeounoh Chung, Andrew Crotty, Cyrus Cousins, Dylan Ebert, Philipp Eichmann, Alex Galakatos, Benjamin Hättasch, Amir Ilkhechi, Tim Kraska, Zeyuan Shang, Isabella Tromba, Arif Usta, Prasetya Ajie Utama, Eli Upfal, Linnan Wang, Nathaniel Weir, Robert C. Zeleznik, Emanuel Zgraggen
2016	A	`conf`	A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. IPDPS Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2016	A*	`conf`	ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages. KDD Matteo Riondato, Eli Upfal
2016	J	`jnl`	ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages. CoRR Matteo Riondato, Eli Upfal
2016	A*	`conf`	Balanced Allocation: Patience is not a Virtue. SODA John Augustine, William K. Moses Jr., Amanda Redlich, Eli Upfal
2016	J	`jnl`	Balanced Allocation: Patience is not a Virtue. CoRR John Augustine, William K. Moses Jr., Amanda Redlich, Eli Upfal
2016	J	`jnl`	Controlling False Discoveries During Interactive Data Exploration. CoRR Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska
2016	J	`jnl`	MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. CoRR Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2016	J	`jnl`	On the Sample Complexity of Cancer Pathways Identification. J. Comput. Biol. Fabio Vandin, Benjamin J. Raphael, Eli Upfal
2016	A*	`conf`	Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic. AAAI Lorenzo De Stefani, Alessandro Epasto, Eli Upfal, Fabio Vandin
2016	A*	`conf`	Scalable Betweenness Centrality Maximization via Sampling. KDD Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal
2016	J	`jnl`	Scalable Betweenness Centrality Maximization via Sampling. CoRR Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal
2016	A*	`conf`	TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size. KDD Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal
2016	J	`jnl`	TRIÈST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size. CoRR Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal
2016	A	`conf`	Wiggins: Detecting Valuable Information in Dynamic Networks Using Limited Resources. WSDM Ahmad Mahmoody, Matteo Riondato, Eli Upfal
2015	J	`jnl`	A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. CoRR Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2015	J	`jnl`	Accurate Computation of Survival Statistics in Genome-Wide Studies. PLoS Comput. Biol. Fabio Vandin, Alexandra Papoutsaki, Benjamin J. Raphael, Eli Upfal
2015	J	`jnl`	Distributed agreement in dynamic peer-to-peer networks. J. Comput. Syst. Sci. John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal
2015	A*	`conf`	Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. FOCS John Augustine, Gopal Pandurangan, Peter Robinson, Scott T. Roche, Eli Upfal
2015	J	`jnl`	Fast distributed PageRank computation. Theor. Comput. Sci. Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal
2015	A*	`conf`	Mining Frequent Itemsets through Progressive Sampling with Rademacher Averages. KDD Matteo Riondato, Eli Upfal
2015	A	`conf`	Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles. DATE Guru Prakash Arumugam, Prashanth Srikanthan, John Augustine, Krishna V. Palem, Eli Upfal, Ayush Bhargava, Parishkrati, Sreelatha Yenugula
2015	B	`conf`	On the Sample Complexity of Cancer Pathways Identification. RECOMB Fabio Vandin, Benjamin J. Raphael, Eli Upfal
2015	C	`conf`	Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection. COCOA Ahmad Mahmoody, Evgenios M. Kornaropoulos, Eli Upfal
2015	J	`jnl`	Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection. CoRR Ahmad Mahmoody, Evgenios M. Kornaropoulos, Eli Upfal
2015	B	`conf`	Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. SPAA Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2015	J	`jnl`	The Probabilistic Hitting Set Paradigm: a General Framework for Search and Detection in Dynamic Social Networks. CoRR Ahmad Mahmoody, Eli Upfal
2015	A*	`conf`	VC-Dimension and Rademacher Averages: From Statistical Learning Theory to Sampling Algorithms. KDD Matteo Riondato, Eli Upfal
2014	B	`conf`	Contender: A Resource Modeling Approach for Concurrent Query Performance Prediction. EDBT Jennie Duggan, Olga Papaemmanouil, Ugur Çetintemel, Eli Upfal
2014	J	`jnl`	Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. ACM Trans. Knowl. Discov. Data Matteo Riondato, Eli Upfal
2014	J	`jnl`	Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space. CoRR Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2014	—	`ch.`	Some Practical Randomized Algorithms and Data Structures. Computing Handbook, 3rd ed. (1) Michael Mitzenmacher, Eli Upfal
2014	—	`conf`	The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. ICALP (2) Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal
2014	J	`jnl`	The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. CoRR Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal
2013	J	`jnl`	A Clustering Approach to Solving Large Stochastic Matching Problems CoRR Milos Hauskrecht, Eli Upfal
2013	J	`jnl`	Bandits and Experts in Metric Spaces. CoRR Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
2013	—	`ed.`	Computing Frontiers Conference, CF'13, Ischia, Italy, May 14 - 16, 2013 Conf. Computing Frontiers Hubertus Franke, Alexander Heinecke, Krishna V. Palem, Eli Upfal
2013	Misc	`conf`	Fast Distributed PageRank Computation. ICDCN Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal
2013	B	`conf`	Genome-Wide Survival Analysis of Somatic Mutations in Cancer. RECOMB Fabio Vandin, Alexandra Papoutsaki, Benjamin J. Raphael, Eli Upfal
2013	—	`conf`	Identifying significant mutations in large cohorts of cancer genomes. ICCABS Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2013	J	`jnl`	Storage and Search in Dynamic Peer-to-Peer Networks CoRR John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
2013	B	`conf`	Storage and search in dynamic peer-to-peer networks. SPAA John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
2012	J	`jnl`	Algorithms and Genome Sequencing: Identifying Driver Pathways in Cancer. Computer Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2012	A	`conf`	Algorithms on evolving graphs. ITCS Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal, Fabio Vandin
2012	J	`jnl`	An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. J. ACM Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2012	Misc	`conf`	Discovery of Mutated Subnetworks Associated with Clinical Data in Cancer. Pacific Symposium on Biocomputing Fabio Vandin, Patrick Clay, Eli Upfal, Benjamin J. Raphael
2012	—	`conf`	Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. ECML/PKDD (1) Matteo Riondato, Eli Upfal
2012	J	`jnl`	Fast Distributed PageRank Computation CoRR Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal
2012	J	`jnl`	Finding Driver Pathways in Cancer: Models and Algorithms. Algorithms Mol. Biol. Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2012	A*	`conf`	Learning-based Query Performance Modeling and Prediction. ICDE Mert Akdere, Ugur Çetintemel, Matteo Riondato, Eli Upfal, Stanley B. Zdonik
2012	A	`conf`	PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce. CIKM Matteo Riondato, Justin A. DeBrabant, Rodrigo Fonseca, Eli Upfal
2012	A*	`conf`	PageRank on an evolving graph. KDD Bahman Bahmani, Ravi Kumar, Mohammad Mahdian, Eli Upfal
2012	A	`conf`	Space-round tradeoffs for MapReduce computations. ICS Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal
2012	A*	`conf`	Towards robust and efficient computation in dynamic peer-to-peer networks. SODA John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal
2012	—	`conf`	Workshop: Algorithms for discovery of mutated pathways in cancer. ICCABS Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2011	J	`jnl`	Algorithms for Detecting Significantly Mutated Pathways in Cancer. J. Comput. Biol. Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2011	J	`jnl`	Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees CoRR Matteo Riondato, Eli Upfal
2011	C	`conf`	Finding Driver Pathways in Cancer: Models and Algorithms. WABI Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2011	J	`jnl`	MADMX: A Strategy for Maximal Dense Motif Extraction. J. Comput. Biol. Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
2011	—	`conf`	Performance prediction for concurrent database workloads. SIGMOD Conference Jennie Duggan, Ugur Çetintemel, Olga Papaemmanouil, Eli Upfal
2011	J	`jnl`	Sorting and selection on dynamic data. Theor. Comput. Sci. Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal
2011	J	`jnl`	Space-Round Tradeoffs for MapReduce Computations CoRR Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal
2011	A	`conf`	The Case for Predictive Database Systems: Opportunities and Challenges. CIDR Mert Akdere, Ugur Çetintemel, Matteo Riondato, Eli Upfal, Stanley B. Zdonik
2011	J	`jnl`	The VC-Dimension of Queries and Selectivity Estimation Through Sampling CoRR Matteo Riondato, Mert Akdere, Ugur Çetintemel, Stanley B. Zdonik, Eli Upfal
2011	—	`conf`	The VC-Dimension of SQL Queries and Selectivity Estimation through Sampling. ECML/PKDD (2) Matteo Riondato, Mert Akdere, Ugur Çetintemel, Stanley B. Zdonik, Eli Upfal
2011	J	`jnl`	Tight Bounds on Information Dissemination in Sparse Mobile Networks CoRR Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2011	A*	`conf`	Tight bounds on information dissemination in sparse mobile networks. PODC Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2011	J	`jnl`	Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks CoRR John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal
2010	B	`conf`	Algorithms for Detecting Significantly Mutated Pathways in Cancer. RECOMB Fabio Vandin, Eli Upfal, Benjamin J. Raphael
2010	J	`jnl`	An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets CoRR Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2010	J	`jnl`	Database-support for Continuous Prediction Queries over Streaming Data. Proc. VLDB Endow. Mert Akdere, Ugur Çetintemel, Eli Upfal
2010	J	`jnl`	Infectious Random Walks CoRR Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2010	J	`jnl`	MADMX: A Novel Strategy for Maximal Dense Motif Extraction CoRR Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
2010	J	`jnl`	Mining Top-K Frequent Itemsets Through Progressive Sampling CoRR Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin
2010	J	`jnl`	Mining top- Data Min. Knowl. Discov. Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin
2010	J	`jnl`	Online stochastic optimization under time constraints. Ann. Oper. Res. Pascal Van Hentenryck, Russell Bent, Eli Upfal
2009	A*	`conf`	An efficient rigorous approach for identifying statistically significant frequent itemsets. PODS Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2009	C	`conf`	MADMX: A Novel Strategy for Maximal Dense Motif Extraction. WABI Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
2009	—	`conf`	Sort Me If You Can: How to Sort Dynamic Data. ICALP (2) Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal
2009	J	`jnl`	The Hiring Problem and Lake Wobegon Strategies. SIAM J. Comput. Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii
2008	A*	`conf`	Adapting to a Changing Environment: the Brownian Restless Bandits. COLT Aleksandrs Slivkins, Eli Upfal
2008	J	`jnl`	Commitment under uncertainty: Two-stage stochastic matching problems. Theor. Comput. Sci. Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
2008	—	`conf`	Mortal Multi-Armed Bandits. NIPS Deepayan Chakrabarti, Ravi Kumar, Filip Radlinski, Eli Upfal
2008	J	`jnl`	Multi-Armed Bandits in Metric Spaces CoRR Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
2008	A*	`conf`	Multi-armed bandits in metric spaces. STOC Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
2008	A*	`conf`	The hiring problem and Lake Wobegon strategies. SODA Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii
2007	—	`conf`	07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. Probabilistic Methods in the Design and Analysis of Algorithms Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking
2007	A*	`conf`	Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. ICALP Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
2007	J	`jnl`	Entropy-based bounds for online algorithms. ACM Trans. Algorithms Gopal Pandurangan, Eli Upfal
2007	A*	`conf`	Finding near neighbors through cluster pruning. PODS Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal
2007	—	`ed.`	Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007 Probabilistic Methods in the Design and Analysis of Algorithms Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking
2007	A*	`conf`	Propagating Knapsack Constraints in Sublinear Time. AAAI Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck
2006	J	`jnl`	Using PageRank to Characterize Web Structure. Internet Math. Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
2005	—	`conf`	A Learned Comparative Expression Measure for Affymetrix GeneChip DNA Microarrays. CSB Will Sheffler, Eli Upfal, John Sedivy, William Stafford Noble
2005	J	`jnl`	Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input. SIAM J. Comput. Aris Anagnostopoulos, Adam Kirsch, Eli Upfal
2005	—	`book`	Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Michael Mitzenmacher, Eli Upfal
2005	J	`jnl`	Steady state analysis of balanced-allocation routing. Random Struct. Algorithms Aris Anagnostopoulos, Ioannis Kontoyiannis, Eli Upfal
2004	J	`jnl`	A simple and deterministic competitive algorithm for online facility location. Inf. Comput. Aris Anagnostopoulos, Russell Bent, Eli Upfal, Pascal Van Hentenryck
2004	J	`jnl`	Efficient communication in an ad-hoc network. J. Algorithms Abraham Flaxman, Alan M. Frieze, Eli Upfal
2003	J	`jnl`	Building low-diameter peer-to-peer networks. IEEE J. Sel. Areas Commun. Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
2003	A*	`conf`	Performance Analysis of Dynamic Network Processes. FOCS Eli Upfal
2003	A*	`conf`	Stability and Efficiency of a Random Local Load Balancing Protocol. FOCS Aris Anagnostopoulos, Adam Kirsch, Eli Upfal
2002	Misc	`conf`	Using PageRank to Characterize Web Structure. COCOON Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
2001	A	`conf`	A Clustering Approach to Solving Large Stochastic Matching Problems. UAI Milos Hauskrecht, Eli Upfal
2001	J	`jnl`	A general approach to dynamic packet routing with bounded buffers. J. ACM Andrei Z. Broder, Alan M. Frieze, Eli Upfal
2001	A*	`conf`	Building Low-Diameter P2P Networks. FOCS Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
2001	A*	`conf`	Can entropy characterize performance of online algorithms?. SODA Gopal Pandurangan, Eli Upfal
2001	J	`jnl`	Efficient Methods for Computing Investment Strategies for Multi-Market Commodity Trading. Appl. Artif. Intell. Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochantaridis, Eli Upfal
2000	—	`conf`	Computing Global Strategies for Multi-Market Commodity Trading. AIPS Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochantaridis, Eli Upfal
2000	A*	`conf`	Random graph models for the web graph. FOCS Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
2000	J	`jnl`	Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm. J. Comput. Biol. Franco P. Preparata, Eli Upfal
2000	B	`conf`	Sequencing-by-hybridization at the information-theory bound: an optimal algorithm. RECOMB Franco P. Preparata, Eli Upfal
2000	J	`jnl`	Static and Dynamic Evaluation of QoS Properties. J. Interconnect. Networks Gopal Pandurangan, Eli Upfal
2000	A*	`conf`	The Web as a Graph. PODS Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
1999	J	`jnl`	Balanced Allocations. SIAM J. Comput. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
1999	A*	`conf`	Computing Near Optimal Strategies for Stochastic Investment Planning Problems. IJCAI Milos Hauskrecht, Gopal Pandurangan, Eli Upfal
1999	B	`conf`	On the power of universal bases in sequencing by hybridization. RECOMB Franco P. Preparata, Alan M. Frieze, Eli Upfal
1999	J	`jnl`	Optimal Reconstruction of a Sequence from its Probes. J. Comput. Biol. Alan M. Frieze, Franco P. Preparata, Eli Upfal
1999	J	`jnl`	Real-Time Communication Scheduling in a Multicomputer Video Server. J. Parallel Distributed Comput. A. L. Narasimha Reddy, Eli Upfal
1999	A*	`conf`	Reducing Network Congestion and Blocking Probability Through Balanced Allocation. FOCS Malwina J. Luczak, Eli Upfal
1999	A*	`conf`	Static and Dynamic Evaluation of QoS Properties. STOC Gopal Pandurangan, Eli Upfal
1999	J	`jnl`	Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. Random Struct. Algorithms Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1998	J	`jnl`	A Steady State Analysis of Diffracting Trees. Theory Comput. Syst. Nir Shavit, Eli Upfal, Asaph Zemach
1998	A	`conf`	Design and Analysis of Dynamic Processes: A Stochastic Approach. ESA Eli Upfal
1998	B	`conf`	Dynamic Packet Routing on Arrays with Bounded Buffers. LATIN Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1998	—	`conf`	On Balls and Bins with Deletions. RANDOM Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal
1998	J	`jnl`	Optimal Construction of Edge-Disjoint Paths in Random Graphs. SIAM J. Comput. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
1998	J	`jnl`	Reliable Fault Diagnosis with Few Tests. Comb. Probab. Comput. Andrzej Pelc, Eli Upfal
1998	J	`jnl`	Stochastic Contention Resolution With Short Delays. SIAM J. Comput. Prabhakar Raghavan, Eli Upfal
1998	—	`conf`	Updates to the QBIC System. Storage and Retrieval for Image and Video Databases (SPIE) Wayne Niblack, Xiaoming Zhu, James L. Hafner, Thomas M. Breuel, Dulce B. Ponceleon, Dragutin Petkovic, Myron Flickner, Eli Upfal, Sigfredo I. Nin, Sanghoon Sull, Byron Dom, Boon-Lock Yeo, Savitha Srinivasan, Dan Zivkovic, Mike Penner
1997	A*	`conf`	A Wait-Free Sorting Algorithm. PODC Nir Shavit, Eli Upfal, Asaph Zemach
1997	J	`jnl`	Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems. IEEE Trans. Parallel Distributed Syst. Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Eli Upfal, Derrick Weathersby
1997	J	`jnl`	How much can hardware help routing? J. ACM Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal
1997	A*	`conf`	Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). STOC Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1997	B	`conf`	Stochastic Analysis of Dynamic Processes. FCT Eli Upfal
1996	A*	`conf`	A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). FOCS Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1996	B	`conf`	A Steady State Analysis of Diffracting Trees (Extended Abstract). SPAA Nir Shavit, Eli Upfal, Asaph Zemach
1996	J	`jnl`	A Theory of Wormhole Routing in Parallel Computers. IEEE Trans. Computers Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal
1996	A*	`conf`	An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. SODA Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
1996	A*	`conf`	Dynamic Deflection Routing on Arrays (Preliminary Version). STOC Andrei Z. Broder, Eli Upfal
1996	A*	`conf`	Efficient Traffic Laws for Mobile Robots - Work in Progress (Avstract). PODC Sonne Preminger, Eli Upfal
1996	J	`jnl`	Randomized Routing with Shorter Paths. IEEE Trans. Parallel Distributed Syst. Eli Upfal, Sergio A. Felperin, Marc Snir
1996	—	`conf`	Safe and Efficient Traffic Laws for Mobile Robots. SWAT Sonne Preminger, Eli Upfal
1995	A*	`conf`	Stochastic contention resolution with short delays. STOC Prabhakar Raghavan, Eli Upfal
1995	J	`jnl`	The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Inf. Process. Lett. Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal
1994	A*	`conf`	Balanced allocations (extended abstract). STOC Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
1994	J	`jnl`	Computing with Noisy Information. SIAM J. Comput. Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal
1994	A*	`conf`	Efficient routing in all-optical networks. STOC Prabhakar Raghavan, Eli Upfal
1994	J	`jnl`	Existence and Construction of Edge-Disjoint Paths on Expander Graphs. SIAM J. Comput. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1994	J	`jnl`	Near-perfect Token Distribution. Random Struct. Algorithms Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
1994	A*	`conf`	On the Theory of Interconnection Networks for Parallel Computers. ICALP Eli Upfal
1994	A*	`conf`	Optimal Construction of Edge-Disjoint Paths in Random Graphs. SODA Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
1994	J	`jnl`	Tolerating a Linear Number of Faults in Networks of Bounded Degree Inf. Comput. Eli Upfal
1994	J	`jnl`	Trading Space for Time in Undirected s-t Connectivity. SIAM J. Comput. Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal
1993	A*	`conf`	How much can hardware help routing? STOC Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal
1993	A*	`conf`	On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1993	B	`conf`	Randomized routing with shorter paths. SPAA Eli Upfal, Sergio A. Felperin, Marc Snir
1992	A*	`conf`	A Theory of Wormhole Routing in Parallel Computers (Extended Abstract) FOCS Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal
1992	—	`conf`	An Experimental Study of Wormhole Routing in Parallel Computers. Heinz Nixdorf Symposium Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal
1992	J	`jnl`	An O(log(N)) Deterministic Packet-Routing Scheme. J. ACM Eli Upfal
1992	A*	`conf`	Existence and Construction of Edge Disjoint Paths on Expander Graphs STOC Andrei Z. Broder, Alan M. Frieze, Eli Upfal
1992	A*	`conf`	Near-perfect Token Distribution. ICALP Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
1992	A*	`conf`	Tolerating Linear Number of Faults in Networks of Bounded Degree. PODC Eli Upfal
1991	B	`conf`	A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. SPAA Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal
1991	J	`jnl`	Fault Tolerant Sorting Networks. SIAM J. Discret. Math. Shay Assaf, Eli Upfal
1991	A*	`conf`	On the Parallel Complexity of Evaluating Game Trees. SODA Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal
1990	J	`jnl`	A Time-Randomness Trade-Off for Oblivious Routing. SIAM J. Comput. David Peleg, Eli Upfal
1990	A*	`conf`	Computing with Unreliable Information (Preliminary Version) STOC Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
1990	A*	`conf`	Fault Tolerant Sorting Network FOCS Shay Assaf, Eli Upfal
1990	—	`conf`	Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
1990	J	`jnl`	Randomized Broadcast in Networks. Random Struct. Algorithms Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
1989	J	`jnl`	A trade-off between space and efficiency for routing tables. J. ACM David Peleg, Eli Upfal
1989	A*	`conf`	An O(log N) Deterministic Packet Routing Scheme (Preliminary Version) STOC Eli Upfal
1989	J	`jnl`	Constructng disjoint paths on expander graphs. Comb. David Peleg, Eli Upfal
1989	J	`jnl`	The Token Distribution Problem. SIAM J. Comput. David Peleg, Eli Upfal
1989	A*	`conf`	Trading Space for Time in Undirected s-t Connectivity STOC Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal
1988	A*	`conf`	A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) STOC Danny Krizanc, David Peleg, Eli Upfal
1988	J	`jnl`	A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. Theor. Comput. Sci. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
1988	A*	`conf`	A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract) STOC David Peleg, Eli Upfal
1988	J	`jnl`	Fault Tolerance in Networks of Bounded Degree. SIAM J. Comput. Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
1988	J	`jnl`	Parallel hashing: an efficient implementation of shared memory. J. ACM Anna R. Karlin, Eli Upfal
1988	J	`jnl`	The Complexity of Parallel Search. J. Comput. Syst. Sci. Richard M. Karp, Eli Upfal, Avi Wigderson
1987	J	`jnl`	A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems. J. Parallel Distributed Comput. Eli Shamir, Eli Upfal
1987	J	`jnl`	A Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
1987	A*	`conf`	Constructing Disjoint Paths on Expander Graphs (Extended Abstract) STOC David Peleg, Eli Upfal
1987	J	`jnl`	How to share memory in a distributed system. J. ACM Eli Upfal, Avi Wigderson
1987	J	`jnl`	The Generalized Packet Routing Problem. Theor. Comput. Sci. David Peleg, Eli Upfal
1986	A	`conf`	A Time-Space Tradeoff for Element Distinctness. STACS Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
1986	A*	`conf`	A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. ICALP Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
1986	J	`jnl`	Constructing a perfect matching is in random NC. Comb. Richard M. Karp, Eli Upfal, Avi Wigderson
1986	A*	`conf`	Fault Tolerance in Networks of Bounded Degree (Preliminary Version) STOC Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
1986	A*	`conf`	Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version) STOC Anna R. Karlin, Eli Upfal
1986	J	`jnl`	The Parallel Complexity of Scheduling with Precedence Constraints. J. Parallel Distributed Comput. Danny Dolev, Eli Upfal, Manfred K. Warmuth
1986	A*	`conf`	The Token Distribution Problem (Preliminary Version) FOCS David Peleg, Eli Upfal
1985	A*	`conf`	Are Search and Decision Problems Computationally Equivalent? STOC Richard M. Karp, Eli Upfal, Avi Wigderson
1985	A*	`conf`	Constructing a Perfect Matching is in Random NC STOC Richard M. Karp, Eli Upfal, Avi Wigderson
1985	J	`jnl`	Random hypergraph coloring algorithms and the weak chromatic number. J. Graph Theory Jeanette Schmidt-Pruzan, Eli Shamir, Eli Upfal
1985	A*	`conf`	The Complexity of Parallel Computation on Matroids FOCS Richard M. Karp, Eli Upfal, Avi Wigderson
1984	A*	`conf`	A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version) STOC Eli Upfal
1984	J	`jnl`	Efficient Schemes for Parallel Communication. J. ACM Eli Upfal
1984	A*	`conf`	How to Share Memory in a Distributed System (A Preliminary Version) FOCS Eli Upfal, Avi Wigderson
1984	J	`jnl`	Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces. J. Algorithms Eli Shamir, Eli Upfal
1983	B	`conf`	A Fast Construction oF Disjoint Paths in Communication Networks. FCT Eli Shamir, Eli Upfal
1983	—	`—`	אלגוריתמים הסתברותיים מבזרים לבעיות בתורת הגרפים, תקשורת תאום ותזמון (Distributed probabilistic algorithms for problems in graph theory.). Eli Upfal
1982	A*	`conf`	Efficient Schemes for Parallel Communication. PODC Eli Upfal
1982	J	`jnl`	Formal Correctness Proofs of a Nondeterministic Program. Inf. Process. Lett. Eli Upfal
1982	A*	`conf`	N-Processors Graph Distributively Achieve Perfect Matchings in O(log PODC Eli Shamir, Eli Upfal
1982	J	`jnl`	One-factor in random graphs based on vertex choice. Discret. Math. Eli Shamir, Eli Upfal