%0 Conference Paper %1 conf/fsttcs/GoldsmithHK91 %A Goldsmith, Judy %A Hemachandra, Lane A. %A Kunen, Kenneth %B FSTTCS %D 1991 %E Biswas, Somenath %E Nori, Kesav V. %I Springer %K dblp %P 212-223 %T On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. %U http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs91.html#GoldsmithHK91 %V 560 %@ 3-540-54967-6

@inproceedings{conf/fsttcs/GoldsmithHK91, added-at = {2017-05-20T00:00:00.000+0200}, author = {Goldsmith, Judy and Hemachandra, Lane A. and Kunen, Kenneth}, biburl = {https://www.bibsonomy.org/bibtex/2a91ebbe5ce2892e5f435529306d7fb66/dblp}, booktitle = {FSTTCS}, crossref = {conf/fsttcs/1991}, editor = {Biswas, Somenath and Nori, Kesav V.}, ee = {https://doi.org/10.1007/3-540-54967-6_70}, interhash = {b97dc99a4fe055c6cd34081f6a2f4962}, intrahash = {a91ebbe5ce2892e5f435529306d7fb66}, isbn = {3-540-54967-6}, keywords = {dblp}, pages = {212-223}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:09:02.000+0200}, title = {On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions.}, url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs91.html#GoldsmithHK91}, volume = 560, year = 1991 }