| Approximating Congestion+ Dilation in Networks via" Quality of Routing” Games C Busch, R Kannan, AV Vasilakos IEEE Transactions on Computers 61 (9), 1270-1283, 2011 | 149 | 2011 |
| Contention-free MAC protocols for wireless sensor networks C Busch, M Magdon-Ismail, F Sivrikaya, B Yener Distributed Computing: 18th International Conference, DISC 2004, Amsterdam …, 2004 | 110 | 2004 |
| Analysis of link reversal routing algorithms for mobile ad hoc networks C Busch, S Surapaneni, S Tirthapura Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003 | 78 | 2003 |
| A combinatorial treatment of balancing networks C Busch, M Mavronicolas Journal of the ACM (JACM) 43 (5), 794-839, 1996 | 56 | 1996 |
| Sketching asynchronous streams over a sliding window S Tirthapura, B Xu, C Busch Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006 | 51 | 2006 |
| Atomic routing games on maximum congestion C Busch, M Magdon-Ismail Theoretical Computer Science 410 (36), 3337-3347, 2009 | 49 | 2009 |
| Proteus: A scalable BFT consensus protocol for blockchains MM Jalalzai, C Busch, GG Richard 2019 IEEE international conference on Blockchain (Blockchain), 308-313, 2019 | 43 | 2019 |
| Distributed transactional memory for general networks G Sharma, C Busch Distributed computing 27 (5), 329-362, 2014 | 42 | 2014 |
| Optimal oblivious path selection on the mesh C Busch, M Magdon-Ismail, J Xi IEEE Transactions on Computers 57 (5), 660-671, 2008 | 42 | 2008 |
| Oblivious routing on geometric networks C Busch, M Magdon-Ismail, J Xi Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005 | 41 | 2005 |
| Cake-cutting is not a piece of cake M Magdon-Ismail, C Busch, MS Krishnamoorthy STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science …, 2003 | 40 | 2003 |
| Hard-potato routing C Busch, M Herlihy, R Wattenhofer Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 39 | 2000 |
| Mutual visibility with an optimal number of colors G Sharma, C Busch, S Mukhopadhyay Algorithms for Sensor Systems: 11th International Symposium on Algorithms …, 2016 | 38 | 2016 |
| Complete Visibility for Robots with Lights in O(1) Time G Sharma, R Vaidyanathan, JL Trahan, C Busch, S Rai Stabilization, Safety, and Security of Distributed Systems: 18th …, 2016 | 36 | 2016 |
| A deterministic algorithm for summarizing asynchronous streams over a sliding window C Busch, S Tirthapura STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science …, 2007 | 36 | 2007 |
| O (log n)-time complete visibility for asynchronous robots with lights G Sharma, R Vaidyanathan, JL Trahan, C Busch, S Rai 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2017 | 35 | 2017 |
| Logarithmic-time complete visibility for robots with lights R Vaidyanathan, C Busch, JL Trahan, G Sharma, S Rai 2015 IEEE International Parallel and Distributed Processing Symposium, 375-384, 2015 | 34 | 2015 |
| Routing without flow control C Busch, M Herlihy, R Wattenhofer Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001 | 33 | 2001 |
| Improved sparse covers for graphs excluding a fixed minor C Busch, R LaFortune, S Tirthapura Proceedings of the twenty-sixth annual ACM Symposium on Principles of …, 2007 | 32 | 2007 |
| Sketching asynchronous data streams over sliding windows B Xu, S Tirthapura, C Busch Distributed Computing 20 (5), 359-374, 2008 | 29 | 2008 |
Maurice HerlihyAn Wang Professor of Computer Science, Brown UniversityVerified email at cs.brown.edu
