Fragile complexity of comparison-based algorithms

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Peyman Afshani
  • Rolf Fagerberg, Syddansk Universitet
  • ,
  • David Hammer, Syddansk Universitet, Johann Wolfgang Goethe Universitat Frankfurt am Main
  • ,
  • Riko Jacob, IT-Universitetet i Kobenhavn
  • ,
  • Irina Kostitsyna, Eindhoven University of Technology
  • ,
  • Ulrich Meyer, Johann Wolfgang Goethe Universitat Frankfurt am Main
  • ,
  • Manuel Penschuck, Johann Wolfgang Goethe Universitat Frankfurt am Main
  • ,
  • Nodari Sitchinava

We initiate a study of algorithms with a focus on the computational complexity of individual elements, and introduce the fragile complexity of comparison-based algorithms as the maximal number of comparisons any individual element takes part in. We give a number of upper and lower bounds on the fragile complexity for fundamental problems, including Minimum, Selection, Sorting and Heap Construction. The results include both deterministic and randomized upper and lower bounds, and demonstrate a separation between the two settings for a number of problems. The depth of a comparator network is a straight-forward upper bound on the worst case fragile complexity of the corresponding fragile algorithm. We prove that fragile complexity is a different and strictly easier property than the depth of comparator networks, in the sense that for some problems a fragile complexity equal to the best network depth can be achieved with less total work and that with randomization, even a lower fragile complexity is possible.

Original languageEnglish
Title of host publication27th Annual European Symposium on Algorithms, ESA 2019
EditorsMichael A. Bender, Ola Svensson, Grzegorz Herman
Number of pages19
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Publication year2019
Article number2
ISBN (Electronic)9783959771245
DOIs
Publication statusPublished - 2019
Event27th Annual European Symposium on Algorithms, ESA 2019 - Munich/Garching, Germany
Duration: 9 Sep 201911 Sep 2019

Conference

Conference27th Annual European Symposium on Algorithms, ESA 2019
LandGermany
ByMunich/Garching
Periode09/09/201911/09/2019
SeriesLeibniz International Proceedings in Informatics, LIPIcs
Volume144
ISSN1868-8969

    Research areas

  • Algorithms, Comparison based algorithms, Lower bounds

See relations at Aarhus University Citationformats

ID: 172713870