Copertina

Efficient algorithms for collecting the statistics of large-scale IP address data

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, Hui, Cao, Yi, Cai, Zehan, Mao, Hua, Chen, Jie
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A parameterized algorithm for $K_r$-factors in graphs of high minimum degree
di: Gan, Luyining, et al.
Pubblicazione: (2023)

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
di: Björklund, Andreas, et al.
Pubblicazione: (2025)

Polynomial and analytic methods for classifying complexity of planar graph homomorphisms
di: Cai, Jin-Yi, et al.
Pubblicazione: (2024)

Learning complexity of gradient descent and conjugate gradient algorithms
di: Jiao, Xianqi, et al.
Pubblicazione: (2024)

Holant* Dichotomy on Domain Size 3: A Geometric Perspective
di: Cai, Jin-Yi, et al.
Pubblicazione: (2025)

Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
di: Arunachalam, Srinivasan, et al.
Pubblicazione: (2021)

Decision algorithms for reversibility of one-dimensional non-linear cellular automata under null boundary conditions
di: Junchi, Ma, et al.
Pubblicazione: (2024)

Planar Graph Homomorphisms: A Dichotomy and a Barrier from Quantum Groups
di: Cai, Jin-Yi, et al.
Pubblicazione: (2026)

Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete
di: Li, Qian, et al.
Pubblicazione: (2026)

An Efficient Algorithm for Solving the 2-MAXSAT Problem
di: Chen, Yangjun
Pubblicazione: (2023)

Positive Univariate Polynomials: SOS certificates, algorithms, bit complexity, and T-systems
di: Bender, Matías, et al.
Pubblicazione: (2025)

Monitoring graph edges via shortest paths: computational complexity and approximation algorithms
di: Colli, Giordano
Pubblicazione: (2025)

A near-optimal Quadratic Goldreich-Levin algorithm
di: Briët, Jop, et al.
Pubblicazione: (2025)

A $4/3$ ratio approximation algorithm for the Tree Augmentation Problem by deferred local-ratio and climbing
di: Kortsarz, Guy
Pubblicazione: (2026)

Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing
di: Mao, Xinyu, et al.
Pubblicazione: (2024)

Bounded Dynamic Level Maintenance for Efficient Logic Optimization
di: Liu, Junfeng, et al.
Pubblicazione: (2025)

Approximation algorithms for noncommutative CSPs
di: Culf, Eric, et al.
Pubblicazione: (2023)

Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors
di: Kawarabayashi, Ken-ichi, et al.
Pubblicazione: (2025)

When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?
di: Chen, Yuansi, et al.
Pubblicazione: (2023)

Singleton algorithms for the Constraint Satisfaction Problem
di: Zhuk, Dmitriy
Pubblicazione: (2025)

Efficient Matrix Product State Learning in Logarithmic Depth
di: Lin, Chia-Ying, et al.
Pubblicazione: (2025)

Efficiently verifiable quantum advantage on near-term analog quantum simulators
di: Liu, Zhenning, et al.
Pubblicazione: (2024)

$\#$W[1] = $\text{FPT}$: Fixed-Parameter Tractable Exact Algorithms for the $\#k$-Matching Problem
di: Yi, Yongming
Pubblicazione: (2026)

A new metric for evaluating the performance and complexity of computer programs: A new approach to the traditional ways of measuring the complexity of algorithms and estimating running times
di: Folea, Rares, et al.
Pubblicazione: (2025)

Quantum algorithms for path and cycle containment problems
di: Cornelissen, Arjan, et al.
Pubblicazione: (2026)

Is a LOCAL algorithm computable?
di: Cruciani, Antonio, et al.
Pubblicazione: (2026)

How to fit large complexity classes into TFNP
di: Thapen, Neil
Pubblicazione: (2024)

Complexity of some algorithmic problems in groups: a survey
di: Shpilrain, Vladimir
Pubblicazione: (2024)

Feedback Set Problems on Bounded-Degree (Planar) Graphs
di: Bai, Tian, et al.
Pubblicazione: (2026)

Efficient Polynomial Identity Testing Over Nonassociative Algebras
di: Mukhopadhyay, Partha, et al.
Pubblicazione: (2025)

On Efficient Noncommutative Polynomial Factorization via Higman Linearization
di: Arvind, V., et al.
Pubblicazione: (2022)

New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model
di: Fan, Austen, et al.
Pubblicazione: (2026)

On the Need for Large Quantum Depth
di: Chia, Nai-Hui, et al.
Pubblicazione: (2019)

A slightly improved upper bound for quantum statistical zero-knowledge
di: Gall, François Le, et al.
Pubblicazione: (2025)

PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering
di: Lin, Longlong, et al.
Pubblicazione: (2024)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
di: Carbonnel, Clément
Pubblicazione: (2026)

Quantum algorithms to simulate quadratic classical Hamiltonians and optimal control
di: Krovi, Hari
Pubblicazione: (2024)

High Rate Efficient Local List Decoding from HDX
di: Dikstein, Yotam, et al.
Pubblicazione: (2026)

Rate-optimal community detection near the KS threshold via node-robust algorithms
di: Ding, Jingqiu, et al.
Pubblicazione: (2025)

Finding large $k$-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs
di: Hodur, Nadzieja, et al.
Pubblicazione: (2025)