Derandomizing algorithms for routing and sorting on meshes

Michael Kaufmann, Jop F. Sibeyn, Torsten Suel

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deriving improved deterministic algorithms for a variety of routing and sorting problems. Our main results are an optimal algorithm for k-k routing on multi-dimensional meshes, a permutation routing algorithm with running time 2n+o(n) and queue size 5, and an optimal algorithm for 1-1 sorting.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
    Place of PublicationNew York, NY, United States
    PublisherPubl by ACM
    Pages669-679
    Number of pages11
    ISBN (Print)0898713293
    StatePublished - 1994
    EventProceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms - Arlington, VA, USA
    Duration: Jan 23 1994Jan 25 1994

    Other

    OtherProceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms
    CityArlington, VA, USA
    Period1/23/941/25/94

    Fingerprint

    Sorting
    Routing
    Mesh
    Optimal Algorithm
    Deterministic Algorithm
    Randomized Algorithms
    Routing Algorithm
    Queue
    Permutation
    Routing algorithms
    Demonstrate

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Discrete Mathematics and Combinatorics

    Cite this

    Kaufmann, M., Sibeyn, J. F., & Suel, T. (1994). Derandomizing algorithms for routing and sorting on meshes. In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms (pp. 669-679). New York, NY, United States: Publ by ACM.

    Derandomizing algorithms for routing and sorting on meshes. / Kaufmann, Michael; Sibeyn, Jop F.; Suel, Torsten.

    Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. New York, NY, United States : Publ by ACM, 1994. p. 669-679.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Kaufmann, M, Sibeyn, JF & Suel, T 1994, Derandomizing algorithms for routing and sorting on meshes. in Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Publ by ACM, New York, NY, United States, pp. 669-679, Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms, Arlington, VA, USA, 1/23/94.
    Kaufmann M, Sibeyn JF, Suel T. Derandomizing algorithms for routing and sorting on meshes. In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. New York, NY, United States: Publ by ACM. 1994. p. 669-679
    Kaufmann, Michael ; Sibeyn, Jop F. ; Suel, Torsten. / Derandomizing algorithms for routing and sorting on meshes. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. New York, NY, United States : Publ by ACM, 1994. pp. 669-679
    @inproceedings{29e4603c181046b482cbf52122aa6418,
    title = "Derandomizing algorithms for routing and sorting on meshes",
    abstract = "We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deriving improved deterministic algorithms for a variety of routing and sorting problems. Our main results are an optimal algorithm for k-k routing on multi-dimensional meshes, a permutation routing algorithm with running time 2n+o(n) and queue size 5, and an optimal algorithm for 1-1 sorting.",
    author = "Michael Kaufmann and Sibeyn, {Jop F.} and Torsten Suel",
    year = "1994",
    language = "English (US)",
    isbn = "0898713293",
    pages = "669--679",
    booktitle = "Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms",
    publisher = "Publ by ACM",

    }

    TY - GEN

    T1 - Derandomizing algorithms for routing and sorting on meshes

    AU - Kaufmann, Michael

    AU - Sibeyn, Jop F.

    AU - Suel, Torsten

    PY - 1994

    Y1 - 1994

    N2 - We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deriving improved deterministic algorithms for a variety of routing and sorting problems. Our main results are an optimal algorithm for k-k routing on multi-dimensional meshes, a permutation routing algorithm with running time 2n+o(n) and queue size 5, and an optimal algorithm for 1-1 sorting.

    AB - We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deriving improved deterministic algorithms for a variety of routing and sorting problems. Our main results are an optimal algorithm for k-k routing on multi-dimensional meshes, a permutation routing algorithm with running time 2n+o(n) and queue size 5, and an optimal algorithm for 1-1 sorting.

    UR - http://www.scopus.com/inward/record.url?scp=0028263307&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0028263307&partnerID=8YFLogxK

    M3 - Conference contribution

    SN - 0898713293

    SP - 669

    EP - 679

    BT - Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

    PB - Publ by ACM

    CY - New York, NY, United States

    ER -