Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/s0304-3975(00)00287-5> ?p ?o }
Showing triples 1 to 15 of
15
with 100 triples per page.
- s0304-3975(00)00287-5 doi "10.1016/S0304-397500287-5".
- s0304-3975(00)00287-5 first1 "Heejin".
- s0304-3975(00)00287-5 first2 "Kunsoo".
- s0304-3975(00)00287-5 isCitedBy Red–black_tree.
- s0304-3975(00)00287-5 issue "1–2".
- s0304-3975(00)00287-5 journal "Theoretical computer science".
- s0304-3975(00)00287-5 last1 "Park".
- s0304-3975(00)00287-5 last2 "Park".
- s0304-3975(00)00287-5 pages "415–435".
- s0304-3975(00)00287-5 publisher "Elsevier".
- s0304-3975(00)00287-5 quote "Our parallel algorithm for constructing a red–black tree from a sorted list of n items runs in time with n processors on the CRCW PRAM and runs in time with n / log log n processors on the EREW PRAM.".
- s0304-3975(00)00287-5 title "Parallel algorithms for red–black trees".
- s0304-3975(00)00287-5 url S0304397500002875.
- s0304-3975(00)00287-5 volume "262".
- s0304-3975(00)00287-5 year "2001".