Are bitvectors optimal?

Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

35 Citationer (Scopus)

Originalsprog	Engelsk
Titel	Proceedings of the thirty-second annual ACM symposium on Theory of computing
Antal sider	10
Forlag	Association for Computing Machinery
Publikationsdato	2000
Sider	449-458
ISBN (Trykt)	1-58113-184-4
DOI	https://doi.org/10.1145/335305.335357
Status	Udgivet - 2000
Begivenhed	Annual ACM Symposium on Theory of Computing - Portland, USA Varighed: 21 maj 2000 → 23 maj 2000 Konferencens nummer: 32

Konference	Annual ACM Symposium on Theory of Computing
Nummer	32
Land/Område	USA
By	Portland
Periode	21/05/2000 → 23/05/2000

Adgang til dokumentet

@inproceedings{532a38a0af7311df8c1a000ea68e967b,

title = "Are bitvectors optimal?",

author = "Harry Buhrman and Miltersen, {Peter Bro} and Jaikumar Radhakrishnan and Srinivasan Venkatesh",

year = "2000",

doi = "10.1145/335305.335357",

language = "English",

isbn = "1-58113-184-4",

pages = "449--458",

booktitle = "Proceedings of the thirty-second annual ACM symposium on Theory of computing",

publisher = "Association for Computing Machinery",

address = "United States",

note = "Annual ACM Symposium on Theory of Computing ; Conference date: 21-05-2000 Through 23-05-2000",