The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Costas Busch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  43. Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics. [Citation Graph (, )][DBLP]


  44. Online Algorithms for Maximizing Quality of Link Transmissions over a Jammed Wireless Channel. [Citation Graph (, )][DBLP]


  45. Window-Based Greedy Contention Management for Transactional Memory. [Citation Graph (, )][DBLP]


  46. Quality of routing congestion games in wireless sensor networks. [Citation Graph (, )][DBLP]


  47. Bicretieria Optimization in Routing Games [Citation Graph (, )][DBLP]


  48. The Impact of Exponential Utility Costs in Bottleneck Routing Games [Citation Graph (, )][DBLP]


  49. Window-Based Greedy Contention Management for Transactional Memory [Citation Graph (, )][DBLP]


  50. Bottleneck Routing Games with Low Price of Anarchy [Citation Graph (, )][DBLP]


  51. An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems [Citation Graph (, )][DBLP]


  52. A Streaming Approximation Algorithm for Klee's Measure Problem [Citation Graph (, )][DBLP]


  53. Sketching asynchronous data streams over sliding windows. [Citation Graph (, )][DBLP]


  54. Contention-free MAC protocols for asynchronous wireless sensor networks. [Citation Graph (, )][DBLP]


Search in 0.088secs, Finished in 0.090secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002