Alistair Stewart

IACR Cryptol. ePrint Arch., 2024

Efficient Execution Auditing for Blockchains under Byzantine Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

2023

Sassafras and Semi-Anonymous Single Leader Election.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Ethical identity, ring VRFs, and zero-knowledge continuations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

2022

Accountable Light Client Systems for PoS Blockchains.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Efficient Aggregatable BLS Signatures with Chaum-Pedersen Proofs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Bridging Sapling: Private Cross-Chain Transfers.

[BibT_eX]

[DOI]

Aleixo Sanchez

Fatemeh Shirazi

CoRR, 2022

Efficient Approximation Algorithms for the Inverse Semivalue Problem.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Robustness meets algorithms.

[BibT_eX]

[DOI]

Commun. ACM, 2021

Statistical Query Lower Bounds for List-Decodable Linear Regression.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Outlier-Robust Learning of Ising Models Under Dobrushin's Condition.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

A verifiably secure and proportional committee election rule.

[BibT_eX]

[DOI]

Alfonso Cevallos

Proceedings of the AFT '21: 3rd ACM Conference on Advances in Financial Technologies, Arlington, Virginia, USA, September 26, 2021

2020

Testing Bayesian Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

Overview of Polkadot and its Design Considerations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

GRANDPA: a Byzantine Finality Gadget.

[BibT_eX]

[DOI]

Eleftherios Kokoris-Kogia

CoRR, 2020

Validator election in nominated proof-of-stake.

[BibT_eX]

[DOI]

Alfonso Cevallos

CoRR, 2020

2019

Robust Estimators in High-Dimensions Without the Computational Intractability.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Efficient Algorithms and Lower Bounds for Robust Linear Regression.

[BibT_eX]

[DOI]

Weihao Kong

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families.

[BibT_eX]

[DOI]

Brian Axelrod

Anastasios Sidiropoulos

Gregory Valiant

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Sever: A Robust Meta-Algorithm for Stochastic Optimization.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Reachability for Branching Concurrent Stochastic Games.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Poster: GRANDPA Finality Gadget.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018

Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes.

[BibT_eX]

[DOI]

Inf. Comput., 2018

A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities.

[BibT_eX]

[DOI]

Anastasios Sidiropoulos

CoRR, 2018

Learning geometric concepts with nasty noise.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

List-decodable robust mean estimation and learning mixtures of spherical gaussians.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Testing conditional independence of discrete distributions.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Robustly Learning a Gaussian: Getting Optimal Error, Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Testing for Families of Distributions via the Fourier Transform.

[BibT_eX]

[DOI]

Clément L. Canonne

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Robust Learning of Fixed-Structure Bayesian Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities.

[BibT_eX]

[DOI]

Timothy Carpenter

Anastasios Sidiropoulos

Proceedings of the Conference On Learning Theory, 2018

2017

A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Sharp Bounds for Generalized Uniformity Testing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Fourier-Based Testing for Families of Distributions.

[BibT_eX]

[DOI]

Clément L. Canonne

Electron. Colloquium Comput. Complex., 2017

Playing Anonymous Games using Simple Strategies.

[BibT_eX]

[DOI]

Yu Cheng

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Being Robust (in High Dimensions) Can Be Practical.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

Learning Multivariate Log-concave Distributions.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Learning Theory, 2017

2016

Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

Efficient Robust Proper Learning of Log-concave Distributions.

[BibT_eX]

[DOI]

CoRR, 2016

The fourier transform of poisson multinomial distributions and its algorithmic applications.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Properly Learning Poisson Binomial Distributions in Almost Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the 29th Conference on Learning Theory, 2016

Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables.

[BibT_eX]

[DOI]

Proceedings of the 29th Conference on Learning Theory, 2016

2015

Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata.

[BibT_eX]

[DOI]

J. ACM, 2015

Nearly Optimal Learning and Sparse Covers for Sums of Independent Integer Random Variables.

[BibT_eX]

[DOI]

CoRR, 2015

2013

A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

Stochastic Context-Free Grammars, Regular Languages, and Newton's Method.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars

[BibT_eX]

[DOI]

CoRR, 2012

Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars.

[BibT_eX]

[DOI]