Alexander Healy

DrugMap: A quantitative pan-cancer analysis of cysteine ligandability

Mariko Takahashi, Harrison B. Chong, Siwen Zhang, Tzu-yi Yang et autres

us (code pays fourni par la source)

DrugMap: A quantitative pan-cancer analysis of cysteine ligandability

Mariko Takahashi, Harrison B. Chong, Siwen Zhang, Matthew J. Lazarov et autres

Abstract Cysteine-focused chemical proteomic platforms have accelerated the clinical development of covalent inhibitors of a wide-range of targets in cancer. However, how different oncogenic contexts influence cysteine targeting remains unknown. To address this question, we have developed DrugMap , an atlas of …

us (code pays fourni par la source)

Mercurial Commitments with Applications to Zero-Knowledge Sets

Melissa Chase, Alexander Healy, Anna Lysyanskaya, Tal Malkin et autres

us (code pays fourni par la source)

Characterizing generic global rigidity

Steven J. Gortler, Alexander Healy, Dylan P. Thurston

A $d$-dimensional {\it framework} is a graph and a map from its vertices to~${\Bbb E}^d$. Such a framework is {\it globally rigid} if it is the only framework in ${\Bbb E}^d$ with the same graph and edge lengths, up to rigid motions. …

us (code pays fourni par la source)

A (de)constructive approach to program checking

Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman et autres

Program checking, program self-correcting and program self-testing were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain confidence in software, by considering program correctness on an input by input basis rather …

us (code pays fourni par la source)

Randomness-Efficient Sampling within NC1

Alexander Healy

us (code pays fourni par la source)

Characterizing Generic Global Rigidity

Steven J. Gortler, Alexander Healy, Dylan P. Thurston

A d-dimensional framework is a graph and a map from its vertices to E^d. Such a framework is globally rigid if it is the only framework in E^d with the same graph and edge lengths, up to rigid motions. For which underlying …

Verifying and decoding in constant depth

Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman et autres

We develop a general approach for improving the efficiency of a computationally bounded receiver interacting with a powerful and possibly malicious sender. The key idea we use is that of delegating some of the receiver's computation to the (potentially malicious) sender. This …

il, us (code pays fourni par la source)

Randomness-E-cient Sampling within NC 1

Alexander Healy

We construct a randomness-e‐cient averaging sampler that is computable by uniform constantdepth circuits with parity gates (i.e., in uniform AC 0 [']). Our sampler matches the parameters achieved by random walks on constant-degree expander graphs, allowing us to apply a variety expander-based …

Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two

Alexander Healy, Emanuele Viola

us (code pays fourni par la source)

Randomness-Efficient Sampling Within NC 1

Alexander Healy

us (code pays fourni par la source)

Using Nondeterminism to Amplify Hardness

Alexander Healy, Salil Vadhan, Emanuele Viola

We revisit the problem of hardness amplification in $\mathcal{NP}$, as recently studied by O'Donnell [J. Comput. System Sci., 69 (2004), pp. 68-94]. We prove that if $\mathcal{NP}$ has a balanced function f such that any circuit of size $s(n)$ fails to compute …