Search results for "data structures"
showing 10 items of 258 documents
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
2002
This article presents two algebraic characterizations and two related complete problems for the complexity class DLIN that was introduced in [E. Grandjean, Ann. Math. Artif. Intell., 16 (1996), pp. 183--236]. DLIN is essentially the class of all functions that can be computed in linear time on a Random Access Machine which uses only numbers of linear value during its computations. The algebraic characterizations are in terms of recursion schemes that define unary functions. One of these schemes defines several functions simultaneously, while the other one defines only one function. From the algebraic characterizations, we derive two complete problems for DLIN under new, very strict, and mac…
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
2008
Graphs and Algorithms
A note on Sturmian words
2012
International audience; We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows-Wheeler transformation.
On the longest common factor problem
2008
The Longest Common Factor (LCF) of a set of strings is a well studied problem having a wide range of applications in Bioinformatics: from microarrays to DNA sequences analysis. This problem has been solved by Hui (2000) who uses a famous constant-time solution to the Lowest Common Ancestor (LCA) problem in trees coupled with use of suffix trees. A data structure for the LCA problem, although linear in space and construction time, introduces a multiplicative constant in both space and time that reduces the range of applications in many biological applications. In this article we present a new method for solving the LCF problem using the suffix tree structure with an auxiliary array that take…
New Encodings of Pseudo-Boolean Constraints into CNF
2009
International audience; This paper answers affirmatively the open question of the existence of a polynomial size CNF encoding of pseudo-Boolean (PB) constraints such that generalized arc consistency (GAC) is maintained through unit propagation (UP). All previous encodings of PB constraints either did not allow UP to maintain GAC, or were of exponential size in the worst case. This paper presents an encoding that realizes both of the desired properties. From a theoretical point of view, this narrows the gap between the expressive power of clauses and the one of pseudo-Boolean constraints.
"Efficiency in the SR3$\ell$ region with $\ell=$$\tau$" of "Search for trilepton resonances from chargino and neutralino pair production in $\sqrt{s}…
2021
The combined $\tilde\chi^{\pm}_{1}\tilde\chi^{\mp}_{1} + \tilde\chi^{\pm}_{1}\tilde\chi^{0}_{1}$ reconstruction efficiencies in the SR3$\ell$ region. Results are given as a function of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ mass and branching fraction to Z bosons, and are derived separately when requiring that the charged-lepton decays of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ are into $\tau$-leptons only
"Triangle, Efficiency in SR3$\ell$, $\ell=(e, \mu, \tau)$" of "Search for trilepton resonances from chargino and neutralino pair production in $\sqrt…
2021
The combined $\tilde\chi^{\pm}_{1}\tilde\chi^{\mp}_{1} + \tilde\chi^{\pm}_{1}\tilde\chi^{0}_{1}$ reconstruction efficiencies in the SR3$\ell$ region for $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ masses of 700 GeV. Results are given as a function of the branching fractions to Z and Higgs bosons
"Triangle, Efficiency in SR4$\ell$, $\ell=(e, \mu, \tau)$" of "Search for trilepton resonances from chargino and neutralino pair production in $\sqrt…
2021
The combined $\tilde\chi^{\pm}_{1}\tilde\chi^{\mp}_{1} + \tilde\chi^{\pm}_{1}\tilde\chi^{0}_{1}$ reconstruction efficiencies in the SR4$\ell$ region for $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ masses of 700 GeV. Results are given as a function of the branching fractions to Z and Higgs bosons
"Efficiency in the SRFR region with $\ell=$$\tau$" of "Search for trilepton resonances from chargino and neutralino pair production in $\sqrt{s}$ = 1…
2021
The combined $\tilde\chi^{\pm}_{1}\tilde\chi^{\mp}_{1} + \tilde\chi^{\pm}_{1}\tilde\chi^{0}_{1}$ reconstruction efficiencies in the SRFR region. Results are given as a function of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ mass and branching fraction to Z bosons, and are derived separately when requiring that the charged-lepton decays of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ are into $\tau$-leptons only
"Efficiency in the SRFR region with $\ell=$$(e, \mu, \tau)$" of "Search for trilepton resonances from chargino and neutralino pair production in $\sq…
2021
The combined $\tilde\chi^{\pm}_{1}\tilde\chi^{\mp}_{1} + \tilde\chi^{\pm}_{1}\tilde\chi^{0}_{1}$ reconstruction efficiencies in the SRFR region. Results are given as a function of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ mass and branching fraction to Z bosons, and are derived separately when requiring that the charged-lepton decays of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ are into any leptons with equal probability