%---------------------------------------------------
% Distributive ie bucket sorts and monotonic hashing
%---------------------------------------------------
@article
 {geh,
  author="G. Ehrlich",
  title="Searching and sorting real numbers",
  journal="Journal of Algorithms",
  year="1981",
  volume="2",
  number="",
  pages="1-12"
}

@inproceedings
 {kro,
  author="R. Kronmal and M. Tarter",
  title="Cumulative Polygon adress calculation sort",
  booktitle="ACM 20 th National Conference",
  year="1965",
  pages="376-385"
 }

@article
 {akl,
  author="G. Akl and H. Meijer",
  title="On the average-case complexity of Bucketing algorithms",
  journal="Journal of algorithms",
  year="1982",
  volume="3",
  number="",  
  pages="9-13"
 }

@article
 {mei,
  author="H. Meijer and G. Akl",
  title="The design and analysis of a new hybrid sorting algorithm",
  journal="Information Processing Letters",
  year="1980",
  volume="10",
  number="4-5",  
  pages="213-218"
 }

@article
 {dev1,
  author="L. Devroye and T. Klincsek",
  title="Average time behaviour of distributive sorting algorithms",
  journal="Computing",
  year="1981",
  volume="26",
  number="",  
  pages="1-7"
 }

@article
 {dob1,
  author="W. Dobosiewicz",
  title="Sorting by distributive partitionning",
  journal="Information Procesing Letters",
  year="1978",
  volume="7",
  number="1",  
  pages="1-6"
 }

@article
 {dob2,
  author="W. Dobosiewicz",
  title="The practical significance of D.P sort revisited",
  journal="Information Procesing Letter",
  year="1979",
  volume="8",
  number="4",  
  pages="170-172"
 }

@article
 {tam1,
  author="M. Tamminen",
  title="Analysis of N-Trees",
  journal="Information Procesing Letter",
  year="1983",
  volume="16",
  number="",  
  pages="131-137"
 }

@article
 {tam2,
  author="M. Tamminen",
  title="Two levels are as good as any",
  journal="Journal of algorithms",
  year="1985",
  volume="6",
  number="",  
  pages="138-144"
 }

@article
 {vda,
  author="W. van Dam and J. Frenk and R. Kan",
  title="The asymptotic behaviour of a distributive sorting method",
  journal="Computing",
  year="1983",
  volume="31",
  number="",  
  pages="287-303"
 }

@article
 {tam3,
  author="M. Tamminen",
  title="Order preserving extendible hashing and bucket tries",
  journal="BIT",
  year="1981",
  volume="21",
  number="",  
  pages="419-435"
 }

@article
 {dev2,
  author="L. Devroye",
  title="The expected length of the longest probe sequence for bucket searching 
         when the distribution is not uniform",
  journal="Journal of algorithms",
  year="1985",
  volume="6",
  number="",  
  pages="1-9"
 }

@article
 {tam4,
  author="M. Tamminen",
  title="On search by address computation",
  journal="BIT",
  year="1985",
  volume="25",
  number="",  
  pages="135-147"
 }

@article
 {kir,
  author="D. Kirpatrick and S. Reisch",
  title="Upper bounds for sorting integers on random access machines",
  journal="Theorical Computer Science",
  year="1984",
  volume="28",
  number="",  
  pages="263-276"
 }


@article
 {all,
  author="D. Allison and N. Noga",
  title="Selection by distributive partitionning",
  journal="Information Processing Letters",
  year="1980",
  volume="11",
  number="1",  
  pages="7-8"
 }

@article
 {knu,
  author="D. Knuth and E. Kaelher",
  title="An experiment in optimal sorting",
  journal="Information Processing Letters",
  year="1972",
  volume="1",
  number="",  
  pages="173-176"
 }

@article
 {coo,
  author="R. Cooper and M. Solomon",
  title="The average time until bucket overflow",
  journal="",
  year="",
  volume="",
  number="",  
  pages=""
 }



@article
 {slu,
  author="E. Slud",
  title="Distribution Inequalities for the binomial law",
  journal="",
  year="",
  volume="",
  number="",  
  pages=""
 }


@techreport
 {tam2,
  author="M. Tamminen",
  title="A note on order preserving extendible hashing and bucket 
         tries",
  number="HTKK-TKO-B29",
  institution="Helsinki University of Technology",
  year="1981"
}

@techreport
 {tam3,
  author="M. Tamminen",
  title="Some aspects of order preserving extendible hashing",
  number="HTKK-TKO-A19",
  institution="Helsinki University of Technology",
  year="1980"
}


%---------------------------------------------------
% Sorting, merging: misc
%---------------------------------------------------
@inproceedings
 {,
  author="B. Durian",
  title="Quicksort without a stack",
  booktitle="Math. Found. of Computer Science",
  address="Bratislava",
  year="1986",
  pages=""
}


@article
 {,
  author="H. Mannali and E. Ukkonen",
  title="A simple linear-time algorithm for in situ merging",
  journal="IPL",
  year="1984",
  volume="18",
  number="",
  pages=""
}

@article
 {,
  author="I. Wegener",
  title="BOTTOM-HEAPSORT: a new variant of HEAPSORT
         beating on an average QUICKSORT (if $n$ is not very small)",
  journal="Theoritical Computer Science",
  year="1993",
  volume="118",
  number="",
  pages=""
}