Bous on selction netorks

Andrew Chi Chih Yao

Bous on selction netorks

Andrew Chi Chih Yao

Faculty of Electronic and Information Engineering

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

Abstract

We investigate the complexity of network selection by measuring it in terms of U(t,N), the minimum number of comparators needed, and T(t,N), the minimum delay time pOSSible, for networks selecting the smallestt elements from a set of N inputs. New bounds on U(t,N) and T(t,N) are presented. In particular, U(3,N) is determined to within a constant of 2, and asytotic formulae for U(t,N) and T(t,N) are given for fixed t.

Original language	English
Pages	110-116
Number of pages	7
State	Published - 2021
Event	15th Annual Symposium on Switching and Automata Theory, SWAT 1974 - New Orleans, United States Duration: 14 Oct 1974 → 16 Oct 1974

Conference

Conference	15th Annual Symposium on Switching and Automata Theory, SWAT 1974
Country/Territory	United States
City	New Orleans
Period	14/10/74 → 16/10/74

Cite this

@conference{090732774b064a779e37eb614e151203,

title = "Bous on selction netorks",

abstract = "We investigate the complexity of network selection by measuring it in terms of U(t,N), the minimum number of comparators needed, and T(t,N), the minimum delay time pOSSible, for networks selecting the smallestt elements from a set of N inputs. New bounds on U(t,N) and T(t,N) are presented. In particular, U(3,N) is determined to within a constant of 2, and asytotic formulae for U(t,N) and T(t,N) are given for fixed t.",

author = "Yao, \{Andrew Chi Chih\}",

year = "2021",

language = "英语",

pages = "110--116",

}

TY - CONF

T1 - Bous on selction netorks

AU - Yao, Andrew Chi Chih

PY - 2021

Y1 - 2021

N2 - We investigate the complexity of network selection by measuring it in terms of U(t,N), the minimum number of comparators needed, and T(t,N), the minimum delay time pOSSible, for networks selecting the smallestt elements from a set of N inputs. New bounds on U(t,N) and T(t,N) are presented. In particular, U(3,N) is determined to within a constant of 2, and asytotic formulae for U(t,N) and T(t,N) are given for fixed t.

AB - We investigate the complexity of network selection by measuring it in terms of U(t,N), the minimum number of comparators needed, and T(t,N), the minimum delay time pOSSible, for networks selecting the smallestt elements from a set of N inputs. New bounds on U(t,N) and T(t,N) are presented. In particular, U(3,N) is determined to within a constant of 2, and asytotic formulae for U(t,N) and T(t,N) are given for fixed t.

UR - https://www.scopus.com/pages/publications/85115213919

M3 - 论文

AN - SCOPUS:85115213919

SP - 110

EP - 116

T2 - 15th Annual Symposium on Switching and Automata Theory, SWAT 1974

Y2 - 14 October 1974 through 16 October 1974

ER -

Bous on selction netorks

Abstract

Conference

Other files and links

Fingerprint

Cite this