Image de couverture de livre

Permutation patterns in streams

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Berendsohn, Benjamin Aram
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal antimatroid sorting
par: Berendsohn, Benjamin Aram
Publié: (2025)

Fast and simple unrooted dynamic forests
par: Berendsohn, Benjamin Aram
Publié: (2023)

Universally Optimal Decremental Tree Minima
par: Berendsohn, Benjamin Aram
Publié: (2026)

Optimization with pattern-avoiding input
par: Berendsohn, Benjamin Aram, et autres
Publié: (2023)

Fast decremental tree sums in forests
par: Berendsohn, Benjamin Aram, et autres
Publié: (2026)

Balanced TSP partitioning
par: Berendsohn, Benjamin Aram, et autres
Publié: (2025)

Inapproximability of Counting Permutation Patterns
par: Opler, Michal
Publié: (2026)

Greedy BST on Permutation Initial Tree
par: Pareek, Akash
Publié: (2024)

Optimal Distance Labeling for Permutation Graphs
par: Gawrychowski, Paweł, et autres
Publié: (2024)

Succinct Data Structures for Baxter Permutation and Related Families
par: Chakraborty, Sankardeep, et autres
Publié: (2024)

Engineering Semi-streaming DFS algorithms
par: Bhagavan, Kancharla Nikhilesh, et autres
Publié: (2024)

Testing frequency distributions in a stream
par: Mathieu, Claire, et autres
Publié: (2023)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
par: Bampis, Evripidis, et autres
Publié: (2025)

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations
par: Brown, Nathaniel K., et autres
Publié: (2026)

Counting Permutation Patterns with Multidimensional Trees
par: Beniamini, Gal, et autres
Publié: (2024)

SimiSketch: Efficiently Estimating Similarity of streaming Multisets
par: Dong, Fenghao, et autres
Publié: (2024)

Faster Semi-streaming Matchings via Alternating Trees
par: Mitrović, Slobodan, et autres
Publié: (2024)

Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing
par: Uroić, Leon Stjepan, et autres
Publié: (2026)

Downstream: efficient cross-platform algorithms for fixed-capacity stream downsampling
par: Yang, Connor, et autres
Publié: (2025)

Efficient stream-based Max-Min diversification with minimal failure rate
par: Kalogeratos, Argyris, et autres
Publié: (2020)

Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
par: Velusamy, Santhoshini, et autres
Publié: (2025)

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
par: Clifford, Peter, et autres
Publié: (2026)

Improved Algorithm for Permutation Testing
par: Zhang, Xiaojin
Publié: (2020)

Near-optimal streaming approximation for Max-DICUT in sublinear space using two passes
par: Velusamy, Santhoshini
Publié: (2025)

Approximate counting of permutation patterns
par: Ben-Eliezer, Omri, et autres
Publié: (2024)

Sampling Permutations with Cell Probes is Hard
par: Alekseev, Yaroslav, et autres
Publié: (2025)

Compact representations of pattern-avoiding permutations
par: Kozma, László, et autres
Publié: (2025)

Simple Construction of Greedy Trees and Greedy Permutations
par: Chubet, Oliver, et autres
Publié: (2024)

Faster two-dimensional pattern matching with $k$ mismatches
par: Ellert, Jonas, et autres
Publié: (2024)

On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
par: Kuschner, Jordan, et autres
Publié: (2024)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
par: Nerem, Robert R., et autres
Publié: (2024)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
par: Alejandro-Soto, J. A., et autres
Publié: (2025)

Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
par: Courtney, Joshua M.
Publié: (2026)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
par: Bai, Tian, et autres
Publié: (2026)

Efficient Identification of Permutation Symmetries in Many-Body Hamiltonians via Graph Theory
par: Shah, Saumya, et autres
Publié: (2025)

Clustering Permutations: New Techniques with Streaming Applications
par: Chakraborty, Diptarka, et autres
Publié: (2022)

Tight bounds for stream decodable error-correcting codes
par: Gupta, Meghal, et autres
Publié: (2024)

Permutation Matching Under Parikh Budgets: Linear-Time Detection, Packing, and Disjoint Selection
par: Shanto, MD Nazmul Alam, et autres
Publié: (2026)

Nine lower bound conjectures on streaming approximation algorithms for CSPs
par: Singer, Noah G.
Publié: (2025)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
par: Harada, Tsubasa
Publié: (2024)