turbonss/vldb/pt/references.bib

@inproceedings{p99,
    author = {R. Pagh},
    title = {Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions},
    booktitle = {Workshop on Algorithms and Data Structures},
    pages = {49-54},
    year = 1999,
    url = {citeseer.nj.nec.com/pagh99hash.html},
    key = {author} 
}

@article{p00,
    author = {R. Pagh},
    title = {Faster deterministic dictionaries},
    journal = {Symposium on Discrete Algorithms (ACM SODA)},
    OPTvolume = {43},
    OPTnumber = {5},
    pages = {487--493},
    year = {2000}
}

@article{gss01,
    author = {N. Galli and B. Seybold and K. Simon},
    title = {Tetris-Hashing or optimal table compression},
    journal = {Discrete Applied Mathematics},
    volume = {110},
    number = {1},
    pages = {41--58},
    month = {june},
    publisher = {Elsevier Science},
    year = {2001}
}


@InProceedings{ss89,
  author = 	 {P. Schmidt and A. Siegel},
  title = 	 {On aspects of universality and performance for closed hashing},
  booktitle =    {Proc. 21th Ann. ACM Symp. on Theory of Computing -- STOC'89},
  month = 	 {May},
  year = 	 {1989},
  pages = 	 {355--366}
}

@article{asw00,
    author = {M. Atici and D. R. Stinson and R. Wei.},
    title = {A new practical algorithm for the construction of a perfect hash function},
    journal = {Journal Combin. Math. Combin. Comput.},
    volume = {35},
    pages = {127--145},
    year = {2000}
}

@article{swz00,
    author = {D. R. Stinson and R. Wei and L. Zhu},
    title = {New constructions for perfect hash families and related structures using combinatorial designs and codes},
    journal = {Journal Combin. Designs.},
    volume = {8},
    pages = {189--200},
    year = {2000}
}

@inproceedings{ht01,
    author = {T. Hagerup and T. Tholey},
    title = {Efficient minimal perfect hashing in nearly minimal space},
    booktitle = {The 18th Symposium on Theoretical Aspects of Computer Science (STACS), volume 2010 of Lecture Notes in Computer Science},
    year = 2001,
    pages = {317--326},
    key = {author} 
}

@inproceedings{dh01,
    author = {M. Dietzfelbinger and T. Hagerup},
    title = {Simple minimal perfect hashing in less space},
    booktitle = {The 9th European Symposium on Algorithms (ESA), volume 2161 of Lecture Notes in Computer Science},
    year = 2001,
    pages = {109--120},
    key = {author} 
}


@MastersThesis{mar00,
  author = 	 {M. S. Neubert},
  title = 	 {Algoritmos Distribu<62>os para a Constru<72>o de Arquivos invertidos},
  school = 	 {Departamento de Ci<43>cia da Computa<74>o, Universidade Federal de Minas Gerais},
  year = 	 2000,
  month =	 {Mar<61>},
  key = {author}
}


@Book{clrs01,
  author = 	 {T. H. Cormen and C. E. Leiserson and R. L. Rivest and C. Stein},
  title = 	 {Introduction to Algorithms},
  publisher = 	 {MIT Press},
  year = 	 {2001},
  edition = 	 {second},
}


@Book{k73,
  author = 	 {D. E. Knuth},
  title = 	 {The Art of Computer Programming: Sorting and Searching},
  publisher = 	 {Addison-Wesley},
  volume    =    {3},
  year = 	 {1973},
  edition = 	 {second},
}

@inproceedings{rp99,
    author = {R. Pagh},
    title = {Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions},
    booktitle = {Workshop on Algorithms and Data Structures},
    pages = {49-54},
    year = 1999,
    url = {citeseer.nj.nec.com/pagh99hash.html},
    key = {author} 
}

@inproceedings{hmwc93,
    author = {G. Havas and B.S. Majewski and N.C. Wormald and Z.J. Czech},
    title = {Graphs, Hypergraphs and Hashing},
    booktitle = {19th International Workshop on Graph-Theoretic Concepts in Computer Science},
    publisher = {Springer Lecture Notes in Computer Science vol. 790},
    pages = {153-165},
    year = 1993,
    key = {author} 
}

@inproceedings{bkz05,
    author = {F.C. Botelho and Y. Kohayakawa and N. Ziviani},
    title = {A Practical Minimal Perfect Hashing Method},
    booktitle = {4th International Workshop on Efficient and Experimental Algorithms},
    publisher = {Springer Lecture Notes in Computer Science vol. 3503},
    pages = {488-500},
    Moth = May,
    year = 2005,
    key = {author} 
}

@Article{chm97,
  author = 	 {Z.J. Czech and G. Havas and B.S. Majewski},
  title = 	 {Fundamental Study Perfect Hashing},
  journal = 	 {Theoretical Computer Science},
  volume = 	{182},
  year = 	 {1997},
  pages = 	 {1-143},
  key = {author}
}

@article{chm92,
    author = {Z.J. Czech and G. Havas and B.S. Majewski},
    title = {An Optimal Algorithm for Generating Minimal Perfect Hash Functions},
    journal = {Information Processing Letters},
    volume = {43},
    number = {5},
    pages = {257-264},
    year = {1992},
    url = {citeseer.nj.nec.com/czech92optimal.html}, 
    key = {author} 
}

@Article{mwhc96,
  author = 	 {B.S. Majewski and N.C. Wormald and G. Havas and Z.J. Czech},
  title = 	 {A family of perfect hashing methods},
  journal = 	 {The Computer Journal},
  year = 	 {1996},
  volume = 	 {39},
  number = 	 {6},
  pages = 	 {547-554},
  key = {author}
}

@InProceedings{bv04,
author =         {P. Boldi and S. Vigna},
title =          {The WebGraph Framework I: Compression Techniques},
booktitle =      {13th International World Wide Web Conference},
pages =          {595--602},
year =           {2004}
}


@Book{z04,
  author = 	 {N. Ziviani},
  title = 	 {Projeto de Algoritmos com implementa<74>es em Pascal e C},
  publisher = 	 {Pioneira Thompson},
  year = 	 2004,
  edition = 	 {segunda edi<64>o}
}


@Book{p85,
  author = 	 {E. M. Palmer},
  title = 	 {Graphical Evolution: An Introduction to the Theory of Random Graphs},
  publisher = 	 {John Wiley \& Sons},
  year = 	 {1985},
  address = 	 {New York}
}

@Book{imb99,
  author = 	 {I.H. Witten and A. Moffat and T.C. Bell},
  title = 	 {Managing Gigabytes: Compressing and Indexing Documents and Images},
  publisher = 	 {Morgan Kaufmann Publishers},
  year = 	 1999,
  edition = 	 {second edition}
}
@Book{wfe68,
  author = 	 {W. Feller},
  title = 	 { An Introduction to Probability Theory and Its Applications},
  publisher = 	 {Wiley},
  year = 	 1968,
  volume = 1,
  optedition = 	 {second edition}
}


@Article{fhcd92,
  author = 	 {E.A. Fox and L. S. Heath and Q.Chen and A.M. Daoud},
  title = 	 {Practical Minimal Perfect Hash Functions For Large Databases},
  journal = 	 {Communications of the ACM},
  year = 	 {1992},
  volume = 	 {35},
  number = 	 {1},
  pages =        {105--121}
}


@inproceedings{fch92,
  author    = {E.A. Fox and Q.F. Chen and L.S. Heath},
  title     = {A Faster Algorithm for Constructing Minimal Perfect Hash Functions},
  booktitle = {Proceedings of the 15th Annual International ACM SIGIR Conference
               on Research and Development in Information Retrieval},
  year      = {1992},
  pages = {266-273},
}

@article{c80,
 author = {R.J. Cichelli},
 title = {Minimal perfect hash functions made simple},
 journal = {Communications of the ACM},
 volume = {23},
 number = {1},
 year = {1980},
 issn = {0001-0782},
 pages = {17--19},
 doi = {http://doi.acm.org/10.1145/358808.358813},
 publisher = {ACM Press},
 }


@TechReport{fhc89,
  author = 	 {E.A. Fox and L.S. Heath and Q.F. Chen},
  title = 	 {An $O(n\log n)$ algorithm for finding minimal perfect hash functions},
  institution =  {Virginia Polytechnic Institute and State University},
  year = 	 {1989},
  OPTkey = 	 {},
  OPTtype = 	 {},
  OPTnumber = 	 {},
  address = 	 {Blacksburg, VA},
  month = 	 {April},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@inproceedings{fcdh90,
 author = {E.A. Fox and Q.F. Chen and A.M. Daoud and L.S. Heath},
 title = {Order preserving minimal perfect hash functions and information retrieval},
 booktitle = {Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval},
 year = {1990},
 isbn = {0-89791-408-2},
 pages = {279--311},
 location = {Brussels, Belgium},
 doi = {http://doi.acm.org/10.1145/96749.98233},
 publisher = {ACM Press},
 }

@Article{fkp89,
  author = 	 {P. Flajolet and D. E. Knuth and B. Pittel},
  title = 	 {The first cycles in an evolving graph},
  journal = 	 {Discrete Math},
  year = 	 {1989},
  volume = 	 {75},
  pages = 	 {167-215},
}

@Article{s77,
  author = 	 {R. Sprugnoli},
  title = 	 {Perfect Hashing Functions: A Single Probe Retrieving 
                  Method For Static Sets},
  journal = 	 {Communications of the ACM},
  year = 	 {1977},
  volume = 	 {20},
  number = 	 {11},
  pages =        {841--850},
  month = 	 {November},
}

@Article{j81,
  author = 	 {G. Jaeschke},
  title = 	 {Reciprocal Hashing: A method For Generating Minimal Perfect
                  Hashing Functions},
  journal = 	 {Communications of the ACM},
  year = 	 {1981},
  volume = 	 {24},
  number = 	 {12},
  month = 	 {December},
  pages =        {829--833}
}

@Article{c84,
  author = 	 {C. C. Chang},
  title = 	 {The Study Of An Ordered Minimal Perfect Hashing Scheme},
  journal = 	 {Communications of the ACM},
  year = 	 {1984},
  volume = 	 {27},
  number = 	 {4},
  month = 	 {December},
  pages =        {384--387}
}

@Article{c86,
  author = 	 {C. C. Chang},
  title = 	 {Letter-Oriented Reciprocal Hashing Scheme},
  journal = 	 {Inform. Sci.},
  year = 	 {1986},
  volume = 	 {27},
  pages =        {243--255}
}

@Article{cl86,
  author = 	 {C. C. Chang and R. C. T. Lee},
  title = 	 {A Letter-Oriented Minimal Perfect Hashing Scheme},
  journal = 	 {Computer Journal},
  year = 	 {1986},
  volume = 	 {29},
  number = 	 {3},
  month = 	 {June},
  pages =        {277--281}
}


@Article{cc88,
  author = 	 {C. C. Chang and C. H. Chang},
  title = 	 {An Ordered Minimal Perfect Hashing Scheme with Single Parameter},
  journal = 	 {Inform. Process. Lett.},
  year = 	 {1988},
  volume = 	 {27},
  number = 	 {2},
  month = 	 {February},
  pages =        {79--83}
}

@Article{w90,
  author = 	 {V. G. Winters},
  title = 	 {Minimal Perfect Hashing in Polynomial Time},
  journal = 	 {BIT},
  year = 	 {1990},
  volume = 	 {30},
  number = 	 {2},
  pages =        {235--244}
}

@Article{fcdh91,
  author = 	 {E. A. Fox and Q. F. Chen and A. M. Daoud and L. S. Heath},
  title = 	 {Order Preserving Minimal Perfect Hash Functions and Information Retrieval},
  journal = 	 {ACM Trans. Inform. Systems},
  year = 	 {1991},
  volume = 	 {9},
  number = 	 {3},
  month = 	 {July},
  pages =        {281--308}
}

@Article{fks84,
  author = 	 {M. L. Fredman and J. Koml\'os and E. Szemer\'edi},
  title = 	 {Storing a sparse table with {O(1)} worst case access time},
  journal = 	 {J. ACM},
  year = 	 {1984},
  volume = 	 {31},
  number = 	 {3},
  month = 	 {July},
  pages =        {538--544}
}

@Article{dhjs83,
  author = 	 {M. W. Du and T. M. Hsieh and K. F. Jea and D. W. Shieh},
  title = 	 {The study of a new perfect hash scheme},
  journal = 	 {IEEE Trans. Software Eng.},
  year = 	 {1983},
  volume = 	 {9},
  number = 	 {3},
  month = 	 {May},
  pages =        {305--313}
}

@Article{bt94,
  author = 	 {M. D. Brain and A. L. Tharp},
  title = 	 {Using Tries to Eliminate Pattern Collisions in Perfect Hashing},
  journal = 	 {IEEE Trans. on Knowledge and Data Eng.},
  year = 	 {1994},
  volume = 	 {6},
  number = 	 {2},
  month = 	 {April},
  pages =        {239--247}
}

@Article{bt90,
  author = 	 {M. D. Brain and A. L. Tharp},
  title = 	 {Perfect hashing using sparse matrix packing},
  journal = 	 {Inform. Systems},
  year = 	 {1990},
  volume = 	 {15},
  number = 	 {3},
  OPTmonth = 	 {April},
  pages =        {281--290}
}

@Article{ckw93,
  author = 	 {C. C. Chang and H. C.Kowng and T. C. Wu},
  title = 	 {A refinement of a compression-oriented addressing scheme},
  journal = 	 {BIT},
  year = 	 {1993},
  volume = 	 {33},
  number = 	 {4},
  OPTmonth = 	 {April},
  pages =        {530--535}
}

@Article{cw91,
  author = 	 {C. C. Chang and T. C. Wu},
  title = 	 {A letter-oriented perfect hashing scheme based upon sparse table compression},
  journal = 	 {Software -- Practice Experience},
  year = 	 {1991},
  volume = 	 {21},
  number = 	 {1},
  month = 	 {january},
  pages =        {35--49}
}

@Article{ty79,
  author = 	 {R. E. Tarjan and A. C. C. Yao},
  title = 	 {Storing a sparse table},
  journal = 	 {Comm. ACM},
  year = 	 {1979},
  volume = 	 {22},
  number = 	 {11},
  month = 	 {November},
  pages =        {606--611}
}

@Article{yd85,
  author = 	 {W. P. Yang and M. W. Du},
  title = 	 {A backtracking method for constructing perfect hash functions from a set of mapping functions},
  journal = 	 {BIT},
  year = 	 {1985},
  volume = 	 {25},
  number = 	 {1},
  pages =        {148--164}
}

@Article{s85,
  author = 	 {T. J. Sager},
  title = 	 {A polynomial time generator for minimal perfect hash functions},
  journal = 	 {Commun. ACM},
  year = 	 {1985},
  volume = 	 {28},
  number = 	 {5},
  month =        {May},
  pages =        {523--532}
}

@Article{cm93,
  author = 	 {Z. J. Czech and B. S. Majewski},
  title = 	 {A linear time algorithm for finding minimal perfect hash functions},
  journal = 	 {The computer Journal},
  year = 	 {1993},
  volume = 	 {36},
  number = 	 {6},
  pages =        {579--587}
}

@Article{gbs94,
  author = 	 {R. Gupta and S. Bhaskar and S. Smolka},
  title = 	 {On randomization in sequential and distributed algorithms},
  journal = 	 {ACM Comput. Surveys},
  year = 	 {1994},
  volume = 	 {26},
  number = 	 {1},
  month =        {March},
  pages =        {7--86}
}

@InProceedings{sb84,
  author = 	 {C. Slot and P. V. E. Boas},
  title = 	 {On tape versus core; an application of space efficient perfect hash functions to the 
                  invariance of space},
  booktitle =    {Proc. 16th Ann. ACM Symp. on Theory of Computing -- STOC'84},
  address = 	 {Washington},
  month = 	 {May},
  year = 	 {1984},
  pages = 	 {391--400},
}

@InProceedings{wi90,
  author = 	 {V. G. Winters},
  title = 	 {Minimal perfect hashing for large sets of data},
  booktitle =    {Internat. Conf. on Computing and Information -- ICCI'90},
  address = 	 {Canada},
  month = 	 {May},
  year = 	 {1990},
  pages = 	 {275--284},
}

@InProceedings{lr85,
  author = 	 {P. Larson and M. V. Ramakrishna},
  title = 	 {External perfect hashing},
  booktitle =    {Proc. ACM SIGMOD Conf.},
  address = 	 {Austin TX},
  month = 	 {June},
  year = 	 {1985},
  pages = 	 {190--199},
}

@Book{m84,
  author = 	 {K. Mehlhorn},
  editor = 	 {W. Brauer and G. Rozenberg and A. Salomaa},
  title = 	 {Data Structures and Algorithms 1: Sorting and Searching},
  publisher = 	 {Springer-Verlag},
  year = 	 {1984},
}

@PhdThesis{c92,
  author = 	 {Q. F. Chen},
  title = 	 {An Object-Oriented Database System for Efficient Information Retrieval Appliations},
  school = 	 {Virginia Tech Dept. of Computer Science},
  year = 	 {1992},
  month = 	 {March}
}

@article {er59,
    AUTHOR = {Erd{\H{o}}s, P. and R{\'e}nyi, A.},
     TITLE = {On random graphs {I}},
   JOURNAL = {Pub. Math. Debrecen},
    VOLUME = {6},
      YEAR = {1959},
     PAGES = {290--297},
   MRCLASS = {05.00},
  MRNUMBER = {MR0120167 (22 \#10924)},
MRREVIEWER = {A. Dvoretzky},
}


@article {erdos61,
    AUTHOR = {Erd{\H{o}}s, P. and R{\'e}nyi, A.},
     TITLE = {On the evolution of random graphs},
   JOURNAL = {Bull. Inst. Internat. Statist.},
    VOLUME = 38,
      YEAR = 1961,
     PAGES = {343--347},
   MRCLASS = {05.40 (55.10)},
  MRNUMBER = {MR0148055 (26 \#5564)},
}

@article {er60,
    AUTHOR = {Erd{\H{o}}s, P. and R{\'e}nyi, A.},
     TITLE = {On the evolution of random graphs},
   JOURNAL = {Magyar Tud. Akad. Mat. Kutat\'o Int. K\"ozl.},
    VOLUME = {5},
      YEAR = {1960},
     PAGES = {17--61},
   MRCLASS = {05.40},
  MRNUMBER = {MR0125031 (23 \#A2338)},
MRREVIEWER = {J. Riordan},
}

@Article{er60:_Old,
  author =   {P. Erd{\H{o}}s and A. R\'enyi},
  title =    {On the evolution of random graphs},
  journal =  {Publications of the Mathematical Institute of the Hungarian
                  Academy of Sciences},  
  year =     {1960},
  volume =   {56},
  pages =    {17-61}
}

@Article{er61,
  author =   {P. Erd{\H{o}}s and A. R\'enyi},
  title =    {On the strength of connectedness of a random graph},
  journal =  {Acta Mathematica Scientia Hungary},
  year =     {1961},
  volume =   {12},
  pages =    {261-267}
}


@Article{bp04,
  author = 	 {B. Bollob\'as and O. Pikhurko},
  title = 	 {Integer Sets with Prescribed Pairwise Differences Being Distinct},
  journal = 	 {European Journal of Combinatorics},
  OPTkey = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTpages = 	 {},
  OPTmonth = 	 {},
  note = 	 {To Appear},
  OPTannote = 	 {}
}

@Article{pw04,
  author = 	 {B. Pittel and N. C. Wormald},
  title = 	 {Counting connected graphs inside-out},
  journal = 	 {Journal of Combinatorial Theory},
  OPTkey = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTpages = 	 {},
  OPTmonth = 	 {},
  note = 	 {To Appear},
  OPTannote = 	 {}
}


@Article{mr95,
  author =   {M. Molloy and B. Reed},
  title =    {A critical point for random graphs with a given degree sequence},
  journal =  {Random Structures and Algorithms},
  year =     {1995},
  volume =   {6},
  pages =    {161-179}
}

@TechReport{bmz04,
  author = 	 {F. C. Botelho and D. Menoti and N. Ziviani},
  title = 	 {A New algorithm for constructing minimal perfect hash functions},
  institution =  {Federal Univ. of Minas Gerais},
  year = 	 {2004},
  OPTkey = 	 {},
  OPTtype = 	 {},
  number = 	 {TR004},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  note = 	 {(http://www.dcc.ufmg.br/\texttt{\~ }nivio/pub/technicalreports.html)},
  OPTannote = 	 {}
}

@Article{mr98,
  author =   {M. Molloy and B. Reed},
  title =    {The size of the giant component of a random graph with a given degree sequence},
  journal =  {Combinatorics, Probability and Computing},
  year =     {1998},
  volume =   {7},
  pages =    {295-305}
}

@misc{h98,
  author = {D. Hawking},
  title = {Overview of TREC-7 Very Large Collection Track (Draft for Notebook)},
  url = {citeseer.ist.psu.edu/4991.html},
  year = {1998}}

@book {jlr00,
    AUTHOR = {Janson, S. and {\L}uczak, T. and Ruci{\'n}ski, A.},
     TITLE = {Random graphs},
 PUBLISHER = {Wiley-Inter.},
      YEAR = 2000,
     PAGES = {xii+333},
      ISBN = {0-471-17541-2},
   MRCLASS = {05C80 (60C05 82B41)},
  MRNUMBER = {2001k:05180},
MRREVIEWER = {Mark R. Jerrum},
}

@incollection {jlr90,
    AUTHOR = {Janson, Svante and {\L}uczak, Tomasz and Ruci{\'n}ski,
              Andrzej},
     TITLE = {An exponential bound for the probability of nonexistence of a
              specified subgraph in a random graph},
 BOOKTITLE = {Random graphs '87 (Pozna\'n, 1987)},
     PAGES = {73--87},
 PUBLISHER = {Wiley},
   ADDRESS = {Chichester},
      YEAR = 1990,
   MRCLASS = {05C80 (60C05)},
  MRNUMBER = {91m:05168},
MRREVIEWER = {J. Spencer},
}

@book {b01,
    AUTHOR = {Bollob{\'a}s, B.},
     TITLE = {Random graphs},
    SERIES = {Cambridge Studies in Advanced Mathematics},
    VOLUME = 73,
   EDITION = {Second},
 PUBLISHER = {Cambridge University Press},
   ADDRESS = {Cambridge},
      YEAR = 2001,
     PAGES = {xviii+498},
      ISBN = {0-521-80920-7; 0-521-79722-5},
   MRCLASS = {05C80 (60C05)},
  MRNUMBER = {MR1864966 (2002j:05132)},
}