Logarithmic lower bounds in the cell-probe model
Pǎtraşcu, Mihai
and
Erik D. Demaine
ACM Computing Research Repository, cs.DS/0502041
Cites:
Maintenance of a minimum spanning forest in a dynamic planar graph
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
