Costas Busch

	2012
71		Gokarna Sharma, Costas Busch: A Competitive Analysis for Balanced Transactional Memory Workloads. Algorithmica 63(1-2): 296-322 (2012)
70		Srinivasagopalan Srivathsan, Costas Busch, S. S. Iyengar: An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs. IEEE Trans. Computers 61(5): 700-712 (2012)
	2011
69		Gokarna Sharma, Costas Busch: On the Performance of Window-Based Contention Managers for Transactional Memory. IPDPS Workshops 2011: 559-568
68		Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar: Oblivious Buy-at-Bulk in Planar Graphs. WALCOM 2011: 33-44
67		Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan: Split and Join: Strong Partitions and Universal Steiner Trees for Graphs CoRR abs/1111.4766: (2011)
	2010
66		Gokarna Sharma, Brett Estrade, Costas Busch: Window-Based Greedy Contention Management for Transactional Memory. DISC 2010: 64-78
65		Gokarna Sharma, Costas Busch: A Competitive Analysis for Balanced Transactional Memory Workloads. OPODIS 2010: 348-363
64		Rajgopal Kannan, Costas Busch: Bottleneck Congestion Games with Logarithmic Price of Anarchy. SAGT 2010: 222-233
63		Gokarna Sharma, Brett Estrade, Costas Busch: Window-Based Greedy Contention Management for Transactional Memory CoRR abs/1002.4182: (2010)
62		Rajgopal Kannan, Costas Busch: Bottleneck Routing Games with Low Price of Anarchy CoRR abs/1003.4307: (2010)
61		Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar: An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems CoRR abs/1004.0351: (2010)
60		Gokarna Sharma, Costas Busch, Srikanta Tirthapura: A Streaming Approximation Algorithm for Klee's Measure Problem CoRR abs/1004.1569: (2010)
59		Gokarna Sharma, Costas Busch: A Competitive Analysis for Balanced Transactional Memory Workloads CoRR abs/1009.0056: (2010)
58		Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar: Oblivious Buy-at-Bulk in Planar Graphs CoRR abs/1010.0401: (2010)
57		Rajgopal Kannan, Costas Busch, Athanasios V. Vasilakos: Polynomial Bottleneck Congestion Games with Optimal Price of Anarchy CoRR abs/1010.4812: (2010)
56		Costas Busch, Marios Mavronicolas: An efficient counting network. Theor. Comput. Sci. 411(34-36): 3001-3030 (2010)
55		Costas Busch, Srikanta Tirthapura: Concurrent counting is harder than queuing. Theor. Comput. Sci. 411(43): 3823-3833 (2010)
	2009
54		Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar: Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics. ALGOSENSORS 2009: 151-152
53		Rajgopal Kannan, Shuangqing Wei, Costas Busch, Athanasios V. Vasilakos: Online Algorithms for Maximizing Quality of Link Transmissions over a Jammed Wireless Channel. PerCom Workshops 2009: 1-6
52		Rajgopal Kannan, Costas Busch: The Impact of Exponential Utility Costs in Bottleneck Routing Games CoRR abs/0911.4150: (2009)
51		Costas Busch, Malik Magdon-Ismail: Atomic routing games on maximum congestion. Theor. Comput. Sci. 410(36): 3337-3347 (2009)
	2008
50		Costas Busch, Rajgopal Kannan, Athanasios V. Vasilakos: Quality of routing congestion games in wireless sensor networks. WICON 2008: 71
49		Costas Busch: Direct Routing Algorithms. Encyclopedia of Algorithms 2008
48		Costas Busch, Rajgopal Kannan: Bicretieria Optimization in Routing Games CoRR abs/0801.4851: (2008)
47		Bojian Xu, Srikanta Tirthapura, Costas Busch: Sketching asynchronous data streams over sliding windows. Distributed Computing 20(5): 359-374 (2008)
46		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)
45		Costas Busch, Malik Magdon-Ismail, Jing Xi: Optimal Oblivious Path Selection on the Mesh. IEEE Trans. Computers 57(5): 660-671 (2008)
	2007
44		Costas Busch, Ryan LaFortune, Srikanta Tirthapura: Improved sparse covers for graphs excluding a fixed minor. PODC 2007: 61-70
43		Costas Busch, Srikanta Tirthapura: A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window. STACS 2007: 465-476
42		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)
41		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Universal Bufferless Packet Switching. SIAM J. Comput. 37(4): 1139-1162 (2007)
	2006
40		Costas Busch, Malik Magdon-Ismail: Atomic Routing Games on Maximum Congestion. AAIM 2006: 79-91
39		Srikanta Tirthapura, Costas Busch: Concurrent counting is harder than queuing. IPDPS 2006
38		Srikanta Tirthapura, Bojian Xu, Costas Busch: Sketching asynchronous streams over a sliding window. PODC 2006: 82-91
37		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis: Direct Routing: Algorithms and Complexity. Algorithmica 45(1): 45-68 (2006)
36		James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer: Eight Open Problems in Distributed Computing. Bulletin of the EATCS 90: 109-126 (2006)
	2005
35		Costas Busch, Shailesh Kelkar, Malik Magdon-Ismail: Efficient Bufferless Routing on Leveled Networks. Euro-Par 2005: 931-940
34		Costas Busch, Malik Magdon-Ismail, Jing Xi: Optimal Oblivious Path Selection on the Mesh. IPDPS 2005
33		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		Costas Busch, Srikanta Tirthapura: Analysis of Link Reversal Routing Algorithms. SIAM J. Comput. 35(2): 305-326 (2005)
29		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		Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener: Contention-Free MAC Protocols for Wireless Sensor Networks. DISC 2004: 245-259
27		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis: Direct Routing: Algorithms and Complexity. ESA 2004: 134-145
26		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer: Near-Optimal Hot-Potato Routing on Trees. Euro-Par 2004: 820-827
25		Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas: Universal Bufferless Routing. WAOA 2004: 239-252
24		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		Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura: Analysis of link reversal routing algorithms for mobile ad hoc networks. SPAA 2003: 210-219
21		Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy: Cake-Cutting Is Not a Piece of Cake. STACS 2003: 596-607
	2002
20		Costas Busch: Õ(congestion + dilation) hot-potato routing on leveled networks. SPAA 2002: 20-29
19		Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: Threshold counters with increments and decrements. Theor. Comput. Sci. 270(1-2): 811-826 (2002)
18		Costas Busch, Maurice Herlihy: Sorting and Counting Networks of Arbitrary Width and Small Depth. Theory Comput. Syst. 35(2): 99-128 (2002)
	2001
17		Costas Busch, Maurice Herlihy, Roger Wattenhofer: Routing without flow control. SPAA 2001: 11-20
	2000
16		Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: A Combinatorial Characterization of Properties Preserved by Antitokens. Euro-Par 2000: 575-582
15		Costas Busch, Maurice Herlihy, Roger Wattenhofer: Randomized greedy hot-potato routing. SODA 2000: 458-466
14		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		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		Costas Busch, Maurice Herlihy: Sorting and Counting Networks of Small Depth and Arbitrary Width. SPAA 1999: 64-73
9		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		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		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		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	James Aspnes	[36]
3	Neophytos Demetriou	[11] [13] [16] [19]
4	Shlomi Dolev	[36]
5	Chinmoy Dutta	[67]
6	Brett Estrade	[63] [66]
7	Panagiota Fatourou	[36]
8	Chryssis Georgiou	[36]
9	Nikolaos Hardavellas (Nikos Hardavellas)	[1]
10	Maurice Herlihy	[7] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19]
11	S. Sitharama Iyengar (S. S. Iyengar)	[54] [58] [61] [68] [70]
12	Rajgopal Kannan	[48] [50] [52] [53] [57] [62] [64]
13	Shailesh Kelkar	[35]
14	Mukkai S. Krishnamoorthy	[21] [31]
15	Ryan LaFortune	[44]
16	Malik Magdon-Ismail	[21] [25] [26] [27] [28] [31] [33] [34] [35] [37] [40] [41] [42] [45] [46] [51]
17	Marios Mavronicolas	[1] [2] [3] [4] [5] [6] [8] [9] [11] [12] [13] [16] [19] [23] [25] [26] [27] [29] [32] [37] [41] [42] [56]
18	Jaikumar Radhakrishnan	[67]
19	Rajmohan Rajaraman	[67]
20	Gokarna Sharma	[59] [60] [63] [65] [66] [69] [71]
21	Nir Shavit	[9] [12]
22	Alexander A. Shvartsman	[36]
23	Fikret Sivrikaya	[28] [46]
24	Paul G. Spirakis	[23] [27] [29] [32] [36] [37]
25	Srinivasagopalan Srivathsan	[54] [58] [61] [67] [68] [70]
26	Srikanth Surapaneni	[22]
27	Srikanta Tirthapura	[22] [30] [38] [39] [43] [44] [47] [55] [60]
28	Dan Touitou	[9] [12]
29	Athanasios V. Vasilakos (Thanos Vasilakos)	[50] [53] [57]
30	Roger Wattenhofer	[14] [15] [17] [26] [36]
31	Shuangqing Wei	[53]
32	Jing Xi	[33] [34] [45]
33	Bojian Xu	[38] [47]
34	Bülent Yener	[28] [46]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page