N / \log_2 N
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
arXiv:2505.23649v3 Announce Type: replace Abstract: We study the self-stabilizing leader election (SS-LE) problem in the population protocol model, assuming exact knowledge of the population size $n$. Burman, Chen, Chen, Doty, Nowak, Severson, and Xu [BCC+21a] (PODC) showed that this problem can be solved in $O(n)$ expected time with $O(n)$ states. Recently, G\k{a}sieniec, Grodzicki, and Stachowiak [GGS25] (PODC) proved that $n+O(\log n)$ states suffice to achieve $O(n \log n)$ time both in...
Incremental BPE Tokenization
arXiv:2605.30813v1 Announce Type: new Abstract: We propose a novel algorithm for incremental Byte Pair Encoding (BPE) tokenization. The algorithm processes each input byte in worst-case $\mathcal{O}(\log^2 t)$ time, leading to an overall complexity of $\mathcal{O}(n \log^2 t)$, where $n$ is the input length and $t$ is the maximum token length. The algorithm incrementally maintains BPE tokenization results for every prefix of the input text, implementing the standard BPE merge procedure...
Infinite sequences with optimal diaphony, periodic $L_2$-discrepancy, and beyond
arXiv:2606.05482v1 Announce Type: new Abstract: We investigate the periodic $L_2$-discrepancy of infinite sequences $\S_d$ in $[0,1)^d$ and its analytic counterpart, the diaphony. We prove that infinite order-2 digital sequences over $\mathbb{F}_2$ attain the optimal order $L_{2,N}^{{\rm per}}(\S_d) \le C_d (\log N)^{d/2}/N$ for all $N \in \mathbb{N}\setminus \{1\}$, matching known lower bounds for infinitely many $N \in \mathbb{N}$.
On the Duke--Erd\H{o}s--R\"odl Problem at the One-Third Threshold
Announce Type: cross Abstract: Let $G$ be an $n$-vertex graph with $e(G)\ge n^2/ k$. We prove a self-contained internal short-cycle core theorem at the threshold $k\le n^{1/3}$: the graph $G$ contains a subgraph $H_6$ with $\Omega(n^2/ k^3)$ edges in which every two distinct edges lie together on a cycle of length at most $6$ contained in $H_6$, and a subgraph $H_8$ with $\Omega(n^2/k^2)$ edges in which every two distinct edges lie together on a cycle of length at most $8$ contained in...
Empirical Approximation of $L_p$ Norms
arXiv:2606.00347v1 Announce Type: cross Abstract: We study empirical $L_p$ moments of a random vector $\pmb\varphi$ based on its i.i.d.\ copies $\pmb\varphi^1,\ldots,\pmb\varphi^m$, that is, $\frac1m\sum_{j=1}^m |\langle \pmb\varphi^j,y\rangle|^p$. Our main result is a new estimate for the expected uniform deviation \[ \mathbb{E}\sup_{y\in D}\biggl| \frac1m\sum_{j=1}^m |\langle \pmb\varphi^j,y\rangle|^p -\mathbb{E}|\langle \pmb\varphi,y\rangle|^p \biggr| \] over an arbitrary index set $D$....
Speeding Up the NSGA-II via Dynamic Population Sizes
Announce Type: replace Abstract: Multi-objective evolutionary algorithms (MOEAs) are among the most widely and successfully applied optimizers for multi-objective problems. However, to store many optimal trade-offs (the Pareto optima) simultaneously, MOEAs are typically run with a large population of solution candidates. This slows down the algorithm and renders the choice of the population size a crucial design decision.
Speeding Up the NSGA-II via Dynamic Population Sizes
arXiv:2509.01739v3 Announce Type: replace Abstract: Multi-objective evolutionary algorithms (MOEAs) are among the most widely and successfully applied optimizers for multi-objective problems. However, to store many optimal trade-offs (the Pareto optima) simultaneously, MOEAs are typically run with a large population of solution candidates. This slows down the algorithm and renders the choice of the population size a crucial design decision.
ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
arXiv:2603.05406v2 Announce Type: replace Abstract: The Optimal Morse Matching (OMM) problem asks for a discrete gradient vector field on a simplicial complex that minimizes the number of critical simplices. It is NP-hard and has been studied extensively in heuristic, approximation, and parameterized complexity settings. Parameterized by treewidth $k$, OMM has long been known to be solvable on triangulations of $3$-manifolds in $2^{O(k^2)} n^{O(1)}$ time and in FPT time for triangulations of...
On Sketching Trimmed Statistics
Announce Type: replace Abstract: We study sketching trimmed statistics of a frequency vector, including the $F_p$ moment of the top-$k$ coordinates and of the trimmed-$k$ vector. Despite their natural role in robust analytics, this is the first time these problems have been studied in any sublinear space setting. For $p \in [0,2]$, we obtain $poly(\log n/\varepsilon)$-space algorithms for both tasks when $k$ is moderately large, and for general $k$ we identify a sharp structural threshold...
Discrete Incremental Voting: New Bounds for General Graphs and Expanders
arXiv:2606.06381v1 Announce Type: new Abstract: We analyze the discrete incremental voting process (DIV) introduced by Cooper, Radzik, and Shiraga [OPODIS '23]. In this process, we consider a set $V$ of $n$ nodes connected in an undirected graph $G = (V, E)$ where each node has an integer opinion. In one step a randomly selected node interacts with its randomly selected neighbor and changes its opinion by $1$ in the direction of the neighbour's opinion.