Change search
ReferencesLink to record
Permanent link

Direct link
Average cost to produce partial orders
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
1994 (English)In: Algorithms and Computation: 5th International Symposium, ISAAC '94 Beijing, P. R. China, August 25-27, 1994 Proceedings / [ed] Ding-Zhu Du, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 1994, 155-163 p.Conference paper (Refereed)
Abstract [en]

We study the average-case complexity of partial order productions. Any comparison-based algorithm for solving problems in computer science can be viewed as the partial order production. The productions of some specific partial orders, such as sorting, searching, and selection, have received much attention in the past decades. As to arbitrary partial orders, very little is known about the inherent complexity of their productions. In particular, no non-trivial average-case lower bounds were known. By combining information-theoretic lower bounds with adversary-based arguments, we present some non-trivial average-case lower bounds for the productions of arbitrary partial orders. More precisely, we first demonstrate a counter-example to some intuition about lower bounds on partial order productions, and then present some simple lower bounds. By utilizing adversaries which were originally constructed for deriving worst-case lower bounds, we prove non-trivial average-case lower bounds for partial order productions. Our lower-bound techniques of mixing the information-theoretical and adversary-based approaches are interesting, as well as the lower-bound results obtained. Moreover, several conjectures concerning the production complexity of partial orders are answered. Motivating from the selection problem and from the design of efficient algorithms, we also investigate average-case cost for producing many isomorphic copies simultaneously of some partial order.

Place, publisher, year, edition, pages
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 1994. 155-163 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 834
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-34437DOI: 10.1007/3-540-58325-4_177Local ID: 8a2c44f0-a7f7-11dc-9534-000ea68e967bISBN: 978-3-540-58325-7OAI: oai:DiVA.org:ltu-34437DiVA: diva2:1007688
Conference
International Symposium on Algorithms and Computation : 25/08/1994 - 27/08/1994
Note
Godkänd; 1994; 20071211 (ysko)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Chen, Jingsen
By organisation
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 3 hits
ReferencesLink to record
Permanent link

Direct link