Selection algorithm: Difference between revisions

Revision as of 00:29, 4 April 2023

Revision as of 09:48, 4 April 2023

Line 109:

| last2 = Pippenger | first2 = Nicholas | author2-link = Nick Pippenger

| doi = 10.1016/0166-218X(90)90128-Y

| issue = 1-21–2

| journal = [[Discrete Applied Mathematics]]

| mr = 1055590

Line 141:

| url = http://people.csail.mit.edu/rivest/pubs/BFPRT73.pdf

| volume = 7

| year = 1973| issue = 4 }}</ref>

<ref name=bks>{{cite journal

Line 154:

| title = Cascade heap: towards time-optimal extractions

| volume = 63

| year = 2019}}</ref>| s2cid = 253740380

}}</ref>

<ref name=brodal>{{cite conference

Line 179 ⟶ 180:

| pages = 301–304

| title = Remark on Algorithm 489

| volume = 2}}</ref>| s2cid = 13985011

}}</ref>

<ref name=chan>{{cite journal

Line 190 ⟶ 192:

| title = Comparison-based time-space lower bounds for selection

| volume = 6

| year = 2010| s2cid = 11742607 }}</ref>

<ref name=chr>{{cite conference

Line 231 ⟶ 233:

| title = Average case selection

| volume = 36

| year = 1989}}</ref>| s2cid = 10947879

}}</ref>

<ref name=devroye>{{cite journal

Line 253 ⟶ 256:

| url = https://luc.devroye.org/wcfind.pdf

| volume = 31

| year = 2001}}</ref>| s2cid = 674040

}}</ref>

<ref name=dieram>{{cite journal

Line 277 ⟶ 281:

| title = Selecting the median

| volume = 28

| year = 1999}}</ref>| s2cid = 2633282

}}</ref>

<ref name=dz01>{{cite journal

Line 338 ⟶ 343:

| pages = 88–96

| title = Finding the {{nowrap|<math>i</math>th}} largest of <math>n</math> for small <math>i,n</math>

| volume = 27| s2cid = 3133332 }}</ref>

<ref name=gootam>{{cite book|title=Algorithm Design and Applications|first1=Michael T.|last1=Goodrich|author1-link= Michael T. Goodrich|first2=Roberto|last2=Tamassia|author2-link=Roberto Tamassia|publisher=Wiley|year=2015|chapter=9.2: Selection|pages=270–275|isbn=978-1-118-33591-8}}</ref>

Line 350 ⟶ 355:

| title = On teaching median-finding algorithms

| volume = 35

| year = 1992}}</ref>| bibcode = 1992ITEdu..35..230G

}}</ref>

<ref name=hadsob>{{cite report|first1=Abdollah|last1=Hadian|first2=Milton|last2=Sobel|author2-link=Milton Sobel|hdl=11299/199105|series=School of Statistics Technical Reports|volume=121|publisher=University of Minnesota|title=Selecting the {{nowrap|<math>t</math>-th}} largest using binary errorless comparisons|date=May 1969}}</ref>

Line 363 ⟶ 369:

| title = Optimal parallel selection

| volume = 3

| year = 2007}}</ref>| s2cid = 9645870

}}</ref>

<ref name=hoare>{{cite journal

Line 385 ⟶ 392:

| title = Randomized algorithms and pseudorandom numbers

| volume = 40

| year = 1993}}</ref>| s2cid = 17956460

}}</ref>

<ref name=kkzz>{{cite conference

Line 469 ⟶ 477:

| title = An efficient dynamic selection method

| volume = 26

| year = 1983}}</ref>| s2cid = 3211474

}}</ref>

<ref name=reischuk>{{cite journal

Line 493 ⟶ 502:

| series = Texts in Computer Science

| title = The Algorithm Design Manual

| year = 2020| s2cid = 22382667 }}</ref>

<ref name=spp>{{cite journal

Line 506 ⟶ 515:

| title = Finding the median

| volume = 13

| year = 1976| s2cid = 29867292 }}</ref>

<ref name=valiant>{{cite journal