by Lau Chu Man. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 76-83). / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Basic Notions --- p.13 / Chapter 3 --- Fast Knockout --- p.19 / Chapter 3.1 --- The Algorithm of Fast Knockout --- p.20 / Chapter 3.2 --- Complexity of the Fast Knockout Algorithm --- p.29 / Chapter 3.3 --- Summary --- p.35 / Chapter 4 --- k-Sortout --- p.36 / Chapter 4.1 --- A Brief Review of k-Sorting --- p.37 / Chapter 4.2 --- The Algorithm of k-Sortout --- p.47 / Chapter 4.3 --- Complexity of the k- Sortout Algorithm --- p.53 / Chapter 4.4 --- Summary --- p.58 / Chapter 5 --- General Sortout --- p.59 / Chapter 5.1 --- The General Algorithm of Sortout --- p.59 / Chapter 5.2 --- Complexity of Concentrators by the General Algorithm --- p.64 / Chapter 5.3 --- Summary --- p.69 / Chapter 6 --- Concluding Remarks --- p.70 / Chapter 6.1 --- Summary of Results --- p.70 / Chapter 6.2 --- Directions for Further Research --- p.73 / Bibliography --- p.76
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_320654 |
| Date | January 1995 |
| Contributors | Lau, Chu Man., Chinese University of Hong Kong Graduate School. Division of Information Engineering. |
| Publisher | Chinese University of Hong Kong |
| Source Sets | The Chinese University of Hong Kong |
| Language | English |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, ix, 83 leaves : ill. ; 30 cm. |
| Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0023 seconds