FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1956214747> ?p ?o ?g. }

• W1956214747 abstract "The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST). It postulates the existence of an asymptotically optimal online BST, i.e. One that is constant factor competitive with any BST on any input access sequence. The two main candidates for dynamic optimality in the literature are splay trees [Sleator and Tarjan, 1985], and Greedy [Lucas, 1988, Munro, 2000, Demaine et al. 2009]. Despite BSTs being among the simplest data structures in computer science, and despite extensive effort over the past three decades, the conjecture remains elusive. Dynamic optimality is trivial for almost all sequences: the optimum access cost of most length-n sequences is Theta(n log n), achievable by any balanced BST. Thus, the obvious missing step towards the conjecture is an understanding of the easy access sequences, and indeed the most fruitful research direction so far has been the study of specific sequences, whose easiness is captured by a parameter of interest. For instance, splay provably achieves the bound of O(nd) when d roughly measures the distances between consecutive accesses (dynamic finger), the average entropy (static optimality), or the delays between multiple accesses of an element(working set). The difficulty of proving dynamic optimality is witnessed by other highly restricted special cases that remain unresolved, one prominent example is the traversal conjecture [Sleator and Tarjan, 1985], which states that preorder sequences (whose optimum is linear) are linear-time accessed by splay trees, no online BST is known to satisfy this conjecture. In this paper, we prove two different relaxations of the traversal conjecture for Greedy: (i) Greedy is almost linear for preorder traversal, (ii) if a linear-time preprocessing is allowed, Greedy is in fact linear. These statements are corollaries of our more general results that express the complexity of access sequences in terms of a pattern avoidance parameter k. Pattern avoidance is a well-established concept in combinatorics, and the classes of input sequences thus defined are rich, e.g. The k = 3 case includes preorder sequences. For any sequence X with parameter k, our most general result shows that Greedy achieves the cost n*2(Α(n))O(k) where Α is the inverse Ackermann function. Furthermore, a broad subclass of parameter-k sequences has a natural combinatorial interpretation as k-decomposable sequences. For this class of inputs, we obtain an n*2O(k) bound for Greedy when preprocessing is allowed. For k = 3, these results imply (i) and (ii). To our knowledge, these are the first upper bounds for Greedy that are not known to hold for any other online BST. To obtain these results we identify an input-revealing property of Greedy. Informally, this means that the execution log partially reveals the structure of the access sequence. This property facilitates the use of rich technical tools from forbidden sub matrix theory. Further studying the intrinsic complexity of k-decomposable sequences, we make several observations. First, in order to obtain an offline optimal BST, it is enough to bound Greedy on non-decomposable access sequences. Furthermore, we show that the optimal cost for k-decomposable sequences is Theta(n log k), which is well below the proven performance of all known BST algorithms. Hence, sequences in this class can be seen as a candidate counterexample to dynamic optimality." @default.
• W1956214747 created "2016-06-24" @default.
• W1956214747 creator A5010547647 @default.
• W1956214747 creator A5010961023 @default.
• W1956214747 creator A5016828567 @default.
• W1956214747 creator A5065214797 @default.
• W1956214747 creator A5080620426 @default.
• W1956214747 date "2015-10-01" @default.
• W1956214747 modified "2023-10-02" @default.
• W1956214747 title "Pattern-Avoiding Access in Binary Search Trees" @default.
• W1956214747 cites W1553603221 @default.
• W1956214747 cites W1624114741 @default.
• W1956214747 cites W166539567 @default.
• W1956214747 cites W1747890423 @default.
• W1956214747 cites W1768195728 @default.
• W1956214747 cites W1924246083 @default.
• W1956214747 cites W1956214747 @default.
• W1956214747 cites W1972748018 @default.
• W1956214747 cites W1991146548 @default.
• W1956214747 cites W1994055767 @default.
• W1956214747 cites W1998902257 @default.
• W1956214747 cites W2007311757 @default.
• W1956214747 cites W2016857845 @default.
• W1956214747 cites W2017619076 @default.
• W1956214747 cites W2017788080 @default.
• W1956214747 cites W2044155041 @default.
• W1956214747 cites W2068373264 @default.
• W1956214747 cites W2077866342 @default.
• W1956214747 cites W2078913074 @default.
• W1956214747 cites W2083354900 @default.
• W1956214747 cites W2091015960 @default.
• W1956214747 cites W2092885083 @default.
• W1956214747 cites W2114313475 @default.
• W1956214747 cites W2130055503 @default.
• W1956214747 cites W4238690014 @default.
• W1956214747 cites W4238935418 @default.
• W1956214747 cites W4242724277 @default.
• W1956214747 cites W4256485853 @default.
• W1956214747 doi "https://doi.org/10.1109/focs.2015.32" @default.
• W1956214747 hasPublicationYear "2015" @default.
• W1956214747 type Work @default.
• W1956214747 sameAs 1956214747 @default.
• W1956214747 citedByCount "19" @default.
• W1956214747 countsByYear W19562147472015 @default.
• W1956214747 countsByYear W19562147472018 @default.
• W1956214747 countsByYear W19562147472019 @default.
• W1956214747 countsByYear W19562147472020 @default.
• W1956214747 countsByYear W19562147472021 @default.
• W1956214747 countsByYear W19562147472022 @default.
• W1956214747 countsByYear W19562147472023 @default.
• W1956214747 crossrefType "proceedings-article" @default.
• W1956214747 hasAuthorship W1956214747A5010547647 @default.
• W1956214747 hasAuthorship W1956214747A5010961023 @default.
• W1956214747 hasAuthorship W1956214747A5016828567 @default.
• W1956214747 hasAuthorship W1956214747A5065214797 @default.
• W1956214747 hasAuthorship W1956214747A5080620426 @default.
• W1956214747 hasBestOaLocation W19562147472 @default.
• W1956214747 hasConcept C11413529 @default.
• W1956214747 hasConcept C114614502 @default.
• W1956214747 hasConcept C118615104 @default.
• W1956214747 hasConcept C134306372 @default.
• W1956214747 hasConcept C140745168 @default.
• W1956214747 hasConcept C163797641 @default.
• W1956214747 hasConcept C177264268 @default.
• W1956214747 hasConcept C181789720 @default.
• W1956214747 hasConcept C197855036 @default.
• W1956214747 hasConcept C199360897 @default.
• W1956214747 hasConcept C2333172 @default.
• W1956214747 hasConcept C27628562 @default.
• W1956214747 hasConcept C2778112365 @default.
• W1956214747 hasConcept C2780990831 @default.
• W1956214747 hasConcept C33923547 @default.
• W1956214747 hasConcept C41008148 @default.
• W1956214747 hasConcept C48372109 @default.
• W1956214747 hasConcept C54355233 @default.
• W1956214747 hasConcept C77553402 @default.
• W1956214747 hasConcept C84927040 @default.
• W1956214747 hasConcept C86803240 @default.
• W1956214747 hasConcept C91154448 @default.
• W1956214747 hasConcept C94375191 @default.
• W1956214747 hasConceptScore W1956214747C11413529 @default.
• W1956214747 hasConceptScore W1956214747C114614502 @default.
• W1956214747 hasConceptScore W1956214747C118615104 @default.
• W1956214747 hasConceptScore W1956214747C134306372 @default.
• W1956214747 hasConceptScore W1956214747C140745168 @default.
• W1956214747 hasConceptScore W1956214747C163797641 @default.
• W1956214747 hasConceptScore W1956214747C177264268 @default.
• W1956214747 hasConceptScore W1956214747C181789720 @default.
• W1956214747 hasConceptScore W1956214747C197855036 @default.
• W1956214747 hasConceptScore W1956214747C199360897 @default.
• W1956214747 hasConceptScore W1956214747C2333172 @default.
• W1956214747 hasConceptScore W1956214747C27628562 @default.
• W1956214747 hasConceptScore W1956214747C2778112365 @default.
• W1956214747 hasConceptScore W1956214747C2780990831 @default.
• W1956214747 hasConceptScore W1956214747C33923547 @default.
• W1956214747 hasConceptScore W1956214747C41008148 @default.
• W1956214747 hasConceptScore W1956214747C48372109 @default.
• W1956214747 hasConceptScore W1956214747C54355233 @default.
• W1956214747 hasConceptScore W1956214747C77553402 @default.
• W1956214747 hasConceptScore W1956214747C84927040 @default.

• next