Content deleted Content added
Undo disimprovements. Among other problems, changing "is it" to "it is" loses sight of the fact that this is posed as a question, not an assertion, and "In addition to these conventions" for how to set k to get the max, after setting up a choice of two different conventions that would use different values of k, is flat-out incorrect. |
m Open access bot: hdl, doi added to citation with #oabot. |
||
Line 127:
| publisher = Association for Computing Machinery
| title = Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6–8, 1985, Providence, Rhode Island, USA
| year = 1985
}}</ref>
<ref name=bfprt>{{cite journal
Line 210 ⟶ 211:
| title = Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 – September 3, 1993, Proceedings
| volume = 711
| year = 1993
| hdl-access = free
}}</ref>
<ref name=clrs>{{Introduction to Algorithms|edition=3|chapter=Chapter 9: Medians and order statistics|pages=213–227}}; "Section 14.1: Dynamic order statistics", pp. 339–345</ref>
Line 237 ⟶ 240:
| volume = 36
| year = 1989| s2cid = 10947879
| doi-access = free
}}</ref>
Line 311 ⟶ 315:
| s2cid = 3064709
| title = Expected time bounds for selection
| volume = 18| doi-access = free
<ref name=frederickson>{{cite journal
Line 322 ⟶ 327:
| title = An optimal algorithm for selection in a min-heap
| volume = 104
| year = 1993
}}</ref>
<ref name=frejoh>{{cite journal
Line 396 ⟶ 402:
| volume = 40
| year = 1993| s2cid = 17956460
| doi-access = free
}}</ref>
Line 481 ⟶ 488:
| volume = 26
| year = 1983| s2cid = 3211474
| doi-access = free
}}</ref>
| |||