Konstantin Busch

View Scopus Profile

Konstantin Busch

Professor

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

Research activity per year

If you made any changes in Pure these will be visible here soon.

Search results

  • 2005

    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

    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
  • 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

    33 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

    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
  • 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

    39 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
  • 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
  • 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
  • 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
  • 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

    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
  • 1998

    Efficient counting network

    Busch, C. & Mavronicolas, M., 1998, Proceedings of the International Parallel Processing Symposium, IPPS. Anon (ed.). p. 380-384 5 p. (Proceedings of the International Parallel Processing Symposium, IPPS).

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

    9 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
  • 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
    14 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
  • 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