Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain

B David, P Gaži, A Kiayias, A Russell - … on the Theory and Applications of …, 2018 - Springer
Abstract We present “Ouroboros Praos”, a proof-of-stake blockchain protocol that, for the first
time, provides security against fully-adaptive corruption in the semi-synchronous setting …

HEDGES error-correcting code for DNA storage corrects indels and allows sequence constraints

WH Press, JA Hawkins, SK Jones Jr… - Proceedings of the …, 2020 - National Acad Sciences
Synthetic DNA is rapidly emerging as a durable, high-density information storage platform. A
major challenge for DNA-based information encoding strategies is the high rate of errors that …

Probabilistic tools for the analysis of randomized optimization heuristics

B Doerr - … of evolutionary computation: Recent developments in …, 2020 - Springer
This chapter collects several probabilistic tools that have proven to be useful in the analysis
of randomized search heuristics. This includes classic material such as the Markov …

Single-emitter quantum key distribution over 175 km of fibre with optimised finite key rates

CL Morrison, RG Pousa, F Graffitti, ZX Koong… - Nature …, 2023 - nature.com
Quantum key distribution with solid-state single-photon emitters is gaining traction due to
their rapidly improving performance and compatibility with future quantum networks. Here …

Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake protocol

B David, P Gaži, A Kiayias, A Russell - Cryptology ePrint Archive, 2017 - eprint.iacr.org
Abstract We present``Ouroboros Praos'', a proof-of-stake blockchain protocol that, for the first
time, provides security against fully-adaptive corruption in the semi-synchronous setting …

Sgd in the large: Average-case analysis, asymptotics, and stepsize criticality

C Paquette, K Lee, F Pedregosa… - … on Learning Theory, 2021 - proceedings.mlr.press
We propose a new framework, inspired by random matrix theory, for analyzing the dynamics
of stochastic gradient descent (SGD) when both number of samples and dimensions are …

Deadline scheduling as restless bandits

Z Yu, Y Xu, L Tong - IEEE Transactions on Automatic Control, 2018 - ieeexplore.ieee.org
The problem of stochastic deadline scheduling is considered. A constrained Markov
decision process model is introduced in which jobs arrive randomly at a service center with …

The landscape of the planted clique problem: Dense subgraphs and the overlap gap property

D Gamarnik, I Zadik - arXiv preprint arXiv:1904.07174, 2019 - arxiv.org
In this paper we study the computational-statistical gap of the planted clique problem, where
a clique of size $ k $ is planted in an Erdos Renyi graph $ G (n,\frac {1}{2}) $ resulting in a …

Priv'it: Private and sample efficient identity testing

B Cai, C Daskalakis, G Kamath - … Conference on Machine …, 2017 - proceedings.mlr.press
We develop differentially private hypothesis testing methods for the small sample regime.
Given a sample $\mathcal {D} $ from a categorical distribution $ p $ over some domain …

Statistical-computational trade-offs in tensor pca and related problems via communication complexity

R Dudeja, D Hsu - The Annals of Statistics, 2024 - projecteuclid.org
Statistical-computational trade-offs in tensor PCA and related problems via communication
complexity Page 1 The Annals of Statistics 2024, Vol. 52, No. 1, 131–156 https://doi.org/10.1214/23-AOS2331 …