Folgen
Costas Busch
Costas Busch
Professor, School of Computer and Cyber Sciences, Augusta University
Bestätigte E-Mail-Adresse bei augusta.edu
Titel
Zitiert von
Zitiert von
Jahr
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
1522011
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
1102004
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
802003
A combinatorial treatment of balancing networks
C Busch, M Mavronicolas
Journal of the ACM (JACM) 43 (5), 794-839, 1996
581996
Proteus: A scalable bft consensus protocol for blockchains
MM Jalalzai, C Busch, GG Richard
2019 IEEE international conference on Blockchain (Blockchain), 308-313, 2019
562019
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
502006
Atomic routing games on maximum congestion
C Busch, M Magdon-Ismail
Theoretical Computer Science 410 (36), 3337-3347, 2009
492009
Mutual visibility with an optimal number of colors
G Sharma, C Busch, S Mukhopadhyay
International Symposium on Algorithms and Experiments for Wireless Sensor …, 2015
482015
Complete Visibility for Robots with Lights in O(1) Time
G Sharma, R Vaidyanathan, JL Trahan, C Busch, S Rai
International Symposium on Stabilization, Safety, and Security of …, 2016
462016
Optimal oblivious path selection on the mesh
C Busch, M Magdon-Ismail, J Xi
IEEE Transactions on Computers 57 (5), 660-671, 2008
452008
Distributed transactional memory for general networks
G Sharma, C Busch
Distributed computing 27 (5), 329-362, 2014
432014
Oblivious routing on geometric networks
C Busch, M Magdon-Ismail, J Xi
Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005
432005
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
412015
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
392003
Hard-potato routing
C Busch, M Herlihy, R Wattenhofer
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
392000
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
372017
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
342007
Routing without flow control
C Busch, M Herlihy, R Wattenhofer
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001
332001
Contention in counting networks
C Busch, N Hardavellas, M Mavronicolas
Proceedings of the thirteenth annual ACM symposium on Principles of …, 1994
311994
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
292007
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20