| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gokarna Sharma, Costas Busch |
A Competitive Analysis for Balanced Transactional Memory Workloads.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan |
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gokarna Sharma, Costas Busch |
On the Performance of Window-Based Contention Managers for Transactional Memory. |
IPDPS Workshops |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar |
Oblivious Buy-at-Bulk in Planar Graphs. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Srikanta Tirthapura |
Concurrent counting is harder than queuing. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Marios Mavronicolas |
An efficient counting network. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gokarna Sharma, Brett Estrade, Costas Busch |
Window-Based Greedy Contention Management for Transactional Memory |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gokarna Sharma, Costas Busch, Srikanta Tirthapura |
A Streaming Approximation Algorithm for Klee's Measure Problem |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rajgopal Kannan, Costas Busch, Athanasios V. Vasilakos |
Polynomial Bottleneck Congestion Games with Optimal Price of Anarchy |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar |
Oblivious Buy-at-Bulk in Planar Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar |
An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rajgopal Kannan, Costas Busch |
Bottleneck Routing Games with Low Price of Anarchy |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gokarna Sharma, Costas Busch |
A Competitive Analysis for Balanced Transactional Memory Workloads |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gokarna Sharma, Costas Busch |
A Competitive Analysis for Balanced Transactional Memory Workloads. |
OPODIS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gokarna Sharma, Brett Estrade, Costas Busch |
Window-Based Greedy Contention Management for Transactional Memory. |
DISC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajgopal Kannan, Costas Busch |
Bottleneck Congestion Games with Logarithmic Price of Anarchy. |
SAGT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail |
Atomic routing games on maximum congestion. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajgopal Kannan, Costas Busch |
The Impact of Exponential Utility Costs in Bottleneck Routing Games |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar |
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics. |
ALGOSENSORS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail, Jing Xi |
Optimal Oblivious Path Selection on the Mesh. |
IEEE Trans. Computers |
2008 |
DBLP DOI BibTeX RDF |
Routing protocols |
| 1 | Costas Busch, Rajgopal Kannan |
Bicretieria Optimization in Routing Games |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener |
Contention-free MAC protocols for asynchronous wireless sensor networks. |
Distributed Computing |
2008 |
DBLP DOI BibTeX RDF |
TDMA protocols, Wireless sensor networks, Self-stabilization, MAC protocols |
| 1 | Bojian Xu, Srikanta Tirthapura, Costas Busch |
Sketching asynchronous data streams over sliding windows. |
Distributed Computing |
2008 |
DBLP DOI BibTeX RDF |
Asynchronous streams, Data streams, Sliding window, Median, Sum, Distributed streams |
| 1 | Costas Busch |
Direct Routing Algorithms. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Rajgopal Kannan, Athanasios V. Vasilakos |
Quality of routing congestion games in wireless sensor networks. |
WICON |
2008 |
DBLP DOI BibTeX RDF |
Nash equilibrium, price of anarchy, congestion games, algorithmic game theory, price of stability |
| 1 | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas |
Efficient bufferless packet switching on trees and leveled networks. |
J. Parallel Distrib. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas |
Universal Bufferless Packet Switching. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Srikanta Tirthapura |
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Ryan LaFortune, Srikanta Tirthapura |
Improved sparse covers for graphs excluding a fixed minor. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
minor free graph, path separator, sparse cover, planar graph, compact routing |
| 1 | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis |
Direct Routing: Algorithms and Complexity. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Direct routing, Bufferless routing, Congestion, Dilation, Communication algorithms |
| 1 | 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 |
2006 |
DBLP BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail |
Atomic Routing Games on Maximum Congestion. |
AAIM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Srikanta Tirthapura, Costas Busch |
Concurrent counting is harder than queuing. |
IPDPS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Srikanta Tirthapura, Bojian Xu, Costas Busch |
Sketching asynchronous streams over a sliding window. |
PODC |
2006 |
DBLP DOI BibTeX RDF |
asynchronous streams, sketches of streams, union of streams, aggregates, sliding windows, data stream processing, distributed streams |
| 1 | Costas Busch, Marios Mavronicolas, Paul G. Spirakis |
The cost of concurrent, low-contention Read&Modify&Write. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Marios Mavronicolas, Paul G. Spirakis |
An Application of the Monotone Linearizability Lemma. |
Bulletin of the EATCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Costas Busch, Mukkai S. Krishnamoorthy, Malik Magdon-Ismail |
Hardness Results for Cake Cutting. |
Bulletin of the EATCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Costas Busch, Srikanta Tirthapura |
Analysis of Link Reversal Routing Algorithms. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Shailesh Kelkar, Malik Magdon-Ismail |
Efficient Bufferless Routing on Leveled Networks. |
Euro-Par |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail, Jing Xi |
Optimal Oblivious Path Selection on the Mesh. |
IPDPS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail, Jing Xi |
Oblivious routing on geometric networks. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
disc graphs, congestion, oblivious routing, stretch, geometric networks |
| 1 | Costas Busch |
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer |
Near-Optimal Hot-Potato Routing on Trees. |
Euro-Par |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis |
Direct Routing: Algorithms and Complexity. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener |
Contention-Free MAC Protocols for Wireless Sensor Networks. |
DISC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas |
Universal Bufferless Routing. |
WAOA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy |
Cake-Cutting Is Not a Piece of Cake. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Marios Mavronicolas, Paul G. Spirakis |
The Cost of Concurrent, Low-Contention Read-Modify-Write. |
SIROCCO |
2003 |
DBLP BibTeX RDF |
|
| 1 | Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura |
Analysis of link reversal routing algorithms for mobile ad hoc networks. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
gafni-berstekas, link reversal routing, ad hoc networks |
| 1 | Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas |
Threshold counters with increments and decrements. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Maurice Herlihy |
Sorting and Counting Networks of Arbitrary Width and Small Depth. |
Theory Comput. Syst. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch |
Õ(congestion + dilation) hot-potato routing on leveled networks. |
SPAA |
2002 |
DBLP DOI BibTeX RDF |
leveled networks, congestion, dilation, hot-potato routing |
| 1 | Costas Busch, Maurice Herlihy, Roger Wattenhofer |
Routing without flow control. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas |
A Combinatorial Characterization of Properties Preserved by Antitokens. |
Bulletin of the EATCS |
2000 |
DBLP BibTeX RDF |
|
| 1 | Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas |
A Combinatorial Characterization of Properties Preserved by Antitokens. |
Euro-Par |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Maurice Herlihy, Roger Wattenhofer |
Randomized greedy hot-potato routing. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Maurice Herlihy, Roger Wattenhofer |
Hard-Potato routing. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou |
Supporting Increment and Decrement Operations in Balancing Networks. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas |
Threshold Counters with Increments and Decrements. |
SIROCCO |
1999 |
DBLP BibTeX RDF |
|
| 1 | Costas Busch, Maurice Herlihy |
Sorting and Counting Networks of Small Depth and Arbitrary Width. |
SPAA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Marios Mavronicolas |
An Efficient Counting Network. (PDF / PS) |
IPPS/SPDP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Maurice Herlihy |
A Survey on Counting Networks. |
WDAS |
1998 |
DBLP BibTeX RDF |
|
| 1 | Costas Busch, Marios Mavronicolas |
Impossibility Results for Weak Threshold Networks. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Marios Mavronicolas |
A Combinatorial Treatment of Balancing Networks. |
J. ACM |
1996 |
DBLP DOI BibTeX RDF |
balancing networks, block-input networks, block-output networks, combinatorial characterization, incidence matrices, smoothing networks, transfer parameters, counting networks, impossibility results |
| 1 | Costas Busch, Marios Mavronicolas |
The Strength of Counting Networks (Abstract). |
PODC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Marios Mavronicolas |
A Logarithmic Depth Counting Network (Abstract). |
PODC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Marios Mavronicolas |
A Combinatorial Treatment of Balancing Networks. |
PODC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas Busch, Nikos Hardavellas, Marios Mavronicolas |
Contention in Counting Networks. |
PODC |
1994 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")