Suchergebnisse - encoding (Algorithm OR Algorithmic)

Parameterized Algorithms for the Drone Delivery Problem von Bartlmae, Simon, Hene, Andreas, Könen, Joshua, Röglin, Heiko

Inhaltsangabe: “… polynomially encodable factor $a(n)$, unless P=NP. Additionally, we identify the intersection graph …”
Volltext

Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval von Becht, Matthias, Lehmann, Hans-Peter, Sanders, Peter

Inhaltsangabe: “… answer membership queries, so it does not have to encode S. The information theoretic space lower bound …”
Volltext

Optimal-Time Mapping in Run-Length Compressed PBWT von Bonizzoni, Paola, Cozzi, Davide, Gao, Younan

Inhaltsangabe: “… . Although the run-length encoded variant of the PBWT (also known as the $μ$-PBWT) achieves $O(\newR)$-word …”
Volltext

DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis von Narvaez, Alexander

Inhaltsangabe: “… principle: each integer key simultaneously encodes its value and its canonical position in the ordered …”
Volltext

Random Wheeler Automata von Becker, Ruben, Cenzato, Davide, Kim, Sung-Hwan, Kodric, Bojana, Maso, Riccardo, Prezza, Nicola

Inhaltsangabe: “… of distinct WDFAs and obtain that $ nσ+ (n - σ) \log σ$ bits are necessary and sufficient to encode a WDFA …”
Volltext

Lower Bounds for Matroid Optimization Problems with a Linear Constraint von Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

Inhaltsangabe: “… ), and show that the same results hold when the matroids are encoded as part of the input, assuming $P \neq NP …”
Volltext

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding von Hermann, Stefan, Lehmann, Hans-Peter, Pibiri, Giulio Ermanno, Sanders, Peter, Walzer, Stefan

Inhaltsangabe: “… throughput for space efficient configurations in practice. Our second contribution is a novel encoding scheme …”
Volltext

Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries von Kempa, Dominik, Kociumaka, Tomasz

Inhaltsangabe: “… the array cannot be stored explicitly. The suffix array $SA_T[1..n]$ of a text $T$ of length $n$ encodes …”
Volltext

Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework von Sena, Francisco, Politov, Aleksandr, Moumard, Corentin, Cairo, Massimo, Rizzi, Romeo, Cáceres, Manuel, Schmidt, Sebastian, Harviainen, Juha, Tomescu, Alexandru I.

Inhaltsangabe: “… in the graph. We employ the well-known SPQR-tree decomposition, which encodes all 2-separators of a biconnected …”
Volltext

Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings von Hammer, Nina, Kammer, Frank, Meintrup, Johannes

Inhaltsangabe: “… for any fixed graph $H$. This allows us to construct the succinct encoding scheme for $H$-minor-free …”
Volltext

Multi-dimensional Approximate Counting von Wang, Dingyu

Inhaltsangabe: “… . The upper bound is constructed with a certain variable-length integer encoding and the lower bound …”
Volltext

Finite Pinwheel Scheduling: the k-Visits Problem von Kanellopoulos, Sotiris, Pergaminelis, Christos, Kokkou, Maria, Markou, Euripides, Pagourtzis, Aris

Inhaltsangabe: “… -complete, it remains open whether Pinwheel Scheduling is NP-hard (unless a compact input encoding is used …”
Volltext

R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies von Kimura, Kotaro, I, Tomohiro

Inhaltsangabe: “… the run-length encoded BWT (RLBWT) of $T$, r-enum runs in $O(n \log \log_{w} (n/r))$ time in addition …”
Volltext

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations von Brown, Nathaniel K., Langmead, Ben

Inhaltsangabe: “… balancing. An $O(r)$-time and $O(r)$-space construction lets us apply the method to run-length encoded BWT …”
Volltext

Efficient Streaming Algorithms for Two-Dimensional Congruence Testing and Geometric Hashing von Chang, Yen-Cheng, Cheung, Tsun Ming, Tsai, Meng-Tsung, Wu, Ting-An

Inhaltsangabe: “… of compactly encoding multiple point sets for efficient congruence queries. Despite its wide applications, both …”
Volltext

Succinct Data Structure for Graphs with $d$-Dimensional $t$-Representation von Balakrishnan, Girish, Chakraborty, Sankardeep, Jo, Seungbum, Narayanaswamy, N S, Sadakane, Kunihiko

Inhaltsangabe: “… structure for encoding an arbitrary graph that belongs to $\mathcal{G}_{t,d}$. We then present a $((2dt-1 …”
Volltext

Fine Grained Lower Bounds for Multidimensional Knapsack von Doron-Arad, Ilan, Kulik, Ariel, Manurangsi, Pasin

Inhaltsangabe: “… parameter and $n$ is the encoding size. Despite decades of active research, the best running time of a PTAS …”
Volltext

Compressing Dynamic Fully Indexable Dictionaries in Word-RAM von Domingues, Gabriel Marques

Inhaltsangabe: “… model using space close to the information-theoretic lower bound. A FID is a data-structure that encodes …”
Volltext

Succinct Encodings of Binary Trees with Application to AVL Trees von Chizewer, Jeremy, Melczer, Stephen, Munro, J. Ian, Pun, Ava

Inhaltsangabe: “… $0.938$ bits per node to encode.  …”
Volltext

Space Complexity of Vertex Connectivity Oracles von Pettie, Seth, Saranurak, Thatchaphol, Yin, Longhui

Inhaltsangabe: “… and Nutov shows that a data structure of total size $\tilde{O}(kn)$ can even be encoded as a $\tilde{O}(k …”
Volltext