%-----------------------------------
%introduction & hash functions
%-----------------------------------
@book
 {Knu73,
  author="Donald Knuth",
  title="The art of Computer programming, vol 3",
  publisher="Addison-Wesley",
  year="1973"
 }

@book
 {Cor&Al,
  author="T. Cormen and C. Leiserson and R. Rivest",
  title="Introduction to Algorithms",
  publisher="Mc Graw Hill",
  year="1990"
 }


@article
 {lg,
  author="L.J. Guibas",
  title="The analysis of Hashing Techniques that exhibit
         $k$-ary clustering",
  journal="J. of the ACM",
  year="1978",
  volume="25",
  number="4",
  pages="544-555"
}

@article
 {,
  author="JL. Carter and Wegman",
  title="Universal classes of hash functions",
  journal="J. Comp. Syst. Sci.",
  year="",
  volume="18",
  number="",
  pages="143-154"
}


@article
 {Car,
  author="G. Markowsky and JL. Carter and M. Wegman ",
  title="Analysis of a universal class of hash functions",
  journal="Lectures Notes in Computer Science",
  year="1978",
  volume="64",
  number="",  
  pages="345-354"
 }

@article
 {Fre,
  author="L. Fredman and J. Komlos and E. Szemeredi",
  title="Storing a sparse table with O(1) worst case access time",
  journal="Journal of the ACM",
  year="1984",
  volume="31",
  number="3",  
  pages="538-544"
 }

@inproceedings
 {Die88,
  author="M. Dietzfelbinger and K. Melhron and others",
  title="Dynamic perfect hashing : upper and lower bounds",
  booktitle="IEEE Symposium on Foundations of Computer Science",
  year="1988",
  pages="524-531",
 } 

@article
 {Die90,
  author="M. Dietzfelbinger and F. Meyer",
  title="A new universal class of hash functions and dynamic hashing 
         in real time",
  journal="Lectures Notes in Computer Science",
  year="1990",
  volume="443",
  number="",  
  pages="6-19"
 }


@article
 {har,
  author="EP. Harris and K. Ramamohanarao",
  title="Optimal dynamic multi-attribute hashing for range queries",
  journal="BIT",
  year="1993",
  volume="33",
  pages="561-579"
 }  


@article
 {bo,
  author="A. Bolour",
  title="Optimality properties of multiple-key hashing functions",
  journal="J. of the ACM",
  year="1979",
  volume="26",
  number="2",
  pages=""
}




%-------------------
%dynamic hashing
%-------------------
@article
 {Fag&Al,
  author="R. Fagin and J. Nievergelt and others",
  title="Extendible hashing - A fast Access method for dynamic files",
  journal="ACM transactions on Database Systems",
  year="1979",
  volume="4",
  number="3",  
  pages="315-344"
 }


@article
 {ed,
  author="R. Enbody and H. Du",
  title="Dynamic hashing schemes",
  journal="ACM computing surveys",
  year="1988",
  volume="20",
  number="2",
  pages=""
}



@inproceedings
 {Lit80,
  author="W. Litwin",
  title="Linear Hashing : a new tool for file and table addressing",
  booktitle="Very large data bases conf.",
  year="1980",
  pages="212-223"
 }

@inproceedings
 {Lit78,
  author="W. Litwin",
  title="Virtual Hashing : a dinamically changing hashing",
  booktitle="Very large data bases conf.",
  year="1978",
  address="Berlin",
  pages="517-523",
 }

@article
 {Lar,
  author="P. Larson",
  title="Dynamic hashing",
  journal="BIT",
  year="1978",
  volume="18",
  number="",  
  pages="184-201"
 }

@article
 {Yao,
  author="A. Yao",
  title="A note on the analysis of extendible hashing",
  journal="Information Processing Letters",
  year="1980",
  volume="11",
  number="2",  
  pages="84-86"
 }

@article
 {Rei,
  author="M. Regnier",
  title="On the average height of trees in digital search and dynamic hashing",
  journal="Information Processing Letters",
  year="1981",
  volume="13",
  number="2",  
  pages="64-66"
 }

@article
 {Tam82,
  author="M. Tamminen",
  title="Extendible hashing with overflow",
  journal="Information Processing Letters",
  year="1982",
  volume="15",
  number="5",  
  pages="227-232"
 }

@article
 {Fla83,
  author="P. Flajolet",
  title="On the performance evaluation of extendible hashing and trie searching",
  journal="Acta  Informatica",
  year="1983",
  volume="20",
  number="",  
  pages="345-369"
 }

@inproceedings
 {Fla&Al,
  author="P. Flajolet and JM. Steyaert",
  title="A branching process arising in dynamic hashing, trie searching and
        polynomial factorization",
  booktitle="Proc. ICALP",
  year="1982",
 }

%----------------
%perfect hashing
%----------------
@article
 {Jae,
  author="G. Jaeschke",
  title="Reciprocical Hashing : A Method for Generating Minimal Perfect Hashing 
         Functions. ",
  journal="Communications of the ACM ",
  year="1981",
  volume="24",
  number="12",
  pages=""}

@article
 {Spr,
  author="R. Sprugnoli",
  title="Perfect Hashing Functions : A Single Probe Retriving Method for Static 
         Sets",
  journal="Communications of the ACM",
  year="1977",
  volume="20",
  number="11",
  pages=""}


@article
 {Yan&Al,
  author="W. Yang and M. Du",
  title="A Backtracking Method for Constructing Perfect Hash Functions from a set 
         of Mapping Functions",
  journal="BIT",
  year="1985",
  volume="25",
  number="",
  pages="148-164"}


@article
 {cv,
  author="C. Kenyon and S. Vitter",
  title="Maximum queue size and hashing with lazy deletion",
  journal="Algorithmica",
  year="1991",
  volume="6",
  number="",
  pages="597-619"
}

@article
 {at,
  author="T. Asano and T. Tokuyama",
  title="Algorithms for projecting points to give the most uniform
         distribution with applications to hashing",
  journal="Algorithmica",
  year="1993",
  volume="9",
  number="",
  pages="572-590"
}