Costas Busch

2008
48	EE	Costas Busch: Direct Routing Algorithms. Encyclopedia of Algorithms 2008
47	EE	Costas Busch, Rajgopal Kannan: Bicretieria Optimization in Routing Games CoRR abs/0801.4851: (2008)
46	EE	Bojian Xu, Srikanta Tirthapura, Costas Busch: Sketching asynchronous data streams over sliding windows. Distributed Computing 20(5): 359-374 (2008)
45	EE	Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener: Contention-free MAC protocols for asynchronous wireless sensor networks. Distributed Computing 21(1): 23-42 (2008)
44	EE	Costas Busch, Malik Magdon-Ismail, Jing Xi: Optimal Oblivious Path Selection on the Mesh. IEEE Trans. Computers 57(5): 660-671 (2008)
2007
43	EE	Costas Busch, Ryan LaFortune, Srikanta Tirthapura: Improved sparse covers for graphs excluding a fixed minor. PODC 2007: 61-70
42	EE	Costas Busch, Srikanta Tirthapura: A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window. STACS 2007: 465-476
41	EE	Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Efficient bufferless packet switching on trees and leveled networks. J. Parallel Distrib. Comput. 67(11): 1168-1186 (2007)
40	EE	Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Universal Bufferless Packet Switching. SIAM J. Comput. 37(4): 1139-1162 (2007)
2006
39	EE	Costas Busch, Malik Magdon-Ismail: Atomic Routing Games on Maximum Congestion. AAIM 2006: 79-91
38	EE	Srikanta Tirthapura, Costas Busch: Concurrent counting is harder than queuing. IPDPS 2006
37	EE	Srikanta Tirthapura, Bojian Xu, Costas Busch: Sketching asynchronous streams over a sliding window. PODC 2006: 82-91
36	EE	Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis: Direct Routing: Algorithms and Complexity. Algorithmica 45(1): 45-68 (2006)
2005
35	EE	Costas Busch, Shailesh Kelkar, Malik Magdon-Ismail: Efficient Bufferless Routing on Leveled Networks. Euro-Par 2005: 931-940
34	EE	Costas Busch, Malik Magdon-Ismail, Jing Xi: Optimal Oblivious Path Selection on the Mesh. IPDPS 2005
33	EE	Costas Busch, Malik Magdon-Ismail, Jing Xi: Oblivious routing on geometric networks. SPAA 2005: 316-324
32		Costas Busch, Marios Mavronicolas, Paul G. Spirakis: An Application of the Monotone Linearizability Lemma. Bulletin of the EATCS 85: 70-80 (2005)
31		Costas Busch, Mukkai S. Krishnamoorthy, Malik Magdon-Ismail: Hardness Results for Cake Cutting. Bulletin of the EATCS 86: 85-106 (2005)
30	EE	Costas Busch, Srikanta Tirthapura: Analysis of Link Reversal Routing Algorithms. SIAM J. Comput. 35(2): 305-326 (2005)
29	EE	Costas Busch, Marios Mavronicolas, Paul G. Spirakis: The cost of concurrent, low-contention Read&Modify&Write. Theor. Comput. Sci. 333(3): 373-400 (2005)
2004
28	EE	Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener: Contention-Free MAC Protocols for Wireless Sensor Networks. DISC 2004: 245-259
27	EE	Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis: Direct Routing: Algorithms and Complexity. ESA 2004: 134-145
26	EE	Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer: Near-Optimal Hot-Potato Routing on Trees. Euro-Par 2004: 820-827
25	EE	Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Universal Bufferless Routing. WAOA 2004: 239-252
24	EE	Costas Busch: Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks. Theory Comput. Syst. 37(3): 371-396 (2004)
2003
23		Costas Busch, Marios Mavronicolas, Paul G. Spirakis: The Cost of Concurrent, Low-Contention Read-Modify-Write. SIROCCO 2003: 57-72
22	EE	Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura: Analysis of link reversal routing algorithms for mobile ad hoc networks. SPAA 2003: 210-219
21	EE	Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy: Cake-Cutting Is Not a Piece of Cake. STACS 2003: 596-607
2002
20	EE	Costas Busch: Õ(congestion + dilation) hot-potato routing on leveled networks. SPAA 2002: 20-29
19	EE	Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: Threshold counters with increments and decrements. Theor. Comput. Sci. 270(1-2): 811-826 (2002)
18	EE	Costas Busch, Maurice Herlihy: Sorting and Counting Networks of Arbitrary Width and Small Depth. Theory Comput. Syst. 35(2): 99-128 (2002)
2001
17	EE	Costas Busch, Maurice Herlihy, Roger Wattenhofer: Routing without flow control. SPAA 2001: 11-20
2000
16	EE	Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: A Combinatorial Characterization of Properties Preserved by Antitokens. Euro-Par 2000: 575-582
15	EE	Costas Busch, Maurice Herlihy, Roger Wattenhofer: Randomized greedy hot-potato routing. SODA 2000: 458-466
14	EE	Costas Busch, Maurice Herlihy, Roger Wattenhofer: Hard-Potato routing. STOC 2000: 278-285
13		Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: A Combinatorial Characterization of Properties Preserved by Antitokens. Bulletin of the EATCS 71: 114-132 (2000)
12	EE	William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou: Supporting Increment and Decrement Operations in Balancing Networks. Chicago J. Theor. Comput. Sci. 2000: (2000)
1999
11		Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: Threshold Counters with Increments and Decrements. SIROCCO 1999: 47-61
10	EE	Costas Busch, Maurice Herlihy: Sorting and Counting Networks of Small Depth and Arbitrary Width. SPAA 1999: 64-73
9	EE	William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou: Supporting Increment and Decrement Operations in Balancing Networks. STACS 1999: 393-403
1998
8	EE	Costas Busch, Marios Mavronicolas: An Efficient Counting Network. IPPS/SPDP 1998: 380-384
7		Costas Busch, Maurice Herlihy: A Survey on Counting Networks. WDAS 1998: 13-20
1997
6	EE	Costas Busch, Marios Mavronicolas: Impossibility Results for Weak Threshold Networks. Inf. Process. Lett. 63(2): 85-90 (1997)
1996
5		Costas Busch, Marios Mavronicolas: The Strength of Counting Networks (Abstract). PODC 1996: 311
4	EE	Costas Busch, Marios Mavronicolas: A Combinatorial Treatment of Balancing Networks. J. ACM 43(5): 794-839 (1996)
1995
3		Costas Busch, Marios Mavronicolas: A Logarithmic Depth Counting Network (Abstract). PODC 1995: 274
1994
2		Costas Busch, Marios Mavronicolas: A Combinatorial Treatment of Balancing Networks. PODC 1994: 206-215
1		Costas Busch, Nikos Hardavellas, Marios Mavronicolas: Contention in Counting Networks. PODC 1994: 404

Coauthor Index

1	William Aiello	[9] [12]
2	Neophytos Demetriou	[11] [13] [16] [19]
3	Nikolaos Hardavellas (Nikos Hardavellas)	[1]
4	Maurice Herlihy	[7] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19]
5	Rajgopal Kannan	[47]
6	Shailesh Kelkar	[35]
7	Mukkai S. Krishnamoorthy	[21] [31]
8	Ryan LaFortune	[43]
9	Malik Magdon-Ismail	[21] [25] [26] [27] [28] [31] [33] [34] [35] [36] [39] [40] [41] [44] [45]
10	Marios Mavronicolas	[1] [2] [3] [4] [5] [6] [8] [9] [11] [12] [13] [16] [19] [23] [25] [26] [27] [29] [32] [36] [40] [41]
11	Nir Shavit	[9] [12]
12	Fikret Sivrikaya	[28] [45]
13	Paul G. Spirakis	[23] [27] [29] [32] [36]
14	Srikanth Surapaneni	[22]
15	Srikanta Tirthapura	[22] [30] [37] [38] [42] [43] [46]
16	Dan Touitou	[9] [12]
17	Roger Wattenhofer	[14] [15] [17] [26]
18	Jing Xi	[33] [34] [44]
19	Bojian Xu	[37] [46]
20	Bülent Yener	[28] [45]

Colors in the list of coauthors