Imagen de Portada

Faster optimal univariate microgaggregation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Stamm, Felix I., Schaub, Michael T.
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

Efficient Sampling of Temporal Networks with Preserved Causality Structure
por: Stamm, Felix I., et al.
Publicado: (2025)

Diameter Computation on (Random) Geometric Graphs
por: Bläsius, Thomas, et al.
Publicado: (2026)

Faster Algorithms for Graph Monopolarity
por: Philip, Geevarghese, et al.
Publicado: (2024)

Simple and Faster Algorithms for Knapsack
por: He, Qizheng, et al.
Publicado: (2023)

Faster Parameterized Vertex Multicut
por: Chu, Huairui, et al.
Publicado: (2026)

Faster Combinatorial k-Clique Algorithms
por: Abboud, Amir, et al.
Publicado: (2024)

Faster Pseudo-Deterministic Minimum Cut
por: Kenneth-Mordoch, Yotam
Publicado: (2026)

Faster Deterministic Streaming Vertex Coloring
por: Chechik, Shiri, et al.
Publicado: (2026)

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

Faster Global Minimum Cut with Predictions
por: Moseley, Benjamin, et al.
Publicado: (2025)

Faster Approximate Linear Matroid Intersection
por: Terao, Tatsuya
Publicado: (2026)

Faster Algorithms for Longest Common Substring
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2021)

Faster Algorithms for Dual-Failure Replacement Paths
por: Chechik, Shiri, et al.
Publicado: (2024)

Faster run-length compressed suffix arrays
por: Brown, Nathaniel K., et al.
Publicado: (2024)

3SUM in Preprocessed Universes: Faster and Simpler
por: Kasliwal, Shashwat, et al.
Publicado: (2024)

Faster Linear-Size And-Or Path and Adder Circuits
por: Brenner, Ulrich, et al.
Publicado: (2024)

A Faster Algorithm for Pigeonhole Equal Sums
por: Jin, Ce, et al.
Publicado: (2024)

Faster ED-String Matching with $k$ Mismatches
por: Gawrychowski, Paweł, et al.
Publicado: (2025)

Faster Algorithms for Shortest Unique or Absent Substrings
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2026)

Faster Algorithms for Text-to-Pattern Hamming Distances
por: Chan, Timothy M., et al.
Publicado: (2023)

A Faster Algorithm for Constrained Correlation Clustering
por: Fischer, Nick, et al.
Publicado: (2025)

Simpler and Faster Directed Low-Diameter Decompositions
por: Li, Jason
Publicado: (2025)

Faster Algorithm for Structured John Ellipsoid Computation
por: Cao, Yang, et al.
Publicado: (2022)

Faster Iterative $ϕ$ Queries on the Positional BWT
por: Bonizzoni, Paola, et al.
Publicado: (2026)

Faster parameterized algorithm for 3-Hitting Set
por: Tsur, Dekel
Publicado: (2025)

Faster Vizing and Near-Vizing Edge Coloring Algorithms
por: Assadi, Sepehr
Publicado: (2024)

Faster and Simpler Online Computation of String Net Frequency
por: Inenaga, Shunsuke
Publicado: (2024)

Faster feasibility for dynamic flows and transshipments on temporal networks
por: Sheridan, Kristin, et al.
Publicado: (2024)

Faster algorithms for packing forests in graphs and related problems
por: Arkhipov, Pavel, et al.
Publicado: (2024)

Faster Algorithms for Schatten-p Low Rank Approximation
por: Kacham, Praneeth, et al.
Publicado: (2024)

Faster Semi-streaming Matchings via Alternating Trees
por: Mitrović, Slobodan, et al.
Publicado: (2024)

Faster two-dimensional pattern matching with $k$ mismatches
por: Ellert, Jonas, et al.
Publicado: (2024)

Faster algorithms for k-Orthogonal Vectors in low dimension
por: Dürr, Anita, et al.
Publicado: (2025)

Adaptive Hashing: Faster Hash Functions with Fewer Collisions
por: Melis, Gábor
Publicado: (2026)

Faster All-Pairs Optimal Electric Car Routing
por: Dorfman, Dani, et al.
Publicado: (2025)

Faster Approximate Fixed Points of $\ell_\infty$-Contractions
por: Feodorov, Andrei, et al.
Publicado: (2026)

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation
por: Schwartz, Oded, et al.
Publicado: (2025)

Finding 4-Additive Spanners: Faster, Stronger, and Simpler
por: Qi, Chuhan
Publicado: (2025)

Faster Weak Expander Decompositions and Approximate Max Flow
por: Fleischmann, Henry, et al.
Publicado: (2025)

Faster MAX-CUT on Bounded Threshold Rank Graphs
por: Anderson, Prashanti, et al.
Publicado: (2025)