| 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 | 1029 | 2009 |
| Novel architectures for P2P applications: the continuous-discrete approach M Naor, U Wieder ACM Transactions on Algorithms (TALG) 3 (3), 34-es, 2007 | 398 | 2007 |
| 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 | 260 | 2004 |
| Heuristics for vector bin packing R Panigrahy, K Talwar, L Uyeda, U Wieder research. microsoft. com, 2011 | 198 | 2011 |
| A simple fault tolerant distributed hash table M Naor, U Wieder International Workshop on Peer-to-Peer Systems, 88-97, 2003 | 171 | 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 | 154 | 2011 |
| More robust hashing: Cuckoo hashing with a stash A Kirsch, M Mitzenmacher, U Wieder SIAM Journal on Computing 39 (4), 1543-1561, 2010 | 117 | 2010 |
| 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 | 85 | 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 | 76 | 2012 |
| Scalable and dynamic quorum systems M Naor, U Wieder Distributed Computing 17 (4), 311-322, 2005 | 76 | 2005 |
| 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 | 75 | 2010 |
| Graphical balanced allocations and the (1+ β)‐choice process Y Peres, K Talwar, U Wieder Random Structures & Algorithms 47 (4), 760-775, 2015 | 68* | 2015 |
| Trace reconstruction with constant deletion probability and related results. T Holenstein, M Mitzenmacher, R Panigrahy, U Wieder SODA 8, 389-398, 2008 | 66 | 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 | 64 | 2013 |
| 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 | 60 | 2018 |
| More robust hashing: Cuckoo hashing with a stash A Kirsch, M Mitzenmacher, U Wieder European Symposium on Algorithms, 611-622, 2008 | 57 | 2008 |
| Balanced allocations: the weighted case K Talwar, U Wieder Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 56 | 2007 |
| Kinesis: A new approach to replica placement in distributed storage systems J MacCormick, N Murphy, V Ramasubramanian, U Wieder, J Yang, ... ACM Transactions On Storage (TOS) 4 (4), 1-28, 2009 | 52 | 2009 |
| Subscriber account replenishment in a netework-based electronic commerce system incorporating prepaid service offerings W Bartter, Y Cai, M Locher, B Rae, A Rush, S Sripathi US Patent App. 10/284,679, 2004 | 51 | 2004 |
| A geometric approach to lower bounds for approximate near-neighbor search and partial match R Panigrahy, K Talwar, U Wieder 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 414-423, 2008 | 45 | 2008 |
Kunal TalwarAppleVerified email at kunaltalwar.org
