Randomized algorithms for finding a majority element

Paweł Gawrychowski, Jukka Suomela, Przemyslaw Uznanski

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

23 Downloads (Pure)
Original languageEnglish
Title of host publication15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)
PublisherSchloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Pages1-14
Number of pages14
ISBN (Electronic)978-3-95977-011-8
DOIs
Publication statusPublished - 2016
MoE publication typeA4 Article in a conference publication
EventScandinavian Symposium and Workshops on Algorithm Theory - Reykjavik, Iceland
Duration: 22 Jun 201624 Jun 2016
Conference number: 15
http://www.ru.is/~mmh/swat16/

Publication series

NameLeibniz International Proceedings in Informatics
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH
ISSN (Print)1868-8969

Conference

ConferenceScandinavian Symposium and Workshops on Algorithm Theory
Abbreviated titleSWAT
CountryIceland
CityReykjavik
Period22/06/201624/06/2016
Internet address

Keywords

  • majority
  • randomized algorithms
  • lower bounds

Cite this

Gawrychowski, P., Suomela, J., & Uznanski, P. (2016). Randomized algorithms for finding a majority element. In 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016) (pp. 1-14). [9] (Leibniz International Proceedings in Informatics). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.SWAT.2016.9