default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEli Upfal
Person information
- affiliation: Brown University, Providence, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i46]Megumi Ando, Anna Lysyanskaya, Eli Upfal:
Bruisable Onions: Anonymous Communication in the Asynchronous Model. IACR Cryptol. ePrint Arch. 2024: 885 (2024)- 2023
- [c136]Alessio Mazzetto, Eli Upfal:
Nonparametric Density Estimation under Distribution Drift. ICML 2023: 24251-24270 - [c135]Alessio Mazzetto, Eli Upfal:
An Adaptive Algorithm for Learning with Unknown Distribution Drift. NeurIPS 2023 - [i45]Alessio Mazzetto, Eli Upfal:
Nonparametric Density Estimation under Distribution Drift. CoRR abs/2302.02460 (2023) - [i44]Alessio Mazzetto, Eli Upfal:
An Adaptive Algorithm for Learning with Unknown Distribution Drift. CoRR abs/2305.02252 (2023) - [i43]Alessio Mazzetto, Reza Esfandiarpoor, Eli Upfal, Stephen H. Bach:
An Adaptive Method for Weak Supervision with Drifting Data. CoRR abs/2306.01658 (2023) - 2022
- [j78]Shahrzad Haddadan
, Cristina Menghini, Matteo Riondato, Eli Upfal:
Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights. Data Min. Knowl. Discov. 36(6): 2334-2378 (2022) - [j77]John Augustine, William K. Moses Jr., Amanda Redlich, Eli Upfal:
Balanced Allocation: Patience Is Not a Virtue. SIAM J. Comput. 51(6): 1743-1768 (2022) - [c134]Alessio Mazzetto, Cristina Menghini, Andrew Yuan, Eli Upfal, Stephen H. Bach:
Tight Lower Bounds on Worst-Case Guarantees for Zero-Shot Learning with Attributes. NeurIPS 2022 - [i42]Alessio Mazzetto, Cristina Menghini, Andrew Yuan, Eli Upfal, Stephen H. Bach:
Tight Lower Bounds on Worst-Case Guarantees for Zero-Shot Learning with Attributes. CoRR abs/2205.13068 (2022) - 2021
- [j76]Lorenzo De Stefani, Erisa Terolli, Eli Upfal:
Tiered Sampling: An Efficient Method for Counting Sparse Motifs in Massive Graph Streams. ACM Trans. Knowl. Discov. Data 15(5): 79:1-79:52 (2021) - [c133]Alessio Mazzetto, Dylan Sam, Andrew Park, Eli Upfal, Stephen H. Bach:
Semi-Supervised Aggregation of Dependent Weak Supervision Sources With Performance Guarantees. AISTATS 2021: 3196-3204 - [c132]Cristina Menghini, Aris Anagnostopoulos, Eli Upfal:
How Inclusive Are Wikipedia's Hyperlinks in Articles Covering Polarizing Topics? IEEE BigData 2021: 1300-1307 - [c131]Megumi Ando, Anna Lysyanskaya, Eli Upfal:
On the Complexity of Anonymous Communication Through Public Networks. ITC 2021: 9:1-9:25 - [c130]Alessio Mazzetto, Cyrus Cousins, Dylan Sam, Stephen H. Bach, Eli Upfal:
Adversarial Multi Class Learning under Weak Supervision with Performance Guarantees. ICML 2021: 7534-7543 - [c129]Shahrzad Haddadan, Yue Zhuang, Cyrus Cousins, Eli Upfal:
Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds. NeurIPS 2021: 25760-25772 - [c128]Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal:
RePBubLik: Reducing Polarized Bubble Radius with Link Insertions. WSDM 2021: 139-147 - [i41]Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal:
RePBubLik: Reducing the Polarized Bubble Radius with Link Insertions. CoRR abs/2101.04751 (2021) - [i40]Shahrzad Haddadan, Yue Zhuang, Cyrus Cousins, Eli Upfal:
Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds. CoRR abs/2111.07372 (2021) - [i39]Nathan Tung, Eli Upfal, Jerome N. Sanes, Ani Eloyan:
Neuro-Hotnet: A Graph Theoretic Approach for Brain FC Estimation. CoRR abs/2111.08118 (2021) - 2020
- [j75]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Distributed Graph Diameter Approximation. Algorithms 13(9): 216 (2020) - [i38]Cristina Menghini, Aris Anagnostopoulos, Eli Upfal:
Wikipedia's Network Bias on Controversial Topics. CoRR abs/2007.08197 (2020) - [i37]Cyrus Cousins, Shahrzad Haddadan, Eli Upfal:
Making mean-estimation more efficient using an MCMC trace variance approach: DynaMITE. CoRR abs/2011.11129 (2020)
2010 – 2019
- 2019
- [j74]Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin:
Differentially mutated subnetworks discovery. Algorithms Mol. Biol. 14(1): 10:1-10:11 (2019) - [j73]Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal:
Bandits and Experts in Metric Spaces. J. ACM 66(4): 30:1-30:77 (2019) - [j72]Ahmad Mahmoody, Eli Upfal:
Optimizing static and adaptive probing schedules for rapid event detection. Theor. Comput. Sci. 774: 14-30 (2019) - [c127]Enrique Areyan Viqueira, Amy Greenwald, Cyrus Cousins, Eli Upfal:
Learning Simulation-Based Games from Data. AAMAS 2019: 1778-1780 - [c126]Benedetto Buratti, Eli Upfal:
Ordalia: Deep Learning Hyperparameter Search via Generalization Error Bounds Extrapolation. IEEE BigData 2019: 180-187 - [c125]Cristina Menghini, Aris Anagnostopoulos, Eli Upfal:
Wikipedia Polarization and Its Effects on Navigation Paths. IEEE BigData 2019: 6154-6156 - [c124]Lorenzo De Stefani, Eli Upfal:
A Rademacher Complexity Based Method for Controlling Power and Confidence Level in Adaptive Statistical Analysis. DSAA 2019: 71-80 - [c123]Lorenzo De Stefani, Leonhard F. Spiegelberg, Eli Upfal, Tim Kraska:
VizCertify: A Framework for Secure Visual Data Exploration. DSAA 2019: 241-251 - [c122]Zeyuan Shang, Emanuel Zgraggen, Benedetto Buratti, Ferdinand Kossmann, Philipp Eichmann, Yeounoh Chung, Carsten Binnig, Eli Upfal, Tim Kraska:
Democratizing Data Science through Interactive Curation of ML Pipelines. SIGMOD Conference 2019: 1171-1188 - [i36]Megumi Ando, Anna Lysyanskaya, Eli Upfal:
On the Complexity of Anonymous Communication Through Public Networks. CoRR abs/1902.06306 (2019) - [i35]Enrique Areyan Viqueira, Cyrus Cousins, Eli Upfal, Amy Greenwald:
Learning Equilibria of Simulation-Based Games. CoRR abs/1905.13379 (2019) - [i34]Lorenzo De Stefani, Eli Upfal:
A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis. CoRR abs/1910.03493 (2019) - 2018
- [j71]Alessandro Epasto, Eli Upfal:
Efficient Approximation for Restricted Biclique Cover Problems. Algorithms 11(6): 84 (2018) - [j70]Matteo Riondato, Eli Upfal:
ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages. ACM Trans. Knowl. Discov. Data 12(5): 61:1-61:38 (2018) - [c121]Megumi Ando, Anna Lysyanskaya, Eli Upfal:
Practical and Provably Secure Onion Routing. ICALP 2018: 144:1-144:14 - [c120]Carsten Binnig, Benedetto Buratti, Yeounoh Chung, Cyrus Cousins, Tim Kraska, Zeyuan Shang, Eli Upfal, Robert C. Zeleznik, Emanuel Zgraggen:
Towards Interactive Curation & Automatic Tuning of ML Pipelines. DEEM@SIGMOD 2018: 1:1-1:4 - [c119]Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin:
Differentially Mutated Subnetworks Discovery. WABI 2018: 18:1-18:14 - [i33]Kim Albertsson, Piero Altoe, Dustin Anderson, Michael Andrews, Juan Pedro Araque Espinosa, Adam Aurisano, Laurent Basara, Adrian Bevan, Wahid Bhimji, Daniele Bonacorsi, Paolo Calafiura, Mario Campanelli, Louis Capps, Federico Carminati, Stefano Carrazza, Taylor Childers, Elias Coniavitis, Kyle Cranmer, Claire David, Douglas Davis, Javier M. Duarte, Martin Erdmann, Jonas Eschle, Amir Farbin, Matthew Feickert, Nuno Filipe Castro, Conor Fitzpatrick, Michele Floris, Alessandra Forti, Jordi Garra-Tico, Jochen Gemmler, Maria Girone, Paul Glaysher, Sergei Gleyzer, Vladimir V. Gligorov, Tobias Golling, Jonas Graw, Lindsey Gray, Dick Greenwood, Thomas Hacker, John Harvey, Benedikt Hegner, Lukas Heinrich, Ben Hooberman, Johannes Junggeburth, Michael Kagan, Meghan Kane, Konstantin Kanishchev, Przemyslaw Karpinski, Zahari Kassabov, Gaurav Kaul, Dorian Kcira, Thomas Keck, Alexei Klimentov, Jim Kowalkowski, Luke Kreczko, Alexander Kurepin, Rob Kutschke, Valentin Kuznetsov, Nicolas Köhler, Igor Lakomov, Kevin Lannon, Mario Lassnig, Antonio Limosani, Gilles Louppe, Aashrita Mangu, Pere Mato, Narain Meenakshi, Helge Meinhard, Dario Menasce, Lorenzo Moneta, Seth Moortgat, Mark S. Neubauer, Harvey B. Newman, Hans Pabst, Michela Paganini, Manfred Paulini, Gabriel N. Perdue, Uzziel Perez, Attilio Picazio, Jim Pivarski, Harrison Prosper, Fernanda Psihas, Alexander Radovic, Ryan Reece, Aurelius Rinkevicius, Eduardo Rodrigues, Jamal Rorie, David Rousseau, Aaron Sauers, Steven Schramm, Ariel Schwartzman, Horst Severini, Paul Seyfert, Filip Siroky, Konstantin Skazytkin, Mike Sokoloff, Graeme Andrew Stewart, Bob Stienen, Ian Stockdale, Giles Chatham Strong, Savannah Thais, Karen Tomko, Eli Upfal, Emanuele Usai, Andrey Ustyuzhanin, Martin Vala, Sofia Vallecorsa, Mauro Verzetti, Xavier Vilasís-Cardona, Jean-Roch Vlimant, Ilija Vukotic, Sean-Jiun Wang, Gordon Watts, Michael Williams, Wenjing Wu, Stefan Wunsch, Omar Zapata:
Machine Learning in High Energy Physics Community White Paper. CoRR abs/1807.02876 (2018) - [i32]Yeounoh Chung, Peter J. Haas, Eli Upfal, Tim Kraska:
Unknown Examples & Machine Learning Model Generalization. CoRR abs/1808.08294 (2018) - [i31]Lorenzo De Stefani, Leonhard F. Spiegelberg, Tim Kraska, Eli Upfal:
VizRec: A framework for secure data exploration via visual representation. CoRR abs/1811.00602 (2018) - [i30]Clayton Sanford, Cyrus Cousins, Eli Upfal:
Uniform Convergence Bounds for Codec Selection. CoRR abs/1812.07568 (2018) - 2017
- [j69]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. Proc. VLDB Endow. 10(5): 469-480 (2017) - [j68]Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal:
TRIÈST: Counting Local and Global Triangles in Fully Dynamic Streams with Fixed Memory Size. ACM Trans. Knowl. Discov. Data 11(4): 43:1-43:50 (2017) - [c118]Alessandro Epasto, Ahmad Mahmoody, Eli Upfal:
Real-Time Targeted-Influence Queries over Large Graphs. ASONAM 2017: 224-231 - [c117]Lorenzo De Stefani, Erisa Terolli, Eli Upfal:
Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams. IEEE BigData 2017: 776-786 - [c116]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:
Towards Interactive Data Exploration. BIRTE (Revised Selected Papers) 2017: 177-190 - [c115]Carsten Binnig, Lorenzo De Stefani, Tim Kraska, Eli Upfal, Emanuel Zgraggen, Zheguang Zhao:
Toward Sustainable Insights, or Why Polygamy is Bad for You. CIDR 2017 - [c114]Cyrus Cousins, Eli Upfal:
The k-Nearest Representatives Classifier: A Distance-Based Classifier with Strong Generalization Bounds. DSAA 2017: 1-10 - [c113]Megumi Ando, Eli Upfal:
Minimizing operational cost for zero information leakage. ICC 2017: 1-7 - [c112]Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska:
Controlling False Discoveries During Interactive Data Exploration. SIGMOD Conference 2017: 527-540 - [c111]Zheguang Zhao, Emanuel Zgraggen, Lorenzo De Stefani, Carsten Binnig, Eli Upfal, Tim Kraska:
Safe Visual Data Exploration. SIGMOD Conference 2017: 1671-1674 - [i29]Megumi Ando, Anna Lysyanskaya, Eli Upfal:
Scalable and Provably Secure P2P Communication Protocols. CoRR abs/1706.05367 (2017) - [i28]Lorenzo De Stefani, Erisa Terolli, Eli Upfal:
Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams. CoRR abs/1710.02108 (2017) - [i27]Bodo Manthey, Claire Mathieu, Heiko Röglin, Eli Upfal:
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). Dagstuhl Reports 7(4): 1-22 (2017) - 2016
- [j67]Fabio Vandin, Benjamin J. Raphael, Eli Upfal:
On the Sample Complexity of Cancer Pathways Identification. J. Comput. Biol. 23(1): 30-41 (2016) - [c110]Lorenzo De Stefani, Alessandro Epasto, Eli Upfal, Fabio Vandin:
Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic. AAAI 2016: 1526-1532 - [c109]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. IPDPS 2016: 12-21 - [c108]Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal:
TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size. KDD 2016: 825-834 - [c107]Matteo Riondato, Eli Upfal:
ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages. KDD 2016: 1145-1154 - [c106]Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal:
Scalable Betweenness Centrality Maximization via Sampling. KDD 2016: 1765-1773 - [c105]John Augustine, William K. Moses Jr., Amanda Redlich, Eli Upfal:
Balanced Allocation: Patience is not a Virtue. SODA 2016: 655-671 - [c104]Ahmad Mahmoody, Matteo Riondato, Eli Upfal:
Wiggins: Detecting Valuable Information in Dynamic Networks Using Limited Resources. WSDM 2016: 677-686 - [i26]Matteo Riondato, Eli Upfal:
ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages. CoRR abs/1602.05866 (2016) - [i25]Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal:
TRIÈST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size. CoRR abs/1602.07424 (2016) - [i24]John Augustine, William K. Moses Jr., Amanda Redlich, Eli Upfal:
Balanced Allocation: Patience is not a Virtue. CoRR abs/1602.08298 (2016) - [i23]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. CoRR abs/1605.05590 (2016) - [i22]Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal:
Scalable Betweenness Centrality Maximization via Sampling. CoRR abs/1609.00790 (2016) - [i21]Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska:
Controlling False Discoveries During Interactive Data Exploration. CoRR abs/1612.01040 (2016) - 2015
- [j66]John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Distributed agreement in dynamic peer-to-peer networks. J. Comput. Syst. Sci. 81(7): 1088-1109 (2015) - [j65]Fabio Vandin, Alexandra Papoutsaki, Benjamin J. Raphael, Eli Upfal:
Accurate Computation of Survival Statistics in Genome-Wide Studies. PLoS Comput. Biol. 11(5) (2015) - [j64]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal:
Fast distributed PageRank computation. Theor. Comput. Sci. 561: 113-121 (2015) - [c103]Ahmad Mahmoody, Evgenios M. Kornaropoulos, Eli Upfal:
Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection. COCOA 2015: 377-391 - [c102]Guru Prakash Arumugam, Prashanth Srikanthan, John Augustine, Krishna V. Palem, Eli Upfal, Ayush Bhargava, Parishkrati, Sreelatha Yenugula:
Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles. DATE 2015: 752-757 - [c101]John Augustine, Gopal Pandurangan, Peter Robinson, Scott T. Roche, Eli Upfal:
Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. FOCS 2015: 350-369 - [c100]Matteo Riondato, Eli Upfal:
Mining Frequent Itemsets through Progressive Sampling with Rademacher Averages. KDD 2015: 1005-1014 - [c99]Matteo Riondato, Eli Upfal:
VC-Dimension and Rademacher Averages: From Statistical Learning Theory to Sampling Algorithms. KDD 2015: 2321-2322 - [c98]Fabio Vandin, Benjamin J. Raphael, Eli Upfal:
On the Sample Complexity of Cancer Pathways Identification. RECOMB 2015: 326-337 - [c97]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. SPAA 2015: 182-191 - [i20]Ahmad Mahmoody, Eli Upfal:
The Probabilistic Hitting Set Paradigm: a General Framework for Search and Detection in Dynamic Social Networks. CoRR abs/1504.03275 (2015) - [i19]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. CoRR abs/1506.03265 (2015) - [i18]Ahmad Mahmoody, Evgenios M. Kornaropoulos, Eli Upfal:
Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection. CoRR abs/1509.02487 (2015) - 2014
- [j63]Matteo Riondato, Eli Upfal:
Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. ACM Trans. Knowl. Discov. Data 8(4): 20:1-20:32 (2014) - [c96]Jennie Duggan, Olga Papaemmanouil, Ugur Çetintemel, Eli Upfal:
Contender: A Resource Modeling Approach for Concurrent Query Performance Prediction. EDBT 2014: 109-120 - [c95]Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal:
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. ICALP (2) 2014: 556-567 - [p1]Michael Mitzenmacher, Eli Upfal:
Some Practical Randomized Algorithms and Data Structures. Computing Handbook, 3rd ed. (1) 2014: 11: 1-23 - [i17]Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal:
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. CoRR abs/1402.5524 (2014) - [i16]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space. CoRR abs/1407.3144 (2014) - 2013
- [c94]Fabio Vandin, Eli Upfal, Benjamin J. Raphael:
Identifying significant mutations in large cohorts of cancer genomes. ICCABS 2013: 1 - [c93]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal:
Fast Distributed PageRank Computation. ICDCN 2013: 11-26 - [c92]Fabio Vandin, Alexandra Papoutsaki, Benjamin J. Raphael, Eli Upfal:
Genome-Wide Survival Analysis of Somatic Mutations in Cancer. RECOMB 2013: 285-286 - [c91]John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Storage and search in dynamic peer-to-peer networks. SPAA 2013: 53-62 - [e2]Hubertus Franke, Alexander Heinecke, Krishna V. Palem, Eli Upfal:
Computing Frontiers Conference, CF'13, Ischia, Italy, May 14 - 16, 2013. ACM 2013, ISBN 978-1-4503-2053-5 [contents] - [i15]Milos Hauskrecht, Eli Upfal:
A Clustering Approach to Solving Large Stochastic Matching Problems. CoRR abs/1301.2277 (2013) - [i14]John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Storage and Search in Dynamic Peer-to-Peer Networks. CoRR abs/1305.1121 (2013) - [i13]Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal:
Bandits and Experts in Metric Spaces. CoRR abs/1312.1277 (2013) - 2012
- [j62]Fabio Vandin, Eli Upfal, Benjamin J. Raphael:
Finding Driver Pathways in Cancer: Models and Algorithms. Algorithms Mol. Biol. 7: 23 (2012) - [j61]Fabio Vandin, Eli Upfal, Benjamin J. Raphael:
Algorithms and Genome Sequencing: Identifying Driver Pathways in Cancer. Computer 45(3): 39-46 (2012) - [j60]Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin:
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. J. ACM 59(3): 12:1-12:22 (2012) - [c90]Matteo Riondato, Justin A. DeBrabant, Rodrigo Fonseca, Eli Upfal:
PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce. CIKM 2012: 85-94 - [c89]Fabio Vandin, Eli Upfal, Benjamin J. Raphael:
Workshop: Algorithms for discovery of mutated pathways in cancer. ICCABS 2012: 1 - [c88]Mert Akdere, Ugur Çetintemel, Matteo Riondato, Eli Upfal, Stanley B. Zdonik:
Learning-based Query Performance Modeling and Prediction. ICDE 2012: 390-401 - [c87]Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal:
Space-round tradeoffs for MapReduce computations. ICS 2012: 235-244 - [c86]Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal, Fabio Vandin:
Algorithms on evolving graphs. ITCS 2012: 149-160 - [c85]Bahman Bahmani, Ravi Kumar, Mohammad Mahdian, Eli Upfal:
PageRank on an evolving graph. KDD 2012: 24-32 - [c84]Matteo Riondato, Eli Upfal:
Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. ECML/PKDD (1) 2012: 25-41 - [c83]Fabio Vandin, Patrick Clay, Eli Upfal, Benjamin J. Raphael:
Discovery of Mutated Subnetworks Associated with Clinical Data in Cancer. Pacific Symposium on Biocomputing 2012: 55-66 - [c82]John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Towards robust and efficient computation in dynamic peer-to-peer networks. SODA 2012: 551-569 - [i12]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal:
Fast Distributed PageRank Computation. CoRR abs/1208.3071 (2012) - 2011
- [j59]Fabio Vandin, Eli Upfal, Benjamin J. Raphael:
Algorithms for Detecting Significantly Mutated Pathways in Cancer. J. Comput. Biol. 18(3): 507-522 (2011) - [j58]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin:
MADMX: A Strategy for Maximal Dense Motif Extraction. J. Comput. Biol. 18(4): 535-545 (2011) - [j57]Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal:
Sorting and selection on dynamic data. Theor. Comput. Sci. 412(24): 2564-2576 (2011) - [c81]Mert Akdere, Ugur Çetintemel, Matteo Riondato, Eli Upfal, Stanley B. Zdonik:
The Case for Predictive Database Systems: Opportunities and Challenges. CIDR 2011: 167-174 - [c80]Matteo Riondato, Mert Akdere, Ugur Çetintemel, Stanley B. Zdonik, Eli Upfal:
The VC-Dimension of SQL Queries and Selectivity Estimation through Sampling. ECML/PKDD (2) 2011: 661-676 - [c79]Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Tight bounds on information dissemination in sparse mobile networks. PODC 2011: 355-362 - [c78]Fabio Vandin, Eli Upfal, Benjamin J. Raphael:
De Novo Discovery of Mutated Driver Pathways in Cancer. RECOMB 2011: 499-500 - [c77]Jennie Duggan, Ugur Çetintemel, Olga Papaemmanouil, Eli Upfal:
Performance prediction for concurrent database workloads. SIGMOD Conference 2011: 337-348 - [c76]Fabio Vandin, Eli Upfal, Benjamin J. Raphael:
Finding Driver Pathways in Cancer: Models and Algorithms. WABI 2011: 314-325 - [i11]Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Tight Bounds on Information Dissemination in Sparse Mobile Networks. CoRR abs/1101.4609 (2011) - [i10]Matteo Riondato, Mert Akdere, Ugur Çetintemel, Stanley B. Zdonik, Eli Upfal:
The VC-Dimension of Queries and Selectivity Estimation Through Sampling. CoRR abs/1101.5805 (2011) - [i9]John Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks. CoRR abs/1108.0809 (2011) - [i8]Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal:
Space-Round Tradeoffs for MapReduce Computations. CoRR abs/1111.2228 (2011) - [i7]Matteo Riondato, Eli Upfal:
Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees. CoRR abs/1111.6937 (2011) - 2010
- [j56]Pascal Van Hentenryck, Russell Bent, Eli Upfal:
Online stochastic optimization under time constraints. Ann. Oper. Res. 177(1): 151-183 (2010) - [j55]Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin:
Mining top-K frequent itemsets through progressive sampling. Data Min. Knowl. Discov. 21(2): 310-326 (2010) - [j54]Mert Akdere, Ugur Çetintemel, Eli Upfal:
Database-support for Continuous Prediction Queries over Streaming Data. Proc. VLDB Endow. 3(1): 1291-1301 (2010) - [c75]Fabio Vandin, Eli Upfal, Benjamin J. Raphael:
Algorithms for Detecting Significantly Mutated Pathways in Cancer. RECOMB 2010: 506-521 - [i6]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin:
MADMX: A Novel Strategy for Maximal Dense Motif Extraction. CoRR abs/1002.0874 (2010) - [i5]Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin:
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. CoRR abs/1002.1104 (2010) - [i4]Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin:
Mining Top-K Frequent Itemsets Through Progressive Sampling. CoRR abs/1006.5235 (2010) - [i3]Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Infectious Random Walks. CoRR abs/1007.1604 (2010)
2000 – 2009
- 2009
- [j53]Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii:
The Hiring Problem and Lake Wobegon Strategies. SIAM J. Comput. 39(4): 1233-1255 (2009) - [c74]Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal:
Sort Me If You Can: How to Sort Dynamic Data. ICALP (2) 2009: 339-350 - [c73]Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin:
An efficient rigorous approach for identifying statistically significant frequent itemsets. PODS 2009: 117-126 - [c72]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin:
MADMX: A Novel Strategy for Maximal Dense Motif Extraction. WABI 2009: 362-374 - 2008
- [j52]Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal:
Commitment under uncertainty: Two-stage stochastic matching problems. Theor. Comput. Sci. 408(2-3): 213-223 (2008) - [c71]Aleksandrs Slivkins, Eli Upfal:
Adapting to a Changing Environment: the Brownian Restless Bandits. COLT 2008: 343-354 - [c70]Deepayan Chakrabarti, Ravi Kumar, Filip Radlinski, Eli Upfal:
Mortal Multi-Armed Bandits. NIPS 2008: 273-280 - [c69]Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii:
The hiring problem and Lake Wobegon strategies. SODA 2008: 1184-1193 - [c68]Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal:
Multi-armed bandits in metric spaces. STOC 2008: 681-690 - [i2]Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal:
Multi-Armed Bandits in Metric Spaces. CoRR abs/0809.4882 (2008) - 2007
- [j51]Gopal Pandurangan, Eli Upfal:
Entropy-based bounds for online algorithms. ACM Trans. Algorithms 3(1): 7:1-7:19 (2007) - [c67]Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck:
Propagating Knapsack Constraints in Sublinear Time. AAAI 2007: 231-236 - [c66]Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal:
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. ICALP 2007: 171-182 - [c65]Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal:
Finding near neighbors through cluster pruning. PODS 2007: 103-112 - [e1]Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking:
Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007. Dagstuhl Seminar Proceedings 07391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i1]Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking:
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. Probabilistic Methods in the Design and Analysis of Algorithms 2007 - 2006
- [j50]Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal:
Using PageRank to Characterize Web Structure. Internet Math. 3(1): 1-20 (2006) - 2005
- [b2]Michael Mitzenmacher, Eli Upfal:
Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press 2005, ISBN 978-0-521-83540-4, pp. I-XVI, 1-352 - [j49]Aris Anagnostopoulos, Ioannis Kontoyiannis, Eli Upfal:
Steady state analysis of balanced-allocation routing. Random Struct. Algorithms 26(4): 446-467 (2005) - [j48]Aris Anagnostopoulos, Adam Kirsch, Eli Upfal:
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input. SIAM J. Comput. 34(3): 616-639 (2005) - [c64]Will Sheffler, Eli Upfal, John Sedivy, William Stafford Noble:
A Learned Comparative Expression Measure for Affymetrix GeneChip DNA Microarrays. CSB 2005: 144-154 - 2004
- [j47]Aris Anagnostopoulos, Russell Bent, Eli Upfal, Pascal Van Hentenryck:
A simple and deterministic competitive algorithm for online facility location. Inf. Comput. 194(2): 175-202 (2004) - [j46]Abraham Flaxman, Alan M. Frieze, Eli Upfal:
Efficient communication in an ad-hoc network. J. Algorithms 52(1): 1-7 (2004) - 2003
- [j45]Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal:
Building low-diameter peer-to-peer networks. IEEE J. Sel. Areas Commun. 21(6): 995-1002 (2003) - [c63]Eli Upfal:
Performance Analysis of Dynamic Network Processes. FOCS 2003: 18 - [c62]Aris Anagnostopoulos, Adam Kirsch, Eli Upfal:
Stability and Efficiency of a Random Local Load Balancing Protocol. FOCS 2003: 472-481 - 2002
- [c61]Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal:
Using PageRank to Characterize Web Structure. COCOON 2002: 330-339 - 2001
- [j44]Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochantaridis, Eli Upfal:
Efficient Methods for Computing Investment Strategies for Multi-Market Commodity Trading. Appl. Artif. Intell. 15(5): 429-452 (2001) - [j43]Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
A general approach to dynamic packet routing with bounded buffers. J. ACM 48(2): 324-349 (2001) - [c60]Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal:
Building Low-Diameter P2P Networks. FOCS 2001: 492-499 - [c59]Gopal Pandurangan, Eli Upfal:
Can entropy characterize performance of online algorithms?. SODA 2001: 727-734 - [c58]Milos Hauskrecht, Eli Upfal:
A Clustering Approach to Solving Large Stochastic Matching Problems. UAI 2001: 219-226 - 2000
- [j42]Franco P. Preparata, Eli Upfal:
Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm. J. Comput. Biol. 7(3-4): 621-630 (2000) - [j41]Gopal Pandurangan, Eli Upfal:
Static and Dynamic Evaluation of QoS Properties. J. Interconnect. Networks 1(2): 135-150 (2000) - [c57]Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochantaridis, Eli Upfal:
Computing Global Strategies for Multi-Market Commodity Trading. AIPS 2000: 159-166 - [c56]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal:
Random graph models for the web graph. FOCS 2000: 57-65 - [c55]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal:
The Web as a Graph. PODS 2000: 1-10 - [c54]Franco P. Preparata, Eli Upfal:
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm. RECOMB 2000: 245-253
1990 – 1999
- 1999
- [j40]Alan M. Frieze, Franco P. Preparata, Eli Upfal:
Optimal Reconstruction of a Sequence from its Probes. J. Comput. Biol. 6(3/4): 361-368 (1999) - [j39]A. L. Narasimha Reddy, Eli Upfal:
Real-Time Communication Scheduling in a Multicomputer Video Server. J. Parallel Distributed Comput. 58(3): 425-445 (1999) - [j38]Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. Random Struct. Algorithms 14(1): 87-109 (1999) - [j37]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal:
Balanced Allocations. SIAM J. Comput. 29(1): 180-200 (1999) - [c53]Malwina J. Luczak, Eli Upfal:
Reducing Network Congestion and Blocking Probability Through Balanced Allocation. FOCS 1999: 587-595 - [c52]Milos Hauskrecht, Gopal Pandurangan, Eli Upfal:
Computing Near Optimal Strategies for Stochastic Investment Planning Problems. IJCAI 1999: 1310-1315 - [c51]Franco P. Preparata, Alan M. Frieze, Eli Upfal:
On the power of universal bases in sequencing by hybridization. RECOMB 1999: 295-301 - [c50]Gopal Pandurangan, Eli Upfal:
Static and Dynamic Evaluation of QoS Properties. STOC 1999: 566-573 - 1998
- [j36]Andrzej Pelc, Eli Upfal:
Reliable Fault Diagnosis with Few Tests. Comb. Probab. Comput. 7(3): 323-333 (1998) - [j35]Nir Shavit, Eli Upfal, Asaph Zemach:
A Steady State Analysis of Diffracting Trees. Theory Comput. Syst. 31(4): 403-423 (1998) - [j34]Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal:
Optimal Construction of Edge-Disjoint Paths in Random Graphs. SIAM J. Comput. 28(2): 541-573 (1998) - [j33]Prabhakar Raghavan, Eli Upfal:
Stochastic Contention Resolution With Short Delays. SIAM J. Comput. 28(2): 709-719 (1998) - [c49]Eli Upfal:
Design and Analysis of Dynamic Processes: A Stochastic Approach. ESA 1998: 26-34 - [c48]Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
Dynamic Packet Routing on Arrays with Bounded Buffers. LATIN 1998: 273-281 - [c47]Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal:
On Balls and Bins with Deletions. RANDOM 1998: 145-158 - [c46]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:
Updates to the QBIC System. Storage and Retrieval for Image and Video Databases (SPIE) 1998: 150-161 - 1997
- [j32]Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal:
How much can hardware help routing? J. ACM 44(5): 726-741 (1997) - [j31]Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Eli Upfal, Derrick Weathersby:
Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems. IEEE Trans. Parallel Distributed Syst. 8(11): 1143-1156 (1997) - [c45]Eli Upfal:
Stochastic Analysis of Dynamic Processes. FCT 1997: 85-92 - [c44]Nir Shavit, Eli Upfal, Asaph Zemach:
A Wait-Free Sorting Algorithm. PODC 1997: 121-128 - [c43]Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). STOC 1997: 531-539 - 1996
- [j30]Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal:
A Theory of Wormhole Routing in Parallel Computers. IEEE Trans. Computers 45(6): 704-713 (1996) - [j29]Eli Upfal, Sergio A. Felperin, Marc Snir:
Randomized Routing with Shorter Paths. IEEE Trans. Parallel Distributed Syst. 7(4): 356-362 (1996) - [c42]Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). FOCS 1996: 390-399 - [c41]Sonne Preminger, Eli Upfal:
Efficient Traffic Laws for Mobile Robots - Work in Progress (Avstract). PODC 1996: 155 - [c40]Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal:
An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. SODA 1996: 261-268 - [c39]Nir Shavit, Eli Upfal, Asaph Zemach:
A Steady State Analysis of Diffracting Trees (Extended Abstract). SPAA 1996: 33-41 - [c38]Andrei Z. Broder, Eli Upfal:
Dynamic Deflection Routing on Arrays (Preliminary Version). STOC 1996: 348-355 - [c37]Sonne Preminger, Eli Upfal:
Safe and Efficient Traffic Laws for Mobile Robots. SWAT 1996: 357-367 - 1995
- [j28]Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal:
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Inf. Process. Lett. 56(2): 79-81 (1995) - [c36]Prabhakar Raghavan, Eli Upfal:
Stochastic contention resolution with short delays. STOC 1995: 229-237 - 1994
- [j27]Eli Upfal:
Tolerating a Linear Number of Faults in Networks of Bounded Degree. Inf. Comput. 115(2): 312-320 (1994) - [j26]Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal:
Near-perfect Token Distribution. Random Struct. Algorithms 5(4): 559-572 (1994) - [j25]Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal:
Trading Space for Time in Undirected s-t Connectivity. SIAM J. Comput. 23(2): 324-334 (1994) - [j24]Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
Existence and Construction of Edge-Disjoint Paths on Expander Graphs. SIAM J. Comput. 23(5): 976-989 (1994) - [j23]Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal:
Computing with Noisy Information. SIAM J. Comput. 23(5): 1001-1018 (1994) - [c35]Eli Upfal:
On the Theory of Interconnection Networks for Parallel Computers. ICALP 1994: 473-486 - [c34]Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal:
Optimal Construction of Edge-Disjoint Paths in Random Graphs. SODA 1994: 603-612 - [c33]Prabhakar Raghavan, Eli Upfal:
Efficient routing in all-optical networks. STOC 1994: 134-143 - [c32]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal:
Balanced allocations (extended abstract). STOC 1994: 593-602 - 1993
- [c31]Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. SODA 1993: 322-330 - [c30]Eli Upfal, Sergio A. Felperin, Marc Snir:
Randomized routing with shorter paths. SPAA 1993: 273-282 - [c29]Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal:
How much can hardware help routing? STOC 1993: 573-582 - 1992
- [j22]Eli Upfal:
An O(log(N)) Deterministic Packet-Routing Scheme. J. ACM 39(1): 55-70 (1992) - [c28]Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal:
A Theory of Wormhole Routing in Parallel Computers (Extended Abstract). FOCS 1992: 563-572 - [c27]Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal:
Near-perfect Token Distribution. ICALP 1992: 308-317 - [c26]Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal:
An Experimental Study of Wormhole Routing in Parallel Computers. Heinz Nixdorf Symposium 1992: 156-165 - [c25]Eli Upfal:
Tolerating Linear Number of Faults in Networks of Bounded Degree. PODC 1992: 83-89 - [c24]Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
Existence and Construction of Edge Disjoint Paths on Expander Graphs. STOC 1992: 140-149 - 1991
- [j21]Shay Assaf, Eli Upfal:
Fault Tolerant Sorting Networks. SIAM J. Discret. Math. 4(4): 472-480 (1991) - [c23]Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal:
On the Parallel Complexity of Evaluating Game Trees. SODA 1991: 404-413 - [c22]Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal:
A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. SPAA 1991: 237-245 - 1990
- [j20]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Randomized Broadcast in Networks. Random Struct. Algorithms 1(4): 447-460 (1990) - [j19]David Peleg, Eli Upfal:
A Time-Randomness Trade-Off for Oblivious Routing. SIAM J. Comput. 19(2): 256-266 (1990) - [c21]Shay Assaf, Eli Upfal:
Fault Tolerant Sorting Network. FOCS 1990: 275-284 - [c20]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms 1990: 128-137 - [c19]Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Computing with Unreliable Information (Preliminary Version). STOC 1990: 128-137
1980 – 1989
- 1989
- [j18]David Peleg, Eli Upfal:
Constructng disjoint paths on expander graphs. Comb. 9(3): 289-313 (1989) - [j17]David Peleg, Eli Upfal:
A trade-off between space and efficiency for routing tables. J. ACM 36(3): 510-530 (1989) - [j16]David Peleg, Eli Upfal:
The Token Distribution Problem. SIAM J. Comput. 18(2): 229-243 (1989) - [c18]Eli Upfal:
An O(log N) Deterministic Packet Routing Scheme (Preliminary Version). STOC 1989: 241-250 - [c17]Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, Eli Upfal:
Trading Space for Time in Undirected s-t Connectivity. STOC 1989: 543-549 - 1988
- [j15]Anna R. Karlin, Eli Upfal:
Parallel hashing: an efficient implementation of shared memory. J. ACM 35(4): 876-892 (1988) - [j14]Richard M. Karp, Eli Upfal, Avi Wigderson:
The Complexity of Parallel Search. J. Comput. Syst. Sci. 36(2): 225-253 (1988) - [j13]Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal:
Fault Tolerance in Networks of Bounded Degree. SIAM J. Comput. 17(5): 975-988 (1988) - [j12]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. Theor. Comput. Sci. 58: 57-68 (1988) - [c16]David Peleg, Eli Upfal:
A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract). STOC 1988: 43-52 - [c15]Danny Krizanc, David Peleg, Eli Upfal:
A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract). STOC 1988: 93-102 - 1987
- [j11]Eli Upfal, Avi Wigderson:
How to share memory in a distributed system. J. ACM 34(1): 116-127 (1987) - [j10]Eli Shamir, Eli Upfal:
A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems. J. Parallel Distributed Comput. 4(5): 521-530 (1987) - [j9]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
A Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. 16(1): 97-99 (1987) - [j8]David Peleg, Eli Upfal:
The Generalized Packet Routing Problem. Theor. Comput. Sci. 53: 281-293 (1987) - [c14]David Peleg, Eli Upfal:
Constructing Disjoint Paths on Expander Graphs (Extended Abstract). STOC 1987: 264-273 - 1986
- [j7]Richard M. Karp, Eli Upfal, Avi Wigderson:
Constructing a perfect matching is in random NC. Comb. 6(1): 35-48 (1986) - [j6]Danny Dolev, Eli Upfal, Manfred K. Warmuth:
The Parallel Complexity of Scheduling with Precedence Constraints. J. Parallel Distributed Comput. 3(4): 553-576 (1986) - [c13]David Peleg, Eli Upfal:
The Token Distribution Problem (Preliminary Version). FOCS 1986: 418-427 - [c12]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. ICALP 1986: 50-59 - [c11]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
A Time-Space Tradeoff for Element Distinctness. STACS 1986: 353-358 - [c10]Anna R. Karlin, Eli Upfal:
Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version). STOC 1986: 160-168 - [c9]Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal:
Fault Tolerance in Networks of Bounded Degree (Preliminary Version). STOC 1986: 370-379 - 1985
- [j5]Jeanette Schmidt-Pruzan, Eli Shamir, Eli Upfal:
Random hypergraph coloring algorithms and the weak chromatic number. J. Graph Theory 9(3): 347-362 (1985) - [c8]Richard M. Karp, Eli Upfal, Avi Wigderson:
The Complexity of Parallel Computation on Matroids. FOCS 1985: 541-550 - [c7]Richard M. Karp, Eli Upfal, Avi Wigderson:
Constructing a Perfect Matching is in Random NC. STOC 1985: 22-32 - [c6]Richard M. Karp, Eli Upfal, Avi Wigderson:
Are Search and Decision Problems Computationally Equivalent? STOC 1985: 464-475 - 1984
- [j4]Eli Upfal:
Efficient Schemes for Parallel Communication. J. ACM 31(3): 507-517 (1984) - [j3]Eli Shamir, Eli Upfal:
Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces. J. Algorithms 5(4): 488-501 (1984) - [c5]Eli Upfal, Avi Wigderson:
How to Share Memory in a Distributed System (A Preliminary Version). FOCS 1984: 171-180 - [c4]Eli Upfal:
A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version). STOC 1984: 258-265 - 1983
- [b1]Eli Upfal:
אלגוריתמים הסתברותיים מבזרים לבעיות בתורת הגרפים, תקשורת תאום ותזמון (Distributed probabilistic algorithms for problems in graph theory.). Hebrew University of Jerusalem, Israel, 1983 - [c3]Eli Shamir, Eli Upfal:
A Fast Construction oF Disjoint Paths in Communication Networks. FCT 1983: 428-438 - 1982
- [j2]Eli Shamir, Eli Upfal:
One-factor in random graphs based on vertex choice. Discret. Math. 41(3): 281-286 (1982) - [j1]Eli Upfal:
Formal Correctness Proofs of a Nondeterministic Program. Inf. Process. Lett. 14(2): 86-92 (1982) - [c2]Eli Upfal:
Efficient Schemes for Parallel Communication. PODC 1982: 55-59 - [c1]Eli Shamir, Eli Upfal:
N-Processors Graph Distributively Achieve Perfect Matchings in O(log2N) Beats. PODC 1982: 238-241
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
