Content deleted Content added
→Hutter search: we don't capitalize galactic anywhere else, let's not capitalize it here |
Citation bot (talk | contribs) Altered author. Added isbn. | Use this bot. Report bugs. | Suggested by Abductive | Category:Analysis of algorithms | #UCB_Category 21/47 |
||
Line 20:
| pages = 514–523
| title = Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012)
| year = 2012|
| s2cid = 2410545
}}</ref>
Line 47 ⟶ 48:
=== Hash tables ===
Researchers have found an algorithm that achieves the provably best-possible<ref>{{cite web |url=https://www.cs.princeton.edu/~hy2/files/dynamic_succinct_dictionary_lower_bound.pdf |title=Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries |author=Tianxiao Li,
| last1 = Bender
| first1 = Michael
| |||