Matches in SemOpenAlex for { <https://semopenalex.org/work/W2055343324> ?p ?o ?g. }
Showing items 1 to 95 of
95
with 100 items per page.
- W2055343324 endingPage "707" @default.
- W2055343324 startingPage "699" @default.
- W2055343324 abstract "Addressing a question of Fredman and Willard from STOC'90, we show that fusion trees cannot be implemented using the AC0 operations available through a standard programming language such as C. However, they can be implemented using AC0 operations on emerging multimedia processors such as the Pentium 4.A fusion node is a linear space representation of an integer set X of size O(√W), where W ≥ log n is the word-length. The fusion node supports searches in X in constant time. Here, a search for y in X returns max{x e Xvx ≤ y}. Using fusion nodes in a O(√W)-degree fusion tree gave Fredman and Willard O(log n/log W) searching for general n, beating the comparison based lower-bound. However, the search routine uses multiplication which is not an AC0 operation.Fredman and Willard asked if multiplication instructions could be avoided. We show that the answer is no unless you have room for a multiplication table. More precisely, restricting ourselves to the AC0 operations available through C, we show that constant time look-ups or searches in sets of any non-constant size require space 2Ω(W). However, if we have that much space, i.e., 2eW for some constant e > 0, then we can tabulate multiplication of (eW/2)-bit numbers, and then we get constant time multiplication of words using additions and shifts. Previous related lowerbounds all disallowed some common AC0 instructions in C such as shifts.We note that even on the weaker Practical RAM the above 2Ω(W) space lower-bound for constant look-ups was only known for sets of size Ω(W2) (Miltersen, ICALP'96). Our Ω(1) set size is best possible since sets of constant size can be searched directly in constant time.Contrasting the above result, we show that using the AC0 operations available on Intel's new Pentium 4, we can implement both fusion trees and Fredman and Willard's later atomic heaps from FOCS'90. Among the many consequences, we get linear time and space AC0 implementations of minimum spanning tree and undirected single source shortest paths. Also, we get optimal Θ(log n/log log n) implementations of dynamic rank and 1½ dimensional range searching. Previous optimal solutions required either multiplication or the use of self-designed AC0 instructions not available on existing processors." @default.
- W2055343324 created "2016-06-24" @default.
- W2055343324 creator A5039232562 @default.
- W2055343324 date "2003-01-12" @default.
- W2055343324 modified "2023-09-26" @default.
- W2055343324 title "On AC0 implementations of fusion trees and atomic heaps" @default.
- W2055343324 cites W1490123358 @default.
- W2055343324 cites W1493544477 @default.
- W2055343324 cites W1895364327 @default.
- W2055343324 cites W1909754222 @default.
- W2055343324 cites W1977026060 @default.
- W2055343324 cites W1985245264 @default.
- W2055343324 cites W1992470151 @default.
- W2055343324 cites W1999545213 @default.
- W2055343324 cites W2009283111 @default.
- W2055343324 cites W2014206268 @default.
- W2055343324 cites W2018338704 @default.
- W2055343324 cites W2024305877 @default.
- W2055343324 cites W2028503265 @default.
- W2055343324 cites W2032841680 @default.
- W2055343324 cites W2041550253 @default.
- W2055343324 cites W2055706406 @default.
- W2055343324 cites W2059868876 @default.
- W2055343324 cites W2074286662 @default.
- W2055343324 cites W2089620427 @default.
- W2055343324 cites W2090747326 @default.
- W2055343324 cites W2126532003 @default.
- W2055343324 cites W2142753649 @default.
- W2055343324 cites W2164485560 @default.
- W2055343324 cites W2165621523 @default.
- W2055343324 cites W2167592280 @default.
- W2055343324 cites W2611598995 @default.
- W2055343324 cites W3043762545 @default.
- W2055343324 doi "https://doi.org/10.5555/644108.644221" @default.
- W2055343324 hasPublicationYear "2003" @default.
- W2055343324 type Work @default.
- W2055343324 sameAs 2055343324 @default.
- W2055343324 citedByCount "10" @default.
- W2055343324 countsByYear W20553433242012 @default.
- W2055343324 countsByYear W20553433242014 @default.
- W2055343324 countsByYear W20553433242015 @default.
- W2055343324 countsByYear W20553433242017 @default.
- W2055343324 crossrefType "proceedings-article" @default.
- W2055343324 hasAuthorship W2055343324A5039232562 @default.
- W2055343324 hasConcept C114614502 @default.
- W2055343324 hasConcept C118615104 @default.
- W2055343324 hasConcept C121332964 @default.
- W2055343324 hasConcept C199360897 @default.
- W2055343324 hasConcept C2777027219 @default.
- W2055343324 hasConcept C2780595030 @default.
- W2055343324 hasConcept C33923547 @default.
- W2055343324 hasConcept C41008148 @default.
- W2055343324 hasConcept C62520636 @default.
- W2055343324 hasConcept C62611344 @default.
- W2055343324 hasConcept C97137487 @default.
- W2055343324 hasConceptScore W2055343324C114614502 @default.
- W2055343324 hasConceptScore W2055343324C118615104 @default.
- W2055343324 hasConceptScore W2055343324C121332964 @default.
- W2055343324 hasConceptScore W2055343324C199360897 @default.
- W2055343324 hasConceptScore W2055343324C2777027219 @default.
- W2055343324 hasConceptScore W2055343324C2780595030 @default.
- W2055343324 hasConceptScore W2055343324C33923547 @default.
- W2055343324 hasConceptScore W2055343324C41008148 @default.
- W2055343324 hasConceptScore W2055343324C62520636 @default.
- W2055343324 hasConceptScore W2055343324C62611344 @default.
- W2055343324 hasConceptScore W2055343324C97137487 @default.
- W2055343324 hasLocation W20553433241 @default.
- W2055343324 hasOpenAccess W2055343324 @default.
- W2055343324 hasPrimaryLocation W20553433241 @default.
- W2055343324 hasRelatedWork W1599325086 @default.
- W2055343324 hasRelatedWork W1600727346 @default.
- W2055343324 hasRelatedWork W1602103078 @default.
- W2055343324 hasRelatedWork W1986633843 @default.
- W2055343324 hasRelatedWork W1990061958 @default.
- W2055343324 hasRelatedWork W2018338704 @default.
- W2055343324 hasRelatedWork W2041550253 @default.
- W2055343324 hasRelatedWork W2049774319 @default.
- W2055343324 hasRelatedWork W2054711061 @default.
- W2055343324 hasRelatedWork W2074286662 @default.
- W2055343324 hasRelatedWork W2087721273 @default.
- W2055343324 hasRelatedWork W2089620427 @default.
- W2055343324 hasRelatedWork W2090021115 @default.
- W2055343324 hasRelatedWork W2090747326 @default.
- W2055343324 hasRelatedWork W2152506638 @default.
- W2055343324 hasRelatedWork W2164485560 @default.
- W2055343324 hasRelatedWork W2169528473 @default.
- W2055343324 hasRelatedWork W2335996541 @default.
- W2055343324 hasRelatedWork W3095545110 @default.
- W2055343324 hasRelatedWork W3145128584 @default.
- W2055343324 isParatext "false" @default.
- W2055343324 isRetracted "false" @default.
- W2055343324 magId "2055343324" @default.
- W2055343324 workType "article" @default.