English
Related papers

Related papers: Tight Additive Sensitivity on LZ-style Compressors…

200 papers

A common complaint about adaptive prefix coding is that it is much slower than static prefix coding. Karpinski and Nekrich recently took an important step towards resolving this: they gave an adaptive Shannon coding algorithm that encodes…

Information Theory · Computer Science 2008-12-18 Travis Gagie , Yakov Nekrich

Estimating the second frequency moment $F_2$ of a data stream up to a $(1 \pm \varepsilon)$ factor is a central problem in the streaming literature. For errors $\varepsilon > \Omega(1/\sqrt{n})$, the tight bound…

Data Structures and Algorithms · Computer Science 2025-09-10 Naomi Green-Maimon , Or Zamir

The Compact Linear Collider (CLIC) is one of the most popular linear colliders, planned to realize $e^{-}e^{+}$ collisions in three energy stages of $0.5$, $1.5$, and $3$ TeV. It has an energy scale never reached by any existing lepton…

High Energy Physics - Phenomenology · Physics 2014-10-31 M. Koksal

We analyze the potential of the CERN Large Hadron Collider running at 7 TeV to search for deviations from the Standard Model predictions for the triple gauge boson coupling ZW+W- assuming an integrated luminosity of 1 fb^{-1}. We show that…

High Energy Physics - Phenomenology · Physics 2011-06-30 O. J. P. Eboli , J. Gonzalez-Fraile , M. C. Gonzalez-Garcia

The classic exact pattern matching problem, given two strings -- a pattern $P$ of length $m$ and a text $T$ of length $n$ -- asks whether $P$ occurs as a substring of $T$. A property tester for the problem needs to distinguish (with high…

Data Structures and Algorithms · Computer Science 2025-10-21 Ce Jin , Tomasz Kociumaka

We compute the string susceptibility $\gamma_{str}$ for the regularized Nambu-Goto string in $d$ dimensions and obtain $\gamma_{str}=1/2 $ in $2<d<26$. This agrees with previous results obtained for lattice strings.

High Energy Physics - Theory · Physics 2021-07-21 Jan Ambjorn , Yuri Makeenko

We give a detailed stability analysis of the Z-string in the standard electroweak model. We identify the mode that determines the stability of the string and numerically map the region of parameter space where the string is stable. For…

High Energy Physics - Phenomenology · Physics 2009-10-22 Margaret James , Leandros Perivolaropoulos , Tanmay Vachaspati

We present a simple method for analyzing the impact of precision electroweak data above and below the Z-peak on flavour-conserving heavy new physics. We find that experiments have probed about ten combinations of new physics effects, which…

High Energy Physics - Phenomenology · Physics 2008-11-26 G. Cacciapaglia , C. Csáki , G. Marandella , A. Strumia

Real-world data often comes in compressed form. Analyzing compressed data directly (without decompressing it) can save space and time by orders of magnitude. In this work, we focus on fundamental sequence comparison problems and try to…

Data Structures and Algorithms · Computer Science 2021-12-14 Arun Ganesh , Tomasz Kociumaka , Andrea Lincoln , Barna Saha

A search for W$\gamma$ resonances in the mass range between 0.7 and 6.0 TeV is presented. The W boson is reconstructed via its hadronic decays, with the final-state products forming a single large-radius jet, owing to a high Lorentz boost…

High Energy Physics - Experiment · Physics 2022-02-07 CMS Collaboration

Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $\lambda_c^{(d)}$ for $d$-dimensional Poisson random geometric…

Probability · Mathematics 2007-05-23 Zhenning Kong , Edmund M. Yeh

We construct non-extremal dyonic string solutions in 6D minimal supergravity where the leading higher derivative corrections arise from either the type IIA string theory compactified on K3 or the heterotic string theory compactified on…

High Energy Physics - Theory · Physics 2022-01-31 Liang Ma , Yi Pang , H. Lü

In this paper we study the adaptive prefix coding problem in cases where the size of the input alphabet is large. We present an online prefix coding algorithm that uses $O(\sigma^{1 / \lambda + \epsilon}) $ bits of space for any constants…

Data Structures and Algorithms · Computer Science 2008-11-24 Travis Gagie , Marek Karpinski , Yakov Nekrich

Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…

Combinatorics · Mathematics 2020-09-09 Bridget Eileen Tenner

The pp-wave/BMN limit of the AdS/CFT correspondence has exposed the Maldacena conjecture to a new regimen of direct tests. In one line of pursuit, finite-radius curvature corrections to the Penrose limit (which appear in inverse powers of…

High Energy Physics - Theory · Physics 2012-08-27 Curtis G. Callan, , Tristan McLoughlin , Ian Swanson

Observables with optimised sensitivity to the $WWZ$ and $WW\gamma$-couplings in $e^+ e^- \to W^+ W^-$ are investigated. They allow for separate studies of CP violation and of absorptive parts in the amplitude. We have calculated expected…

High Energy Physics - Phenomenology · Physics 2007-05-23 M. Diehl , O. Nachtmann

A search for a new heavy particle decaying to a pair of vector bosons (WW or WZ) is presented using data from the CMS detector corresponding to an integrated luminosity of 35.9/fb collected in proton-proton collisions at a centre-of-mass…

High Energy Physics - Experiment · Physics 2018-05-17 Huang Huang

A search for a new heavy particle decaying to a pair of vector bosons (WW or WZ) is presented using data from the CMS detector corresponding to an integrated luminosity of 35.9 fb$^{-1}$ collected in proton-proton collisions at a…

High Energy Physics - Experiment · Physics 2018-05-23 CMS Collaboration

Finding an Approximate Longest Common Substring (ALCS) within a given set $S=\{s_1,s_2,\ldots,s_m\}$ of $m \ge 2$ strings is a key problem in computational biology, such as identifying related mutations across multiple genetic sequences. We…

Data Structures and Algorithms · Computer Science 2025-09-22 Hamed Hasibi , Neerja Mhaskar , W. F. Smyth

Lempel-Ziv (LZ77) factorization is a fundamental problem in string processing: Greedily partition a given string $T$ from left to right into blocks (called phrases) so that each phrase is either the leftmost occurrence of a letter or the…

Data Structures and Algorithms · Computer Science 2025-06-19 Dominik Kempa , Tomasz Kociumaka