Results 61 to 70 of about 423,241 (305)
On the communication complexity of read-once ACO formulae
We study the 2-party randomized communication complexity of read-once AC[superscript 0] formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication complexity of the function f[superscript T](x, y) = T(x omicron y) is
Raghavendra, Prasad +5 more
core +1 more source
Infinite Communication Complexity
Suppose that Alice and Bob are given each an infinite string, and they want to decide whether their two strings are in a given relation. How much communication do they need? How can communication be even defined and measured for infinite strings? In this article, we propose a formalism for a notion of infinite communication complexity, prove that it ...
Pierre Guillon 0001, Emmanuel Jeandel
openaire +2 more sources
Food-web complexity, meta-community complexity and community stability [PDF]
Abstract What allows interacting, diverse species to coexist in nature has been a central question in ecology, ever since the theoretical prediction that a complex community should be inherently unstable. Although the role of spatiality in species coexistence has been recognized, its application to more complex systems has been less ...
A. Mougi, M. Kondoh
openaire +2 more sources
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations
The putative autism‐associated M65I and S97L variants of the EVH1 domain of the postsynaptic scaffold protein Homer1 do not exhibit substantial changes in their overall structure or partner binding. Both of them, but especially the M65I variant, show altered internal dynamics relative to the wild‐type domain on the μs‐ms timescale, indicated by the ...
Fanni Farkas +6 more
wiley +1 more source
Constant-round fair rational secret sharing scheme
In the rational secret sharing scheme, fairness is the goal that all participants expect. Based on the princi-ple of uniform grouping, the scheme was verified by combining bilinear pair knowledge and bivariate one-way function to verify the deception ...
Meng-hui LI +2 more
doaj +3 more sources
The ubiquitin‐proteasome system and autophagy as guardians of the cellular proteome
This Perspective covers the three principles governing the crosstalk between the ubiquitin‐proteasome system and autophagy in cellular proteostasis: (1) a shared ubiquitin code routing substrates via shuttle factors or autophagy receptors; (2) spatial compartmentalization into phase‐separated degradation hubs and organelle‐specific modules (exemplified
Ivan Dikic
wiley +1 more source
Robust Bell inequalities from communication complexity [PDF]
The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say that a Bell inequality is normalized if its absolute value does not exceed 1 for any classical (i.e.
Sophie Laplante +4 more
doaj +1 more source
The Landscape of Communication Complexity Classes [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Göös, Mika +2 more
openaire +4 more sources
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source

