Costas Busch
Costas Busch
Professor, Division of Computer Science and Engineering, Louisiana State University
Email verificata su csc.lsu.edu - Home page
TitoloCitata daAnno
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
1312011
Contention-free MAC protocols for wireless sensor networks
C Busch, M Magdon-Ismail, F Sivrikaya, B Yener
International Symposium on Distributed Computing, 245-259, 2004
962004
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
702003
A combinatorial treatment of balancing networks
C Busch, M Mavronicolas
Journal of the ACM (JACM) 43 (5), 794-839, 1996
571996
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
452006
Atomic routing games on maximum congestion
C Busch, M Magdon-Ismail
Theoretical Computer Science 410 (36), 3337-3347, 2009
432009
Cake-cutting is not a piece of cake
M Magdon-Ismail, C Busch, MS Krishnamoorthy
Annual Symposium on Theoretical Aspects of Computer Science, 596-607, 2003
402003
Hard-potato routing
C Busch, M Herlihy, R Wattenhofer
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
382000
Oblivious routing on geometric networks
C Busch, M Magdon-Ismail, J Xi
Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005
362005
Optimal oblivious path selection on the mesh
C Busch, M Magdon-Ismail, J Xi
IEEE Transactions on Computers 57 (5), 660-671, 2008
332008
Analysis of link reversal routing algorithms
C Busch, S Tirthapura
SIAM Journal on Computing 35 (2), 305-326, 2005
322005
Routing without flow control
C Busch, M Herlihy, R Wattenhofer
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001
322001
A deterministic algorithm for summarizing asynchronous streams over a sliding window
C Busch, S Tirthapura
Annual Symposium on Theoretical Aspects of Computer Science, 465-476, 2007
312007
Contention in counting networks
C Busch, N Hardavellas, M Mavronicolas
Proceedings of the thirteenth annual ACM symposium on Principles of …, 1994
311994
Distributed transactional memory for general networks
G Sharma, C Busch
Distributed computing 27 (5), 329-362, 2014
292014
Randomized greedy hot-potato routing
C Busch, M Herlihy, R Wattenhofer
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000
292000
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
252007
Mutual visibility with an optimal number of colors
G Sharma, C Busch, S Mukhopadhyay
International Symposium on Algorithms and Experiments for Wireless Sensor …, 2015
242015
Sketching asynchronous data streams over sliding windows
B Xu, S Tirthapura, C Busch
Distributed Computing 20 (5), 359-374, 2008
242008
Supporting increment and decrement operations in balancing networks
W Aiello, C Busch, M Herlihy, M Mavronicolas, N Shavit, D Touitou
Annual Symposium on Theoretical Aspects of Computer Science, 393-403, 1999
241999
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20