Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Frederik Rye Skjoldjensen"'
Publikováno v:
Theoretical Computer Science. 905:99-105
We consider the classic partial sums problem on the ultra-wide word RAM model of computation. This model extends the classic $w$-bit word RAM model with special ultrawords of length $w^2$ bits that support standard arithmetic and boolean operation an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2d92928714b0f6200eb94b2baa24ce2
https://doi.org/10.1016/j.tcs.2022.01.002
https://doi.org/10.1016/j.tcs.2022.01.002
Autor:
Hjalte Wedel Vildhøj, Søren Vind, Anders Roy Christiansen, Frederik Rye Skjoldjensen, Patrick Hagge Cording, Inge Li Gørtz, Philip Bille
Publikováno v:
Bille, P, Christiansen, A R, Cording, P H, Gørtz, I L, Skjoldjensen, F R, Vildhøj, H W & Vind, S 2018, ' Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation ', Algorithmica, vol. 80, no. 11, pp. 3207-3224 . https://doi.org/10.1007/s00453-017-0380-7
Given a static reference string R and a source string S, a relative compression of S with respect to R is an encoding of S as a sequence of references to substrings of R. Relative compression schemes are a classic model of compression and have recent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df5a40c8e46e30e315d15cf619683274
https://doi.org/10.1007/s00453-017-0380-7
https://doi.org/10.1007/s00453-017-0380-7
Publikováno v:
Bille, P, Gørtz, I L & Skjoldjensen, F R 2017, ' Subsequence automata with default transitions ', Journal of Discrete Algorithms, vol. 44, pp. 48-55 . https://doi.org/10.1016/j.jda.2017.05.001
Let $S$ be a string of length $n$ with characters from an alphabet of size $\sigma$. The \emph{subsequence automaton} of $S$ (often called the \emph{directed acyclic subsequence graph}) is the minimal deterministic finite automaton accepting all subs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b20eeea91c2af2b4dd1660e4cbbd5d87
https://doi.org/10.1016/j.jda.2017.05.001
https://doi.org/10.1016/j.jda.2017.05.001
Publikováno v:
String Processing and Information Retrieval ISBN: 9783319674278
SPIRE
SPIRE
We consider the well-studied partial sums problem in succint space where one is to maintain an array of n k-bit integers subject to updates such that partial sums queries can be efficiently answered. We present two succint versions of the Fenwick Tre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34af5139448d43f3912dea0ce43f255a
http://hdl.handle.net/11385/194131
http://hdl.handle.net/11385/194131
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662491911
SOFSEM
SOFSEM
Let S be a string of length n with characters from an alphabet of size $$\sigma $$. The subsequence automaton of S often called the directed acyclic subsequence graph is the minimal deterministic finite automaton accepting all subsequences of S. A st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::607f1010c0eae027ee2c62324d8de9ba
https://doi.org/10.1007/978-3-662-49192-8_17
https://doi.org/10.1007/978-3-662-49192-8_17