Imagen de Portada

Learning Partitions using Rank Queries

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chakrabarty, Deeparnab, Liao, Hang
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries
por: Beretta, Lorenzo, et al.
Publicado: (2025)

Fault-tolerant $k$-Supplier with Outliers
por: Chakrabarty, Deeparnab, et al.
Publicado: (2023)

A $d^{1/2+o(1)}$ Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids
por: Black, Hadley, et al.
Publicado: (2023)

Clustering in Varying Metrics
por: Chakrabarty, Deeparnab, et al.
Publicado: (2025)

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
por: Chakrabarty, Deeparnab, et al.
Publicado: (2024)

Counting hypertriangles through hypergraph orientations
por: Paul-Pena, Daniel, et al.
Publicado: (2026)

Range (Rényi) Entropy Queries and Partitioning
por: Esmailpour, Aryan, et al.
Publicado: (2023)

Ranking with Partitioning
por: Boardman, Samuel
Publicado: (2026)

Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
por: Ghosal, Angikar, et al.
Publicado: (2025)

Multi-Way Co-Ranking: Index-Space Partitioning of Sorted Sequences Without Merge
por: Joshi, Amit
Publicado: (2025)

Learning Partitions with Optimal Query and Round Complexities
por: Black, Hadley, et al.
Publicado: (2025)

Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries
por: Bishnu, Arijit, et al.
Publicado: (2025)

Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
por: Chakrabarty, Deeparnab, et al.
Publicado: (2025)

Capacitated Partition Vertex Cover and Partition Edge Cover
por: Dabas, Rajni, et al.
Publicado: (2025)

BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing
por: Pan, Yueyang, et al.
Publicado: (2025)

zSort: Stable Distribution Sort using Z-Score Partitioning
por: Jain, Hriday, et al.
Publicado: (2026)

Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation
por: Hellerstein, Lisa, et al.
Publicado: (2026)

Fast Construction of Partitioned Learned Bloom Filter with Theoretical Guarantees
por: Sato, Atsuki, et al.
Publicado: (2024)

Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
por: Räcke, Harald, et al.
Publicado: (2024)

Parameterizing Path Partitions
por: Fernau, Henning, et al.
Publicado: (2022)

Monotone Submodular Multiway Partition
por: Bi, Richard, et al.
Publicado: (2024)

Graph Partitioning With Limited Moves
por: Behbahani, Majid, et al.
Publicado: (2024)

Path Partitions of Phylogenetic Networks
por: Lafond, Manuel, et al.
Publicado: (2024)

Buffered Streaming Edge Partitioning
por: Chhabra, Adil, et al.
Publicado: (2024)

Partition-based Simple Heaps
por: Brodal, Gerth Stølting, et al.
Publicado: (2026)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
por: Anand, Aditya, et al.
Publicado: (2024)

Approximating Partition in Near-Linear Time
por: Chen, Lin, et al.
Publicado: (2024)

Tera-Scale Multilevel Graph Partitioning
por: Salwasser, Daniel, et al.
Publicado: (2024)

Faster Edge Coloring by Partition Sieving
por: Akmal, Shyan, et al.
Publicado: (2025)

A Note on Deterministic FPTAS for Partition
por: Chen, Lin, et al.
Publicado: (2025)

Weighted Partition Vertex and Edge Cover
por: Dabas, Rajni, et al.
Publicado: (2025)

Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries
por: Adar, Tomer, et al.
Publicado: (2024)

Partitioning Trillion Edge Graphs on Edge Devices
por: Chhabra, Adil, et al.
Publicado: (2024)

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
por: Xu, Chao, et al.
Publicado: (2026)

$\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Sum-of-Max Chain Partition of a Tree
por: Luo, Ruixi, et al.
Publicado: (2025)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
por: Shah, Vihan
Publicado: (2026)

QuadRank: Engineering a High Throughput Rank
por: Koerkamp, R. Groot
Publicado: (2026)

All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

String Partition for Building Long Burrows-Wheeler Transforms
por: Adler, Enno, et al.
Publicado: (2024)