@phdthesis{sedgewick1975quicksort,
  author = {Sedgewick, Robert},
  editor = {Report, Stanford Computer Science},
  interhash = {be68511cc820a4cd44e6ea468d87ac29},
  intrahash = {a1d537575ec9603cb9ca4d1bf2d59efb},
  month = may,
  school = {Stanford University},
  title = {Quicksort},
  year = 1975
}

@article{bentley1997algorithmsfor,
  author = {Bentley, Jon and Sedgewick, Robert},
  interhash = {028c510bc641375ca7e265671ce6193f},
  intrahash = {1b56c8c856ab7fddb7cccaa8554777dd},
  journal = {In Proc. 8th annual ACM-SIAM symposium on Discrete algorithms, },
  pages = {360-369 },
  title = {Fast algorithmsfor sorting and searching strings},
  year = 1997
}

@misc{sedgewick1977analysis,
  abstract = {Copyright of Acta Informatica is the property of Springer Science & Business Media B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)},
  author = {Sedgewick, Robert},
  interhash = {7fa2e2b14721ef7d5a8ff10d591bb5c7},
  intrahash = {5477ae882d6022e7fa935e143c381195},
  journal = {Acta Informatica},
  month = {12},
  number = 4,
  title = {The analysis of Quicksort programs.},
  uniqueid = {73361029|edb},
  volume = 7,
  year = 1977
}

@inproceedings{Sedgewick96,
  author = {Sedgewick, Robert},
  booktitle = {ESA},
  editor = {Díaz, Josep and Serna, Maria J.},
  ee = {http://dx.doi.org/10.1007/3-540-61680-2_42},
  interhash = {0594c31c1838ff65f77a0dca32ca92b6},
  intrahash = {a0f574d6dfc03e06162c839c8d46eb9f},
  isbn = {3-540-61680-2},
  pages = {1-11},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Analysis of Shellsort and Related Algorithms.},
  url = {http://dblp.uni-trier.de/db/conf/esa/esa96.html#Sedgewick96},
  volume = 1136,
  year = 1996
}

@article{schaffer1993analysis,
  author = {Schaffer, Russel and Sedgewick, Robert},
  interhash = {40b92ad6147010e002ad4bdf6eaf0e7b},
  intrahash = {2bd2387d2b6ef2317fdbfff15b27b952},
  journal = {Journal of Algorithms},
  month = jul,
  number = 1,
  pages = {76-100},
  publisher = {Academic Press},
  title = {The analysis of heapsort},
  volume = 15,
  year = 1993
}

@article{journals/cacm/Sedgewick78,
  author = {Sedgewick, Robert},
  ee = {http://doi.acm.org/10.1145/359619.359631},
  interhash = {9a4a22f5ef011caa82c52462824cf636},
  intrahash = {6bb82a1159e0686feee71b28976c7f12},
  journal = {Commun. ACM},
  note = {Corrigendum: CACM 22(6): 368 (1979)},
  number = 10,
  pages = {847-857},
  title = {Implementing Quicksort Programs.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#Sedgewick78},
  volume = 21,
  year = 1978
}

@article{Schaffer:1993:AH:159277.159281,
  acmid = {159281},
  address = {Duluth, MN, USA},
  author = {Schaffer, Russel and Sedgewick, Robert},
  doi = {10.1006/jagm.1993.1031},
  interhash = {40b92ad6147010e002ad4bdf6eaf0e7b},
  intrahash = {124caf5581da878730d8b76a362eb964},
  issn = {0196-6774},
  issue_date = {July 1993},
  journal = {J. Algorithms},
  month = jul,
  number = 1,
  numpages = {25},
  pages = {76--100},
  publisher = {Academic Press, Inc.},
  title = {The analysis of heapsort},
  url = {http://dx.doi.org/10.1006/jagm.1993.1031},
  volume = 15,
  year = 1993
}

@article{sedgewick1978implementing,
  abstract = {This paper is a practical study of how to implement the Quicksort sorting algorithm and its best variants on real computers, including how to apply various code optimization techniques. A detailed implementation combining the most effective improvements to Quicksort is given, along with a discussion of how to implement it in assembly language. Analytic results describing the performance of the programs are summarized. A variety of special situations are considered from a practical standpoint to illustrate Quicksort's wide applicability as an internal sorting method which requires negligible extra storage.},
  acmid = {359631},
  address = {New York, NY, USA},
  author = {Sedgewick, Robert},
  doi = {10.1145/359619.359631},
  interhash = {9a4a22f5ef011caa82c52462824cf636},
  intrahash = {afad926399892172416b18c7a996f647},
  issn = {0001-0782},
  issue_date = {Oct. 1978},
  journal = {Commun. ACM},
  month = oct,
  number = 10,
  numpages = {11},
  pages = {847--857},
  publisher = {ACM},
  title = {Implementing Quicksort programs},
  url = {http://doi.acm.org/10.1145/359619.359631},
  volume = 21,
  year = 1978
}

@article{sedgewick1978implementing,
  abstract = {This paper is a practical study of how to implement the Quicksort sorting algorithm and its best variants on real computers, including how to apply various code optimization techniques. A detailed implementation combining the most effective improvements to Quicksort is given, along with a discussion of how to implement it in assembly language. Analytic results describing the performance of the programs are summarized. A variety of special situations are considered from a practical standpoint to illustrate Quicksort's wide applicability as an internal sorting method which requires negligible extra storage.},
  author = {Sedgewick, Robert},
  interhash = {9a4a22f5ef011caa82c52462824cf636},
  intrahash = {a7a341c1a2f1f3af42a605010a204cfa},
  journal = {Communications of the ACM},
  month = oct,
  number = 10,
  pages = {847-857},
  publisher = {ACM},
  title = {Implementing quicksort programs},
  url = {http://dl.acm.org/citation.cfm?id=359631},
  volume = 21,
  year = 1978
}