Konstantin Busch

View Scopus Profile

Konstantin Busch

Professor

Calculated based on number of publications stored in Pure and citations from Scopus
1994 …2023

Research activity per year

Search results

  • 1994

    A combinatorial treatment of balancing networks

    Costas, B. & Mavronicolas, M., Aug 14 1994, Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994. Association for Computing Machinery, p. 206-215 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. Part F129432).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    6 Scopus citations
  • 1996

    A combinatorial treatment of balancing networks

    Busch, C. & Mavronicolas, M., Sep 1996, In: Journal of the ACM. 43, 5, p. 794-839 46 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    15 Scopus citations

  • Strength of counting networks

    Busch, C. & Mavronicolas, M., 1996, p. 311. 1 p.

    Research output: Contribution to conference › Paper › peer-review

    3 Scopus citations
  • 1997

    Impossibility results for weak threshold networks

    Busch, C. & Mavronicolas, M., Jul 28 1997, In: Information Processing Letters. 63, 2, p. 85-90 6 p.

    Research output: Contribution to journal › Article › peer-review

    3 Scopus citations
  • 1998

    Efficient counting network

    Busch, C. & Mavronicolas, M., 1998, Proceedings of the International Parallel Processing Symposium, IPPS. IEEE Comp Soc, p. 380-384 5 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    9 Scopus citations
  • 1999

    Sorting and counting networks of small depth and arbitrary width

    Busch, C. & Herlihy, M., 1999, p. 64-73. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    Open Access
    2 Scopus citations

  • Supporting increment and decrement operations in balancing networks

    Aiello, W., Busch, C., Herlihy, M., Mavronicolas, M., Shavit, N. & Touitou, D., 1999, STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Meinel, C. & Tison, S. (eds.). Springer Verlag, p. 393-403 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1563).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    7 Scopus citations
  • 2000

    A combinatorial characterization of properties preserved by antitokens

    Busch, C., Demetriou, N., Herlihy, M. & Mavronicolas, M., 2000, Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings. Bode, A., Ludwig, T., Karl, W. & Wismüller, R. (eds.). Springer Verlag, p. 575-582 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1900).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • Hard-potato routing

    Busch, C., Herlihy, M. & Wattenhofer, R., 2000, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. p. 278-285 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    23 Scopus citations

  • Randomized greedy hot-potato routing

    Busch, C., Herlihy, M. & Wattenhofer, R., 2000, p. 458-466. 9 p.

    Research output: Contribution to conference › Paper › peer-review

    16 Scopus citations
  • 2001

    Routing without flow control

    Busch, C., Herlihy, M. & Wattenhofer, R., 2001, p. 11-20. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    13 Scopus citations
  • 2002

    Õ(congestion + dilation) hot-potato routing on leveled networks

    Busch, C., 2002, p. 20-30. 11 p.

    Research output: Contribution to conference › Paper › peer-review

    8 Scopus citations

  • Sorting and counting networks of arbitrary width and small depth

    Busch, C. & Herlihy, M., 2002, In: Theory of Computing Systems. 35, 2, p. 99-128 30 p.

    Research output: Contribution to journal › Article › peer-review

    3 Scopus citations

  • Threshold counters with increments and decrements

    Busch, C., Demetriou, N., Herlihy, M. & Mavronicolas, M., Jan 6 2002, In: Theoretical Computer Science. 270, 1-2, p. 811-826 16 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
  • 2003

    Analysis of link reversal routing algorithms for mobile ad hoc networks

    Busch, C., Surapaneni, S. & Tirthapura, S., 2003, p. 210-219. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    40 Scopus citations

  • Cake-cutting is not a piece of cake

    Magdon-Ismail, M., Busch, C. & Krishnamoorthy, M. S., 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Alt, H. & Habib, M. (eds.). Springer Verlag, p. 596-607 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2607).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter

    24 Scopus citations
  • 2004

    Contention-free MAC protocols for wireless sensor networks

    Busch, C., Magdon-Ismail, M., Sivrikaya, F. & Yener, B., 2004, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3274, p. 245-259 15 p.

    Research output: Contribution to journal › Article › peer-review

    34 Scopus citations

  • Direct routing: Algorithms and complexity

    Busch, C., Magdon-Ismail, M., Mavronicolas, M. & Spirakis, P., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Albers, S. & Radzik, T. (eds.). Springer Verlag, p. 134-145 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3221).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter

    Open Access
    4 Scopus citations

  • Near-optimal hot-potato routing on trees

    Busch, C., Magdon-Ismail, M., Mavronicolas, M. & Wattenhofer, R., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Danelutto, M., Vanneschi, M. & Laforenza, D. (eds.). Springer Verlag, p. 820-827 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3149).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter

    5 Scopus citations

  • Õ(Congestion + Dilation) hot-potato routing on leveled networks

    Busch, C., May 2004, In: Theory of Computing Systems. 37, 3, p. 371-396 26 p.

    Research output: Contribution to journal › Article › peer-review

    6 Scopus citations
  • 2005

    Efficient bufferless routing on leveled networks

    Busch, C., Kelkar, S. & Magdon-Ismail, M., 2005, In: Lecture Notes in Computer Science. 3648, p. 931-940 10 p.

    Research output: Contribution to journal › Conference article › peer-review

    Open Access
    2 Scopus citations

  • Oblivious routing on geometric networks

    Busch, C., Magdon-Ismail, M. & Xi, J., 2005, p. 316-324. 9 p.

    Research output: Contribution to conference › Paper › peer-review

    16 Scopus citations

  • Optimal oblivious path selection on the mesh

    Busch, C., Magdon-Ismail, M. & Xi, J., 2005, Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005. p. 82 1 p. 1419907. (Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    6 Scopus citations

  • The cost of concurrent, low-contention Read&Modify&Write

    Busch, C., Mavronicolas, M. & Spirakis, P., Mar 3 2005, In: Theoretical Computer Science. 333, 3, p. 373-400 28 p.

    Research output: Contribution to journal › Conference article › peer-review

    Open Access
    4 Scopus citations

  • Universal bufferless routing

    Busch, C., Magdon-Ismail, M. & Mavronicolas, M., 2005, In: Lecture Notes in Computer Science. 3351, p. 239-252 14 p.

    Research output: Contribution to journal › Conference article › peer-review

    3 Scopus citations
  • 2006

    Analysis of link reversal routing algorithms

    Busch, C. & Tirthapura, S., 2006, In: SIAM Journal on Computing. 35, 2, p. 305-326 22 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    17 Scopus citations

  • Atomic routing games on maximum congestion

    Busch, C. & Magdon-Ismail, M., 2006, Algorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings. Springer Verlag, p. 79-91 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4041 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    8 Scopus citations

  • Concurrent counting is harder than queuing

    Tirthapura, S. & Busch, C., 2006, 20th International Parallel and Distributed Processing Symposium, IPDPS 2006. IEEE Computer Society, 1639327. (20th International Parallel and Distributed Processing Symposium, IPDPS 2006; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • Direct routing: Algorithms and complexity

    Busch, C., Magdon-Ismail, M., Mavronicolas, M. & Spirakis, P., Jun 2006, In: Algorithmica (New York). 45, 1, p. 45-68 24 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    15 Scopus citations

  • Sketching asynchronous streams over a sliding window

    Tirthapura, S., Xu, B. & Busch, C., 2006, Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006. Association for Computing Machinery (ACM), p. 82-91 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    34 Scopus citations
  • 2007

    A deterministic algorithm for summarizing asynchronous streams over a sliding window

    Busch, C. & Tirthapura, S., 2007, STACS 2007 - 24th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Springer Verlag, p. 465-476 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4393 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    19 Scopus citations

  • Efficient bufferless packet switching on trees and leveled networks

    Busch, C., Magdon-Ismail, M. & Mavronicolas, M., Nov 2007, In: Journal of Parallel and Distributed Computing. 67, 11, p. 1168-1186 19 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    7 Scopus citations

  • Improved sparse covers for graphs excluding a fixed minor

    Busch, C., Lafortune, R. & Tirthapura, S., 2007, PODC'07: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing. p. 61-70 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    21 Scopus citations

  • Universal bufferless packet switching

    Busch, C., Magdon-Ismail, M. & Mavronicolas, M., 2007, In: SIAM Journal on Computing. 37, 4, p. 1139-1162 24 p.

    Research output: Contribution to journal › Article › peer-review

    4 Scopus citations
  • 2008

    Contention-free MAC protocols for asynchronous wireless sensor networks

    Busch, C., Magdon-Ismail, M., Sivrikaya, F. & Yener, B., Jun 2008, In: Distributed Computing. 21, 1, p. 23-42 20 p.

    Research output: Contribution to journal › Article › peer-review

    10 Scopus citations

  • Optimal oblivious path selection on the mesh

    Busch, C., Magdon-lsmail, M. & Xi, J., 2008, In: IEEE Transactions on Computers. 57, 5, p. 660-671 12 p.

    Research output: Contribution to journal › Article › peer-review

    13 Scopus citations

  • Quality of routing congestion games in wireless sensor networks

    Busch, C., Kannan, R. & Vasilakos, A. V., 2008.

    Research output: Contribution to conference › Paper › peer-review

    Open Access
    8 Scopus citations

  • Sketching asynchronous data streams over sliding windows

    Xu, B., Tirthapura, S. & Busch, C., Feb 2008, In: Distributed Computing. 20, 5, p. 359-374 16 p.

    Research output: Contribution to journal › Article › peer-review

    19 Scopus citations
  • 2009

    Atomic routing games on maximum congestion

    Busch, C. & Magdon-Ismail, M., Aug 31 2009, In: Theoretical Computer Science. 410, 36, p. 3337-3347 11 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    30 Scopus citations

  • Brief announcement: Universal data aggregation trees for sensor networks in low doubling metrics

    Srinivasagopalan, S., Busch, C. & Iyengar, S. S., 2009, Algorithmic Aspects of Wireless Sensor Networks - 5th International Workshop, ALGOSENSORS 2009, Revised Selected Papers. p. 151-152 2 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5804 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    1 Scopus citations

  • Online algorithms for maximizing quality of link transmissions over a jammed wireless channel

    Kannan, R., Wei, S., Busch, C. & Vasilakos, A., 2009, 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009. 4912840. (7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2009).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    3 Scopus citations
  • 2010

    A competitive analysis for balanced transactional memory workloads

    Sharma, G. & Busch, C., 2010, Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. p. 348-363 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6490 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    5 Scopus citations

  • An efficient counting network

    Busch, C. & Mavronicolas, M., Jul 17 2010, In: Theoretical Computer Science. 411, 34-36, p. 3001-3030 30 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access

  • Bottleneck congestion games with logarithmic price of anarchy

    Kannan, R. & Busch, C., 2010, Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings. M4D ed. p. 222-233 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6386 LNCS, no. M4D).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    8 Scopus citations

  • Concurrent counting is harder than queuing

    Busch, C. & Tirthapura, S., Oct 9 2010, In: Theoretical Computer Science. 411, 43, p. 3823-3833 11 p.

    Research output: Contribution to journal › Article › peer-review

    Open Access
    1 Scopus citations

  • Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010: Preface

    Kleinrock, L., Yang, Z., Tan, L., Zhuang, W., Pan, Y., Zukerman, M., Lu, C., Hiang, C. T., Rosberg, Z., Li, J., Ma, M., Yoong, C. T., Hanumanthappa, J., Malekian, R., Govil, J., Abdullah, L. N., Sun, H. M., Saravanan, V., Zafar, N. A., Nair, M. S., & 56 othersVoyles, R. M., Kang, D. J., Lee, S. H., Fathabadi, H., Reza, A. W., Samak, A., Kenny, R. F., Mahmoud, M., Algadi, N., Laurie, M., Mahmoud, S. S., Sun, J., John, R., Niccolo, C., Kumar, M. P., Chaiwanarom, P., Kumar, P. S., Marc, S., Jilani, T. A., Chowdhury, S., Ljubo, V., Guo, W., Mohanty, B. K., Ankur, A., Sandhu, P. S., Hu, W., Thatcher, S., Srinonchat, J., Tabrizi, M. N., Ahmed, H. M. S., Tobgay, S., Sree, P. K., Min-Allah, N., Alhadidi, B., Ahmed, T. O., Ménard, P. A., Nehra, N. K., Chang, C. Y., Hung, L. L., Fortino, G., Wang, C. L., Tseng, H. R., Orsag, F., Calafate, C. T., Fischione, C., Farago, A., Pujolle, G., Prokhorov, D., Busch, C., Aravind, A., Cuzzocrea, A., Bolumar, F. J. S., Liu, Y., Yang, S., Andrew, L. & Zhang, C., 2010, Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010. p. v-vi 5497304. (Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010; vol. 2).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Window-based greedy contention management for transactional memory

    Sharma, G., Estrade, B. & Busch, C., 2010, Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. p. 64-78 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6343 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    10 Scopus citations
  • 2011

    Oblivious buy-at-bulk in planar graphs

    Srinivasagopalan, S., Busch, C. & Iyengar, S. S., 2011, WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, Proceedings. p. 33-44 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6552 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    1 Scopus citations

  • On the performance of window-based contention managers for transactional memory

    Sharma, G. & Busch, C., 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2011. p. 559-568 10 p. 6008877. (IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    2 Scopus citations
  • 2012

    A competitive analysis for balanced transactional memory workloads

    Sharma, G. & Busch, C., Jun 2012, In: Algorithmica. 63, 1-2, p. 296-322 27 p.

    Research output: Contribution to journal › Article › peer-review

    14 Scopus citations