| Year |
Citation |
Score |
| 2020 |
Ceccarello M, Pietracaprina A, Pucci G, Upfal E. Distributed Graph Diameter Approximation Algorithms. 13: 216. DOI: 10.3390/A13090216 |
0.444 |
|
| 2019 |
Hajkarim MC, Upfal E, Vandin F. Differentially mutated subnetworks discovery. Algorithms For Molecular Biology : Amb. 14: 10. PMID 30976291 DOI: 10.1186/S13015-019-0146-7 |
0.315 |
|
| 2018 |
Epasto A, Upfal E. Efficient Approximation for Restricted Biclique Cover Problems Algorithms. 11: 84. DOI: 10.3390/A11060084 |
0.391 |
|
| 2018 |
Riondato M, Upfal E. ABRA Acm Transactions On Knowledge Discovery From Data. 12: 1-38. DOI: 10.1145/3208351 |
0.422 |
|
| 2015 |
Vandin F, Raphael BJ, Upfal E. On the Sample Complexity of Cancer Pathways Identification. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. PMID 26645471 DOI: 10.1089/Cmb.2015.0100 |
0.308 |
|
| 2015 |
Vandin F, Papoutsaki A, Raphael BJ, Upfal E. Accurate computation of survival statistics in genome-wide studies. Plos Computational Biology. 11: e1004071. PMID 25950620 DOI: 10.1371/Journal.Pcbi.1004071 |
0.302 |
|
| 2015 |
Ceccarello M, Pietracaprina A, Upfal E, Pucci G. Space and time efficient parallel graph decomposition, clustering, and diameter approximation Annual Acm Symposium On Parallelism in Algorithms and Architectures. 2015: 182-191. DOI: 10.1145/2755573.2755591 |
0.304 |
|
| 2015 |
Augustine J, Pandurangan G, Robinson P, Roche S, Upfal E. Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 350-369. DOI: 10.1109/FOCS.2015.29 |
0.363 |
|
| 2015 |
Mahmoody A, Kornaropoulos EM, Upfal E. Optimizing static and adaptive probing schedules for rapid event detection Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9486: 377-391. DOI: 10.1016/J.Tcs.2016.05.041 |
0.395 |
|
| 2015 |
Das Sarma A, Molla AR, Pandurangan G, Upfal E. Fast distributed PageRank computation Theoretical Computer Science. 561: 113-121. DOI: 10.1016/j.tcs.2014.04.003 |
0.39 |
|
| 2015 |
Augustine J, Pandurangan G, Robinson P, Upfal E. Distributed agreement in dynamic peer-to-peer networks Journal of Computer and System Sciences. 81: 1088-1109. DOI: 10.1016/J.Jcss.2014.10.005 |
0.456 |
|
| 2014 |
Riondato M, Upfal E. Efficient discovery of association rules and frequent itemsets through sampling with tight performance guarantees Acm Transactions On Knowledge Discovery From Data. 8. DOI: 10.1145/2629586 |
0.353 |
|
| 2013 |
Das Sarma A, Molla AR, Pandurangan G, Upfal E. Fast distributed PageRank computation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7730: 11-26. DOI: 10.1007/978-3-642-35668-1_2 |
0.4 |
|
| 2013 |
Augustine J, Molla AR, Morsy E, Pandurangan G, Robinson P, Upfal E. Storage and search in dynamic peer-to-peer networks Annual Acm Symposium On Parallelism in Algorithms and Architectures. 53-62. |
0.317 |
|
| 2012 |
Anagnostopoulos A, Kumar R, Mahdian M, Upfal E, Vandin F. Algorithms on evolving graphs Itcs 2012 - Innovations in Theoretical Computer Science Conference. 149-160. DOI: 10.1145/2090236.2090249 |
0.546 |
|
| 2012 |
Vandin F, Upfal E, Raphael BJ. Algorithms and genome sequencing: Identifying driver pathways in cancer Computer. 45: 39-46. DOI: 10.1109/Mc.2012.71 |
0.343 |
|
| 2012 |
Augustine J, Pandurangan G, Robinson P, Upfal E. Towards robust and efficient computation in dynamic Peer-to-Peer networks Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 551-569. |
0.372 |
|
| 2011 |
Vandin F, Upfal E, Raphael BJ. Algorithms for detecting significantly mutated pathways in cancer. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 18: 507-22. PMID 21385051 DOI: 10.1089/Cmb.2010.0265 |
0.307 |
|
| 2011 |
Anagnostopoulos A, Kumar R, Mahdian M, Upfal E. Sorting and selection on dynamic data Theoretical Computer Science. 412: 2564-2576. DOI: 10.1016/J.Tcs.2010.10.003 |
0.563 |
|
| 2010 |
Pietracaprina A, Riondato M, Upfal E, Vandin F. Mining top-K frequent itemsets through progressive sampling Data Mining and Knowledge Discovery. 21: 310-326. DOI: 10.1007/S10618-010-0185-7 |
0.302 |
|
| 2009 |
Anagnostopoulos A, Kumar R, Mahdian M, Upfal E. Sort me if you can: How to sort dynamic data Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5556: 339-350. DOI: 10.1007/978-3-642-02930-1_28 |
0.305 |
|
| 2008 |
Katriel I, Kenyon-Mathieu C, Upfal E. Commitment under uncertainty: Two-stage stochastic matching problems Theoretical Computer Science. 408: 213-223. DOI: 10.1016/J.Tcs.2008.08.010 |
0.325 |
|
| 2008 |
Kleinberg R, Slivkins A, Upfal E. Multi-armed bandits in metric spaces Proceedings of the Annual Acm Symposium On Theory of Computing. 681-690. |
0.308 |
|
| 2007 |
Pandurangan G, Upfal E. Entropy-based bounds for online algorithms Acm Transactions On Algorithms. 3. DOI: 10.1145/1186810.1186817 |
0.427 |
|
| 2006 |
Pandurangan G, Raghavan P, Upfal E. Using pagerank to characterize web structure Internet Mathematics. 3: 1. DOI: 10.1080/15427951.2006.10129114 |
0.321 |
|
| 2005 |
Anagnostopoulos A, Kirsch A, Upfal E. Load balancing in arbitrary network topologies with stochastic adversarial input Siam Journal On Computing. 34: 616-639. DOI: 10.1137/S0097539703437831 |
0.354 |
|
| 2005 |
Anagnostopoulos A, Kontoyiannis I, Upfal E. Steady state analysis of balanced-allocation routing Random Structures and Algorithms. 26: 446-467. DOI: 10.1002/Rsa.V26:4 |
0.425 |
|
| 2004 |
Flaxman A, Frieze A, Upfal E. Efficient communication in an ad-hoc network Journal of Algorithms. 52: 1-7. DOI: 10.1016/J.Jalgor.2004.01.004 |
0.3 |
|
| 2004 |
Anagnostopoulos A, Bent R, Upfal E, Van Hentenryck P. A simple and deterministic competitive algorithm for online facility location Information and Computation. 194: 175-202. DOI: 10.1016/J.Ic.2004.06.002 |
0.419 |
|
| 2003 |
Pandurangan G, Raghavan P, Upfal E. Building low-diameter peer-to-peer networks Ieee Journal On Selected Areas in Communications. 21: 995-1002. DOI: 10.1109/Jsac.2003.814666 |
0.353 |
|
| 2003 |
Luczak MJ, McDiarmid C, Upfal E. On-line routing of random calls in networks Probability Theory and Related Fields. 125: 457-482. DOI: 10.1007/S00440-002-0242-2 |
0.428 |
|
| 2001 |
Broder AZ, Frieze AM, Upfal E. A general approach to dynamic packet routing with bounded buffers Journal of the Acm. 48: 324-349. DOI: 10.1145/375827.375849 |
0.437 |
|
| 2001 |
Hauskrecht M, Ortiz L, Tsochantaridis I, Upfal E. Efficient methods for computing investment strategies for multi-market commodity trading Applied Artificial Intelligence. 15: 429-452. DOI: 10.1080/088395101300125716 |
0.303 |
|
| 2001 |
Shavit N, Upfal E, Zemach A. A wait-free sorting algorithm Theory of Computing Systems. 34: 519-544. DOI: 10.1007/S00224-001-1009-3 |
0.424 |
|
| 2001 |
Pandurangan G, Upfal E. Can entropy characterize performance of online algorithms? Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 727-734. |
0.323 |
|
| 2000 |
Preparata FP, Upfal E. Sequencing-by-hybridization at the information-theory bound: An optimal algorithm Journal of Computational Biology. 7: 621-630. PMID 11108482 DOI: 10.1089/106652700750050970 |
0.32 |
|
| 1999 |
Pandurangan G, Upfal E. Static and dynamic evaluation of QoS properties Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 566-573. DOI: 10.1142/S0219265900000093 |
0.368 |
|
| 1999 |
Narasimha Reddy AL, Upfal E. Real-time communication scheduling in a multicomputer video server Journal of Parallel and Distributed Computing. 58: 425-445. DOI: 10.1006/Jpdc.1999.1560 |
0.369 |
|
| 1999 |
Broder AZ, Frieze AM, Upfal E. Static and dynamic path selection on expander graphs: A random walk approach Random Structures and Algorithms. 14: 87-109. DOI: 10.1002/(Sici)1098-2418(1999010)14:1<87::Aid-Rsa5>3.0.Co;2-O |
0.456 |
|
| 1999 |
Luczak MJ, Upfal E. Reducing network congestion and blocking probability through balanced allocation Annual Symposium On Foundations of Computer Science - Proceedings. 587-595. |
0.314 |
|
| 1998 |
Broder AZ, Frieze AM, Suen S, Upfal E. Optimal Construction of Edge-Disjoint Paths in Random Graphs Siam Journal On Computing. 28: 541-573. DOI: 10.1137/S0097539795290805 |
0.402 |
|
| 1998 |
Raghavan P, Upfal E. Stochastic Contention Resolution With Short Delays Siam Journal On Computing. 28: 709-719. DOI: 10.1137/S0097539795285333 |
0.305 |
|
| 1998 |
Shavit N, Upfal E, Zemach A. A steady state analysis of diffracting trees Theory of Computing Systems. 31: 403-423. DOI: 10.1007/S002240000095 |
0.39 |
|
| 1998 |
Broder AZ, Frieze AM, Upfal E. Dynamic packet routing on arrays with bounded buffers Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1380: 273-281. |
0.303 |
|
| 1997 |
Borodin A, Raghavan P, Schieber B, Upfal E. How much can hardware help routing? Journal of the Acm. 44: 726-741. DOI: 10.1145/265910.265922 |
0.405 |
|
| 1997 |
Bruck J, Ho CT, Kipnis S, Upfal E, Weathersby D. Efficient algorithms for all-to-all communications in multiport message-passing systems Ieee Transactions On Parallel and Distributed Systems. 8: 1143-1156. DOI: 10.1109/71.642949 |
0.399 |
|
| 1997 |
Shavit N, Upfal E, Zemach A. Wait-free sorting algorithm Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 121-128. |
0.315 |
|
| 1996 |
Upfal E, Felperin S, Snir M. Randomized routing with shorter paths Ieee Transactions On Parallel and Distributed Systems. 7: 356-362. DOI: 10.1109/71.494630 |
0.345 |
|
| 1996 |
Felperin S, Raghavan P, Upfal E. A theory of wormhole routing in parallel computers Ieee Transactions On Computers. 45: 704-713. DOI: 10.1109/12.506426 |
0.383 |
|
| 1995 |
Broder AZ, Dyer ME, Frieze AM, Raghavan P, Upfal E. The worst-case running time of the random simplex algorithm is exponential in the height Information Processing Letters. 56: 79-81. DOI: 10.1016/0020-0190(95)00101-H |
0.404 |
|
| 1994 |
Broder AZ, Frieze AM, Upfal E. Existence and Construction of Edge-Disjoint Paths on Expander Graphs Siam Journal On Computing. 23: 976-989. DOI: 10.1137/S0097539792232021 |
0.44 |
|
| 1994 |
Feige U, Raghavan P, Peleg D, Upfal E. Computing with Noisy Information Siam Journal On Computing. 23: 1001-1018. DOI: 10.1137/S0097539791195877 |
0.357 |
|
| 1994 |
Upfal E. Tolerating a Linear Number of Faults in Networks of Bounded Degree Information and Computation. 115: 312-320. DOI: 10.1006/Inco.1994.1099 |
0.369 |
|
| 1994 |
Broder AZ, Frieze AM, Shamir E, Upfal E. Near-perfect token distribution Random Structures & Algorithms. 5: 559-572. DOI: 10.1002/Rsa.3240050406 |
0.444 |
|
| 1992 |
Upfal E. An O(log N) deterministic packet-routing scheme Journal of the Acm. 39: 55-70. DOI: 10.1145/147508.147517 |
0.414 |
|
| 1991 |
Assaf S, Upfal E. Fault Tolerant Sorting Networks Siam Journal On Discrete Mathematics. 4: 472-480. DOI: 10.1137/0404042 |
0.303 |
|
| 1990 |
Feige U, Peleg D, Raghavan P, Upfal E. Randomized broadcast in networks Random Structures and Algorithms. 1: 447-460. DOI: 10.1002/Rsa.3240010406 |
0.396 |
|
| 1989 |
Peleg D, Upfal E. The Token Distribution Problem Siam Journal On Computing. 18: 229-243. DOI: 10.1137/0218015 |
0.438 |
|
| 1989 |
Peleg D, Upfal E. Constructing disjoint paths on expander graphs Combinatorica. 9: 289-313. DOI: 10.1007/Bf02125897 |
0.438 |
|
| 1988 |
Peleg D, Upfal E. A tradeoff between space and efficiency for routing tables Proceedings of the Annual Acm Symposium On Theory of Computing. 43-52. DOI: 10.1145/65950.65953 |
0.367 |
|
| 1988 |
Karlin AR, Upfal E. Parallel Hashing: An Efficient Implementation of Shared Memory Journal of the Acm (Jacm). 35: 876-892. DOI: 10.1145/48014.350550 |
0.377 |
|
| 1988 |
Krizanc D, Peleg D, Upfal E. A time-randomness tradeoff for oblivious routing Proceedings of the Annual Acm Symposium On Theory of Computing. 93-102. DOI: 10.1137/0219017 |
0.412 |
|
| 1988 |
Dwork C, Peleg D, Pippenger N, Upfal E. Fault Tolerance in Networks of Bounded Degree Siam Journal On Computing. 17: 975-988. DOI: 10.1137/0217061 |
0.326 |
|
| 1987 |
Upfal E, Wigderson A. How to share memory in a distributed system Journal of the Acm (Jacm). 34: 116-127. DOI: 10.1145/7531.7926 |
0.362 |
|
| 1987 |
Borodin A, Fich F, Meyer Auf Der Heide F, Upfal E, Wigderson A. TIME-SPACE TRADEOFF FOR ELEMENT DISTINCTNESS Siam Journal On Computing. 16: 97-99. DOI: 10.1137/0216007 |
0.3 |
|
| 1987 |
Peleg D, Upfal E. The generalized packet routing problem Theoretical Computer Science. 53: 281-293. DOI: 10.1016/0304-3975(87)90069-7 |
0.422 |
|
| 1986 |
Dolev D, Upfal E, Warmuth MK. The parallel complexity of scheduling with precedence constraints Journal of Parallel and Distributed Computing. 3: 553-576. DOI: 10.1016/0743-7315(86)90014-6 |
0.418 |
|
| 1986 |
Karp RM, Upfal E, Wigderson A. Constructing a perfect matching is in random NC Combinatorica. 6: 35-48. DOI: 10.1007/Bf02579407 |
0.383 |
|
| 1985 |
Shamir E, Upfal E. A fast parallel construction of disjoint paths in networks North-Holland Mathematics Studies. 102: 141-153. DOI: 10.1016/S0304-0208(08)73079-2 |
0.447 |
|
| 1985 |
Schmidt-Pruzan J, Shamir E, Upfal E. Random hypergraph coloring algorithms and the weak chromatic number Journal of Graph Theory. 9: 347-362. DOI: 10.1002/Jgt.3190090307 |
0.377 |
|
| 1984 |
Upfal E. Efficient Schemes for Parallel Communication Journal of the Acm (Jacm). 31: 507-517. DOI: 10.1145/828.1892 |
0.409 |
|
| 1984 |
Shamir E, Upfal E. Large Regular Factors in Random Graphs North-Holland Mathematics Studies. 87: 271-282. DOI: 10.1016/S0304-0208(08)72835-4 |
0.339 |
|
| 1984 |
Shamir E, Upfal E. Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces Journal of Algorithms. 5: 488-501. DOI: 10.1016/0196-6774(84)90003-8 |
0.425 |
|
| 1982 |
Shamir E, Upfal E. One-factor in random graphs based on vertex choice Discrete Mathematics. 41: 281-286. DOI: 10.1016/0012-365X(82)90023-1 |
0.358 |
|
| Show low-probability matches. |