Copertina

How many users have been here for a long time? Efficient solutions for counting long aggregated visits

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Afshani, Peyman, Chowdhury, Rezaul, Gørtz, Inge Li, Goswami, Mayank, Silvestri, Francesco, Tognon, Mariafiore
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
di: Ashvinkumar, Vikrant, et al.
Pubblicazione: (2025)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
di: Afshani, Peyman, et al.
Pubblicazione: (2026)

Succinct Data Structures for Segments
di: Bille, Philip, et al.
Pubblicazione: (2024)

Improved Extended Regular Expression Matching
di: Bille, Philip, et al.
Pubblicazione: (2025)

Fast Practical Compression of Deterministic Finite Automata
di: Bille, Philip, et al.
Pubblicazione: (2023)

String Indexing with Compressed Patterns
di: Bille, Philip, et al.
Pubblicazione: (2019)

Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
di: Bille, Philip, et al.
Pubblicazione: (2024)

Compressed Dictionary Matching on Run-Length Encoded Strings
di: Bille, Philip, et al.
Pubblicazione: (2025)

String Indexing for Top-$k$ Close Consecutive Occurrences
di: Bille, Philip, et al.
Pubblicazione: (2020)

Differentially Private Substring and Document Counting with Near-Optimal Error
di: Bernardini, Giulia, et al.
Pubblicazione: (2024)

Differentially Private Release of Hierarchical Origin/Destination Data with a TopDown Approach
di: Boninsegna, Fabrizio, et al.
Pubblicazione: (2024)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
di: Bille, Philip, et al.
Pubblicazione: (2022)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
di: Goswami, Mayank, et al.
Pubblicazione: (2022)

The Fine-Grained Complexity of Episode Matching
di: Bille, Philip, et al.
Pubblicazione: (2021)

MOMENTI: Scalable Motif Mining in Multidimensional Time Series
di: Ceccarello, Matteo, et al.
Pubblicazione: (2025)

Dimensionality Reduction on Complex Vector Spaces for Euclidean Distance with Dynamic Weights
di: Moretti, Simone, et al.
Pubblicazione: (2022)

Differentially Private High-Dimensional Approximate Range Counting, Revisited
di: Aumüller, Martin, et al.
Pubblicazione: (2024)

An Optimal Algorithm for Stochastic Vertex Cover
di: Brand, Jan van den, et al.
Pubblicazione: (2026)

Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm
di: Mikkelstrup, Christian Møller, et al.
Pubblicazione: (2026)

KeBaB: $k$-mer based breaking for finding long MEMs
di: Brown, Nathaniel K., et al.
Pubblicazione: (2025)

Data reduction for directed feedback vertex set on graphs without long induced cycles
di: Dirks, Jona, et al.
Pubblicazione: (2023)

Efficient algorithm for linear diophantine equations in two variables
di: Deora, Mayank, et al.
Pubblicazione: (2025)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
di: Austrin, Per, et al.
Pubblicazione: (2024)

Erdős-Gyárfás conjecture on graphs without long induced paths
di: Hegde, Anand Shripad, et al.
Pubblicazione: (2024)

QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
di: Bonnet, Édouard, et al.
Pubblicazione: (2026)

Cycles with many chords
di: Nemanja Draganić, et al.
Pubblicazione: (2024)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
di: Czyżewska, Jadwiga, et al.
Pubblicazione: (2025)

Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2025)

Computing Diverse and Nice Triangulations
di: Gálvez, Waldo, et al.
Pubblicazione: (2025)

An $O(n^3)$ time algorithm for the maximum-weight limited-capacity many-to-many matching
di: Rajabi-Alni, Fatemeh, et al.
Pubblicazione: (2014)

Max Weight Independent Set in sparse graphs with no long claws
di: Abrishami, Tara, et al.
Pubblicazione: (2023)

2-Approximation for Prize-Collecting Steiner Forest
di: Ahmadi, Ali, et al.
Pubblicazione: (2023)

Breaking a Long-Standing Barrier: 2-$\varepsilon$ Approximation for Steiner Forest
di: Ahmadi, Ali, et al.
Pubblicazione: (2025)

Prize-Collecting Forest with Submodular Penalties: Improved Approximation
di: Ahmadi, Ali, et al.
Pubblicazione: (2025)

Prize-Collecting Steiner Tree: A 1.79 Approximation
di: Ahmadi, Ali, et al.
Pubblicazione: (2024)

Approximate counting of permutation patterns
di: Ben-Eliezer, Omri, et al.
Pubblicazione: (2024)

Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
di: Banihashem, Kiarash, et al.
Pubblicazione: (2025)

Simple and efficient four-cycle counting on sparse graphs
di: Burkhardt, Paul, et al.
Pubblicazione: (2023)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
di: Dhar, Saurav, et al.
Pubblicazione: (2024)

Testable algorithms for approximately counting edges and triangles in sublinear time and space
di: Eden, Talya, et al.
Pubblicazione: (2025)