@article{10852, abstract = { We review old and new results on the Fröhlich polaron model. The discussion includes the validity of the (classical) Pekar approximation in the strong coupling limit, quantum corrections to this limit, as well as the divergence of the effective polaron mass.}, author = {Seiringer, Robert}, issn = {1793-6659}, journal = {Reviews in Mathematical Physics}, keywords = {Mathematical Physics, Statistical and Nonlinear Physics}, number = {01}, publisher = {World Scientific Publishing}, title = {{The polaron at strong coupling}}, doi = {10.1142/s0129055x20600120}, volume = {33}, year = {2021}, } @phdthesis{9056, abstract = {In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density, and thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration function on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets.}, author = {Osang, Georg F}, issn = {2663-337X}, pages = {134}, publisher = {Institute of Science and Technology Austria}, title = {{Multi-cover persistence and Delaunay mosaics}}, doi = {10.15479/AT:ISTA:9056}, year = {2021}, } @phdthesis{9022, abstract = {In the first part of the thesis we consider Hermitian random matrices. Firstly, we consider sample covariance matrices XX∗ with X having independent identically distributed (i.i.d.) centred entries. We prove a Central Limit Theorem for differences of linear statistics of XX∗ and its minor after removing the first column of X. Secondly, we consider Wigner-type matrices and prove that the eigenvalue statistics near cusp singularities of the limiting density of states are universal and that they form a Pearcey process. Since the limiting eigenvalue distribution admits only square root (edge) and cubic root (cusp) singularities, this concludes the third and last remaining case of the Wigner-Dyson-Mehta universality conjecture. The main technical ingredients are an optimal local law at the cusp, and the proof of the fast relaxation to equilibrium of the Dyson Brownian motion in the cusp regime. In the second part we consider non-Hermitian matrices X with centred i.i.d. entries. We normalise the entries of X to have variance N −1. It is well known that the empirical eigenvalue density converges to the uniform distribution on the unit disk (circular law). In the first project, we prove universality of the local eigenvalue statistics close to the edge of the spectrum. This is the non-Hermitian analogue of the TracyWidom universality at the Hermitian edge. Technically we analyse the evolution of the spectral distribution of X along the Ornstein-Uhlenbeck flow for very long time (up to t = +∞). In the second project, we consider linear statistics of eigenvalues for macroscopic test functions f in the Sobolev space H2+ϵ and prove their convergence to the projection of the Gaussian Free Field on the unit disk. We prove this result for non-Hermitian matrices with real or complex entries. The main technical ingredients are: (i) local law for products of two resolvents at different spectral parameters, (ii) analysis of correlated Dyson Brownian motions. In the third and final part we discuss the mathematically rigorous application of supersymmetric techniques (SUSY ) to give a lower tail estimate of the lowest singular value of X − z, with z ∈ C. More precisely, we use superbosonisation formula to give an integral representation of the resolvent of (X − z)(X − z)∗ which reduces to two and three contour integrals in the complex and real case, respectively. The rigorous analysis of these integrals is quite challenging since simple saddle point analysis cannot be applied (the main contribution comes from a non-trivial manifold). Our result improves classical smoothing inequalities in the regime |z| ≈ 1; this result is essential to prove edge universality for i.i.d. non-Hermitian matrices.}, author = {Cipolloni, Giorgio}, issn = {2663-337X}, pages = {380}, publisher = {Institute of Science and Technology Austria}, title = {{Fluctuations in the spectrum of random matrices}}, doi = {10.15479/AT:ISTA:9022}, year = {2021}, } @inproceedings{9416, abstract = {We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks.}, author = {Bui Thi Mai, Phuong and Lampert, Christoph}, booktitle = {9th International Conference on Learning Representations}, location = {Virtual}, title = {{The inductive bias of ReLU networks on orthogonally separable data}}, year = {2021}, } @article{9225, abstract = {The Landau–Pekar equations describe the dynamics of a strongly coupled polaron. Here, we provide a class of initial data for which the associated effective Hamiltonian has a uniform spectral gap for all times. For such initial data, this allows us to extend the results on the adiabatic theorem for the Landau–Pekar equations and their derivation from the Fröhlich model obtained in previous works to larger times.}, author = {Feliciangeli, Dario and Rademacher, Simone Anna Elvira and Seiringer, Robert}, issn = {15730530}, journal = {Letters in Mathematical Physics}, publisher = {Springer Nature}, title = {{Persistence of the spectral gap for the Landau–Pekar equations}}, doi = {10.1007/s11005-020-01350-5}, volume = {111}, year = {2021}, } @unpublished{9787, abstract = {We investigate the Fröhlich polaron model on a three-dimensional torus, and give a proof of the second-order quantum corrections to its ground-state energy in the strong-coupling limit. Compared to previous work in the confined case, the translational symmetry (and its breaking in the Pekar approximation) makes the analysis substantially more challenging.}, author = {Feliciangeli, Dario and Seiringer, Robert}, booktitle = {arXiv}, title = {{The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics}}, year = {2021}, } @inproceedings{9987, abstract = {Stateless model checking (SMC) is one of the standard approaches to the verification of concurrent programs. As scheduling non-determinism creates exponentially large spaces of thread interleavings, SMC attempts to partition this space into equivalence classes and explore only a few representatives from each class. The efficiency of this approach depends on two factors: (a) the coarseness of the partitioning, and (b) the time to generate representatives in each class. For this reason, the search for coarse partitionings that are efficiently explorable is an active research challenge. In this work we present RVF-SMC , a new SMC algorithm that uses a novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are deemed equivalent if they agree on the value obtained in each read event, and read events induce consistent causal orderings between them. The RVF partitioning is provably coarser than recent approaches based on Mazurkiewicz and “reads-from” partitionings. Our experimental evaluation reveals that RVF is quite often a very effective equivalence, as the underlying partitioning is exponentially coarser than other approaches. Moreover, RVF-SMC generates representatives very efficiently, as the reduction in the partitioning is often met with significant speed-ups in the model checking task.}, author = {Agarwal, Pratyush and Chatterjee, Krishnendu and Pathak, Shreya and Pavlogiannis, Andreas and Toman, Viktor}, booktitle = {33rd International Conference on Computer-Aided Verification }, isbn = {978-3-030-81684-1}, issn = {1611-3349}, location = {Virtual}, pages = {341--366}, publisher = {Springer Nature}, title = {{Stateless model checking under a reads-value-from equivalence}}, doi = {10.1007/978-3-030-81685-8_16}, volume = {12759 }, year = {2021}, } @phdthesis{10007, abstract = {The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis.}, author = {Hensel, Sebastian}, issn = {2663-337X}, pages = {300}, publisher = {Institute of Science and Technology Austria}, title = {{Curvature driven interface evolution: Uniqueness properties of weak solution concepts}}, doi = {10.15479/at:ista:10007}, year = {2021}, } @article{10191, abstract = {In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task. }, author = {Bui, Truc Lam and Chatterjee, Krishnendu and Gautam, Tushar and Pavlogiannis, Andreas and Toman, Viktor}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, keywords = {safety, risk, reliability and quality, software}, number = {OOPSLA}, publisher = {Association for Computing Machinery}, title = {{The reads-from equivalence for the TSO and PSO memory models}}, doi = {10.1145/3485541}, volume = {5}, year = {2021}, } @unpublished{10013, abstract = {We derive a weak-strong uniqueness principle for BV solutions to multiphase mean curvature flow of triple line clusters in three dimensions. Our proof is based on the explicit construction of a gradient-flow calibration in the sense of the recent work of Fischer et al. [arXiv:2003.05478] for any such cluster. This extends the two-dimensional construction to the three-dimensional case of surfaces meeting along triple junctions.}, author = {Hensel, Sebastian and Laux, Tim}, booktitle = {arXiv}, title = {{Weak-strong uniqueness for the mean curvature flow of double bubbles}}, doi = {10.48550/arXiv.2108.01733}, year = {2021}, } @article{9928, abstract = {There are two elementary superconducting qubit types that derive directly from the quantum harmonic oscillator. In one, the inductor is replaced by a nonlinear Josephson junction to realize the widely used charge qubits with a compact phase variable and a discrete charge wave function. In the other, the junction is added in parallel, which gives rise to an extended phase variable, continuous wave functions, and a rich energy-level structure due to the loop topology. While the corresponding rf superconducting quantum interference device Hamiltonian was introduced as a quadratic quasi-one-dimensional potential approximation to describe the fluxonium qubit implemented with long Josephson-junction arrays, in this work we implement it directly using a linear superinductor formed by a single uninterrupted aluminum wire. We present a large variety of qubits, all stemming from the same circuit but with drastically different characteristic energy scales. This includes flux and fluxonium qubits but also the recently introduced quasicharge qubit with strongly enhanced zero-point phase fluctuations and a heavily suppressed flux dispersion. The use of a geometric inductor results in high reproducibility of the inductive energy as guaranteed by top-down lithography—a key ingredient for intrinsically protected superconducting qubits.}, author = {Peruzzo, Matilda and Hassani, Farid and Szep, Gregory and Trioni, Andrea and Redchenko, Elena and Zemlicka, Martin and Fink, Johannes M}, issn = {2691-3399}, journal = {PRX Quantum}, keywords = {quantum physics, mesoscale and nanoscale physics}, number = {4}, pages = {040341}, publisher = {American Physical Society}, title = {{Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction}}, doi = {10.1103/PRXQuantum.2.040341}, volume = {2}, year = {2021}, } @phdthesis{10030, abstract = {This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning non-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces.}, author = {Portinale, Lorenzo}, issn = {2663-337X}, publisher = {Institute of Science and Technology Austria}, title = {{Discrete-to-continuum limits of transport problems and gradient flows in the space of measures}}, doi = {10.15479/at:ista:10030}, year = {2021}, } @phdthesis{9920, abstract = {This work is concerned with two fascinating circuit quantum electrodynamics components, the Josephson junction and the geometric superinductor, and the interesting experiments that can be done by combining the two. The Josephson junction has revolutionized the field of superconducting circuits as a non-linear dissipation-less circuit element and is used in almost all superconducting qubit implementations since the 90s. On the other hand, the superinductor is a relatively new circuit element introduced as a key component of the fluxonium qubit in 2009. This is an inductor with characteristic impedance larger than the resistance quantum and self-resonance frequency in the GHz regime. The combination of these two elements can occur in two fundamental ways: in parallel and in series. When connected in parallel the two create the fluxonium qubit, a loop with large inductance and a rich energy spectrum reliant on quantum tunneling. On the other hand placing the two elements in series aids with the measurement of the IV curve of a single Josephson junction in a high impedance environment. In this limit theory predicts that the junction will behave as its dual element: the phase-slip junction. While the Josephson junction acts as a non-linear inductor the phase-slip junction has the behavior of a non-linear capacitance and can be used to measure new Josephson junction phenomena, namely Coulomb blockade of Cooper pairs and phase-locked Bloch oscillations. The latter experiment allows for a direct link between frequency and current which is an elusive connection in quantum metrology. This work introduces the geometric superinductor, a superconducting circuit element where the high inductance is due to the geometry rather than the material properties of the superconductor, realized from a highly miniaturized superconducting planar coil. These structures will be described and characterized as resonators and qubit inductors and progress towards the measurement of phase-locked Bloch oscillations will be presented.}, author = {Peruzzo, Matilda}, isbn = {978-3-99078-013-8}, issn = {2663-337X}, keywords = {quantum computing, superinductor, quantum metrology}, pages = {149}, publisher = {Institute of Science and Technology Austria}, title = {{Geometric superinductors and their applications in circuit quantum electrodynamics}}, doi = {10.15479/at:ista:9920}, year = {2021}, } @inproceedings{10432, abstract = {One key element behind the recent progress of machine learning has been the ability to train machine learning models in large-scale distributed shared-memory and message-passing environments. Most of these models are trained employing variants of stochastic gradient descent (SGD) based optimization, but most methods involve some type of consistency relaxation relative to sequential SGD, to mitigate its large communication or synchronization costs at scale. In this paper, we introduce a general consistency condition covering communication-reduced and asynchronous distributed SGD implementations. Our framework, called elastic consistency, decouples the system-specific aspects of the implementation from the SGD convergence requirements, giving a general way to obtain convergence bounds for a wide variety of distributed SGD methods used in practice. Elastic consistency can be used to re-derive or improve several previous convergence bounds in message-passing and shared-memory settings, but also to analyze new models and distribution schemes. As a direct application, we propose and analyze a new synchronization-avoiding scheduling scheme for distributed SGD, and show that it can be used to efficiently train deep convolutional models for image classification.}, author = {Nadiradze, Giorgi and Markov, Ilia and Chatterjee, Bapi and Kungurtsev, Vyacheslav and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence}, location = {Virtual}, number = {10}, pages = {9037--9045}, title = {{Elastic consistency: A practical consistency model for distributed stochastic gradient descent}}, volume = {35}, year = {2021}, } @inproceedings{10041, abstract = {Yao’s garbling scheme is one of the most fundamental cryptographic constructions. Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security in the selective setting where the adversary chooses the challenge inputs before seeing the garbled circuit assuming secure symmetric-key encryption (and hence one-way functions). This was followed by results, both positive and negative, concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto 2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s scheme (where the output mapping is sent in the online phase, together with the garbled input) that circumvents this negative result, and proved that it is adaptively secure, at least for shallow circuits. In particular, they showed that for the class of circuits of depth δ , the loss in security is at most exponential in δ . The above results all concern the simulation-based notion of security. In this work, we show that the upper bound of Jafargholi and Wichs is basically optimal in a strong sense. As our main result, we show that there exists a family of Boolean circuits, one for each depth δ∈N , such that any black-box reduction proving the adaptive indistinguishability of the natural adaptation of Yao’s scheme from any symmetric-key encryption has to lose a factor that is exponential in δ√ . Since indistinguishability is a weaker notion than simulation, our bound also applies to adaptive simulation. To establish our results, we build on the recent approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction with oracle separations to prove fine-grained lower bounds on loss in cryptographic security.}, author = {Kamath Hosdurg, Chethan and Klein, Karen and Pietrzak, Krzysztof Z and Wichs, Daniel}, booktitle = {41st Annual International Cryptology Conference, Part II }, isbn = {978-3-030-84244-4}, issn = {1611-3349}, location = {Virtual}, pages = {486--515}, publisher = {Springer Nature}, title = {{Limits on the Adaptive Security of Yao’s Garbling}}, doi = {10.1007/978-3-030-84245-1_17}, volume = {12826}, year = {2021}, } @inproceedings{10049, abstract = {While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar security guarantees remains largely open. The two existing proposals to date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer Security Protocol, draft). TreeKEM is the currently considered candidate by the IETF MLS working group, but dynamic group operations (i.e. adding and removing users) can cause efficiency issues. In this paper we formalize and analyze a variant of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying TTKEM was suggested by Millican (MLS mailing list, February 2018). This version is more efficient than TreeKEM for some natural distributions of group operations, we quantify this through simulations.Our second contribution is two security proofs for TTKEM which establish post compromise and forward secrecy even against adaptive attackers. The security loss (to the underlying PKE) in the Random Oracle Model is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like protocol establishing tight security against an adversary who can adaptively choose the sequence of operations was known. We also are the first to prove (or even formalize) active security where the server can arbitrarily deviate from the protocol specification. Proving fully active security – where also the users can arbitrarily deviate – remains open.}, author = {Klein, Karen and Pascual Perez, Guillermo and Walter, Michael and Kamath Hosdurg, Chethan and Capretto, Margarita and Cueto Noval, Miguel and Markov, Ilia and Yeo, Michelle X and Alwen, Joel F and Pietrzak, Krzysztof Z}, booktitle = {2021 IEEE Symposium on Security and Privacy }, location = {San Francisco, CA, United States}, pages = {268--284}, publisher = {IEEE}, title = {{Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement}}, doi = {10.1109/sp40001.2021.00035}, year = {2021}, } @inproceedings{10044, abstract = {We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity.}, author = {Kamath Hosdurg, Chethan and Klein, Karen and Pietrzak, Krzysztof Z}, booktitle = {19th Theory of Cryptography Conference 2021}, location = {Raleigh, NC, United States}, publisher = {International Association for Cryptologic Research}, title = {{On treewidth, separators and Yao's garbling}}, year = {2021}, } @phdthesis{10422, abstract = {Those who aim to devise new materials with desirable properties usually examine present methods first. However, they will find out that some approaches can exist only conceptually without high chances to become practically useful. It seems that a numerical technique called automatic differentiation together with increasing supply of computational accelerators will soon shift many methods of the material design from the category ”unimaginable” to the category ”expensive but possible”. Approach we suggest is not an exception. Our overall goal is to have an efficient and generalizable approach allowing to solve inverse design problems. In this thesis we scratch its surface. We consider jammed systems of identical particles. And ask ourselves how the shape of those particles (or the parameters codifying it) may affect mechanical properties of the system. An indispensable part of reaching the answer is an appropriate particle parametrization. We come up with a simple, yet generalizable and purposeful scheme for it. Using our generalizable shape parameterization, we simulate the formation of a solid composed of pentagonal-like particles and measure anisotropy in the resulting elastic response. Through automatic differentiation techniques, we directly connect the shape parameters with the elastic response. Interestingly, for our system we find that less isotropic particles lead to a more isotropic elastic response. Together with other results known about our method it seems that it can be successfully generalized for different inverse design problems.}, author = {Piankov, Anton}, issn = {2791-4585}, publisher = {Institute of Science and Technology Austria}, title = {{Towards designer materials using customizable particle shape}}, doi = {10.15479/at:ista:10422}, year = {2021}, } @unpublished{10803, abstract = {Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality.}, author = {Konstantinov, Nikola H and Lampert, Christoph}, booktitle = {arXiv}, title = {{Fairness through regularization for learning to rank}}, doi = {10.48550/arXiv.2102.05996}, year = {2021}, } @unpublished{10762, abstract = {Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications.}, author = {Rzadkowski, Wojciech and Lemeshko, Mikhail and Mentink, Johan H.}, booktitle = {arXiv}, pages = {2105.15193}, title = {{Artificial neural network states for non-additive systems}}, doi = {10.48550/arXiv.2105.15193}, year = {2021}, } @phdthesis{9418, abstract = {Deep learning is best known for its empirical success across a wide range of applications spanning computer vision, natural language processing and speech. Of equal significance, though perhaps less known, are its ramifications for learning theory: deep networks have been observed to perform surprisingly well in the high-capacity regime, aka the overfitting or underspecified regime. Classically, this regime on the far right of the bias-variance curve is associated with poor generalisation; however, recent experiments with deep networks challenge this view. This thesis is devoted to investigating various aspects of underspecification in deep learning. First, we argue that deep learning models are underspecified on two levels: a) any given training dataset can be fit by many different functions, and b) any given function can be expressed by many different parameter configurations. We refer to the second kind of underspecification as parameterisation redundancy and we precisely characterise its extent. Second, we characterise the implicit criteria (the inductive bias) that guide learning in the underspecified regime. Specifically, we consider a nonlinear but tractable classification setting, and show that given the choice, neural networks learn classifiers with a large margin. Third, we consider learning scenarios where the inductive bias is not by itself sufficient to deal with underspecification. We then study different ways of ‘tightening the specification’: i) In the setting of representation learning with variational autoencoders, we propose a hand- crafted regulariser based on mutual information. ii) In the setting of binary classification, we consider soft-label (real-valued) supervision. We derive a generalisation bound for linear networks supervised in this way and verify that soft labels facilitate fast learning. Finally, we explore an application of soft-label supervision to the training of multi-exit models.}, author = {Bui Thi Mai, Phuong}, issn = {2663-337X}, pages = {125}, publisher = {Institute of Science and Technology Austria}, title = {{Underspecification in deep learning}}, doi = {10.15479/AT:ISTA:9418}, year = {2021}, } @unpublished{14278, abstract = {The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely, integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of almost every ellipse that preserves integrability near the boundary, is itself an ellipse. We apply this result to study local spectral rigidity of ellipses using the connection between the wave trace of the Laplacian and the dynamics near the boundary and establish rigidity for almost all of them.}, author = {Koval, Illya}, booktitle = {arXiv}, title = {{Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse}}, doi = {10.48550/ARXIV.2111.12171}, year = {2021}, } @phdthesis{10199, abstract = {The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness.}, author = {Toman, Viktor}, issn = {2663-337X}, keywords = {concurrency, verification, model checking}, pages = {166}, publisher = {Institute of Science and Technology Austria}, title = {{Improved verification techniques for concurrent systems}}, doi = {10.15479/at:ista:10199}, year = {2021}, } @article{8429, abstract = {We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability estimation, an alternative to marker discovery, and accurate genomic prediction, taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability parameters in the UK Biobank. We find that only ≤10% of the genetic variation captured for height, body mass index, cardiovascular disease, and type 2 diabetes is attributable to proximal regulatory regions within 10kb upstream of genes, while 12-25% is attributed to coding regions, 32–44% to introns, and 22-28% to distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each chromosome are associated with each trait, with over 3,100 independent exonic and intronic regions and over 5,400 independent regulatory regions having ≥95% probability of contributing ≥0.001% to the genetic variance of these four traits. Our open-source software (GMRM) provides a scalable alternative to current approaches for biobank data.}, author = {Patxot, Marion and Trejo Banos, Daniel and Kousathanas, Athanasios and Orliac, Etienne J and Ojavee, Sven E and Moser, Gerhard and Sidorenko, Julia and Kutalik, Zoltan and Magi, Reedik and Visscher, Peter M and Ronnegard, Lars and Robinson, Matthew Richard}, issn = {2041-1723}, journal = {Nature Communications}, number = {1}, publisher = {Springer Nature}, title = {{Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits}}, doi = {10.1038/s41467-021-27258-9}, volume = {12}, year = {2021}, } @inproceedings{10854, abstract = {Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic CONGEST model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly. Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task.}, author = {Foerster, Klaus-Tycho and Korhonen, Janne and Paz, Ami and Rybicki, Joel and Schmid, Stefan}, booktitle = {Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems}, isbn = {9781450380720}, location = {Virtual, Online}, pages = {71--72}, publisher = {Association for Computing Machinery}, title = {{Input-dynamic distributed algorithms for communication networks}}, doi = {10.1145/3410220.3453923}, year = {2021}, } @article{10855, abstract = {Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \beginitemize \item how much time as a function of α we need to update an existing solution, and \item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.}, author = {Foerster, Klaus-Tycho and Korhonen, Janne and Paz, Ami and Rybicki, Joel and Schmid, Stefan}, issn = {2476-1249}, journal = {Proceedings of the ACM on Measurement and Analysis of Computing Systems}, keywords = {Computer Networks and Communications, Hardware and Architecture, Safety, Risk, Reliability and Quality, Computer Science (miscellaneous)}, number = {1}, pages = {1--33}, publisher = {Association for Computing Machinery}, title = {{Input-dynamic distributed algorithms for communication networks}}, doi = {10.1145/3447384}, volume = {5}, year = {2021}, } @article{9293, abstract = {We consider planning problems for graphs, Markov Decision Processes (MDPs), and games on graphs in an explicit state space. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems with k different target sets: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in a given sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture and strong exponential time hypothesis (SETH), establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs, and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) problem-separation results showing that for MDPs the coverage problem is harder than the sequential target problem.}, author = {Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika H and Svozil, Alexander}, issn = {0004-3702}, journal = {Artificial Intelligence}, number = {8}, publisher = {Elsevier}, title = {{Algorithms and conditional lower bounds for planning problems}}, doi = {10.1016/j.artint.2021.103499}, volume = {297}, year = {2021}, } @misc{13063, abstract = {We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability estimation, an alternative to marker discovery, and accurate genomic prediction, taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability parameters in the UK Biobank. We find that only $\leq$ 10\% of the genetic variation captured for height, body mass index, cardiovascular disease, and type 2 diabetes is attributable to proximal regulatory regions within 10kb upstream of genes, while 12-25% is attributed to coding regions, 32-44% to introns, and 22-28% to distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each chromosome are associated with each trait, with over 3,100 independent exonic and intronic regions and over 5,400 independent regulatory regions having >95% probability of contributing >0.001% to the genetic variance of these four traits. Our open-source software (GMRM) provides a scalable alternative to current approaches for biobank data.}, author = {Robinson, Matthew Richard}, publisher = {Dryad}, title = {{Probabilistic inference of the genetic architecture of functional enrichment of complex traits}}, doi = {10.5061/dryad.sqv9s4n51}, year = {2021}, } @article{9304, abstract = {The high processing cost, poor mechanical properties and moderate performance of Bi2Te3–based alloys used in thermoelectric devices limit the cost-effectiveness of this energy conversion technology. Towards solving these current challenges, in the present work, we detail a low temperature solution-based approach to produce Bi2Te3-Cu2-xTe nanocomposites with improved thermoelectric performance. Our approach consists in combining proper ratios of colloidal nanoparticles and to consolidate the resulting mixture into nanocomposites using a hot press. The transport properties of the nanocomposites are characterized and compared with those of pure Bi2Te3 nanomaterials obtained following the same procedure. In contrast with most previous works, the presence of Cu2-xTe nanodomains does not result in a significant reduction of the lattice thermal conductivity of the reference Bi2Te3 nanomaterial, which is already very low. However, the introduction of Cu2-xTe yields a nearly threefold increase of the power factor associated to a simultaneous increase of the Seebeck coefficient and electrical conductivity at temperatures above 400 K. Taking into account the band alignment of the two materials, we rationalize this increase by considering that Cu2-xTe nanostructures, with a relatively low electron affinity, are able to inject electrons into Bi2Te3, enhancing in this way its electrical conductivity. The simultaneous increase of the Seebeck coefficient is related to the energy filtering of charge carriers at energy barriers within Bi2Te3 domains associated with the accumulation of electrons in regions nearby a Cu2-xTe/Bi2Te3 heterojunction. Overall, with the incorporation of a proper amount of Cu2-xTe nanoparticles, we demonstrate a 250% improvement of the thermoelectric figure of merit of Bi2Te3.}, author = {Zhang, Yu and Xing, Congcong and Liu, Yu and Li, Mengyao and Xiao, Ke and Guardia, Pablo and Lee, Seungho and Han, Xu and Moghaddam, Ahmad and Roa, Joan J and Arbiol, Jordi and Ibáñez, Maria and Pan, Kai and Prato, Mirko and Xie, Ying and Cabot, Andreu}, issn = {1385-8947}, journal = {Chemical Engineering Journal}, number = {8}, publisher = {Elsevier}, title = {{Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride}}, doi = {10.1016/j.cej.2021.129374}, volume = {418}, year = {2021}, } @article{9793, abstract = {Astrocytes extensively infiltrate the neuropil to regulate critical aspects of synaptic development and function. This process is regulated by transcellular interactions between astrocytes and neurons via cell adhesion molecules. How astrocytes coordinate developmental processes among one another to parse out the synaptic neuropil and form non-overlapping territories is unknown. Here we identify a molecular mechanism regulating astrocyte-astrocyte interactions during development to coordinate astrocyte morphogenesis and gap junction coupling. We show that hepaCAM, a disease-linked, astrocyte-enriched cell adhesion molecule, regulates astrocyte competition for territory and morphological complexity in the developing mouse cortex. Furthermore, conditional deletion of Hepacam from developing astrocytes significantly impairs gap junction coupling between astrocytes and disrupts the balance between synaptic excitation and inhibition. Mutations in HEPACAM cause megalencephalic leukoencephalopathy with subcortical cysts in humans. Therefore, our findings suggest that disruption of astrocyte self-organization mechanisms could be an underlying cause of neural pathology.}, author = {Baldwin, Katherine T. and Tan, Christabel X. and Strader, Samuel T. and Jiang, Changyu and Savage, Justin T. and Elorza-Vidal, Xabier and Contreras, Ximena and Rülicke, Thomas and Hippenmeyer, Simon and Estévez, Raúl and Ji, Ru-Rong and Eroglu, Cagla}, issn = {1097-4199}, journal = {Neuron}, number = {15}, pages = {2427--2442.e10}, publisher = {Elsevier}, title = {{HepaCAM controls astrocyte self-organization and coupling}}, doi = {10.1016/j.neuron.2021.05.025}, volume = {109}, year = {2021}, } @article{9305, abstract = {Copper chalcogenides are outstanding thermoelectric materials for applications in the medium-high temperature range. Among different chalcogenides, while Cu2−xSe is characterized by higher thermoelectric figures of merit, Cu2−xS provides advantages in terms of low cost and element abundance. In the present work, we investigate the effect of different dopants to enhance the Cu2−xS performance and also its thermal stability. Among the tested options, Pb-doped Cu2−xS shows the highest improvement in stability against sulfur volatilization. Additionally, Pb incorporation allows tuning charge carrier concentration, which enables a significant improvement of the power factor. We demonstrate here that the introduction of an optimal additive amount of just 0.3% results in a threefold increase of the power factor in the middle-temperature range (500–800 K) and a record dimensionless thermoelectric figure of merit above 2 at 880 K.}, author = {Zhang, Yu and Xing, Congcong and Liu, Yu and Spadaro, Maria Chiara and Wang, Xiang and Li, Mengyao and Xiao, Ke and Zhang, Ting and Guardia, Pablo and Lim, Khak Ho and Moghaddam, Ahmad Ostovari and Llorca, Jordi and Arbiol, Jordi and Ibáñez, Maria and Cabot, Andreu}, issn = {2211-2855}, journal = {Nano Energy}, number = {7}, publisher = {Elsevier}, title = {{Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS}}, doi = {10.1016/j.nanoen.2021.105991}, volume = {85}, year = {2021}, } @article{9212, abstract = {Plant fitness is largely dependent on the root, the underground organ, which, besides its anchoring function, supplies the plant body with water and all nutrients necessary for growth and development. To exploit the soil effectively, roots must constantly integrate environmental signals and react through adjustment of growth and development. Important components of the root management strategy involve a rapid modulation of the root growth kinetics and growth direction, as well as an increase of the root system radius through formation of lateral roots (LRs). At the molecular level, such a fascinating growth and developmental flexibility of root organ requires regulatory networks that guarantee stability of the developmental program but also allows integration of various environmental inputs. The plant hormone auxin is one of the principal endogenous regulators of root system architecture by controlling primary root growth and formation of LR. In this review, we discuss recent progress in understanding molecular networks where auxin is one of the main players shaping the root system and acting as mediator between endogenous cues and environmental factors.}, author = {Cavallari, Nicola and Artner, Christina and Benková, Eva}, issn = {1943-0264}, journal = {Cold Spring Harbor Perspectives in Biology}, number = {7}, publisher = {Cold Spring Harbor Laboratory Press}, title = {{Auxin-regulated lateral root organogenesis}}, doi = {10.1101/cshperspect.a039941}, volume = {13}, year = {2021}, } @article{9953, abstract = {Chronic psychological stress is one of the most important triggers and environmental risk factors for neuropsychiatric disorders. Chronic stress can influence all organs via the secretion of stress hormones, including glucocorticoids by the adrenal glands, which coordinate the stress response across the body. In the brain, glucocorticoid receptors (GR) are expressed by various cell types including microglia, which are its resident immune cells regulating stress-induced inflammatory processes. To study the roles of microglial GR under normal homeostatic conditions and following chronic stress, we generated a mouse model in which the GR gene is depleted in microglia specifically at adulthood to prevent developmental confounds. We first confirmed that microglia were depleted in GR in our model in males and females among the cingulate cortex and the hippocampus, both stress-sensitive brain regions. Then, cohorts of microglial-GR depleted and wild-type (WT) adult female mice were housed for 3 weeks in a standard or stressful condition, using a chronic unpredictable mild stress (CUMS) paradigm. CUMS induced stress-related behavior in both microglial-GR depleted and WT animals as demonstrated by a decrease of both saccharine preference and progressive ratio breakpoint. Nevertheless, the hippocampal microglial and neural mechanisms underlying the adaptation to stress occurred differently between the two genotypes. Upon CUMS exposure, microglial morphology was altered in the WT controls, without any apparent effect in microglial-GR depleted mice. Furthermore, in the standard environment condition, GR depleted-microglia showed increased expression of pro-inflammatory genes, and genes involved in microglial homeostatic functions (such as Trem2, Cx3cr1 and Mertk). On the contrary, in CUMS condition, GR depleted-microglia showed reduced expression levels of pro-inflammatory genes and increased neuroprotective as well as anti-inflammatory genes compared to WT-microglia. Moreover, in microglial-GR depleted mice, but not in WT mice, CUMS led to a significant reduction of CA1 long-term potentiation and paired-pulse ratio. Lastly, differences in adult hippocampal neurogenesis were observed between the genotypes during normal homeostatic conditions, with microglial-GR deficiency increasing the formation of newborn neurons in the dentate gyrus subgranular zone independently from stress exposure. Together, these findings indicate that, although the deletion of microglial GR did not prevent the animal’s ability to respond to stress, it contributed to modulating hippocampal functions in both standard and stressful conditions, notably by shaping the microglial response to chronic stress.}, author = {Picard, Katherine and Bisht, Kanchan and Poggini, Silvia and Garofalo, Stefano and Golia, Maria Teresa and Basilico, Bernadette and Abdallah, Fatima and Ciano Albanese, Naomi and Amrein, Irmgard and Vernoux, Nathalie and Sharma, Kaushik and Hui, Chin Wai and C. Savage, Julie and Limatola, Cristina and Ragozzino, Davide and Maggi, Laura and Branchi, Igor and Tremblay, Marie Ève}, issn = {0889-1591}, journal = {Brain, Behavior, and Immunity}, pages = {423--439}, publisher = {Elsevier}, title = {{Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice}}, doi = {10.1016/j.bbi.2021.07.022}, volume = {97}, year = {2021}, } @article{10327, abstract = {Composite materials offer numerous advantages in a wide range of applications, including thermoelectrics. Here, semiconductor–metal composites are produced by just blending nanoparticles of a sulfide semiconductor obtained in aqueous solution and at room temperature with a metallic Cu powder. The obtained blend is annealed in a reducing atmosphere and afterward consolidated into dense polycrystalline pellets through spark plasma sintering (SPS). We observe that, during the annealing process, the presence of metallic copper activates a partial reduction of the PbS, resulting in the formation of PbS–Pb–CuxS composites. The presence of metallic lead during the SPS process habilitates the liquid-phase sintering of the composite. Besides, by comparing the transport properties of PbS, the PbS–Pb–CuxS composites, and PbS–CuxS composites obtained by blending PbS and CuxS nanoparticles, we demonstrate that the presence of metallic lead decisively contributes to a strong increase of the charge carrier concentration through spillover of charge carriers enabled by the low work function of lead. The increase in charge carrier concentration translates into much higher electrical conductivities and moderately lower Seebeck coefficients. These properties translate into power factors up to 2.1 mW m–1 K–2 at ambient temperature, well above those of PbS and PbS + CuxS. Additionally, the presence of multiple phases in the final composite results in a notable decrease in the lattice thermal conductivity. Overall, the introduction of metallic copper in the initial blend results in a significant improvement of the thermoelectric performance of PbS, reaching a dimensionless thermoelectric figure of merit ZT = 1.1 at 750 K, which represents about a 400% increase over bare PbS. Besides, an average ZTave = 0.72 in the temperature range 320–773 K is demonstrated.}, author = {Li, Mengyao and Liu, Yu and Zhang, Yu and Han, Xu and Xiao, Ke and Nabahat, Mehran and Arbiol, Jordi and Llorca, Jordi and Ibáñez, Maria and Cabot, Andreu}, issn = {1944-8252}, journal = {ACS Applied Materials and Interfaces}, keywords = {CuxS, PbS, energy conversion, nanocomposite, nanoparticle, solution synthesis, thermoelectric}, number = {43}, pages = {51373–51382}, publisher = {American Chemical Society }, title = {{PbS–Pb–CuxS composites for thermoelectric application}}, doi = {10.1021/acsami.1c15609}, volume = {13}, year = {2021}, } @article{9235, abstract = {Cu2–xS has become one of the most promising thermoelectric materials for application in the middle-high temperature range. Its advantages include the abundance, low cost, and safety of its elements and a high performance at relatively elevated temperatures. However, stability issues limit its operation current and temperature, thus calling for the optimization of the material performance in the middle temperature range. Here, we present a synthetic protocol for large scale production of covellite CuS nanoparticles at ambient temperature and atmosphere, and using water as a solvent. The crystal phase and stoichiometry of the particles are afterward tuned through an annealing process at a moderate temperature under inert or reducing atmosphere. While annealing under argon results in Cu1.8S nanopowder with a rhombohedral crystal phase, annealing in an atmosphere containing hydrogen leads to tetragonal Cu1.96S. High temperature X-ray diffraction analysis shows the material annealed in argon to transform to the cubic phase at ca. 400 K, while the material annealed in the presence of hydrogen undergoes two phase transitions, first to hexagonal and then to the cubic structure. The annealing atmosphere, temperature, and time allow adjustment of the density of copper vacancies and thus tuning of the charge carrier concentration and material transport properties. In this direction, the material annealed under Ar is characterized by higher electrical conductivities but lower Seebeck coefficients than the material annealed in the presence of hydrogen. By optimizing the charge carrier concentration through the annealing time, Cu2–xS with record figures of merit in the middle temperature range, up to 1.41 at 710 K, is obtained. We finally demonstrate that this strategy, based on a low-cost and scalable solution synthesis process, is also suitable for the production of high performance Cu2–xS layers using high throughput and cost-effective printing technologies.}, author = {Li, Mengyao and Liu, Yu and Zhang, Yu and Han, Xu and Zhang, Ting and Zuo, Yong and Xie, Chenyang and Xiao, Ke and Arbiol, Jordi and Llorca, Jordi and Ibáñez, Maria and Liu, Junfeng and Cabot, Andreu}, issn = {1936-086X}, journal = {ACS Nano}, keywords = {General Engineering, General Physics and Astronomy, General Materials Science}, number = {3}, pages = {4967–4978}, publisher = {American Chemical Society }, title = {{Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide}}, doi = {10.1021/acsnano.0c09866}, volume = {15}, year = {2021}, } @article{10204, abstract = {Two common representations of close packings of identical spheres consisting of hexagonal layers, called Barlow stackings, appear abundantly in minerals and metals. These motifs, however, occupy an identical portion of space and bear identical first-order topological signatures as measured by persistent homology. Here we present a novel method based on k-fold covers that unambiguously distinguishes between these patterns. Moreover, our approach provides topological evidence that the FCC motif is the more stable of the two in the context of evolving experimental sphere packings during the transition from disordered to an ordered state. We conclude that our approach can be generalised to distinguish between various Barlow stackings manifested in minerals and metals.}, author = {Osang, Georg F and Edelsbrunner, Herbert and Saadatfar, Mohammad}, issn = {1744-6848}, journal = {Soft Matter}, number = {40}, pages = {9107--9115}, publisher = {Royal Society of Chemistry }, title = {{Topological signatures and stability of hexagonal close packing and Barlow stackings}}, doi = {10.1039/d1sm00774b}, volume = {17}, year = {2021}, } @inproceedings{9464, abstract = {We firstly introduce the self-assembled growth of highly uniform Ge quantum wires with controllable position, distance and length on patterned Si (001) substrates. We then present the electrically tunable strong spin-orbit coupling, the first Ge hole spin qubit and ultrafast operation of hole spin qubit in the Ge/Si quantum wires.}, author = {Gao, Fei and Zhang, Jie Yin and Wang, Jian Huan and Ming, Ming and Wang, Tina and Zhang, Jian Jun and Watzinger, Hannes and Kukucka, Josip and Vukušić, Lada and Katsaros, Georgios and Wang, Ke and Xu, Gang and Li, Hai Ou and Guo, Guo Ping}, booktitle = {2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021}, isbn = {9781728181769}, location = {Virtual, Online}, publisher = {IEEE}, title = {{Ge/Si quantum wires for quantum computing}}, doi = {10.1109/EDTM50988.2021.9420817}, year = {2021}, } @inproceedings{9605, abstract = {Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. }, author = {Corbet, René and Kerber, Michael and Lesnick, Michael and Osang, Georg F}, booktitle = {Leibniz International Proceedings in Informatics}, isbn = {9783959771849}, issn = {18688969}, location = {Online}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Computing the multicover bifiltration}}, doi = {10.4230/LIPIcs.SoCG.2021.27}, volume = {189}, year = {2021}, } @inproceedings{9441, abstract = {Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear (PL) approximation M̂ based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂ is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M̂ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. }, author = {Boissonnat, Jean-Daniel and Kachanovich, Siargey and Wintraecken, Mathijs}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, isbn = {978-3-95977-184-9}, issn = {1868-8969}, location = {Virtual}, pages = {17:1--17:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations}}, doi = {10.4230/LIPIcs.SoCG.2021.17}, volume = {189}, year = {2021}, } @article{9393, abstract = {We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff, the ratio, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with bounded treewidth—a class that contains the control flow graphs of most programs. Let n denote the number of nodes of a graph, m the number of edges (for bounded treewidth 𝑚=𝑂(𝑛)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for the minimum initial credit problem we show that (1) for general graphs the problem can be solved in 𝑂(𝑛2⋅𝑚) time and the associated decision problem in 𝑂(𝑛⋅𝑚) time, improving the previous known 𝑂(𝑛3⋅𝑚⋅log(𝑛⋅𝑊)) and 𝑂(𝑛2⋅𝑚) bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm that requires 𝑂(𝑛⋅log𝑛) time. Second, for bounded treewidth graphs we present an algorithm that approximates the mean-payoff value within a factor of 1+𝜖 in time 𝑂(𝑛⋅log(𝑛/𝜖)) as compared to the classical exact algorithms on general graphs that require quadratic time. Third, for the ratio property we present an algorithm that for bounded treewidth graphs works in time 𝑂(𝑛⋅log(|𝑎⋅𝑏|))=𝑂(𝑛⋅log(𝑛⋅𝑊)), when the output is 𝑎𝑏, as compared to the previously best known algorithm on general graphs with running time 𝑂(𝑛2⋅log(𝑛⋅𝑊)). We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks.}, author = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas}, issn = {1572-8102}, journal = {Formal Methods in System Design}, pages = {401--428}, publisher = {Springer}, title = {{Faster algorithms for quantitative verification in bounded treewidth graphs}}, doi = {10.1007/s10703-021-00373-5}, volume = {57}, year = {2021}, } @inproceedings{9227, abstract = {In the multiway cut problem we are given a weighted undirected graph G=(V,E) and a set T⊆V of k terminals. The goal is to find a minimum weight set of edges E′⊆E with the property that by removing E′ from G all the terminals become disconnected. In this paper we present a simple local search approximation algorithm for the multiway cut problem with approximation ratio 2−2k . We present an experimental evaluation of the performance of our local search algorithm and show that it greatly outperforms the isolation heuristic of Dalhaus et al. and it has similar performance as the much more complex algorithms of Calinescu et al., Sharma and Vondrak, and Buchbinder et al. which have the currently best known approximation ratios for this problem.}, author = {Bloch-Hansen, Andrew and Samei, Nasim and Solis-Oba, Roberto}, booktitle = {Conference on Algorithms and Discrete Applied Mathematics}, isbn = {9783030678982}, issn = {1611-3349}, location = {Rupnagar, India}, pages = {346--358}, publisher = {Springer Nature}, title = {{Experimental evaluation of a local search approximation algorithm for the multiway cut problem}}, doi = {10.1007/978-3-030-67899-9_28}, volume = {12601}, year = {2021}, } @article{8817, abstract = {The paper introduces an inertial extragradient subgradient method with self-adaptive step sizes for solving equilibrium problems in real Hilbert spaces. Weak convergence of the proposed method is obtained under the condition that the bifunction is pseudomonotone and Lipchitz continuous. Linear convergence is also given when the bifunction is strongly pseudomonotone and Lipchitz continuous. Numerical implementations and comparisons with other related inertial methods are given using test problems including a real-world application to Nash–Cournot oligopolistic electricity market equilibrium model.}, author = {Shehu, Yekini and Iyiola, Olaniyi S. and Thong, Duong Viet and Van, Nguyen Thi Cam}, issn = {1432-5217}, journal = {Mathematical Methods of Operations Research}, number = {2}, pages = {213--242}, publisher = {Springer Nature}, title = {{An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems}}, doi = {10.1007/s00186-020-00730-w}, volume = {93}, year = {2021}, } @article{9315, abstract = {We consider inertial iteration methods for Fermat–Weber location problem and primal–dual three-operator splitting in real Hilbert spaces. To do these, we first obtain weak convergence analysis and nonasymptotic O(1/n) convergence rate of the inertial Krasnoselskii–Mann iteration for fixed point of nonexpansive operators in infinite dimensional real Hilbert spaces under some seemingly easy to implement conditions on the iterative parameters. One of our contributions is that the convergence analysis and rate of convergence results are obtained using conditions which appear not complicated and restrictive as assumed in other previous related results in the literature. We then show that Fermat–Weber location problem and primal–dual three-operator splitting are special cases of fixed point problem of nonexpansive mapping and consequently obtain the convergence analysis of inertial iteration methods for Fermat–Weber location problem and primal–dual three-operator splitting in real Hilbert spaces. Some numerical implementations are drawn from primal–dual three-operator splitting to support the theoretical analysis.}, author = {Iyiola, Olaniyi S. and Shehu, Yekini}, issn = {1420-9012}, journal = {Results in Mathematics}, number = {2}, publisher = {Springer Nature}, title = {{New convergence results for inertial Krasnoselskii–Mann iterations in Hilbert spaces with applications}}, doi = {10.1007/s00025-021-01381-x}, volume = {76}, year = {2021}, } @article{9365, abstract = {In this paper, we propose a new iterative method with alternated inertial step for solving split common null point problem in real Hilbert spaces. We obtain weak convergence of the proposed iterative algorithm. Furthermore, we introduce the notion of bounded linear regularity property for the split common null point problem and obtain the linear convergence property for the new algorithm under some mild assumptions. Finally, we provide some numerical examples to demonstrate the performance and efficiency of the proposed method.}, author = {Ogbuisi, Ferdinard U. and Shehu, Yekini and Yao, Jen Chih}, issn = {1029-4945}, journal = {Optimization}, publisher = {Taylor and Francis}, title = {{Convergence analysis of new inertial method for the split common null point problem}}, doi = {10.1080/02331934.2021.1914035}, year = {2021}, } @article{10365, abstract = {The early development of many organisms involves the folding of cell monolayers, but this behaviour is difficult to reproduce in vitro; therefore, both mechanistic causes and effects of local curvature remain unclear. Here we study epithelial cell monolayers on corrugated hydrogels engineered into wavy patterns, examining how concave and convex curvatures affect cellular and nuclear shape. We find that substrate curvature affects monolayer thickness, which is larger in valleys than crests. We show that this feature generically arises in a vertex model, leading to the hypothesis that cells may sense curvature by modifying the thickness of the tissue. We find that local curvature also affects nuclear morphology and positioning, which we explain by extending the vertex model to take into account membrane–nucleus interactions, encoding thickness modulation in changes to nuclear deformation and position. We propose that curvature governs the spatial distribution of yes-associated proteins via nuclear shape and density changes. We show that curvature also induces significant variations in lamins, chromatin condensation and cell proliferation rate in folded epithelial tissues. Together, this work identifies active cell mechanics and nuclear mechanoadaptation as the key players of the mechanistic regulation of epithelia to substrate curvature.}, author = {Luciano, Marine and Xue, Shi-lei and De Vos, Winnok H. and Redondo-Morata, Lorena and Surin, Mathieu and Lafont, Frank and Hannezo, Edouard B and Gabriele, Sylvain}, issn = {1745-2481}, journal = {Nature Physics}, number = {12}, pages = {1382–1390}, publisher = {Springer Nature}, title = {{Cell monolayers sense curvature by exploiting active mechanics and nuclear mechanoadaptation}}, doi = {10.1038/s41567-021-01374-1}, volume = {17}, year = {2021}, } @article{9298, abstract = {In 2008, we published the first set of guidelines for standardizing research in autophagy. Since then, this topic has received increasing attention, and many scientists have entered the field. Our knowledge base and relevant new technologies have also been expanding. Thus, it is important to formulate on a regular basis updated guidelines for monitoring autophagy in different organisms. Despite numerous reviews, there continues to be confusion regarding acceptable methods to evaluate autophagy, especially in multicellular eukaryotes. Here, we present a set of guidelines for investigators to select and interpret methods to examine autophagy and related processes, and for reviewers to provide realistic and reasonable critiques of reports that are focused on these processes. These guidelines are not meant to be a dogmatic set of rules, because the appropriateness of any assay largely depends on the question being asked and the system being used. Moreover, no individual assay is perfect for every situation, calling for the use of multiple techniques to properly monitor autophagy in each experimental setting. Finally, several core components of the autophagy machinery have been implicated in distinct autophagic processes (canonical and noncanonical autophagy), implying that genetic approaches to block autophagy should rely on targeting two or more autophagy-related genes that ideally participate in distinct steps of the pathway. Along similar lines, because multiple proteins involved in autophagy also regulate other cellular pathways including apoptosis, not all of them can be used as a specific marker for bona fide autophagic responses. Here, we critically discuss current methods of assessing autophagy and the information they can, or cannot, provide. Our ultimate goal is to encourage intellectual and technical innovation in the field. }, author = {Klionsky, Daniel J. and Abdel-Aziz, Amal Kamal and Abdelfatah, Sara and Abdellatif, Mahmoud and Abdoli, Asghar and Abel, Steffen and Abeliovich, Hagai and Abildgaard, Marie H. and Abudu, Yakubu Princely and Acevedo-Arozena, Abraham and Adamopoulos, Iannis E. and Adeli, Khosrow and Adolph, Timon E. and Adornetto, Annagrazia and Aflaki, Elma and Agam, Galila and Agarwal, Anupam and Aggarwal, Bharat B. and Agnello, Maria and Agostinis, Patrizia and Agrewala, Javed N. and Agrotis, Alexander and Aguilar, Patricia V. and Ahmad, S. Tariq and Ahmed, Zubair M. and Ahumada-Castro, Ulises and Aits, Sonja and Aizawa, Shu and Akkoc, Yunus and Akoumianaki, Tonia and Akpinar, Hafize Aysin and Al-Abd, Ahmed M. and Al-Akra, Lina and Al-Gharaibeh, Abeer and Alaoui-Jamali, Moulay A. and Alberti, Simon and Alcocer-Gómez, Elísabet and Alessandri, Cristiano and Ali, Muhammad and Alim Al-Bari, M. Abdul and Aliwaini, Saeb and Alizadeh, Javad and Almacellas, Eugènia and Almasan, Alexandru and Alonso, Alicia and Alonso, Guillermo D. and Altan-Bonnet, Nihal and Altieri, Dario C. and Álvarez, Élida M.C. and Alves, Sara and Alves Da Costa, Cristine and Alzaharna, Mazen M. and Amadio, Marialaura and Amantini, Consuelo and Amaral, Cristina and Ambrosio, Susanna and Amer, Amal O. and Ammanathan, Veena and An, Zhenyi and Andersen, Stig U. and Andrabi, Shaida A. and Andrade-Silva, Magaiver and Andres, Allen M. and Angelini, Sabrina and Ann, David and Anozie, Uche C. and Ansari, Mohammad Y. and Antas, Pedro and Antebi, Adam and Antón, Zuriñe and Anwar, Tahira and Apetoh, Lionel and Apostolova, Nadezda and Araki, Toshiyuki and Araki, Yasuhiro and Arasaki, Kohei and Araújo, Wagner L. and Araya, Jun and Arden, Catherine and Arévalo, Maria Angeles and Arguelles, Sandro and Arias, Esperanza and Arikkath, Jyothi and Arimoto, Hirokazu and Ariosa, Aileen R. and Armstrong-James, Darius and Arnauné-Pelloquin, Laetitia and Aroca, Angeles and Arroyo, Daniela S. and Arsov, Ivica and Artero, Rubén and Asaro, Dalia Maria Lucia and Aschner, Michael and Ashrafizadeh, Milad and Ashur-Fabian, Osnat and Atanasov, Atanas G. and Au, Alicia K. and Auberger, Patrick and Auner, Holger W. and Aurelian, Laure and Autelli, Riccardo and Avagliano, Laura and Ávalos, Yenniffer and Aveic, Sanja and Aveleira, Célia Alexandra and Avin-Wittenberg, Tamar and Aydin, Yucel and Ayton, Scott and Ayyadevara, Srinivas and Azzopardi, Maria and Baba, Misuzu and Backer, Jonathan M. and Backues, Steven K. and Bae, Dong Hun and Bae, Ok Nam and Bae, Soo Han and Baehrecke, Eric H. and Baek, Ahruem and Baek, Seung Hoon and Baek, Sung Hee and Bagetta, Giacinto and Bagniewska-Zadworna, Agnieszka and Bai, Hua and Bai, Jie and Bai, Xiyuan and Bai, Yidong and Bairagi, Nandadulal and Baksi, Shounak and Balbi, Teresa and Baldari, Cosima T. and Balduini, Walter and Ballabio, Andrea and Ballester, Maria and Balazadeh, Salma and Balzan, Rena and Bandopadhyay, Rina and Banerjee, Sreeparna and Banerjee, Sulagna and Bánréti, Ágnes and Bao, Yan and Baptista, Mauricio S. and Baracca, Alessandra and Barbati, Cristiana and Bargiela, Ariadna and Barilà, Daniela and Barlow, Peter G. and Barmada, Sami J. and Barreiro, Esther and Barreto, George E. and Bartek, Jiri and Bartel, Bonnie and Bartolome, Alberto and Barve, Gaurav R. and Basagoudanavar, Suresh H. and Bassham, Diane C. and Bast, Robert C. and Basu, Alakananda and Batoko, Henri and Batten, Isabella and Baulieu, Etienne E. and Baumgarner, Bradley L. and Bayry, Jagadeesh and Beale, Rupert and Beau, Isabelle and Beaumatin, Florian and Bechara, Luiz R.G. and Beck, George R. and Beers, Michael F. and Begun, Jakob and Behrends, Christian and Behrens, Georg M.N. and Bei, Roberto and Bejarano, Eloy and Bel, Shai and Behl, Christian and Belaid, Amine and Belgareh-Touzé, Naïma and Bellarosa, Cristina and Belleudi, Francesca and Belló Pérez, Melissa and Bello-Morales, Raquel and Beltran, Jackeline Soares De Oliveira and Beltran, Sebastián and Benbrook, Doris Mangiaracina and Bendorius, Mykolas and Benitez, Bruno A. and Benito-Cuesta, Irene and Bensalem, Julien and Berchtold, Martin W. and Berezowska, Sabina and Bergamaschi, Daniele and Bergami, Matteo and Bergmann, Andreas and Berliocchi, Laura and Berlioz-Torrent, Clarisse and Bernard, Amélie and Berthoux, Lionel and Besirli, Cagri G. and Besteiro, Sebastien and Betin, Virginie M. and Beyaert, Rudi and Bezbradica, Jelena S. and Bhaskar, Kiran and Bhatia-Kissova, Ingrid and Bhattacharya, Resham and Bhattacharya, Sujoy and Bhattacharyya, Shalmoli and Bhuiyan, Md Shenuarin and Bhutia, Sujit Kumar and Bi, Lanrong and Bi, Xiaolin and Biden, Trevor J. and Bijian, Krikor and Billes, Viktor A. and Binart, Nadine and Bincoletto, Claudia and Birgisdottir, Asa B. and Bjorkoy, Geir and Blanco, Gonzalo and Blas-Garcia, Ana and Blasiak, Janusz and Blomgran, Robert and Blomgren, Klas and Blum, Janice S. and Boada-Romero, Emilio and Boban, Mirta and Boesze-Battaglia, Kathleen and Boeuf, Philippe and Boland, Barry and Bomont, Pascale and Bonaldo, Paolo and Bonam, Srinivasa Reddy and Bonfili, Laura and Bonifacino, Juan S. and Boone, Brian A. and Bootman, Martin D. and Bordi, Matteo and Borner, Christoph and Bornhauser, Beat C. and Borthakur, Gautam and Bosch, Jürgen and Bose, Santanu and Botana, Luis M. and Botas, Juan and Boulanger, Chantal M. and Boulton, Michael E. and Bourdenx, Mathieu and Bourgeois, Benjamin and Bourke, Nollaig M. and Bousquet, Guilhem and Boya, Patricia and Bozhkov, Peter V. and Bozi, Luiz H.M. and Bozkurt, Tolga O. and Brackney, Doug E. and Brandts, Christian H. and Braun, Ralf J. and Braus, Gerhard H. and Bravo-Sagua, Roberto and Bravo-San Pedro, José M. and Brest, Patrick and Bringer, Marie Agnès and Briones-Herrera, Alfredo and Broaddus, V. Courtney and Brodersen, Peter and Brodsky, Jeffrey L. and Brody, Steven L. and Bronson, Paola G. and Bronstein, Jeff M. and Brown, Carolyn N. and Brown, Rhoderick E. and Brum, Patricia C. and Brumell, John H. and Brunetti-Pierri, Nicola and Bruno, Daniele and Bryson-Richardson, Robert J. and Bucci, Cecilia and Buchrieser, Carmen and Bueno, Marta and Buitrago-Molina, Laura Elisa and Buraschi, Simone and Buch, Shilpa and Buchan, J. Ross and Buckingham, Erin M. and Budak, Hikmet and Budini, Mauricio and Bultynck, Geert and Burada, Florin and Burgoyne, Joseph R. and Burón, M. Isabel and Bustos, Victor and Büttner, Sabrina and Butturini, Elena and Byrd, Aaron and Cabas, Isabel and Cabrera-Benitez, Sandra and Cadwell, Ken and Cai, Jingjing and Cai, Lu and Cai, Qian and Cairó, Montserrat and Calbet, Jose A. and Caldwell, Guy A. and Caldwell, Kim A. and Call, Jarrod A. and Calvani, Riccardo and Calvo, Ana C. and Calvo-Rubio Barrera, Miguel and Camara, Niels O.S. and Camonis, Jacques H. and Camougrand, Nadine and Campanella, Michelangelo and Campbell, Edward M. and Campbell-Valois, François Xavier and Campello, Silvia and Campesi, Ilaria and Campos, Juliane C. and Camuzard, Olivier and Cancino, Jorge and Candido De Almeida, Danilo and Canesi, Laura and Caniggia, Isabella and Canonico, Barbara and Cantí, Carles and Cao, Bin and Caraglia, Michele and Caramés, Beatriz and Carchman, Evie H. and Cardenal-Muñoz, Elena and Cardenas, Cesar and Cardenas, Luis and Cardoso, Sandra M. and Carew, Jennifer S. and Carle, Georges F. and Carleton, Gillian and Carloni, Silvia and Carmona-Gutierrez, Didac and Carneiro, Leticia A. and Carnevali, Oliana and Carosi, Julian M. and Carra, Serena and Carrier, Alice and Carrier, Lucie and Carroll, Bernadette and Carter, A. Brent and Carvalho, Andreia Neves and Casanova, Magali and Casas, Caty and Casas, Josefina and Cassioli, Chiara and Castillo, Eliseo F. and Castillo, Karen and Castillo-Lluva, Sonia and Castoldi, Francesca and Castori, Marco and Castro, Ariel F. and Castro-Caldas, Margarida and Castro-Hernandez, Javier and Castro-Obregon, Susana and Catz, Sergio D. and Cavadas, Claudia and Cavaliere, Federica and Cavallini, Gabriella and Cavinato, Maria and Cayuela, Maria L. and Cebollada Rica, Paula and Cecarini, Valentina and Cecconi, Francesco and Cechowska-Pasko, Marzanna and Cenci, Simone and Ceperuelo-Mallafré, Victòria and Cerqueira, João J. and Cerutti, Janete M. and Cervia, Davide and Cetintas, Vildan Bozok and Cetrullo, Silvia and Chae, Han Jung and Chagin, Andrei S. and Chai, Chee Yin and Chakrabarti, Gopal and Chakrabarti, Oishee and Chakraborty, Tapas and Chakraborty, Trinad and Chami, Mounia and Chamilos, Georgios and Chan, David W. and Chan, Edmond Y.W. and Chan, Edward D. and Chan, H. Y.Edwin and Chan, Helen H. and Chan, Hung and Chan, Matthew T.V. and Chan, Yau Sang and Chandra, Partha K. and Chang, Chih Peng and Chang, Chunmei and Chang, Hao Chun and Chang, Kai and Chao, Jie and Chapman, Tracey and Charlet-Berguerand, Nicolas and Chatterjee, Samrat and Chaube, Shail K. and Chaudhary, Anu and Chauhan, Santosh and Chaum, Edward and Checler, Frédéric and Cheetham, Michael E. and Chen, Chang Shi and Chen, Guang Chao and Chen, Jian Fu and Chen, Liam L. and Chen, Leilei and Chen, Lin and Chen, Mingliang and Chen, Mu Kuan and Chen, Ning and Chen, Quan and Chen, Ruey Hwa and Chen, Shi and Chen, Wei and Chen, Weiqiang and Chen, Xin Ming and Chen, Xiong Wen and Chen, Xu and Chen, Yan and Chen, Ye Guang and Chen, Yingyu and Chen, Yongqiang and Chen, Yu Jen and Chen, Yue Qin and Chen, Zhefan Stephen and Chen, Zhi and Chen, Zhi Hua and Chen, Zhijian J. and Chen, Zhixiang and Cheng, Hanhua and Cheng, Jun and Cheng, Shi Yuan and Cheng, Wei and Cheng, Xiaodong and Cheng, Xiu Tang and Cheng, Yiyun and Cheng, Zhiyong and Chen, Zhong and Cheong, Heesun and Cheong, Jit Kong and Chernyak, Boris V. and Cherry, Sara and Cheung, Chi Fai Randy and Cheung, Chun Hei Antonio and Cheung, King Ho and Chevet, Eric and Chi, Richard J. and Chiang, Alan Kwok Shing and Chiaradonna, Ferdinando and Chiarelli, Roberto and Chiariello, Mario and Chica, Nathalia and Chiocca, Susanna and Chiong, Mario and Chiou, Shih Hwa and Chiramel, Abhilash I. and Chiurchiù, Valerio and Cho, Dong Hyung and Choe, Seong Kyu and Choi, Augustine M.K. and Choi, Mary E. and Choudhury, Kamalika Roy and Chow, Norman S. and Chu, Charleen T. and Chua, Jason P. and Chua, John Jia En and Chung, Hyewon and Chung, Kin Pan and Chung, Seockhoon and Chung, So Hyang and Chung, Yuen Li and Cianfanelli, Valentina and Ciechomska, Iwona A. and Cifuentes, Mariana and Cinque, Laura and Cirak, Sebahattin and Cirone, Mara and Clague, Michael J. and Clarke, Robert and Clementi, Emilio and Coccia, Eliana M. and Codogno, Patrice and Cohen, Ehud and Cohen, Mickael M. and Colasanti, Tania and Colasuonno, Fiorella and Colbert, Robert A. and Colell, Anna and Čolić, Miodrag and Coll, Nuria S. and Collins, Mark O. and Colombo, María I. and Colón-Ramos, Daniel A. and Combaret, Lydie and Comincini, Sergio and Cominetti, Márcia R. and Consiglio, Antonella and Conte, Andrea and Conti, Fabrizio and Contu, Viorica Raluca and Cookson, Mark R. and Coombs, Kevin M. and Coppens, Isabelle and Corasaniti, Maria Tiziana and Corkery, Dale P. and Cordes, Nils and Cortese, Katia and Costa, Maria Do Carmo and Costantino, Sarah and Costelli, Paola and Coto-Montes, Ana and Crack, Peter J. and Crespo, Jose L. and Criollo, Alfredo and Crippa, Valeria and Cristofani, Riccardo and Csizmadia, Tamas and Cuadrado, Antonio and Cui, Bing and Cui, Jun and Cui, Yixian and Cui, Yong and Culetto, Emmanuel and Cumino, Andrea C. and Cybulsky, Andrey V. and Czaja, Mark J. and Czuczwar, Stanislaw J. and D’Adamo, Stefania and D’Amelio, Marcello and D’Arcangelo, Daniela and D’Lugos, Andrew C. and D’Orazi, Gabriella and Da Silva, James A. and Dafsari, Hormos Salimi and Dagda, Ruben K. and Dagdas, Yasin and Daglia, Maria and Dai, Xiaoxia and Dai, Yun and Dai, Yuyuan and Dal Col, Jessica and Dalhaimer, Paul and Dalla Valle, Luisa and Dallenga, Tobias and Dalmasso, Guillaume and Damme, Markus and Dando, Ilaria and Dantuma, Nico P. and Darling, April L. and Das, Hiranmoy and Dasarathy, Srinivasan and Dasari, Santosh K. and Dash, Srikanta and Daumke, Oliver and Dauphinee, Adrian N. and Davies, Jeffrey S. and Dávila, Valeria A. and Davis, Roger J. and Davis, Tanja and Dayalan Naidu, Sharadha and De Amicis, Francesca and De Bosscher, Karolien and De Felice, Francesca and De Franceschi, Lucia and De Leonibus, Chiara and De Mattos Barbosa, Mayara G. and De Meyer, Guido R.Y. and De Milito, Angelo and De Nunzio, Cosimo and De Palma, Clara and De Santi, Mauro and De Virgilio, Claudio and De Zio, Daniela and Debnath, Jayanta and Debosch, Brian J. and Decuypere, Jean Paul and Deehan, Mark A. and Deflorian, Gianluca and Degregori, James and Dehay, Benjamin and Del Rio, Gabriel and Delaney, Joe R. and Delbridge, Lea M.D. and Delorme-Axford, Elizabeth and Delpino, M. Victoria and Demarchi, Francesca and Dembitz, Vilma and Demers, Nicholas D. and Deng, Hongbin and Deng, Zhiqiang and Dengjel, Joern and Dent, Paul and Denton, Donna and Depamphilis, Melvin L. and Der, Channing J. and Deretic, Vojo and Descoteaux, Albert and Devis, Laura and Devkota, Sushil and Devuyst, Olivier and Dewson, Grant and Dharmasivam, Mahendiran and Dhiman, Rohan and Di Bernardo, Diego and Di Cristina, Manlio and Di Domenico, Fabio and Di Fazio, Pietro and Di Fonzo, Alessio and Di Guardo, Giovanni and Di Guglielmo, Gianni M. and Di Leo, Luca and Di Malta, Chiara and Di Nardo, Alessia and Di Rienzo, Martina and Di Sano, Federica and Diallinas, George and Diao, Jiajie and Diaz-Araya, Guillermo and Díaz-Laviada, Inés and Dickinson, Jared M. and Diederich, Marc and Dieudé, Mélanie and Dikic, Ivan and Ding, Shiping and Ding, Wen Xing and Dini, Luciana and Dinić, Jelena and Dinic, Miroslav and Dinkova-Kostova, Albena T. and Dionne, Marc S. and Distler, Jörg H.W. and Diwan, Abhinav and Dixon, Ian M.C. and Djavaheri-Mergny, Mojgan and Dobrinski, Ina and Dobrovinskaya, Oxana and Dobrowolski, Radek and Dobson, Renwick C.J. and Đokić, Jelena and Dokmeci Emre, Serap and Donadelli, Massimo and Dong, Bo and Dong, Xiaonan and Dong, Zhiwu and Dorn, Gerald W. and Dotsch, Volker and Dou, Huan and Dou, Juan and Dowaidar, Moataz and Dridi, Sami and Drucker, Liat and Du, Ailian and Du, Caigan and Du, Guangwei and Du, Hai Ning and Du, Li Lin and Du Toit, André and Duan, Shao Bin and Duan, Xiaoqiong and Duarte, Sónia P. and Dubrovska, Anna and Dunlop, Elaine A. and Dupont, Nicolas and Durán, Raúl V. and Dwarakanath, Bilikere S. and Dyshlovoy, Sergey A. and Ebrahimi-Fakhari, Darius and Eckhart, Leopold and Edelstein, Charles L. and Efferth, Thomas and Eftekharpour, Eftekhar and Eichinger, Ludwig and Eid, Nabil and Eisenberg, Tobias and Eissa, N. Tony and Eissa, Sanaa and Ejarque, Miriam and El Andaloussi, Abdeljabar and El-Hage, Nazira and El-Naggar, Shahenda and Eleuteri, Anna Maria and El-Shafey, Eman S. and Elgendy, Mohamed and Eliopoulos, Aristides G. and Elizalde, María M. and Elks, Philip M. and Elsasser, Hans Peter and Elsherbiny, Eslam S. and Emerling, Brooke M. and Emre, N. C.Tolga and Eng, Christina H. and Engedal, Nikolai and Engelbrecht, Anna Mart and Engelsen, Agnete S.T. and Enserink, Jorrit M. and Escalante, Ricardo and Esclatine, Audrey and Escobar-Henriques, Mafalda and Eskelinen, Eeva Liisa and Espert, Lucile and Eusebio, Makandjou Ola and Fabrias, Gemma and Fabrizi, Cinzia and Facchiano, Antonio and Facchiano, Francesco and Fadeel, Bengt and Fader, Claudio and Faesen, Alex C. and Fairlie, W. Douglas and Falcó, Alberto and Falkenburger, Bjorn H. and Fan, Daping and Fan, Jie and Fan, Yanbo and Fang, Evandro F. and Fang, Yanshan and Fang, Yognqi and Fanto, Manolis and Farfel-Becker, Tamar and Faure, Mathias and Fazeli, Gholamreza and Fedele, Anthony O. and Feldman, Arthur M. and Feng, Du and Feng, Jiachun and Feng, Lifeng and Feng, Yibin and Feng, Yuchen and Feng, Wei and Fenz Araujo, Thais and Ferguson, Thomas A. and Fernández, Álvaro F. and Fernandez-Checa, Jose C. and Fernández-Veledo, Sonia and Fernie, Alisdair R. and Ferrante, Anthony W. and Ferraresi, Alessandra and Ferrari, Merari F. and Ferreira, Julio C.B. and Ferro-Novick, Susan and Figueras, Antonio and Filadi, Riccardo and Filigheddu, Nicoletta and Filippi-Chiela, Eduardo and Filomeni, Giuseppe and Fimia, Gian Maria and Fineschi, Vittorio and Finetti, Francesca and Finkbeiner, Steven and Fisher, Edward A. and Fisher, Paul B. and Flamigni, Flavio and Fliesler, Steven J. and Flo, Trude H. and Florance, Ida and Florey, Oliver and Florio, Tullio and Fodor, Erika and Follo, Carlo and Fon, Edward A. and Forlino, Antonella and Fornai, Francesco and Fortini, Paola and Fracassi, Anna and Fraldi, Alessandro and Franco, Brunella and Franco, Rodrigo and Franconi, Flavia and Frankel, Lisa B. and Friedman, Scott L. and Fröhlich, Leopold F. and Frühbeck, Gema and Fuentes, Jose M. and Fujiki, Yukio and Fujita, Naonobu and Fujiwara, Yuuki and Fukuda, Mitsunori and Fulda, Simone and Furic, Luc and Furuya, Norihiko and Fusco, Carmela and Gack, Michaela U. and Gaffke, Lidia and Galadari, Sehamuddin and Galasso, Alessia and Galindo, Maria F. and Gallolu Kankanamalage, Sachith and Galluzzi, Lorenzo and Galy, Vincent and Gammoh, Noor and Gan, Boyi and Ganley, Ian G. and Gao, Feng and Gao, Hui and Gao, Minghui and Gao, Ping and Gao, Shou Jiang and Gao, Wentao and Gao, Xiaobo and Garcera, Ana and Garcia, Maria Noé and Garcia, Verónica E. and García-Del Portillo, Francisco and Garcia-Escudero, Vega and Garcia-Garcia, Aracely and Garcia-Macia, Marina and García-Moreno, Diana and Garcia-Ruiz, Carmen and García-Sanz, Patricia and Garg, Abhishek D. and Gargini, Ricardo and Garofalo, Tina and Garry, Robert F. and Gassen, Nils C. and Gatica, Damian and Ge, Liang and Ge, Wanzhong and Geiss-Friedlander, Ruth and Gelfi, Cecilia and Genschik, Pascal and Gentle, Ian E. and Gerbino, Valeria and Gerhardt, Christoph and Germain, Kyla and Germain, Marc and Gewirtz, David A. and Ghasemipour Afshar, Elham and Ghavami, Saeid and Ghigo, Alessandra and Ghosh, Manosij and Giamas, Georgios and Giampietri, Claudia and Giatromanolaki, Alexandra and Gibson, Gary E. and Gibson, Spencer B. and Ginet, Vanessa and Giniger, Edward and Giorgi, Carlotta and Girao, Henrique and Girardin, Stephen E. and Giridharan, Mridhula and Giuliano, Sandy and Giulivi, Cecilia and Giuriato, Sylvie and Giustiniani, Julien and Gluschko, Alexander and Goder, Veit and Goginashvili, Alexander and Golab, Jakub and Goldstone, David C. and Golebiewska, Anna and Gomes, Luciana R. and Gomez, Rodrigo and Gómez-Sánchez, Rubén and Gomez-Puerto, Maria Catalina and Gomez-Sintes, Raquel and Gong, Qingqiu and Goni, Felix M. and González-Gallego, Javier and Gonzalez-Hernandez, Tomas and Gonzalez-Polo, Rosa A. and Gonzalez-Reyes, Jose A. and González-Rodríguez, Patricia and Goping, Ing Swie and Gorbatyuk, Marina S. and Gorbunov, Nikolai V. and Görgülü, Kıvanç and Gorojod, Roxana M. and Gorski, Sharon M. and Goruppi, Sandro and Gotor, Cecilia and Gottlieb, Roberta A. and Gozes, Illana and Gozuacik, Devrim and Graef, Martin and Gräler, Markus H. and Granatiero, Veronica and Grasso, Daniel and Gray, Joshua P. and Green, Douglas R. and Greenhough, Alexander and Gregory, Stephen L. and Griffin, Edward F. and Grinstaff, Mark W. and Gros, Frederic and Grose, Charles and Gross, Angelina S. and Gruber, Florian and Grumati, Paolo and Grune, Tilman and Gu, Xueyan and Guan, Jun Lin and Guardia, Carlos M. and Guda, Kishore and Guerra, Flora and Guerri, Consuelo and Guha, Prasun and Guillén, Carlos and Gujar, Shashi and Gukovskaya, Anna and Gukovsky, Ilya and Gunst, Jan and Günther, Andreas and Guntur, Anyonya R. and Guo, Chuanyong and Guo, Chun and Guo, Hongqing and Guo, Lian Wang and Guo, Ming and Gupta, Pawan and Gupta, Shashi Kumar and Gupta, Swapnil and Gupta, Veer Bala and Gupta, Vivek and Gustafsson, Asa B. and Gutterman, David D. and H.B, Ranjitha and Haapasalo, Annakaisa and Haber, James E. and Hać, Aleksandra and Hadano, Shinji and Hafrén, Anders J. and Haidar, Mansour and Hall, Belinda S. and Halldén, Gunnel and Hamacher-Brady, Anne and Hamann, Andrea and Hamasaki, Maho and Han, Weidong and Hansen, Malene and Hanson, Phyllis I. . and Hao, Zijian and Harada, Masaru and Harhaji-Trajkovic, Ljubica and Hariharan, Nirmala and Haroon, Nigil and Harris, James and Hasegawa, Takafumi and Hasima Nagoor, Noor and Haspel, Jeffrey A. and Haucke, Volker and Hawkins, Wayne D. and Hay, Bruce A. and Haynes, Cole M. and Hayrabedyan, Soren B. and Hays, Thomas S. and He, Congcong and He, Qin and He, Rong Rong and He, You Wen and He, Yu Ying and Heakal, Yasser and Heberle, Alexander M. and Hejtmancik, J. Fielding and Helgason, Gudmundur Vignir and Henkel, Vanessa and Herb, Marc and Hergovich, Alexander and Herman-Antosiewicz, Anna and Hernández, Agustín and Hernandez, Carlos and Hernandez-Diaz, Sergio and Hernandez-Gea, Virginia and Herpin, Amaury and Herreros, Judit and Hervás, Javier H. and Hesselson, Daniel and Hetz, Claudio and Heussler, Volker T. and Higuchi, Yujiro and Hilfiker, Sabine and Hill, Joseph A. and Hlavacek, William S. and Ho, Emmanuel A. and Ho, Idy H.T. and Ho, Philip Wing Lok and Ho, Shu Leong and Ho, Wan Yun and Hobbs, G. Aaron and Hochstrasser, Mark and Hoet, Peter H.M. and Hofius, Daniel and Hofman, Paul and Höhn, Annika and Holmberg, Carina I. and Hombrebueno, Jose R. and Yi-Ren Hong, Chang Won Hong and Hooper, Lora V. and Hoppe, Thorsten and Horos, Rastislav and Hoshida, Yujin and Hsin, I. Lun and Hsu, Hsin Yun and Hu, Bing and Hu, Dong and Hu, Li Fang and Hu, Ming Chang and Hu, Ronggui and Hu, Wei and Hu, Yu Chen and Hu, Zhuo Wei and Hua, Fang and Hua, Jinlian and Hua, Yingqi and Huan, Chongmin and Huang, Canhua and Huang, Chuanshu and Huang, Chuanxin and Huang, Chunling and Huang, Haishan and Huang, Kun and Huang, Michael L.H. and Huang, Rui and Huang, Shan and Huang, Tianzhi and Huang, Xing and Huang, Yuxiang Jack and Huber, Tobias B. and Hubert, Virginie and Hubner, Christian A. and Hughes, Stephanie M. and Hughes, William E. and Humbert, Magali and Hummer, Gerhard and Hurley, James H. and Hussain, Sabah and Hussain, Salik and Hussey, Patrick J. and Hutabarat, Martina and Hwang, Hui Yun and Hwang, Seungmin and Ieni, Antonio and Ikeda, Fumiyo and Imagawa, Yusuke and Imai, Yuzuru and Imbriano, Carol and Imoto, Masaya and Inman, Denise M. and Inoki, Ken and Iovanna, Juan and Iozzo, Renato V. and Ippolito, Giuseppe and Irazoqui, Javier E. and Iribarren, Pablo and Ishaq, Mohd and Ishikawa, Makoto and Ishimwe, Nestor and Isidoro, Ciro and Ismail, Nahed and Issazadeh-Navikas, Shohreh and Itakura, Eisuke and Ito, Daisuke and Ivankovic, Davor and Ivanova, Saška and Iyer, Anand Krishnan V. and Izquierdo, José M. and Izumi, Masanori and Jäättelä, Marja and Jabir, Majid Sakhi and Jackson, William T. and Jacobo-Herrera, Nadia and Jacomin, Anne Claire and Jacquin, Elise and Jadiya, Pooja and Jaeschke, Hartmut and Jagannath, Chinnaswamy and Jakobi, Arjen J. and Jakobsson, Johan and Janji, Bassam and Jansen-Dürr, Pidder and Jansson, Patric J. and Jantsch, Jonathan and Januszewski, Sławomir and Jassey, Alagie and Jean, Steve and Jeltsch-David, Hélène and Jendelova, Pavla and Jenny, Andreas and Jensen, Thomas E. and Jessen, Niels and Jewell, Jenna L. and Ji, Jing and Jia, Lijun and Jia, Rui and Jiang, Liwen and Jiang, Qing and Jiang, Richeng and Jiang, Teng and Jiang, Xuejun and Jiang, Yu and Jimenez-Sanchez, Maria and Jin, Eun Jung and Jin, Fengyan and Jin, Hongchuan and Jin, Li and Jin, Luqi and Jin, Meiyan and Jin, Si and Jo, Eun Kyeong and Joffre, Carine and Johansen, Terje and Johnson, Gail V.W. and Johnston, Simon A. and Jokitalo, Eija and Jolly, Mohit Kumar and Joosten, Leo A.B. and Jordan, Joaquin and Joseph, Bertrand and Ju, Dianwen and Ju, Jeong Sun and Ju, Jingfang and Juárez, Esmeralda and Judith, Delphine and Juhász, Gábor and Jun, Youngsoo and Jung, Chang Hwa and Jung, Sung Chul and Jung, Yong Keun and Jungbluth, Heinz and Jungverdorben, Johannes and Just, Steffen and Kaarniranta, Kai and Kaasik, Allen and Kabuta, Tomohiro and Kaganovich, Daniel and Kahana, Alon and Kain, Renate and Kajimura, Shinjo and Kalamvoki, Maria and Kalia, Manjula and Kalinowski, Danuta S. and Kaludercic, Nina and Kalvari, Ioanna and Kaminska, Joanna and Kaminskyy, Vitaliy O. and Kanamori, Hiromitsu and Kanasaki, Keizo and Kang, Chanhee and Kang, Rui and Kang, Sang Sun and Kaniyappan, Senthilvelrajan and Kanki, Tomotake and Kanneganti, Thirumala Devi and Kanthasamy, Anumantha G. and Kanthasamy, Arthi and Kantorow, Marc and Kapuy, Orsolya and Karamouzis, Michalis V. and Karim, Md Razaul and Karmakar, Parimal and Katare, Rajesh G. and Kato, Masaru and Kaufmann, Stefan H.E. and Kauppinen, Anu and Kaushal, Gur P. and Kaushik, Susmita and Kawasaki, Kiyoshi and Kazan, Kemal and Ke, Po Yuan and Keating, Damien J. and Keber, Ursula and Kehrl, John H. and Keller, Kate E. and Keller, Christian W. and Kemper, Jongsook Kim and Kenific, Candia M. and Kepp, Oliver and Kermorgant, Stephanie and Kern, Andreas and Ketteler, Robin and Keulers, Tom G. and Khalfin, Boris and Khalil, Hany and Khambu, Bilon and Khan, Shahid Y. and Khandelwal, Vinoth Kumar Megraj and Khandia, Rekha and Kho, Widuri and Khobrekar, Noopur V. and Khuansuwan, Sataree and Khundadze, Mukhran and Killackey, Samuel A. and Kim, Dasol and Kim, Deok Ryong and Kim, Do Hyung and Kim, Dong Eun and Kim, Eun Young and Kim, Eun Kyoung and Kim, Hak Rim and Kim, Hee Sik and Hyung-Ryong Kim, Unknown and Kim, Jeong Hun and Kim, Jin Kyung and Kim, Jin Hoi and Kim, Joungmok and Kim, Ju Hwan and Kim, Keun Il and Kim, Peter K. and Kim, Seong Jun and Kimball, Scot R. and Kimchi, Adi and Kimmelman, Alec C. and Kimura, Tomonori and King, Matthew A. and Kinghorn, Kerri J. and Kinsey, Conan G. and Kirkin, Vladimir and Kirshenbaum, Lorrie A. and Kiselev, Sergey L. and Kishi, Shuji and Kitamoto, Katsuhiko and Kitaoka, Yasushi and Kitazato, Kaio and Kitsis, Richard N. and Kittler, Josef T. and Kjaerulff, Ole and Klein, Peter S. and Klopstock, Thomas and Klucken, Jochen and Knævelsrud, Helene and Knorr, Roland L. and Ko, Ben C.B. and Ko, Fred and Ko, Jiunn Liang and Kobayashi, Hotaka and Kobayashi, Satoru and Koch, Ina and Koch, Jan C. and Koenig, Ulrich and Kögel, Donat and Koh, Young Ho and Koike, Masato and Kohlwein, Sepp D. and Kocaturk, Nur M. and Komatsu, Masaaki and König, Jeannette and Kono, Toru and Kopp, Benjamin T. and Korcsmaros, Tamas and Korkmaz, Gözde and Korolchuk, Viktor I. and Korsnes, Mónica Suárez and Koskela, Ali and Kota, Janaiah and Kotake, Yaichiro and Kotler, Monica L. and Kou, Yanjun and Koukourakis, Michael I. and Koustas, Evangelos and Kovacs, Attila L. and Kovács, Tibor and Koya, Daisuke and Kozako, Tomohiro and Kraft, Claudine and Krainc, Dimitri and Krämer, Helmut and Krasnodembskaya, Anna D. and Kretz-Remy, Carole and Kroemer, Guido and Ktistakis, Nicholas T. and Kuchitsu, Kazuyuki and Kuenen, Sabine and Kuerschner, Lars and Kukar, Thomas and Kumar, Ajay and Kumar, Ashok and Kumar, Deepak and Kumar, Dhiraj and Kumar, Sharad and Kume, Shinji and Kumsta, Caroline and Kundu, Chanakya N. and Kundu, Mondira and Kunnumakkara, Ajaikumar B. and Kurgan, Lukasz and Kutateladze, Tatiana G. and Kutlu, Ozlem and Kwak, Seong Ae and Kwon, Ho Jeong and Kwon, Taeg Kyu and Kwon, Yong Tae and Kyrmizi, Irene and La Spada, Albert and Labonté, Patrick and Ladoire, Sylvain and Laface, Ilaria and Lafont, Frank and Lagace, Diane C. and Lahiri, Vikramjit and Lai, Zhibing and Laird, Angela S. and Lakkaraju, Aparna and Lamark, Trond and Lan, Sheng Hui and Landajuela, Ane and Lane, Darius J.R. and Lane, Jon D. and Lang, Charles H. and Lange, Carsten and Langel, Ülo and Langer, Rupert and Lapaquette, Pierre and Laporte, Jocelyn and Larusso, Nicholas F. and Lastres-Becker, Isabel and Lau, Wilson Chun Yu and Laurie, Gordon W. and Lavandero, Sergio and Law, Betty Yuen Kwan and Law, Helen Ka Wai and Layfield, Rob and Le, Weidong and Le Stunff, Herve and Leary, Alexandre Y. and Lebrun, Jean Jacques and Leck, Lionel Y.W. and Leduc-Gaudet, Jean Philippe and Lee, Changwook and Lee, Chung Pei and Lee, Da Hye and Lee, Edward B. and Lee, Erinna F. and Lee, Gyun Min and Lee, He Jin and Lee, Heung Kyu and Lee, Jae Man and Lee, Jason S. and Lee, Jin A. and Lee, Joo Yong and Lee, Jun Hee and Lee, Michael and Lee, Min Goo and Lee, Min Jae and Lee, Myung Shik and Lee, Sang Yoon and Lee, Seung Jae and Lee, Stella Y. and Lee, Sung Bae and Lee, Won Hee and Lee, Ying Ray and Lee, Yong Ho and Lee, Youngil and Lefebvre, Christophe and Legouis, Renaud and Lei, Yu L. and Lei, Yuchen and Leikin, Sergey and Leitinger, Gerd and Lemus, Leticia and Leng, Shuilong and Lenoir, Olivia and Lenz, Guido and Lenz, Heinz Josef and Lenzi, Paola and León, Yolanda and Leopoldino, Andréia M. and Leschczyk, Christoph and Leskelä, Stina and Letellier, Elisabeth and Leung, Chi Ting and Leung, Po Sing and Leventhal, Jeremy S. and Levine, Beth and Lewis, Patrick A. and Ley, Klaus and Li, Bin and Li, Da Qiang and Li, Jianming and Li, Jing and Li, Jiong and Li, Ke and Li, Liwu and Li, Mei and Li, Min and Li, Min and Li, Ming and Li, Mingchuan and Li, Pin Lan and Li, Ming Qing and Li, Qing and Li, Sheng and Li, Tiangang and Li, Wei and Li, Wenming and Li, Xue and Li, Yi Ping and Li, Yuan and Li, Zhiqiang and Li, Zhiyong and Li, Zhiyuan and Lian, Jiqin and Liang, Chengyu and Liang, Qiangrong and Liang, Weicheng and Liang, Yongheng and Liang, Yong Tian and Liao, Guanghong and Liao, Lujian and Liao, Mingzhi and Liao, Yung Feng and Librizzi, Mariangela and Lie, Pearl P.Y. and Lilly, Mary A. and Lim, Hyunjung J. and Lima, Thania R.R. and Limana, Federica and Lin, Chao and Lin, Chih Wen and Lin, Dar Shong and Lin, Fu Cheng and Lin, Jiandie D. and Lin, Kurt M. and Lin, Kwang Huei and Lin, Liang Tzung and Lin, Pei Hui and Lin, Qiong and Lin, Shaofeng and Lin, Su Ju and Lin, Wenyu and Lin, Xueying and Lin, Yao Xin and Lin, Yee Shin and Linden, Rafael and Lindner, Paula and Ling, Shuo Chien and Lingor, Paul and Linnemann, Amelia K. and Liou, Yih Cherng and Lipinski, Marta M. and Lipovšek, Saška and Lira, Vitor A. and Lisiak, Natalia and Liton, Paloma B. and Liu, Chao and Liu, Ching Hsuan and Liu, Chun Feng and Liu, Cui Hua and Liu, Fang and Liu, Hao and Liu, Hsiao Sheng and Liu, Hua Feng and Liu, Huifang and Liu, Jia and Liu, Jing and Liu, Julia and Liu, Leyuan and Liu, Longhua and Liu, Meilian and Liu, Qin and Liu, Wei and Liu, Wende and Liu, Xiao Hong and Liu, Xiaodong and Liu, Xingguo and Liu, Xu and Liu, Xuedong and Liu, Yanfen and Liu, Yang and Liu, Yang and Liu, Yueyang and Liu, Yule and Livingston, J. Andrew and Lizard, Gerard and Lizcano, Jose M. and Ljubojevic-Holzer, Senka and Lleonart, Matilde E. and Llobet-Navàs, David and Llorente, Alicia and Lo, Chih Hung and Lobato-Márquez, Damián and Long, Qi and Long, Yun Chau and Loos, Ben and Loos, Julia A. and López, Manuela G. and López-Doménech, Guillermo and López-Guerrero, José Antonio and López-Jiménez, Ana T. and López-Pérez, Óscar and López-Valero, Israel and Lorenowicz, Magdalena J. and Lorente, Mar and Lorincz, Peter and Lossi, Laura and Lotersztajn, Sophie and Lovat, Penny E. and Lovell, Jonathan F. and Lovy, Alenka and Lőw, Péter and Lu, Guang and Lu, Haocheng and Lu, Jia Hong and Lu, Jin Jian and Lu, Mengji and Lu, Shuyan and Luciani, Alessandro and Lucocq, John M. and Ludovico, Paula and Luftig, Micah A. and Luhr, Morten and Luis-Ravelo, Diego and Lum, Julian J. and Luna-Dulcey, Liany and Lund, Anders H. and Lund, Viktor K. and Lünemann, Jan D. and Lüningschrör, Patrick and Luo, Honglin and Luo, Rongcan and Luo, Shouqing and Luo, Zhi and Luparello, Claudio and Lüscher, Bernhard and Luu, Luan and Lyakhovich, Alex and Lyamzaev, Konstantin G. and Lystad, Alf Håkon and Lytvynchuk, Lyubomyr and Ma, Alvin C. and Ma, Changle and Ma, Mengxiao and Ma, Ning Fang and Ma, Quan Hong and Ma, Xinliang and Ma, Yueyun and Ma, Zhenyi and Macdougald, Ormond A. and Macian, Fernando and Macintosh, Gustavo C. and Mackeigan, Jeffrey P. and Macleod, Kay F. and Maday, Sandra and Madeo, Frank and Madesh, Muniswamy and Madl, Tobias and Madrigal-Matute, Julio and Maeda, Akiko and Maejima, Yasuhiro and Magarinos, Marta and Mahavadi, Poornima and Maiani, Emiliano and Maiese, Kenneth and Maiti, Panchanan and Maiuri, Maria Chiara and Majello, Barbara and Major, Michael B. and Makareeva, Elena and Malik, Fayaz and Mallilankaraman, Karthik and Malorni, Walter and Maloyan, Alina and Mammadova, Najiba and Man, Gene Chi Wai and Manai, Federico and Mancias, Joseph D. and Mandelkow, Eva Maria and Mandell, Michael A. and Manfredi, Angelo A. and Manjili, Masoud H. and Manjithaya, Ravi and Manque, Patricio and Manshian, Bella B. and Manzano, Raquel and Manzoni, Claudia and Mao, Kai and Marchese, Cinzia and Marchetti, Sandrine and Marconi, Anna Maria and Marcucci, Fabrizio and Mardente, Stefania and Mareninova, Olga A. and Margeta, Marta and Mari, Muriel and Marinelli, Sara and Marinelli, Oliviero and Mariño, Guillermo and Mariotto, Sofia and Marshall, Richard S. and Marten, Mark R. and Martens, Sascha and Martin, Alexandre P.J. and Martin, Katie R. and Martin, Sara and Martin, Shaun and Martín-Segura, Adrián and Martín-Acebes, Miguel A. and Martin-Burriel, Inmaculada and Martin-Rincon, Marcos and Martin-Sanz, Paloma and Martina, José A. and Martinet, Wim and Martinez, Aitor and Martinez, Ana and Martinez, Jennifer and Martinez Velazquez, Moises and Martinez-Lopez, Nuria and Martinez-Vicente, Marta and Martins, Daniel O. and Martins, Joilson O. and Martins, Waleska K. and Martins-Marques, Tania and Marzetti, Emanuele and Masaldan, Shashank and Masclaux-Daubresse, Celine and Mashek, Douglas G. and Massa, Valentina and Massieu, Lourdes and Masson, Glenn R. and Masuelli, Laura and Masyuk, Anatoliy I. and Masyuk, Tetyana V. and Matarrese, Paola and Matheu, Ander and Matoba, Satoaki and Matsuzaki, Sachiko and Mattar, Pamela and Matte, Alessandro and Mattoscio, Domenico and Mauriz, José L. and Mauthe, Mario and Mauvezin, Caroline and Maverakis, Emanual and Maycotte, Paola and Mayer, Johanna and Mazzoccoli, Gianluigi and Mazzoni, Cristina and Mazzulli, Joseph R. and Mccarty, Nami and Mcdonald, Christine and Mcgill, Mitchell R. and Mckenna, Sharon L. and Mclaughlin, Beth Ann and Mcloughlin, Fionn and Mcniven, Mark A. and Mcwilliams, Thomas G. and Mechta-Grigoriou, Fatima and Medeiros, Tania Catarina and Medina, Diego L. and Megeney, Lynn A. and Megyeri, Klara and Mehrpour, Maryam and Mehta, Jawahar L. and Meijer, Alfred J. and Meijer, Annemarie H. and Mejlvang, Jakob and Meléndez, Alicia and Melk, Annette and Memisoglu, Gonen and Mendes, Alexandrina F. and Meng, Delong and Meng, Fei and Meng, Tian and Menna-Barreto, Rubem and Menon, Manoj B. and Mercer, Carol and Mercier, Anne E. and Mergny, Jean Louis and Merighi, Adalberto and Merkley, Seth D. and Merla, Giuseppe and Meske, Volker and Mestre, Ana Cecilia and Metur, Shree Padma and Meyer, Christian and Meyer, Hemmo and Mi, Wenyi and Mialet-Perez, Jeanne and Miao, Junying and Micale, Lucia and Miki, Yasuo and Milan, Enrico and Milczarek, Małgorzata and Miller, Dana L. and Miller, Samuel I. and Miller, Silke and Millward, Steven W. and Milosevic, Ira and Minina, Elena A. and Mirzaei, Hamed and Mirzaei, Hamid Reza and Mirzaei, Mehdi and Mishra, Amit and Mishra, Nandita and Mishra, Paras Kumar and Misirkic Marjanovic, Maja and Misasi, Roberta and Misra, Amit and Misso, Gabriella and Mitchell, Claire and Mitou, Geraldine and Miura, Tetsuji and Miyamoto, Shigeki and Miyazaki, Makoto and Miyazaki, Mitsunori and Miyazaki, Taiga and Miyazawa, Keisuke and Mizushima, Noboru and Mogensen, Trine H. and Mograbi, Baharia and Mohammadinejad, Reza and Mohamud, Yasir and Mohanty, Abhishek and Mohapatra, Sipra and Möhlmann, Torsten and Mohmmed, Asif and Moles, Anna and Moley, Kelle H. and Molinari, Maurizio and Mollace, Vincenzo and Møller, Andreas Buch and Mollereau, Bertrand and Mollinedo, Faustino and Montagna, Costanza and Monteiro, Mervyn J. and Montella, Andrea and Montes, L. Ruth and Montico, Barbara and Mony, Vinod K. and Monzio Compagnoni, Giacomo and Moore, Michael N. and Moosavi, Mohammad A. and Mora, Ana L. and Mora, Marina and Morales-Alamo, David and Moratalla, Rosario and Moreira, Paula I. and Morelli, Elena and Moreno, Sandra and Moreno-Blas, Daniel and Moresi, Viviana and Morga, Benjamin and Morgan, Alwena H. and Morin, Fabrice and Morishita, Hideaki and Moritz, Orson L. and Moriyama, Mariko and Moriyasu, Yuji and Morleo, Manuela and Morselli, Eugenia and Moruno-Manchon, Jose F. and Moscat, Jorge and Mostowy, Serge and Motori, Elisa and Moura, Andrea Felinto and Moustaid-Moussa, Naima and Mrakovcic, Maria and Muciño-Hernández, Gabriel and Mukherjee, Anupam and Mukhopadhyay, Subhadip and Mulcahy Levy, Jean M. and Mulero, Victoriano and Muller, Sylviane and Münch, Christian and Munjal, Ashok and Munoz-Canoves, Pura and Muñoz-Galdeano, Teresa and Münz, Christian and Murakawa, Tomokazu and Muratori, Claudia and Murphy, Brona M. and Murphy, J. Patrick and Murthy, Aditya and Myöhänen, Timo T. and Mysorekar, Indira U. and Mytych, Jennifer and Nabavi, Seyed Mohammad and Nabissi, Massimo and Nagy, Péter and Nah, Jihoon and Nahimana, Aimable and Nakagawa, Ichiro and Nakamura, Ken and Nakatogawa, Hitoshi and Nandi, Shyam S. and Nanjundan, Meera and Nanni, Monica and Napolitano, Gennaro and Nardacci, Roberta and Narita, Masashi and Nassif, Melissa and Nathan, Ilana and Natsumeda, Manabu and Naude, Ryno J. and Naumann, Christin and Naveiras, Olaia and Navid, Fatemeh and Nawrocki, Steffan T. and Nazarko, Taras Y. and Nazio, Francesca and Negoita, Florentina and Neill, Thomas and Neisch, Amanda L. and Neri, Luca M. and Netea, Mihai G. and Neubert, Patrick and Neufeld, Thomas P. and Neumann, Dietbert and Neutzner, Albert and Newton, Phillip T. and Ney, Paul A. and Nezis, Ioannis P. and Ng, Charlene C.W. and Ng, Tzi Bun and Nguyen, Hang T.T. and Nguyen, Long T. and Ni, Hong Min and Ní Cheallaigh, Clíona and Ni, Zhenhong and Nicolao, M. Celeste and Nicoli, Francesco and Nieto-Diaz, Manuel and Nilsson, Per and Ning, Shunbin and Niranjan, Rituraj and Nishimune, Hiroshi and Niso-Santano, Mireia and Nixon, Ralph A. and Nobili, Annalisa and Nobrega, Clevio and Noda, Takeshi and Nogueira-Recalde, Uxía and Nolan, Trevor M. and Nombela, Ivan and Novak, Ivana and Novoa, Beatriz and Nozawa, Takashi and Nukina, Nobuyuki and Nussbaum-Krammer, Carmen and Nylandsted, Jesper and O’Donovan, Tracey R. and O’Leary, Seónadh M. and O’Rourke, Eyleen J. and O’Sullivan, Mary P. and O’Sullivan, Timothy E. and Oddo, Salvatore and Oehme, Ina and Ogawa, Michinaga and Ogier-Denis, Eric and Ogmundsdottir, Margret H. and Ogretmen, Besim and Oh, Goo Taeg and Oh, Seon Hee and Oh, Young J. and Ohama, Takashi and Ohashi, Yohei and Ohmuraya, Masaki and Oikonomou, Vasileios and Ojha, Rani and Okamoto, Koji and Okazawa, Hitoshi and Oku, Masahide and Oliván, Sara and Oliveira, Jorge M.A. and Ollmann, Michael and Olzmann, James A. and Omari, Shakib and Omary, M. Bishr and Önal, Gizem and Ondrej, Martin and Ong, Sang Bing and Ong, Sang Ging and Onnis, Anna and Orellana, Juan A. and Orellana-Muñoz, Sara and Ortega-Villaizan, Maria Del Mar and Ortiz-Gonzalez, Xilma R. and Ortona, Elena and Osiewacz, Heinz D. and Osman, Abdel Hamid K. and Osta, Rosario and Otegui, Marisa S. and Otsu, Kinya and Ott, Christiane and Ottobrini, Luisa and Ou, Jing Hsiung James and Outeiro, Tiago F. and Oynebraten, Inger and Ozturk, Melek and Pagès, Gilles and Pahari, Susanta and Pajares, Marta and Pajvani, Utpal B. and Pal, Rituraj and Paladino, Simona and Pallet, Nicolas and Palmieri, Michela and Palmisano, Giuseppe and Palumbo, Camilla and Pampaloni, Francesco and Pan, Lifeng and Pan, Qingjun and Pan, Wenliang and Pan, Xin and Panasyuk, Ganna and Pandey, Rahul and Pandey, Udai B. and Pandya, Vrajesh and Paneni, Francesco and Pang, Shirley Y. and Panzarini, Elisa and Papademetrio, Daniela L. and Papaleo, Elena and Papinski, Daniel and Papp, Diana and Park, Eun Chan and Park, Hwan Tae and Park, Ji Man and Park, Jong In and Park, Joon Tae and Park, Junsoo and Park, Sang Chul and Park, Sang Youel and Parola, Abraham H. and Parys, Jan B. and Pasquier, Adrien and Pasquier, Benoit and Passos, João F. and Pastore, Nunzia and Patel, Hemal H. and Patschan, Daniel and Pattingre, Sophie and Pedraza-Alva, Gustavo and Pedraza-Chaverri, Jose and Pedrozo, Zully and Pei, Gang and Pei, Jianming and Peled-Zehavi, Hadas and Pellegrini, Joaquín M. and Pelletier, Joffrey and Peñalva, Miguel A. and Peng, Di and Peng, Ying and Penna, Fabio and Pennuto, Maria and Pentimalli, Francesca and Pereira, Cláudia M.F. and Pereira, Gustavo J.S. and Pereira, Lilian C. and Pereira De Almeida, Luis and Perera, Nirma D. and Pérez-Lara, Ángel and Perez-Oliva, Ana B. and Pérez-Pérez, María Esther and Periyasamy, Palsamy and Perl, Andras and Perrotta, Cristiana and Perrotta, Ida and Pestell, Richard G. and Petersen, Morten and Petrache, Irina and Petrovski, Goran and Pfirrmann, Thorsten and Pfister, Astrid S. and Philips, Jennifer A. and Pi, Huifeng and Picca, Anna and Pickrell, Alicia M. and Picot, Sandy and Pierantoni, Giovanna M. and Pierdominici, Marina and Pierre, Philippe and Pierrefite-Carle, Valérie and Pierzynowska, Karolina and Pietrocola, Federico and Pietruczuk, Miroslawa and Pignata, Claudio and Pimentel-Muiños, Felipe X. and Pinar, Mario and Pinheiro, Roberta O. and Pinkas-Kramarski, Ronit and Pinton, Paolo and Pircs, Karolina and Piya, Sujan and Pizzo, Paola and Plantinga, Theo S. and Platta, Harald W. and Plaza-Zabala, Ainhoa and Plomann, Markus and Plotnikov, Egor Y. and Plun-Favreau, Helene and Pluta, Ryszard and Pocock, Roger and Pöggeler, Stefanie and Pohl, Christian and Poirot, Marc and Poletti, Angelo and Ponpuak, Marisa and Popelka, Hana and Popova, Blagovesta and Porta, Helena and Porte Alcon, Soledad and Portilla-Fernandez, Eliana and Post, Martin and Potts, Malia B. and Poulton, Joanna and Powers, Ted and Prahlad, Veena and Prajsnar, Tomasz K. and Praticò, Domenico and Prencipe, Rosaria and Priault, Muriel and Proikas-Cezanne, Tassula and Promponas, Vasilis J. and Proud, Christopher G. and Puertollano, Rosa and Puglielli, Luigi and Pulinilkunnil, Thomas and Puri, Deepika and Puri, Rajat and Puyal, Julien and Qi, Xiaopeng and Qi, Yongmei and Qian, Wenbin and Qiang, Lei and Qiu, Yu and Quadrilatero, Joe and Quarleri, Jorge and Raben, Nina and Rabinowich, Hannah and Ragona, Debora and Ragusa, Michael J. and Rahimi, Nader and Rahmati, Marveh and Raia, Valeria and Raimundo, Nuno and Rajasekaran, Namakkal Soorappan and Ramachandra Rao, Sriganesh and Rami, Abdelhaq and Ramírez-Pardo, Ignacio and Ramsden, David B. and Randow, Felix and Rangarajan, Pundi N. and Ranieri, Danilo and Rao, Hai and Rao, Lang and Rao, Rekha and Rathore, Sumit and Ratnayaka, J. Arjuna and Ratovitski, Edward A. and Ravanan, Palaniyandi and Ravegnini, Gloria and Ray, Swapan K. and Razani, Babak and Rebecca, Vito and Reggiori, Fulvio and Régnier-Vigouroux, Anne and Reichert, Andreas S. and Reigada, David and Reiling, Jan H. and Rein, Theo and Reipert, Siegfried and Rekha, Rokeya Sultana and Ren, Hongmei and Ren, Jun and Ren, Weichao and Renault, Tristan and Renga, Giorgia and Reue, Karen and Rewitz, Kim and Ribeiro De Andrade Ramos, Bruna and Riazuddin, S. Amer and Ribeiro-Rodrigues, Teresa M. and Ricci, Jean Ehrland and Ricci, Romeo and Riccio, Victoria and Richardson, Des R. and Rikihisa, Yasuko and Risbud, Makarand V. and Risueño, Ruth M. and Ritis, Konstantinos and Rizza, Salvatore and Rizzuto, Rosario and Roberts, Helen C. and Roberts, Luke D. and Robinson, Katherine J. and Roccheri, Maria Carmela and Rocchi, Stephane and Rodney, George G. and Rodrigues, Tiago and Rodrigues Silva, Vagner Ramon and Rodriguez, Amaia and Rodriguez-Barrueco, Ruth and Rodriguez-Henche, Nieves and Rodriguez-Rocha, Humberto and Roelofs, Jeroen and Rogers, Robert S. and Rogov, Vladimir V. and Rojo, Ana I. and Rolka, Krzysztof and Romanello, Vanina and Romani, Luigina and Romano, Alessandra and Romano, Patricia S. and Romeo-Guitart, David and Romero, Luis C. and Romero, Montserrat and Roney, Joseph C. and Rongo, Christopher and Roperto, Sante and Rosenfeldt, Mathias T. and Rosenstiel, Philip and Rosenwald, Anne G. and Roth, Kevin A. and Roth, Lynn and Roth, Steven and Rouschop, Kasper M.A. and Roussel, Benoit D. and Roux, Sophie and Rovere-Querini, Patrizia and Roy, Ajit and Rozieres, Aurore and Ruano, Diego and Rubinsztein, David C. and Rubtsova, Maria P. and Ruckdeschel, Klaus and Ruckenstuhl, Christoph and Rudolf, Emil and Rudolf, Rüdiger and Ruggieri, Alessandra and Ruparelia, Avnika Ashok and Rusmini, Paola and Russell, Ryan R. and Russo, Gian Luigi and Russo, Maria and Russo, Rossella and Ryabaya, Oxana O. and Ryan, Kevin M. and Ryu, Kwon Yul and Sabater-Arcis, Maria and Sachdev, Ulka and Sacher, Michael and Sachse, Carsten and Sadhu, Abhishek and Sadoshima, Junichi and Safren, Nathaniel and Saftig, Paul and Sagona, Antonia P. and Sahay, Gaurav and Sahebkar, Amirhossein and Sahin, Mustafa and Sahin, Ozgur and Sahni, Sumit and Saito, Nayuta and Saito, Shigeru and Saito, Tsunenori and Sakai, Ryohei and Sakai, Yasuyoshi and Sakamaki, Jun Ichi and Saksela, Kalle and Salazar, Gloria and Salazar-Degracia, Anna and Salekdeh, Ghasem H. and Saluja, Ashok K. and Sampaio-Marques, Belém and Sanchez, Maria Cecilia and Sanchez-Alcazar, Jose A. and Sanchez-Vera, Victoria and Sancho-Shimizu, Vanessa and Sanderson, J. Thomas and Sandri, Marco and Santaguida, Stefano and Santambrogio, Laura and Santana, Magda M. and Santoni, Giorgio and Sanz, Alberto and Sanz, Pascual and Saran, Shweta and Sardiello, Marco and Sargeant, Timothy J. and Sarin, Apurva and Sarkar, Chinmoy and Sarkar, Sovan and Sarrias, Maria Rosa and Sarkar, Surajit and Sarmah, Dipanka Tanu and Sarparanta, Jaakko and Sathyanarayan, Aishwarya and Sathyanarayanan, Ranganayaki and Scaglione, K. Matthew and Scatozza, Francesca and Schaefer, Liliana and Schafer, Zachary T. and Schaible, Ulrich E. and Schapira, Anthony H.V. and Scharl, Michael and Schatzl, Hermann M. and Schein, Catherine H. and Scheper, Wiep and Scheuring, David and Schiaffino, Maria Vittoria and Schiappacassi, Monica and Schindl, Rainer and Schlattner, Uwe and Schmidt, Oliver and Schmitt, Roland and Schmidt, Stephen D. and Schmitz, Ingo and Schmukler, Eran and Schneider, Anja and Schneider, Bianca E. and Schober, Romana and Schoijet, Alejandra C. and Schott, Micah B. and Schramm, Michael and Schröder, Bernd and Schuh, Kai and Schüller, Christoph and Schulze, Ryan J. and Schürmanns, Lea and Schwamborn, Jens C. and Schwarten, Melanie and Scialo, Filippo and Sciarretta, Sebastiano and Scott, Melanie J. and Scotto, Kathleen W. and Scovassi, A. Ivana and Scrima, Andrea and Scrivo, Aurora and Sebastian, David and Sebti, Salwa and Sedej, Simon and Segatori, Laura and Segev, Nava and Seglen, Per O. and Seiliez, Iban and Seki, Ekihiro and Selleck, Scott B. and Sellke, Frank W. and Selsby, Joshua T. and Sendtner, Michael and Senturk, Serif and Seranova, Elena and Sergi, Consolato and Serra-Moreno, Ruth and Sesaki, Hiromi and Settembre, Carmine and Setty, Subba Rao Gangi and Sgarbi, Gianluca and Sha, Ou and Shacka, John J. and Shah, Javeed A. and Shang, Dantong and Shao, Changshun and Shao, Feng and Sharbati, Soroush and Sharkey, Lisa M. and Sharma, Dipali and Sharma, Gaurav and Sharma, Kulbhushan and Sharma, Pawan and Sharma, Surendra and Shen, Han Ming and Shen, Hongtao and Shen, Jiangang and Shen, Ming and Shen, Weili and Shen, Zheni and Sheng, Rui and Sheng, Zhi and Sheng, Zu Hang and Shi, Jianjian and Shi, Xiaobing and Shi, Ying Hong and Shiba-Fukushima, Kahori and Shieh, Jeng Jer and Shimada, Yohta and Shimizu, Shigeomi and Shimozawa, Makoto and Shintani, Takahiro and Shoemaker, Christopher J. and Shojaei, Shahla and Shoji, Ikuo and Shravage, Bhupendra V. and Shridhar, Viji and Shu, Chih Wen and Shu, Hong Bing and Shui, Ke and Shukla, Arvind K. and Shutt, Timothy E. and Sica, Valentina and Siddiqui, Aleem and Sierra, Amanda and Sierra-Torre, Virginia and Signorelli, Santiago and Sil, Payel and Silva, Bruno J.De Andrade and Silva, Johnatas D. and Silva-Pavez, Eduardo and Silvente-Poirot, Sandrine and Simmonds, Rachel E. and Simon, Anna Katharina and Simon, Hans Uwe and Simons, Matias and Singh, Anurag and Singh, Lalit P. and Singh, Rajat and Singh, Shivendra V. and Singh, Shrawan K. and Singh, Sudha B. and Singh, Sunaina and Singh, Surinder Pal and Sinha, Debasish and Sinha, Rohit Anthony and Sinha, Sangita and Sirko, Agnieszka and Sirohi, Kapil and Sivridis, Efthimios L. and Skendros, Panagiotis and Skirycz, Aleksandra and Slaninová, Iva and Smaili, Soraya S. and Smertenko, Andrei and Smith, Matthew D. and Soenen, Stefaan J. and Sohn, Eun Jung and Sok, Sophia P.M. and Solaini, Giancarlo and Soldati, Thierry and Soleimanpour, Scott A. and Soler, Rosa M. and Solovchenko, Alexei and Somarelli, Jason A. and Sonawane, Avinash and Song, Fuyong and Song, Hyun Kyu and Song, Ju Xian and Song, Kunhua and Song, Zhiyin and Soria, Leandro R. and Sorice, Maurizio and Soukas, Alexander A. and Soukup, Sandra Fausia and Sousa, Diana and Sousa, Nadia and Spagnuolo, Paul A. and Spector, Stephen A. and Srinivas Bharath, M. M. and St. Clair, Daret and Stagni, Venturina and Staiano, Leopoldo and Stalnecker, Clint A. and Stankov, Metodi V. and Stathopulos, Peter B. and Stefan, Katja and Stefan, Sven Marcel and Stefanis, Leonidas and Steffan, Joan S. and Steinkasserer, Alexander and Stenmark, Harald and Sterneckert, Jared and Stevens, Craig and Stoka, Veronika and Storch, Stephan and Stork, Björn and Strappazzon, Flavie and Strohecker, Anne Marie and Stupack, Dwayne G. and Su, Huanxing and Su, Ling Yan and Su, Longxiang and Suarez-Fontes, Ana M. and Subauste, Carlos S. and Subbian, Selvakumar and Subirada, Paula V. and Sudhandiran, Ganapasam and Sue, Carolyn M. and Sui, Xinbing and Summers, Corey and Sun, Guangchao and Sun, Jun and Sun, Kang and Sun, Meng Xiang and Sun, Qiming and Sun, Yi and Sun, Zhongjie and Sunahara, Karen K.S. and Sundberg, Eva and Susztak, Katalin and Sutovsky, Peter and Suzuki, Hidekazu and Sweeney, Gary and Symons, J. David and Sze, Stephen Cho Wing and Szewczyk, Nathaniel J. and Tabęcka-Łonczynska, Anna and Tabolacci, Claudio and Tacke, Frank and Taegtmeyer, Heinrich and Tafani, Marco and Tagaya, Mitsuo and Tai, Haoran and Tait, Stephen W.G. and Takahashi, Yoshinori and Takats, Szabolcs and Talwar, Priti and Tam, Chit and Tam, Shing Yau and Tampellini, Davide and Tamura, Atsushi and Tan, Chong Teik and Tan, Eng King and Tan, Ya Qin and Tanaka, Masaki and Tanaka, Motomasa and Tang, Daolin and Tang, Jingfeng and Tang, Tie Shan and Tanida, Isei and Tao, Zhipeng and Taouis, Mohammed and Tatenhorst, Lars and Tavernarakis, Nektarios and Taylor, Allen and Taylor, Gregory A. and Taylor, Joan M. and Tchetina, Elena and Tee, Andrew R. and Tegeder, Irmgard and Teis, David and Teixeira, Natercia and Teixeira-Clerc, Fatima and Tekirdag, Kumsal A. and Tencomnao, Tewin and Tenreiro, Sandra and Tepikin, Alexei V. and Testillano, Pilar S. and Tettamanti, Gianluca and Tharaux, Pierre Louis and Thedieck, Kathrin and Thekkinghat, Arvind A. and Thellung, Stefano and Thinwa, Josephine W. and Thirumalaikumar, V. P. and Thomas, Sufi Mary and Thomes, Paul G. and Thorburn, Andrew and Thukral, Lipi and Thum, Thomas and Thumm, Michael and Tian, Ling and Tichy, Ales and Till, Andreas and Timmerman, Vincent and Titorenko, Vladimir I. and Todi, Sokol V. and Todorova, Krassimira and Toivonen, Janne M. and Tomaipitinca, Luana and Tomar, Dhanendra and Tomas-Zapico, Cristina and Tomić, Sergej and Tong, Benjamin Chun Kit and Tong, Chao and Tong, Xin and Tooze, Sharon A. and Torgersen, Maria L. and Torii, Satoru and Torres-López, Liliana and Torriglia, Alicia and Towers, Christina G. and Towns, Roberto and Toyokuni, Shinya and Trajkovic, Vladimir and Tramontano, Donatella and Tran, Quynh Giao and Travassos, Leonardo H. and Trelford, Charles B. and Tremel, Shirley and Trougakos, Ioannis P. and Tsao, Betty P. and Tschan, Mario P. and Tse, Hung Fat and Tse, Tak Fu and Tsugawa, Hitoshi and Tsvetkov, Andrey S. and Tumbarello, David A. and Tumtas, Yasin and Tuñón, María J. and Turcotte, Sandra and Turk, Boris and Turk, Vito and Turner, Bradley J. and Tuxworth, Richard I. and Tyler, Jessica K. and Tyutereva, Elena V. and Uchiyama, Yasuo and Ugun-Klusek, Aslihan and Uhlig, Holm H. and Ułamek-Kozioł, Marzena and Ulasov, Ilya V. and Umekawa, Midori and Ungermann, Christian and Unno, Rei and Urbe, Sylvie and Uribe-Carretero, Elisabet and Üstün, Suayib and Uversky, Vladimir N. and Vaccari, Thomas and Vaccaro, Maria I. and Vahsen, Björn F. and Vakifahmetoglu-Norberg, Helin and Valdor, Rut and Valente, Maria J. and Valko, Ayelén and Vallee, Richard B. and Valverde, Angela M. and Van Den Berghe, Greet and Van Der Veen, Stijn and Van Kaer, Luc and Van Loosdregt, Jorg and Van Wijk, Sjoerd J.L. and Vandenberghe, Wim and Vanhorebeek, Ilse and Vannier-Santos, Marcos A. and Vannini, Nicola and Vanrell, M. Cristina and Vantaggiato, Chiara and Varano, Gabriele and Varela-Nieto, Isabel and Varga, Máté and Vasconcelos, M. Helena and Vats, Somya and Vavvas, Demetrios G. and Vega-Naredo, Ignacio and Vega-Rubin-De-Celis, Silvia and Velasco, Guillermo and Velázquez, Ariadna P. and Vellai, Tibor and Vellenga, Edo and Velotti, Francesca and Verdier, Mireille and Verginis, Panayotis and Vergne, Isabelle and Verkade, Paul and Verma, Manish and Verstreken, Patrik and Vervliet, Tim and Vervoorts, Jörg and Vessoni, Alexandre T. and Victor, Victor M. and Vidal, Michel and Vidoni, Chiara and Vieira, Otilia V. and Vierstra, Richard D. and Viganó, Sonia and Vihinen, Helena and Vijayan, Vinoy and Vila, Miquel and Vilar, Marçal and Villalba, José M. and Villalobo, Antonio and Villarejo-Zori, Beatriz and Villarroya, Francesc and Villarroya, Joan and Vincent, Olivier and Vindis, Cecile and Viret, Christophe and Viscomi, Maria Teresa and Visnjic, Dora and Vitale, Ilio and Vocadlo, David J. and Voitsekhovskaja, Olga V. and Volonté, Cinzia and Volta, Mattia and Vomero, Marta and Von Haefen, Clarissa and Vooijs, Marc A. and Voos, Wolfgang and Vucicevic, Ljubica and Wade-Martins, Richard and Waguri, Satoshi and Waite, Kenrick A. and Wakatsuki, Shuji and Walker, David W. and Walker, Mark J. and Walker, Simon A. and Walter, Jochen and Wandosell, Francisco G. and Wang, Bo and Wang, Chao Yung and Wang, Chen and Wang, Chenran and Wang, Chenwei and Wang, Cun Yu and Wang, Dong and Wang, Fangyang and Wang, Feng and Wang, Fengming and Wang, Guansong and Wang, Han and Wang, Hao and Wang, Hexiang and Wang, Hong Gang and Wang, Jianrong and Wang, Jigang and Wang, Jiou and Wang, Jundong and Wang, Kui and Wang, Lianrong and Wang, Liming and Wang, Maggie Haitian and Wang, Meiqing and Wang, Nanbu and Wang, Pengwei and Wang, Peipei and Wang, Ping and Wang, Ping and Wang, Qing Jun and Wang, Qing and Wang, Qing Kenneth and Wang, Qiong A. and Wang, Wen Tao and Wang, Wuyang and Wang, Xinnan and Wang, Xuejun and Wang, Yan and Wang, Yanchang and Wang, Yanzhuang and Wang, Yen Yun and Wang, Yihua and Wang, Yipeng and Wang, Yu and Wang, Yuqi and Wang, Zhe and Wang, Zhenyu and Wang, Zhouguang and Warnes, Gary and Warnsmann, Verena and Watada, Hirotaka and Watanabe, Eizo and Watchon, Maxinne and Wawrzyńska, Anna and Weaver, Timothy E. and Wegrzyn, Grzegorz and Wehman, Ann M. and Wei, Huafeng and Wei, Lei and Wei, Taotao and Wei, Yongjie and Weiergräber, Oliver H. and Weihl, Conrad C. and Weindl, Günther and Weiskirchen, Ralf and Wells, Alan and Wen, Runxia H. and Wen, Xin and Werner, Antonia and Weykopf, Beatrice and Wheatley, Sally P. and Whitton, J. Lindsay and Whitworth, Alexander J. and Wiktorska, Katarzyna and Wildenberg, Manon E. and Wileman, Tom and Wilkinson, Simon and Willbold, Dieter and Williams, Brett and Williams, Robin S.B. and Williams, Roger L. and Williamson, Peter R. and Wilson, Richard A. and Winner, Beate and Winsor, Nathaniel J. and Witkin, Steven S. and Wodrich, Harald and Woehlbier, Ute and Wollert, Thomas and Wong, Esther and Wong, Jack Ho and Wong, Richard W. and Wong, Vincent Kam Wai and Wong, W. Wei Lynn and Wu, An Guo and Wu, Chengbiao and Wu, Jian and Wu, Junfang and Wu, Kenneth K. and Wu, Min and Wu, Shan Ying and Wu, Shengzhou and Wu, Shu Yan and Wu, Shufang and Wu, William K.K. and Wu, Xiaohong and Wu, Xiaoqing and Wu, Yao Wen and Wu, Yihua and Xavier, Ramnik J. and Xia, Hongguang and Xia, Lixin and Xia, Zhengyuan and Xiang, Ge and Xiang, Jin and Xiang, Mingliang and Xiang, Wei and Xiao, Bin and Xiao, Guozhi and Xiao, Hengyi and Xiao, Hong Tao and Xiao, Jian and Xiao, Lan and Xiao, Shi and Xiao, Yin and Xie, Baoming and Xie, Chuan Ming and Xie, Min and Xie, Yuxiang and Xie, Zhiping and Xie, Zhonglin and Xilouri, Maria and Xu, Congfeng and Xu, En and Xu, Haoxing and Xu, Jing and Xu, Jin Rong and Xu, Liang and Xu, Wen Wen and Xu, Xiulong and Xue, Yu and Yakhine-Diop, Sokhna M.S. and Yamaguchi, Masamitsu and Yamaguchi, Osamu and Yamamoto, Ai and Yamashina, Shunhei and Yan, Shengmin and Yan, Shian Jang and Yan, Zhen and Yanagi, Yasuo and Yang, Chuanbin and Yang, Dun Sheng and Yang, Huan and Yang, Huang Tian and Yang, Hui and Yang, Jin Ming and Yang, Jing and Yang, Jingyu and Yang, Ling and Yang, Liu and Yang, Ming and Yang, Pei Ming and Yang, Qian and Yang, Seungwon and Yang, Shu and Yang, Shun Fa and Yang, Wannian and Yang, Wei Yuan and Yang, Xiaoyong and Yang, Xuesong and Yang, Yi and Yang, Ying and Yao, Honghong and Yao, Shenggen and Yao, Xiaoqiang and Yao, Yong Gang and Yao, Yong Ming and Yasui, Takahiro and Yazdankhah, Meysam and Yen, Paul M. and Yi, Cong and Yin, Xiao Ming and Yin, Yanhai and Yin, Zhangyuan and Yin, Ziyi and Ying, Meidan and Ying, Zheng and Yip, Calvin K. and Yiu, Stephanie Pei Tung and Yoo, Young H. and Yoshida, Kiyotsugu and Yoshii, Saori R. and Yoshimori, Tamotsu and Yousefi, Bahman and Yu, Boxuan and Yu, Haiyang and Yu, Jun and Yu, Jun and Yu, Li and Yu, Ming Lung and Yu, Seong Woon and Yu, Victor C. and Yu, W. Haung and Yu, Zhengping and Yu, Zhou and Yuan, Junying and Yuan, Ling Qing and Yuan, Shilin and Yuan, Shyng Shiou F. and Yuan, Yanggang and Yuan, Zengqiang and Yue, Jianbo and Yue, Zhenyu and Yun, Jeanho and Yung, Raymond L. and Zacks, David N. and Zaffagnini, Gabriele and Zambelli, Vanessa O. and Zanella, Isabella and Zang, Qun S. and Zanivan, Sara and Zappavigna, Silvia and Zaragoza, Pilar and Zarbalis, Konstantinos S. and Zarebkohan, Amir and Zarrouk, Amira and Zeitlin, Scott O. and Zeng, Jialiu and Zeng, Ju Deng and Žerovnik, Eva and Zhan, Lixuan and Zhang, Bin and Zhang, Donna D. and Zhang, Hanlin and Zhang, Hong and Zhang, Hong and Zhang, Honghe and Zhang, Huafeng and Zhang, Huaye and Zhang, Hui and Zhang, Hui Ling and Zhang, Jianbin and Zhang, Jianhua and Zhang, Jing Pu and Zhang, Kalin Y.B. and Zhang, Leshuai W. and Zhang, Lin and Zhang, Lisheng and Zhang, Lu and Zhang, Luoying and Zhang, Menghuan and Zhang, Peng and Zhang, Sheng and Zhang, Wei and Zhang, Xiangnan and Zhang, Xiao Wei and Zhang, Xiaolei and Zhang, Xiaoyan and Zhang, Xin and Zhang, Xinxin and Zhang, Xu Dong and Zhang, Yang and Zhang, Yanjin and Zhang, Yi and Zhang, Ying Dong and Zhang, Yingmei and Zhang, Yuan Yuan and Zhang, Yuchen and Zhang, Zhe and Zhang, Zhengguang and Zhang, Zhibing and Zhang, Zhihai and Zhang, Zhiyong and Zhang, Zili and Zhao, Haobin and Zhao, Lei and Zhao, Shuang and Zhao, Tongbiao and Zhao, Xiao Fan and Zhao, Ying and Zhao, Yongchao and Zhao, Yongliang and Zhao, Yuting and Zheng, Guoping and Zheng, Kai and Zheng, Ling and Zheng, Shizhong and Zheng, Xi Long and Zheng, Yi and Zheng, Zu Guo and Zhivotovsky, Boris and Zhong, Qing and Zhou, Ao and Zhou, Ben and Zhou, Cefan and Zhou, Gang and Zhou, Hao and Zhou, Hong and Zhou, Hongbo and Zhou, Jie and Zhou, Jing and Zhou, Jing and Zhou, Jiyong and Zhou, Kailiang and Zhou, Rongjia and Zhou, Xu Jie and Zhou, Yanshuang and Zhou, Yinghong and Zhou, Yubin and Zhou, Zheng Yu and Zhou, Zhou and Zhu, Binglin and Zhu, Changlian and Zhu, Guo Qing and Zhu, Haining and Zhu, Hongxin and Zhu, Hua and Zhu, Wei Guo and Zhu, Yanping and Zhu, Yushan and Zhuang, Haixia and Zhuang, Xiaohong and Zientara-Rytter, Katarzyna and Zimmermann, Christine M. and Ziviani, Elena and Zoladek, Teresa and Zong, Wei Xing and Zorov, Dmitry B. and Zorzano, Antonio and Zou, Weiping and Zou, Zhen and Zou, Zhengzhi and Zuryn, Steven and Zwerschke, Werner and Brand-Saberi, Beate and Dong, X. Charlie and Kenchappa, Chandra Shekar and Li, Zuguo and Lin, Yong and Oshima, Shigeru and Rong, Yueguang and Sluimer, Judith C. and Stallings, Christina L. and Tong, Chun Kit}, issn = {1554-8635}, journal = {Autophagy}, number = {1}, pages = {1--382}, publisher = {Taylor & Francis}, title = {{Guidelines for the use and interpretation of assays for monitoring autophagy (4th edition)}}, doi = {10.1080/15548627.2020.1797280}, volume = {17}, year = {2021}, } @article{8742, abstract = {We develop a version of Ekedahl’s geometric sieve for integral quadratic forms of rank at least five. As one ranges over the zeros of such quadratic forms, we use the sieve to compute the density of coprime values of polynomials, and furthermore, to address a question about local solubility in families of varieties parameterised by the zeros.}, author = {Browning, Timothy D and Heath-Brown, Roger}, issn = {1435-5337}, journal = {Forum Mathematicum}, number = {1}, pages = {147--165}, publisher = {De Gruyter}, title = {{The geometric sieve for quadrics}}, doi = {10.1515/forum-2020-0074}, volume = {33}, year = {2021}, } @phdthesis{10035, abstract = {Many security definitions come in two flavors: a stronger “adaptive” flavor, where the adversary can arbitrarily make various choices during the course of the attack, and a weaker “selective” flavor where the adversary must commit to some or all of their choices a-priori. For example, in the context of identity-based encryption, selective security requires the adversary to decide on the identity of the attacked party at the very beginning of the game whereas adaptive security allows the attacker to first see the master public key and some secret keys before making this choice. Often, it appears to be much easier to achieve selective security than it is to achieve adaptive security. A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework (published at Crypto ’17 [JKK+17a]) that connects all of these works and allows us to present them in a unified and simplified fashion. Having the framework in place, we show how to achieve adaptive security for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the first adaptive security proofs for continuous group key agreement protocols (published at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that currently used proof techniques cannot lead to significantly better security guarantees for "graph-building" games (published at TCC ’21 [KKPW21a]). These games cover generalized selective decryption, as well as the security of prominent constructions for constrained PRFs, continuous group key agreement, and proxy re-encryption. Finally, we revisit the adaptive security of Yao’s garbled circuits and extend the analysis of Jafargholi and Wichs in two directions: While they prove adaptive security only for a modified construction with increased online complexity, we provide the first positive results for the original construction by Yao (published at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi and Wichs are essentially optimal by showing that no black-box reduction can provide a significantly better security bound (published at Crypto ’21 [KKPW21c]).}, author = {Klein, Karen}, issn = {2663-337X}, pages = {276}, publisher = {Institute of Science and Technology Austria}, title = {{On the adaptive security of graph-based games}}, doi = {10.15479/at:ista:10035}, year = {2021}, } @inproceedings{10410, abstract = {The security of cryptographic primitives and protocols against adversaries that are allowed to make adaptive choices (e.g., which parties to corrupt or which queries to make) is notoriously difficult to establish. A broad theoretical framework was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper we initiate the study of lower bounds on loss in adaptive security for certain cryptographic protocols considered in the framework. We prove lower bounds that almost match the upper bounds (proven using the framework) for proxy re-encryption, prefix-constrained PRFs and generalized selective decryption, a security game that captures the security of certain group messaging and broadcast encryption schemes. Those primitives have in common that their security game involves an underlying graph that can be adaptively built by the adversary. Some of our lower bounds only apply to a restricted class of black-box reductions which we term “oblivious” (the existing upper bounds are of this restricted type), some apply to the broader but still restricted class of non-rewinding reductions, while our lower bound for proxy re-encryption applies to all black-box reductions. The fact that some of our lower bounds seem to crucially rely on obliviousness or at least a non-rewinding reduction hints to the exciting possibility that the existing upper bounds can be improved by using more sophisticated reductions. Our main conceptual contribution is a two-player multi-stage game called the Builder-Pebbler Game. We can translate bounds on the winning probabilities for various instantiations of this game into cryptographic lower bounds for the above-mentioned primitives using oracle separation techniques.}, author = {Kamath Hosdurg, Chethan and Klein, Karen and Pietrzak, Krzysztof Z and Walter, Michael}, booktitle = {19th International Conference}, isbn = {9-783-0309-0452-4}, issn = {1611-3349}, location = {Raleigh, NC, United States}, pages = {550--581}, publisher = {Springer Nature}, title = {{The cost of adaptivity in security games on graphs}}, doi = {10.1007/978-3-030-90453-1_19}, volume = {13043}, year = {2021}, } @inproceedings{10048, abstract = {The security of cryptographic primitives and protocols against adversaries that are allowed to make adaptive choices (e.g., which parties to corrupt or which queries to make) is notoriously difficult to establish. A broad theoretical framework was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper we initiate the study of lower bounds on loss in adaptive security for certain cryptographic protocols considered in the framework. We prove lower bounds that almost match the upper bounds (proven using the framework) for proxy re-encryption, prefix-constrained PRFs and generalized selective decryption, a security game that captures the security of certain group messaging and broadcast encryption schemes. Those primitives have in common that their security game involves an underlying graph that can be adaptively built by the adversary. Some of our lower bounds only apply to a restricted class of black-box reductions which we term “oblivious” (the existing upper bounds are of this restricted type), some apply to the broader but still restricted class of non-rewinding reductions, while our lower bound for proxy re-encryption applies to all black-box reductions. The fact that some of our lower bounds seem to crucially rely on obliviousness or at least a non-rewinding reduction hints to the exciting possibility that the existing upper bounds can be improved by using more sophisticated reductions. Our main conceptual contribution is a two-player multi-stage game called the Builder-Pebbler Game. We can translate bounds on the winning probabilities for various instantiations of this game into cryptographic lower bounds for the above-mentioned primitives using oracle separation techniques. }, author = {Kamath Hosdurg, Chethan and Klein, Karen and Pietrzak, Krzysztof Z and Walter, Michael}, booktitle = {19th Theory of Cryptography Conference 2021}, location = {Raleigh, NC, United States}, publisher = {International Association for Cryptologic Research}, title = {{The cost of adaptivity in security games on graphs}}, year = {2021}, }