A method of constructing selection networks with O(log n) depth

S. Jimbo, A. Maruoka

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

A classifier with n inputs is a comparator network that classifies a set of n values into two classes with the same number of values in such a way that each value in one class is at least as large as all of those in the other. Based on the utilization of expanders, Pippenger constructed classifiers with n inputs whose size is asymptotic to 2n log2 n. In the same spirit, we obtain a relatively simple method of constructing classifiers of depth O(log n). Consequently, for an arbitrary constant C > 3/log2 3 = 1.8927 . . ., we construct classifiers of depth O(log n) and of size at most Cn log2 n + O(n).

Original languageEnglish
Pages (from-to)709-739
Number of pages31
JournalSIAM Journal on Computing
Volume25
Issue number4
DOIs
Publication statusPublished - Aug 1996
Externally publishedYes

Keywords

  • Classifier
  • Comparator network
  • Expander
  • Selection network

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'A method of constructing selection networks with O(log n) depth'. Together they form a unique fingerprint.

  • Cite this