The Library
Tight cell-probe bounds for online hamming distance computation
Tools
Clifford, Raphaël, Jalsenius, Markus and Sach, Ben (2013) Tight cell-probe bounds for online hamming distance computation. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2013, New Orleans, Louisiana, 6-8 January 2013. Published in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms pp. 664-674.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://knowledgecenter.siam.org/0236-000129/0236-0...
Item Type: | Conference Item (Paper) | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Journal or Publication Title: | Proceedings of the ACM-SIAM Symposium on Discrete Algorithms | ||||
Publisher: | SIAM | ||||
Official Date: | January 2013 | ||||
Dates: |
|
||||
Page Range: | pp. 664-674 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Open Access (Creative Commons) | ||||
Funder: | Engineering and Physical Sciences Research Council (EPSRC) | ||||
Conference Paper Type: | Paper | ||||
Title of Event: | ACM-SIAM Symposium on Discrete Algorithms (SODA) 2013 | ||||
Type of Event: | Conference | ||||
Location of Event: | New Orleans, Louisiana | ||||
Date(s) of Event: | 6-8 January 2013 |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |