Halvers and expanders (switching)

Miklós Ajtai, Janos Komlos, E. Szemerédi

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

11 Citations (Scopus)

Abstract

The authors investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. They improve the efficiency of halvers in terms of their depth. The novelty is the use of combinatorial circuits whose basic units are k-sorter switches.

Original languageEnglish
Title of host publicationProceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
PublisherIEEE Computer Society
Pages686-692
Number of pages7
ISBN (Electronic)0818629002
DOIs
Publication statusPublished - Jan 1 1992
Event33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States
Duration: Oct 24 1992Oct 27 1992

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume1992-October
ISSN (Print)0272-5428

Conference

Conference33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
CountryUnited States
CityPittsburgh
Period10/24/9210/27/92

Fingerprint

Combinatorial circuits
Parallel algorithms
Switches

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Ajtai, M., Komlos, J., & Szemerédi, E. (1992). Halvers and expanders (switching). In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 (pp. 686-692). [267782] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October). IEEE Computer Society. https://doi.org/10.1109/SFCS.1992.267782

Halvers and expanders (switching). / Ajtai, Miklós; Komlos, Janos; Szemerédi, E.

Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. p. 686-692 267782 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October).

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

Ajtai, M, Komlos, J & Szemerédi, E 1992, Halvers and expanders (switching). in Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992., 267782, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 1992-October, IEEE Computer Society, pp. 686-692, 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992, Pittsburgh, United States, 10/24/92. https://doi.org/10.1109/SFCS.1992.267782
Ajtai M, Komlos J, Szemerédi E. Halvers and expanders (switching). In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society. 1992. p. 686-692. 267782. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). https://doi.org/10.1109/SFCS.1992.267782
Ajtai, Miklós ; Komlos, Janos ; Szemerédi, E. / Halvers and expanders (switching). Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. pp. 686-692 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
@inproceedings{617a5ff966a94534a7259dce761a9ed7,
title = "Halvers and expanders (switching)",
abstract = "The authors investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. They improve the efficiency of halvers in terms of their depth. The novelty is the use of combinatorial circuits whose basic units are k-sorter switches.",
author = "Mikl{\'o}s Ajtai and Janos Komlos and E. Szemer{\'e}di",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/SFCS.1992.267782",
language = "English",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "686--692",
booktitle = "Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992",

}

TY - GEN

T1 - Halvers and expanders (switching)

AU - Ajtai, Miklós

AU - Komlos, Janos

AU - Szemerédi, E.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - The authors investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. They improve the efficiency of halvers in terms of their depth. The novelty is the use of combinatorial circuits whose basic units are k-sorter switches.

AB - The authors investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. They improve the efficiency of halvers in terms of their depth. The novelty is the use of combinatorial circuits whose basic units are k-sorter switches.

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

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

U2 - 10.1109/SFCS.1992.267782

DO - 10.1109/SFCS.1992.267782

M3 - Conference contribution

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 686

EP - 692

BT - Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992

PB - IEEE Computer Society

ER -