Quicksort, largest bucket, and min-wise hashing with limited independence

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Standard

Quicksort, largest bucket, and min-wise hashing with limited independence. / Knudsen, Mathias Bæk Tejs; Stöckel, Morten.

Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. ed. / Nikhil Bansal; Irene Finocchi. Springer, 2015. p. 828-839 (Lecture notes in computer science, Vol. 9294).

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Harvard

Knudsen, MBT & Stöckel, M 2015, Quicksort, largest bucket, and min-wise hashing with limited independence. in N Bansal & I Finocchi (eds), Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer, Lecture notes in computer science, vol. 9294, pp. 828-839, Annual European Symposium 2015, Patras, Greece, 14/09/2015. https://doi.org/10.1007/978-3-662-48350-3_69

APA

Knudsen, M. B. T., & Stöckel, M. (2015). Quicksort, largest bucket, and min-wise hashing with limited independence. In N. Bansal, & I. Finocchi (Eds.), Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings (pp. 828-839). Springer. Lecture notes in computer science Vol. 9294 https://doi.org/10.1007/978-3-662-48350-3_69

Vancouver

Knudsen MBT, Stöckel M. Quicksort, largest bucket, and min-wise hashing with limited independence. In Bansal N, Finocchi I, editors, Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer. 2015. p. 828-839. (Lecture notes in computer science, Vol. 9294). https://doi.org/10.1007/978-3-662-48350-3_69

Author

Knudsen, Mathias Bæk Tejs ; Stöckel, Morten. / Quicksort, largest bucket, and min-wise hashing with limited independence. Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. editor / Nikhil Bansal ; Irene Finocchi. Springer, 2015. pp. 828-839 (Lecture notes in computer science, Vol. 9294).

Bibtex

@inproceedings{3de20532118f48fc83ad85533ac43191,
title = "Quicksort, largest bucket, and min-wise hashing with limited independence",
author = "Knudsen, {Mathias B{\ae}k Tejs} and Morten St{\"o}ckel",
year = "2015",
doi = "10.1007/978-3-662-48350-3_69",
language = "English",
isbn = "978-3-662-48349-7",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "828--839",
editor = "Nikhil Bansal and Irene Finocchi",
booktitle = "Algorithms - ESA 2015",
address = "Switzerland",
note = "null ; Conference date: 14-09-2015 Through 16-09-2015",

}

RIS

TY - GEN

T1 - Quicksort, largest bucket, and min-wise hashing with limited independence

AU - Knudsen, Mathias Bæk Tejs

AU - Stöckel, Morten

N1 - Conference code: 23

PY - 2015

Y1 - 2015

U2 - 10.1007/978-3-662-48350-3_69

DO - 10.1007/978-3-662-48350-3_69

M3 - Article in proceedings

SN - 978-3-662-48349-7

T3 - Lecture notes in computer science

SP - 828

EP - 839

BT - Algorithms - ESA 2015

A2 - Bansal, Nikhil

A2 - Finocchi, Irene

PB - Springer

Y2 - 14 September 2015 through 16 September 2015

ER -

ID: 160799327