Results 21 to 30 of about 5,239,116 (369)
Improving the visibility of minorities through network growth interventions
Communications Physics, 2023 Improving the position of minority groups in networks through interventions is a challenge of high theoretical and societal importance. However, a systematic analysis of interventions that alter the network growth process is still missing.
Leonie Neuhäuser +4 more
doaj +1 more source
Computational single cell oncology: state of the art
Frontiers in Genetics, 2023 Single cell computational analysis has emerged as a powerful tool in the field of oncology, enabling researchers to decipher the complex cellular heterogeneity that characterizes cancer.
Ernesto Paas-Oliveros +5 more
doaj +1 more source
Efficient computation of optimal temporal walks under waiting-time constraints
Applied Network Science, 2020 Node connectivity plays a central role in temporal network analysis. We provide a broad study of various concepts of walks in temporal graphs, that is, graphs with fixed vertex sets but arc sets changing over time. Taking into account the temporal aspect
Matthias Bentert +3 more
doaj +1 more source
h-Index manipulation by undoing merges
Quantitative Science Studies, 2020 The h-index is an important bibliographic measure used to assess the performance of researchers. Dutiful researchers merge different versions of their articles in their Google Scholar profile even though this can decrease their h-index.
René van Bevern +5 more
doaj +1 more source
Cryptanalysis of a white‐box SM4 implementation based on collision attack
IET Information Security, 2022 White‐box cryptography is to primarily protect the key of a cipher from being extracted in a white‐box scenario, where an adversary has full access to the execution environment of software implementation. Since the introduction of white‐box cryptography,
Rusi Wang +3 more
doaj +1 more source
The complexity of computable categoricity [PDF]
Advances in Mathematics, 2015 We show that the index set complexity of the computably categorical structures is Π11-complete, demonstrating that computable categoricity has no simple syntactic characterization. As a consequence of our proof, we exhibit, for every computable ordinal α, a computable structure that is computably categorical but not relatively ∆0α-categorical.
Rodney G. Downey +5 more
openaire +3 more sources
On the computational complexity of algorithms [PDF]
Transactions of the American Mathematical Society, 1965 See the review of the English original in Zbl 0131.154.
Richard Edwin Stearns, Juris Hartmanis
openaire +4 more sources
ON THE COMPLEXITY OF COMPUTING DETERMINANTS [PDF]
Computer Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaltofen, Erich, Villard, Gilles
openaire +4 more sources
Group mixing drives inequality in face-to-face gatherings
Communications Physics, 2022 The emergence of inequality in social interactions can depend on a number of factors, among which the intrinsic attractiveness of individuals, but also group size the presence of pre-formed social ties.
Marcos Oliveira +5 more
doaj +1 more source
A Robust Version of Heged\H{u}s's Lemma, with Applications [PDF]
TheoretiCS, 2023 Heged\H{u}s's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field $\mathbb{F}$ of characteristic $p > 0$ and for $q$ a power of $p$, the lemma says that any multilinear polynomial $P\in \mathbb{F}[x_1 ...
Srikanth Srinivasan
doaj +1 more source