Matches in DBpedia 2016-04 for { <http://citation.dbpedia.org/hash/7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1> ?p ?o }
Showing triples 1 to 11 of
11
with 100 triples per page.
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 authorlink "Michael Fredman".
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 date "May 1989".
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 first "M.".
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 first2 "M.".
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 isCitedBy Disjoint-set_data_structure.
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 journal "Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing".
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 last "Fredman".
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 last2 "Saks".
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 pages "345–354".
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 quote "Theorem 5: Any CPROBE implementation of the set union problem requires Ω time to execute m Find's and n−1 Union's, beginning with n singleton sets.".
- 7b334d6d101e0d2f867592af155bf8d73c9c49aeffa805a41e85057d5c4706a1 title "The cell probe complexity of dynamic data structures".