%--------------------------------
% Median and Quantiles selection
%--------------------------------
@article
 {dob,
  author="D. Dobkin and J. Ian Munro",
  title="Optimal time Minimal space Selection Algorithms",
  journal="J. of the ACM",
  year="1981",
  volume="28",
  number="3",
  pages="454-461"
}



@article
 {flo1,
  author="R. Floyd",
  title="The algorithm select 
         for finding the i th smallest of n elements",
  journal="Communications of the ACM",
  year="1975",
  volume="18",
  number="3",  
  pages="173"
 }

@article
 {flo2,
  author="R. Floyd and L. Rivest",
  title="Expected time bounds for selection",
  journal="Communications of the ACM",
  year="1975",
  volume="18",
  number="3",  
  pages="165-172"
 }

@article
 {flo3,
  author="R. Floyd and others",
  title="Time bounds for selection",
  journal="Journal of Computer and System Sciences",
  year="1973",
  volume="7",
  number="",  
  pages="448-461"
 }

@article
 {pip,
  author="N. Pippenger",
  title="Finding the median",
  journal="Journal of Computer and System Sciences",
  year="1976",
  volume="13",
  number="",  
  pages="184-199"
 }


@inproceedings
 {kom,
  author="J. Komlos and others",
  title="An O(n * log n) sorting network",
  booktitle="15 th ACM Symp. on Theory of Computing",
  year="1983",
  pages="1-9"
 }



@article
 {pai,
  author="R. Paige and R. Tarjan",
  title="Three partition refinement algorithms",
  journal="SIAM J. Computing",
  year="1987",
  volume="16",
  number="6",
  pages="973-989"
}

@article
 {,
  author="V. Estivill-Castro and D. Wood",
  title="A survey of adaptative sorting algorithms",
  journal="ACM Computing Surveys",
  year="1992",
  volume="24",
  number="4",
  pages=""
}


@inproceedings
 {hm,
  author="T. Hagerup and M. Maas",
  title="Generalized topological sorting in linear time",
  booktitle="Fundamentals of Computation Theory - LNCS 710",
  address="Szeged",
  year="1993",
  pages=""
}