FRINK Linked Data Fragments server

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

• W758438229 abstract "Efficient sorting and searching are corner-stones in algorithm design. In computer science it has become a deep-rooted habit to use comparison-based methods to solve these problems. In this thesis we argue that radix sorting and searching algorithms are superior in many respects, both practical and theoretical. They are often remarkably simple and many, if not most, sorting and searching problems may be cast in a form suitable for such algorithms.In particular, we show that string sorting can be reduced to integer sorting in optimal asymptotic time and we show that a unit-cost RAM with a word length of w bits can sort n word-sized integers in O(n log log n) time for arbitrary w >= log n, a significantly improved upper bound for sorting. The algorithm is simple and runs surprisingly fast also in practice.We introduce a new practical radix sorting algorithm, Forward radixsort, that combines the advantages of traditional LSD and MSD radixsort in a simple way. Adding a preprocessing step to Forward radixsort we obtain an algorithm with interesting theoretical properties. For example, if B / n = O(w), where B is the minimum number of bits that must be inspected to distinguish the strings, it is possible to sort n binary strings in O(n log(B / n log n)) time. The result can also be expressed in terms of the entropy H per bit of the input: n strings from a stationary ergodic process can be sorted in O(n log (1 / H)) time. We implement some of the new radix sorting algorithms in the C programming language and achieve sorting routines that run significantly faster than previously presented string sorting routines.The other theme of the thesis is a new compression technique, level compression, for trie structures. A level-compressed trie, or LC-trie, is easy to implement and inherits the good properties of standard tries with respect to neighbor and range searches, while the average depth is significantly decreased. The expected average depth of an element in an LC-trie is proportional to the iterated logarithm function for uniformly distributed data and proportional to log log n for data from a Bernoulli-type distribution.We also study the problem of string searching using suffix trees. Combining the methods of path compression, level compression, and data compression we achieve an efficient, compact, and fast implementation of a suffix tree. Based on extensive simulations, we argue that this new data structure is useful in many practical situations. For example, it can be used to reduce the number of accesses to secondary memory when searching in very large sets of data." @default.
• W758438229 created "2016-06-24" @default.
• W758438229 creator A5079477807 @default.
• W758438229 date "1996-01-01" @default.
• W758438229 modified "2023-09-24" @default.
• W758438229 title "Radix Sorting & Searching" @default.
• W758438229 cites W1485516007 @default.
• W758438229 cites W1506181463 @default.
• W758438229 cites W1529849411 @default.
• W758438229 cites W1559718699 @default.
• W758438229 cites W1563264900 @default.
• W758438229 cites W1571265267 @default.
• W758438229 cites W1593096882 @default.
• W758438229 cites W1655990431 @default.
• W758438229 cites W1976258582 @default.
• W758438229 cites W1985361644 @default.
• W758438229 cites W1992439437 @default.
• W758438229 cites W1992470151 @default.
• W758438229 cites W1998556530 @default.
• W758438229 cites W1999447420 @default.
• W758438229 cites W1999813096 @default.
• W758438229 cites W2011398297 @default.
• W758438229 cites W2012960842 @default.
• W758438229 cites W2017493520 @default.
• W758438229 cites W2018795275 @default.
• W758438229 cites W2023290740 @default.
• W758438229 cites W2023807842 @default.
• W758438229 cites W2031227655 @default.
• W758438229 cites W2033639590 @default.
• W758438229 cites W2036797527 @default.
• W758438229 cites W2043879303 @default.
• W758438229 cites W2046569047 @default.
• W758438229 cites W2050576295 @default.
• W758438229 cites W2051049045 @default.
• W758438229 cites W2052207834 @default.
• W758438229 cites W2059619336 @default.
• W758438229 cites W2060108852 @default.
• W758438229 cites W2065493100 @default.
• W758438229 cites W2070991879 @default.
• W758438229 cites W2071381739 @default.
• W758438229 cites W2074286662 @default.
• W758438229 cites W2091851562 @default.
• W758438229 cites W2121252285 @default.
• W758438229 cites W2125712182 @default.
• W758438229 cites W2129652681 @default.
• W758438229 cites W2141389982 @default.
• W758438229 cites W2149468555 @default.
• W758438229 cites W2152506638 @default.
• W758438229 cites W2157718155 @default.
• W758438229 cites W2158874082 @default.
• W758438229 cites W2165621523 @default.
• W758438229 cites W2295428206 @default.
• W758438229 cites W2337480916 @default.
• W758438229 cites W2611071497 @default.
• W758438229 cites W2993383518 @default.
• W758438229 hasPublicationYear "1996" @default.
• W758438229 type Work @default.
• W758438229 sameAs 758438229 @default.
• W758438229 citedByCount "8" @default.
• W758438229 crossrefType "dissertation" @default.
• W758438229 hasAuthorship W758438229A5079477807 @default.
• W758438229 hasConcept C106301342 @default.
• W758438229 hasConcept C108094655 @default.
• W758438229 hasConcept C111472728 @default.
• W758438229 hasConcept C111696304 @default.
• W758438229 hasConcept C11413529 @default.
• W758438229 hasConcept C114614502 @default.
• W758438229 hasConcept C118615104 @default.
• W758438229 hasConcept C121332964 @default.
• W758438229 hasConcept C138885662 @default.
• W758438229 hasConcept C157486923 @default.
• W758438229 hasConcept C199360897 @default.
• W758438229 hasConcept C2780586882 @default.
• W758438229 hasConcept C311688 @default.
• W758438229 hasConcept C33923547 @default.
• W758438229 hasConcept C37914503 @default.
• W758438229 hasConcept C41008148 @default.
• W758438229 hasConcept C62520636 @default.
• W758438229 hasConcept C63553672 @default.
• W758438229 hasConcept C88548561 @default.
• W758438229 hasConcept C94375191 @default.
• W758438229 hasConcept C97137487 @default.
• W758438229 hasConceptScore W758438229C106301342 @default.
• W758438229 hasConceptScore W758438229C108094655 @default.
• W758438229 hasConceptScore W758438229C111472728 @default.
• W758438229 hasConceptScore W758438229C111696304 @default.
• W758438229 hasConceptScore W758438229C11413529 @default.
• W758438229 hasConceptScore W758438229C114614502 @default.
• W758438229 hasConceptScore W758438229C118615104 @default.
• W758438229 hasConceptScore W758438229C121332964 @default.
• W758438229 hasConceptScore W758438229C138885662 @default.
• W758438229 hasConceptScore W758438229C157486923 @default.
• W758438229 hasConceptScore W758438229C199360897 @default.
• W758438229 hasConceptScore W758438229C2780586882 @default.
• W758438229 hasConceptScore W758438229C311688 @default.
• W758438229 hasConceptScore W758438229C33923547 @default.
• W758438229 hasConceptScore W758438229C37914503 @default.
• W758438229 hasConceptScore W758438229C41008148 @default.
• W758438229 hasConceptScore W758438229C62520636 @default.
• W758438229 hasConceptScore W758438229C63553672 @default.

• next