I'm a professor of computer science at Brown University, during 2002-2007 I was also the department chair. Before coming to Brown in 1998 I was a researcher and project manager at the IBM Almaden Research Center in California, and a professor at the Weizmann Institute in Israel. I received an undergraduate degree in mathematics and statistics and a doctorate degree in computer science from the Hebrew University in Jerusalem, Israel.
Vandin, Fabio, Raphael, Benjamin J., Upfal, Eli On the Sample Complexity of Cancer Pathways Identification. Journal of Computational Biology. 2016; 23 (1) : 30-41. |
Vandin, Fabio, Papoutsaki, Alexandra, Raphael, Benjamin J., Upfal, Eli Accurate Computation of Survival Statistics in Genome-Wide Studies. PLOS Computational Biology. 2015; 11 (5) : e1004071. |
Augustine, John, Pandurangan, Gopal, Robinson, Peter, Upfal, Eli Distributed agreement in dynamic peer-to-peer networks. Journal of Computer and System Sciences. 2015; 81 (7) : 1088-1109. |
Das Sarma, Atish, Molla, Anisur Rahaman, Pandurangan, Gopal, Upfal, Eli Fast distributed PageRank computation. Theoretical Computer Science. 2015; 561 : 113-121. |
Arumugam, Guru Prakash, Srikanthan, Prashanth, Augustine, John, Palem, Krishna, Upfal, Eli, Bhargava, Ayush, ., Parishkrati, Yenugula, Sreelatha Novel Inexact Memory Aware Algorithm Co-design for Energy Efficient Computation – Algorithmic Principles. Design, Automation & Test in Europe Conference & Exhibition (DATE), 2015. 2015; |
Vandin, Fabio, Raphael, Benjamin J., Upfal, Eli On the Sample Complexity of Cancer Pathways Identification. Automata, Languages and Programming. 2015; : 326-337. |
Riondato, Matteo, Upfal, Eli Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. ACM Trans. Knowl. Discov. Data. 2014; 8 (4) : 1-32. |
Ohrimenko, Olga, Goodrich, Michael T., Tamassia, Roberto, Upfal, Eli The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. Automata, Languages and Programming. 2014; : 556-567. |
Das Sarma, Atish, Molla, Anisur Rahaman, Pandurangan, Gopal, Upfal, Eli Fast Distributed PageRank Computation. Automata, Languages and Programming. 2013; : 11-26. |
Vandin, Fabio, Papoutsaki, Alexandra, Raphael, Benjamin J., Upfal, Eli Genome-Wide Survival Analysis of Somatic Mutations in Cancer. Automata, Languages and Programming. 2013; : 285-286. |
Vandin, Fabio, Upfal, Eli, Raphael, Ben Identifying significant mutations in large cohorts of cancer genomes. 2013 IEEE 3rd International Conference on Computational Advances in Bio and medical Sciences (ICCABS). 2013; |
Augustine, John, Molla, Anisur Rahaman, Morsy, Ehab, Pandurangan, Gopal, Robinson, Peter, Upfal, Eli Storage and search in dynamic peer-to-peer networks. Proceedings of the 25th ACM symposium on Parallelism in algorithms and architectures - SPAA '13. 2013; |
Vandin, Fabio, Upfal, Eli, Raphael, Benjamin Algorithms and Genome Sequencing: Identifying Driver Pathways in Cancer. Computer. 2012; 45 (3) : 39-46. |
Anagnostopoulos, Aris, Kumar, Ravi, Mahdian, Mohammad, Upfal, Eli, Vandin, Fabio Algorithms on evolving graphs. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12. 2012; |
Kirsch, Adam, Mitzenmacher, Michael, Pietracaprina, Andrea, Pucci, Geppino, Upfal, Eli, Vandin, Fabio An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. Journal of the ACM. 2012; 59 (3) : 1-22. |
Riondato, Matteo, Upfal, Eli Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. Automata, Languages and Programming. 2012; : 25-41. |
Vandin, Fabio, Upfal, Eli, Raphael, Benjamin J. Finding Driver Pathways in Cancer: Models and Algorithms. Algorithms Mol Biol. 2012; 7 (1) : 23. |
Akdere, Mert, Çetintemel, Ugur, Riondato, Matteo, Upfal, Eli, Zdonik, Stanley B. Learning-based Query Performance Modeling and Prediction. 2012 IEEE 28th International Conference on Data Engineering. 2012; |
Bahmani, Bahman, Kumar, Ravi, Mahdian, Mohammad, Upfal, Eli PageRank on an evolving graph. Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '12. 2012; |
Riondato, Matteo, DeBrabant, Justin A., Fonseca, Rodrigo, Upfal, Eli PARMA. Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12/Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12. 2012; |
Pietracaprina, Andrea, Pucci, Geppino, Riondato, Matteo, Silvestri, Francesco, Upfal, Eli Space-round tradeoffs for MapReduce computations. Proceedings of the 26th ACM international conference on Supercomputing - ICS '12. 2012; |
Vandin, Fabio, Upfal, Eli, Raphael, Benjamin J. Workshop: Algorithms for discovery of mutated pathways in cancer. 2012 IEEE 2nd International Conference on Computational Advances in Bio and medical Sciences (ICCABS). 2012; |
Vandin, Fabio, Upfal, Eli, Raphael, Benjamin J. Algorithms for Detecting Significantly Mutated Pathways in Cancer. Journal of Computational Biology. 2011; 18 (3) : 507-522. |
Vandin, Fabio, Upfal, Eli, Raphael, Benjamin J. De Novo Discovery of Mutated Driver Pathways in Cancer. Automata, Languages and Programming. 2011; : 499-500. |
Vandin, F., Upfal, E., Raphael, B. J. De novo discovery of mutated driver pathways in cancer. Genome research. 2011; 22 (2) : 375-385. |
VANDIN, FABIO, CLAY, PATRICK, UPFAL, ELI, RAPHAEL, BENJAMIN J. DISCOVERY OF MUTATED SUBNETWORKS ASSOCIATED WITH CLINICAL DATA IN CANCER. Database-support for continuous prediction queries over streaming data. 2011; |
Vandin, Fabio, Upfal, Eli, Raphael, Benjamin J. Finding Driver Pathways in Cancer: Models and Algorithms. Automata, Languages and Programming. 2011; : 314-325. |
Grossi, Roberto, Pietracaprina, Andrea, Pisanti, Nadia, Pucci, Geppino, Upfal, Eli, Vandin, Fabio MADMX: A Strategy for Maximal Dense Motif Extraction. Journal of Computational Biology. 2011; 18 (4) : 535-545. |
Duggan, Jennie, Cetintemel, Ugur, Papaemmanouil, Olga, Upfal, Eli Performance prediction for concurrent database workloads. Proceedings of the 2011 international conference on Management of data - SIGMOD '11. 2011; |
Anagnostopoulos, Aris, Kumar, Ravi, Mahdian, Mohammad, Upfal, Eli Sorting and selection on dynamic data. Theoretical Computer Science. 2011; 412 (24) : 2564-2576. |
Riondato, Matteo, Akdere, Mert, Çetintemel, Uǧur, Zdonik, Stanley B., Upfal, Eli The VC-Dimension of SQL Queries and Selectivity Estimation through Sampling. Automata, Languages and Programming. 2011; : 661-676. |
Pettarin, Alberto, Pietracaprina, Andrea, Pucci, Geppino, Upfal, Eli Tight bounds on information dissemination in sparse mobile networks. Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11. 2011; |
Vandin, Fabio, Upfal, Eli, Raphael, Benjamin J. Algorithms for Detecting Significantly Mutated Pathways in Cancer. Automata, Languages and Programming. 2010; : 506-521. |
Akdere, Mert, Çetintemel, Uǧur, Upfal, Eli Database-support for continuous prediction queries over streaming data. Proc. VLDB Endow.. 2010; 3 (1-2) : 1291-1301. |
Pietracaprina, Andrea, Riondato, Matteo, Upfal, Eli, Vandin, Fabio Mining top-K frequent itemsets through progressive sampling. Data Mining and Knowledge Discovery. 2010; 21 (2) : 310-326. |
Broder, Andrei Z., Kirsch, Adam, Kumar, Ravi, Mitzenmacher, Michael, Upfal, Eli, Vassilvitskii, Sergei The Hiring Problem and Lake Wobegon Strategies. SIAM J. Comput.. 2010; 39 (4) : 1233-1255. |
Kirsch, Adam, Mitzenmacher, Michael, Pietracaprina, Andrea, Pucci, Geppino, Upfal, Eli, Vandin, Fabio An efficient rigorous approach for identifying statistically significant frequent itemsets. Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '09. 2009; |
Grossi, Roberto, Pietracaprina, Andrea, Pisanti, Nadia, Pucci, Geppino, Upfal, Eli, Vandin, Fabio MADMX: A Novel Strategy for Maximal Dense Motif Extraction. Automata, Languages and Programming. 2009; : 362-374. |
Van Hentenryck, Pascal, Bent, Russell, Upfal, Eli Online stochastic optimization under time constraints. Annals of Operations Research. 2009; 177 (1) : 151-183. |
Anagnostopoulos, Aris, Kumar, Ravi, Mahdian, Mohammad, Upfal, Eli Sort Me If You Can: How to Sort Dynamic Data. Automata, Languages and Programming. 2009; : 339-350. |
Katriel, Irit, Kenyon-Mathieu, Claire, Upfal, Eli Commitment under uncertainty: Two-stage stochastic matching problems. Theoretical Computer Science. 2008; 408 (2-3) : 213-223. |
Kleinberg, Robert, Slivkins, Aleksandrs, Upfal, Eli Multi-armed bandits in metric spaces. Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08. 2008; |
Katriel, Irit, Kenyon-Mathieu, Claire, Upfal, Eli Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. Automata, Languages and Programming. 2007; : 171-182. |
Pandurangan, Gopal, Upfal, Eli Entropy-based bounds for online algorithms. ACM Transactions on Algorithms. 2007; 3 (1) : 1. |
Chierichetti, Flavio, Panconesi, Alessandro, Raghavan, Prabhakar, Sozio, Mauro, Tiberi, Alessandro, Upfal, Eli Finding near neighbors through cluster pruning. Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '07. 2007; |
Pandurangan, Gopal, Raghavan, Prabhakar, Upfal, Eli Using PageRank to Characterize Web Structure. Internet Mathematics. 2006; 3 (1) : 1-20. |
Sheffler, W., Upfal, E., Sedivy, J., Noble, W.S. A learned comparative expression measure for Affymetrix genechip DNA microarrays. 2005 IEEE Computational Systems Bioinformatics Conference (CSB'05). 2005; |
Anagnostopoulos, Aris, Kirsch, Adam, Upfal, Eli Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input. SIAM J. Comput.. 2005; 34 (3) : 616-639. |
Anagnostopoulos, Aris, Kontoyiannis, Ioannis, Upfal, Eli Steady state analysis of balanced-allocation routing. Random Struct. Alg.. 2005; 26 (4) : 446-467. |
Anagnostopoulos, Aris, Bent, Russell, Upfal, Eli, Hentenryck, Pascal Van A simple and deterministic competitive algorithm for online facility location. Information and Computation. 2004; 194 (2) : 175-202. |
Flaxman, Abraham, Frieze, Alan, Upfal, Eli Efficient communication in an ad-hoc network. Journal of Algorithms. 2004; 52 (1) : 1-7. |
Preparata, Franco P., Upfal, Eli Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm. Journal of Computational Biology. 2000; 7 (3-4) : 621-630. |
Professor Upfal’s research focuses on the design and analysis of algorithms. In particular he is interested in randomized algorithms, probabilistic analysis of algorithms, and computational statistics, with applications ranging from combinatorial and stochastic optimization to routing and communication networks, computational biology, and computational finance.
Professor Upfal published over 100 research papers in scientific journals and conferences. He is co-author of a popular textbook “Probability and Computing: Randomized Algorithms and Probabilistic Analysis” (with M. Mitzenmacher, Cambridge University Press 2005).
Professor Upfal is the inventor of 13 US patents. His patents related to sequencing by hybridizations (with F. Preparata) were licensed to GeneSpectrum Inc., a bio-tech startup (acquired by NABsys inc. in 2006).
Eli Upfal's general research area is theory of computation—trying to apply rigorous mathematical tools to the design and analysis of computer algorithms. He is particularly interested in applications of probability theory and combinatorics to computiong.
Funding at Brown University (1998 – present):
NSF-CCR-9731477: Design and Analysis of Dynamic Processes: A Stochastic Approach, 7/98-6/02.
Goldman, Sachs & Co.: Computation Problems in Valuation and Management of Inventory, 9/98-9/00.
NSF-DBI-9983081: Applying Universal Bases to Achieving the Full Potential of SBH, 7/99-6/02.
DARPA/Air Force F30602-00-2-0599: Stochastic Models for Web Agents and the Web Environment, 7/00 - 9/02.
NSF-CCR-0121154: ITR/SY Algorithmic Issues in Large Scale Dynamic Networks, 9/01-9/06.
NSF-DMI-0121495: ITR/SY Stochastic Combinatorial Optimization, 9/01-8/05.
NSF-IIS 0325838: ITR Collaborative Proposal: Aurora - Enabling Stream-Based Monitoring Applications, 10/03-10/07.
NSF DMI-0600384: “Online Stochastic Combinatorial Optimization”, 7/06-7/09.
ONR DEPSCOR Award N000140610607, “Adaptive and Robust Resource Allocation and Scheduling”,
7/06-7/09.
Yahoo! Research Alliance Gift - 2006, 2008.
NSF IIS-0905553: ”III: Medium: Longview: Querying the Future Now”, 8/09-7/12
NSF IIS-1016648: ”III Small: Algorithmic Approaches for Pathway and Gene Group Analysis in Genetic Studies”, 8/10-7/13
NSF IIS-1247581: ”BIGDATA: Mid-Scale: DA: Analytical Approaches to Massive Data Computation with Applications to Genomics”, 10/12-9/16
NIH 1R01 CA180776: ”Analytical Approaches to Massive Data Computation with Applications to Ge- nomics”, 6/13-3/17
NIH 1R01 HG007069: ”Computational Characterization of Genetic Heterogeneity”, 9/13-8/16.
Professor Upfal published over 150 research papers in scientific journals and conferences. He is co-author of a popular textbook “Probability and Computing: Randomized Algorithms and Probabilistic Analysis” (with M. Mitzenmacher, Cambridge University Press 2005).
Year | Degree | Institution |
---|---|---|
1983 | PhD | Hebrew University |
1980 | MS | Weizmann Institute of Science |
1978 | BS | Hebrew University |
Best Paper Award, RECOMB 2013.
ACM Fellow, 2005.
IBM Faculty Award 2003, 2005.
IEEE Fellow, 2002.
IBM Research Division Award, 1997.
The Levinson Prize in Mathematical Sciences, 1994.
IBM Outstanding Innovation Award, 1993
The Norman D. Cohen Professorial Chair of Computer Science at the
Weizmann Institute,
1992 -- 1997.
Revson Career Development Award, 1988-1990.
Bat-Sheva Fellow - Bat-Sheva de Rothscild Award for Young Outstanding
Researchers, 1988.
The Swig-Weiler Career Development Chair, 1987.
IBM Outstanding Innovation Award, 1986.
Weizmann Post-Doctoral Fellowship, 1983 -- 1985.
G. Y. Yashinsky memorial fund award for an outstanding Ph.D. thesis, 1982.
Fellow of the Association for Computing Machinery (ACM)
Fellow of the Institute of Electrical and Electronics Engineers (IEEE)
Editorial boards:
• Journal of Discrete Algorithms (Editor in Chief) (2003 - 2014 ).
• Journal of the ACM (2007 - ).
• SIAM J. on Computing (2001-2004).
• SIAM J. on Discrete Algorithms (1999-2003).
• Web Intelligence and Agent Systems (2002-2004).
• Journal on Interconnection Networks (2000 - ).
• Computational Complexity (1990-2004).
• Random Structures & Algorithms (2002 - ).
• IEEE Transactions on Parallel and Distributed Computing (1998-2000).
CSCI 1450 - Probability for Computing and Data Analysis |
CSCI 1550 - Probabilistic Methods in Computer Science |
CSCI 1550 - Probability and Computing: Randomized Algorithms and Probabilistic Analysis |
CSCI 1951A - Data Science |
CSCI 1951G - Optimization Methods in Finance |
CSCI 2540 - Advanced Probabilistic Methods in Computer Science |
DATA 2040 - Data and Computational Science |