Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (STOC, 2012)

Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (CoRR, 2012)

Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (ICALP (2), 2013)

A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (Electron. Colloquium Comput. Complex., 2013)

Nearly Optimal Learning and Sparse Covers for Sums of Independent Integer Random Variables. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (CoRR, 2015)

Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. - Alistair Stewart; Kousha Etessami; Mihalis Yannakakis (J. ACM, 2015)

Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (COLT, 2016)

Properly Learning Poisson Binomial Distributions in Almost Polynomial Time. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (COLT, 2016)

The fourier transform of poisson multinomial distributions and its algorithmic applications. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (STOC, 2016)

Efficient Robust Proper Learning of Log-concave Distributions. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (CoRR, 2016)

Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (Electron. Colloquium Comput. Complex., 2016)

Learning Multivariate Log-concave Distributions. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (COLT, 2017)

Being Robust (in High Dimensions) Can Be Practical. - Ilias Diakonikolas; Gautam Kamath 001; Daniel M. Kane; Jerry Li 001; Ankur Moitra; Alistair Stewart (ICML, 2017)

Playing Anonymous Games using Simple Strategies. - Yu Cheng 002; Ilias Diakonikolas; Alistair Stewart (SODA, 2017)

Fourier-Based Testing for Families of Distributions. - Clément L. Canonne; Ilias Diakonikolas; Alistair Stewart (Electron. Colloquium Comput. Complex., 2017)

Sharp Bounds for Generalized Uniformity Testing. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (Electron. Colloquium Comput. Complex., 2017)

A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (SIAM J. Comput., 2017)

Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities. - Timothy Carpenter; Ilias Diakonikolas; Anastasios Sidiropoulos; Alistair Stewart (COLT, 2018)

Robust Learning of Fixed-Structure Bayesian Networks. - Yu Cheng 002; Ilias Diakonikolas; Daniel Kane 001; Alistair Stewart (NeurIPS, 2018)

Testing for Families of Distributions via the Fourier Transform. - Alistair Stewart; Ilias Diakonikolas; Clément L. Canonne (NeurIPS, 2018)

Robustly Learning a Gaussian: Getting Optimal Error, Efficiently. - Ilias Diakonikolas; Gautam Kamath 001; Daniel M. Kane; Jerry Li 001; Ankur Moitra; Alistair Stewart (SODA, 2018)

Testing conditional independence of discrete distributions. - Clément L. Canonne; Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (STOC, 2018)

List-decodable robust mean estimation and learning mixtures of spherical gaussians. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (STOC, 2018)

Learning geometric concepts with nasty noise. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (STOC, 2018)

A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities. - Ilias Diakonikolas; Anastasios Sidiropoulos; Alistair Stewart (CoRR, 2018)

Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (Inf. Comput., 2018)

Poster: GRANDPA Finality Gadget. - Alistair Stewart (CCS, 2019)

Reachability for Branching Concurrent Stochastic Games. - Kousha Etessami; Emanuel Martinov; Alistair Stewart; Mihalis Yannakakis (ICALP, 2019)

Sever: A Robust Meta-Algorithm for Stochastic Optimization. - Ilias Diakonikolas; Gautam Kamath 001; Daniel Kane 001; Jerry Li 001; Jacob Steinhardt; Alistair Stewart (ICML, 2019)

A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families. - Brian Axelrod; Ilias Diakonikolas; Alistair Stewart; Anastasios Sidiropoulos; Gregory Valiant (NeurIPS, 2019)

Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering. - Ilias Diakonikolas; Daniel Kane 001; Sushrut Karmalkar; Eric Price 001; Alistair Stewart (NeurIPS, 2019)

Efficient Algorithms and Lower Bounds for Robust Linear Regression. - Ilias Diakonikolas; Weihao Kong; Alistair Stewart (SODA, 2019)

Robust Estimators in High-Dimensions Without the Computational Intractability. - Ilias Diakonikolas; Gautam Kamath 001; Daniel Kane 001; Jerry Li 001; Ankur Moitra; Alistair Stewart (SIAM J. Comput., 2019)

Validator election in nominated proof-of-stake. - Alfonso Cevallos; Alistair Stewart (CoRR, 2020)

GRANDPA: a Byzantine Finality Gadget. - Alistair Stewart; Eleftherios Kokoris-Kogia (CoRR, 2020)

Overview of Polkadot and its Design Considerations. - Jeff Burdges; Alfonso Cevallos; Peter Czaban; Rob Habermeier; Syed Hosseini; Fabio Lama; Handan Kilinç Alper; Ximin Luo; Fatemeh Shirazi; Alistair Stewart; Gavin Wood (IACR Cryptol. ePrint Arch., 2020)

Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (Math. Oper. Res., 2020)

Testing Bayesian Networks. - Clément L. Canonne; Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart (IEEE Trans. Inf. Theory, 2020)

A verifiably secure and proportional committee election rule. - Alfonso Cevallos; Alistair Stewart (AFT, 2021)

Outlier-Robust Learning of Ising Models Under Dobrushin's Condition. - Ilias Diakonikolas; Daniel M. Kane; Alistair Stewart; Yuxin Sun (COLT, 2021)

Statistical Query Lower Bounds for List-Decodable Linear Regression. - Ilias Diakonikolas; Daniel Kane 001; Ankit Pensia; Thanasis Pittas; Alistair Stewart (NeurIPS, 2021)

Robustness meets algorithms. - Ilias Diakonikolas; Gautam Kamath 001; Daniel M. Kane; Jerry Li 001; Ankur Moitra; Alistair Stewart (Commun. ACM, 2021)

Efficient Approximation Algorithms for the Inverse Semivalue Problem. - Ilias Diakonikolas; Chrystalla Pavlou; John Peebles; Alistair Stewart (AAMAS, 2022)

Bridging Sapling: Private Cross-Chain Transfers. - Aleixo Sanchez; Alistair Stewart; Fatemeh Shirazi (CoRR, 2022)

Efficient Aggregatable BLS Signatures with Chaum-Pedersen Proofs. - Jeff Burdges; Oana Ciobotaru; Syed Lavasani; Alistair Stewart (IACR Cryptol. ePrint Arch., 2022)

Accountable Light Client Systems for PoS Blockchains. - Oana Ciobotaru; Fatemeh Shirazi; Alistair Stewart; Sergey Vasilyev (IACR Cryptol. ePrint Arch., 2022)

Ethical identity, ring VRFs, and zero-knowledge continuations. - Jeffrey Burdges; Handan Kilinç Alper; Alistair Stewart; Sergey Vasilyev (IACR Cryptol. ePrint Arch., 2023)

Sassafras and Semi-Anonymous Single Leader Election. - Jeffrey Burdges; Handan Kilinç Alper; Alistair Stewart; Sergey Vasilyev (IACR Cryptol. ePrint Arch., 2023)

Efficient Execution Auditing for Blockchains under Byzantine Assumptions. - Jeff Burdges; Alfonso Cevallos; Handan Kilinç Alper; Chen-Da Liu-Zhang; Fatemeh Shirazi; Alistair Stewart; Rob Habermeier; Robert Klotzner; Andronik Ordian (IACR Cryptol. ePrint Arch., 2024)

Unbiasable Verifiable Random Functions. - Emanuele Giunta; Alistair Stewart (IACR Cryptol. ePrint Arch., 2024)

Sassafras: Efficient Batch Single Leader Election. - Jeffrey Burdges; Elizabeth C. Crites; Handan Kilinç Alper; Alistair Stewart; Sergey Vasilyev (ACNS (1), 2025)

Trustless Bridges via Random Sampling Light Clients. - Bhargav Nagaraja Bhatt; Fatemeh Shirazi; Alistair Stewart (IACR Cryptol. ePrint Arch., 2025)

A Plausible Attack on the Adaptive Security of Threshold Schnorr Signatures. - Elizabeth C. Crites; Alistair Stewart (IACR Cryptol. ePrint Arch., 2025)