Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Theory of computation → Data structures design and analysis"'
The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint has been in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5745a0fd32557344ffaa2ca59c6b0725
http://arxiv.org/abs/2305.00122
http://arxiv.org/abs/2305.00122
A finite group of order $n$ can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order $n$ can be stored using $O(n^2)$ words and can be used to answer a multiplication query in constant time. It is interesting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd54375113e776d1340a47e003b317ea
http://arxiv.org/abs/2303.01957
http://arxiv.org/abs/2303.01957
Autor:
Shahrokhi, Hesam, Shaikhha, Amir
In recent years, the increasing demand for high-performance analytics on big data has led the research on batch hash tables. It is shown that this type of hash table can benefit from the cache locality and multi-threading more than ordinary hash tabl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1eb50294866ab950c0f08105a4d315e2
LIPIcs, Volume 253, OPODIS 2022, Complete Volume
LIPIcs, Vol. 253, 26th International Conference on Principles of Distributed Systems (OPODIS 2022), pages 1-536
LIPIcs, Vol. 253, 26th International Conference on Principles of Distributed Systems (OPODIS 2022), pages 1-536
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea9dcd913c7341ecb66b2397db2a5682
https://drops.dagstuhl.de/opus/volltexte/2023/17619/
https://drops.dagstuhl.de/opus/volltexte/2023/17619/
Autor:
Bilò, Davide, Choudhary, Keerti, Cohen, Sarel, Friedrich, Tobias, Krogmann, Simon, Schirneck, Martin
We study the problem of estimating the $ST$-diameter of a graph that is subject to a bounded number of edge failures. An $f$-edge fault-tolerant $ST$-diameter oracle ($f$-FDO-$ST$) is a data structure that preprocesses a given graph $G$, two sets of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::087621af55cef08ca54db55769a49d62
Autor:
Geerts, Floris, Vandevoort, Brecht
LIPIcs, Volume 255, ICDT 2023, Complete Volume
LIPIcs, Vol. 255, 26th International Conference on Database Theory (ICDT 2023), pages 1-466
LIPIcs, Vol. 255, 26th International Conference on Database Theory (ICDT 2023), pages 1-466
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::293fb00994779f2d5c23730505bad861
Autor:
Fatourou, Panagiota
Non-Volatile Memory (NVM) is an emerging memory technology which aims to address the high computational demands of modern applications and support recovery from crashes. Recovery ensures that after a crash every executed operation is able to recover
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bcf15a648a14129f8039b5fe0248e2a6
Autor:
Bille, Philip, Fischer, Johannes, Gørtz, Inge Li, Pedersen, Max Rishøj, Stordalen, Tord Joakim
Publikováno v:
Bille, P, Fischer, J, Gørtz, I L, Pedersen, M R & Stordalen, T J 2023, Sliding Window String Indexing in Streams . in Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023) . vol. 259, 4, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 34th Annual Symposium on Combinatorial Pattern Matching, Marne-la-Vallée, France, 26/06/2023 . https://doi.org/10.4230/LIPIcs.CPM.2023.4
Given a string S over an alphabet Σ, the string indexing problem is to preprocess S to subsequently support efficient pattern matching queries, that is, given a pattern string P report all the occurrences of P in S. In this paper we study the stream
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::526a86821b5651867026782252a3d2d8
https://orbit.dtu.dk/en/publications/f7439191-973c-4975-8523-495fd16aa336
https://orbit.dtu.dk/en/publications/f7439191-973c-4975-8523-495fd16aa336
Autor:
Navarro, Gonzalo
We describe two success stories on the application of compact data structures (cds) to solve the problem of the excessively redundant space requirements posed by worst-case-optimal (wco) algorithms for multijoins in databases, and particularly basic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::221503902b11b614f21bee339870d0a8
Autor:
Rotenberg, Eva
In dynamic data structures, one is interested in efficiently facilitating queries to a data set, while being able to efficiently perform updates as the data set undergoes changes. Often, relaxing the efficiency measure to the amortised setting allows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54e2a787294db18a0ddde603613c7547