| Quincy: fair scheduling for distributed computing clusters M Isard, V Prabhakaran, J Currey, U Wieder, K Talwar, A Goldberg Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles …, 2009 | 1242 | 2009 |
| Novel architectures for P2P applications: the continuous-discrete approach M Naor, U Wieder ACM Transactions on Algorithms (TALG) 3 (3), 34-es, 2007 | 427 | 2007 |
| Heuristics for vector bin packing R Panigrahy, K Talwar, L Uyeda, U Wieder research. microsoft. com, 2011 | 290 | 2011 |
| Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks GS Manku, M Naor, U Wieder Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 276 | 2004 |
| More robust hashing: Cuckoo hashing with a stash A Kirsch, M Mitzenmacher, U Wieder SIAM Journal on Computing 39 (4), 1543-1561, 2010 | 267 | 2010 |
| Efficient circuit-based PSI via cuckoo hashing B Pinkas, T Schneider, C Weinert, U Wieder Annual International Conference on the Theory and Applications of …, 2018 | 226 | 2018 |
| A simple fault tolerant distributed hash table M Naor, U Wieder Peer-to-Peer Systems II: Second International Workshop, IPTPS 2003, Berkeley …, 2003 | 190 | 2003 |
| Validating heuristics for virtual machines consolidation S Lee, R Panigrahy, V Prabhakaran, V Ramasubramanian, K Talwar, ... Microsoft Research, MSR-TR-2011-9, 1-14, 2011 | 163 | 2011 |
| Trace reconstruction with constant deletion probability and related results T Holenstein, M Mitzenmacher, R Panigrahy, U Wieder Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 128 | 2008 |
| Maintaining privacy during user profiling N Nice, E Wieder, B Feldbaum, S Ophir, E Shamir, Y Yacobi, A Friedman US Patent 8,520,842, 2013 | 114 | 2013 |
| Graphical balanced allocations and the (1+ β)‐choice process Y Peres, K Talwar, U Wieder Random Structures & Algorithms 47 (4), 760-775, 2015 | 109* | 2015 |
| Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds M Naor, U Wieder International Workshop on Peer-to-Peer Systems, 269-277, 2004 | 92 | 2004 |
| Scheduling ready tasks by generating network flow graph using information receive from root task having affinities between ready task and computers for execution M Isard, V Prabhakaran, JJ Currey, E Wieder, K Talwar US Patent 8,332,862, 2012 | 91 | 2012 |
| Scalable and dynamic quorum systems M Naor, U Wieder Proceedings of the twenty-second annual symposium on Principles of …, 2003 | 89 | 2003 |
| Lower bounds on near neighbor search via metric expansion R Panigrahy, K Talwar, U Wieder 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 805-814, 2010 | 84 | 2010 |
| {vCorfu}: A {Cloud-Scale} Object Store on a Shared Log M Wei, A Tai, CJ Rossbach, I Abraham, M Munshed, M Dhawan, J Stabile, ... 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI …, 2017 | 76 | 2017 |
| Balanced allocations: the weighted case K Talwar, U Wieder Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 75 | 2007 |
| Virtual machine packing method using scarcity LK Uyeda, R Panigrahy, E Wieder, K Talwar US Patent 8,464,267, 2013 | 73 | 2013 |
| Changing bases: Multistage optimization for matroids and matchings A Gupta, K Talwar, U Wieder Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 66 | 2014 |
| Omnipredictors P Gopalan, AT Kalai, O Reingold, V Sharan, U Wieder arXiv preprint arXiv:2109.05389, 2021 | 65 | 2021 |
Kunal TalwarApple Inc在 apple.com 的电子邮件经过验证