BSuccinct: Rust libraries and programs focused on succinct data structures

Autor: Piotr Beling

Publikováno v: SoftwareX, Vol 26, Iss , Pp 101681- (2024)

BSuccinct is a collection of software focused on compact and succinct data structures that are both space and time efficient. It is written in Rust, a programming language well suited for scientific applications due to its emphasis on reliability and

Externí odkaz: https://doaj.org/article/059e104671dc4e21b517fb6f66cc2fdd

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Dynamic Distributed Multi-Path Aided Load Balancing for Optical Data Center Networks

Autor: Qi Zhang, Fu Wang, Ran Gao, Jingjing Wang, Haipeng Yao, Mohsen Guizani, Dong Guo

Publikováno v: IEEE Transactions on Network and Service Management. 19:991-1005

Benefiting from dense connections in data center networks (DCNs), load balancing algorithms are capable of steering traffic into multiple paths for the sake of preventing traffic congestion. However, given each path’s time-varying and asymmetrical

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::eaec31ac8b4915947d9ed2f312a1568a
https://doi.org/10.1109/tnsm.2021.3125307

PTHash: Revisiting FCH Minimal Perfect Hashing

Autor: Giulio Ermanno Pibiri, Roberto Trani

Publikováno v: SIGIR
ACM Conference on Research and Development in Information Retrieval, Canada, Montreal (Virtual Event), 11-15/07/2021
info:cnr-pdr/source/autori:Pibiri G.M.; Trani R./congresso_nome:ACM Conference on Research and Development in Information Retrieval/congresso_luogo:Canada, Montreal (Virtual Event)/congresso_data:11-15%2F07%2F2021/anno:2021/pagina_da:/pagina_a:/intervallo_pagine
SIGIR '21-44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1339–1348, Canada, Montreal (Virtual Event), 11-15/07/2021

Given a set $S$ of $n$ distinct keys, a function $f$ that bijectively maps the keys of $S$ into the range $\{0,\ldots,n-1\}$ is called a minimal perfect hash function for $S$. Algorithms that find such functions when $n$ is large and retain constant

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6552a0b92949d9a27a800e03147796cd
https://doi.org/10.1145/3404835.3462849

An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel

Autor: Jaikumar Radhakrishnan, Venkatesan Guruswami Carnegie, Marco Dalai

Publikováno v: ISIT

We prove a new, improved upper bound on the size of codes C ⊆{1, 2, 3, 4}n with the property that every four distinct codewords in C have a coordinate where they all differ. Specifically, we show that such a code has size at most 26n/19 +o(n), or e

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d89d5f27feb32c61b561f3205213484
https://doi.org/10.1109/tit.2019.2933424