Alistair Stewart

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 72

Top Topics

Fourier Transform

Maximum Likelihood

Sample Complexity Bounds

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Emanuele Giunta, Alistair Stewart
Unbiasable Verifiable Random Functions. IACR Cryptol. ePrint Arch. 2024 (2024)
Jeff Burdges, Alfonso Cevallos, Handan Kilinç Alper, Chen-Da Liu-Zhang, Fatemeh Shirazi, Alistair Stewart, Rob Habermeier, Robert Klotzner, Andronik Ordian
Efficient Execution Auditing for Blockchains under Byzantine Assumptions. IACR Cryptol. ePrint Arch. 2024 (2024)
Emanuele Giunta, Alistair Stewart
Unbiasable Verifiable Random Functions. EUROCRYPT (4) (2024)
Jeffrey Burdges, Handan Kilinç Alper, Alistair Stewart, Sergey Vasilyev
Sassafras and Semi-Anonymous Single Leader Election. IACR Cryptol. ePrint Arch. 2023 (2023)
Jeffrey Burdges, Handan Kilinç Alper, Alistair Stewart, Sergey Vasilyev
Ethical identity, ring VRFs, and zero-knowledge continuations. IACR Cryptol. ePrint Arch. 2023 (2023)
Ilias Diakonikolas, Chrystalla Pavlou, John Peebles, Alistair Stewart
Efficient Approximation Algorithms for the Inverse Semivalue Problem. AAMAS (2022)
Aleixo Sanchez, Alistair Stewart, Fatemeh Shirazi
Bridging Sapling: Private Cross-Chain Transfers. CoRR (2022)
Jeff Burdges, Oana Ciobotaru, Syed Lavasani, Alistair Stewart
Efficient Aggregatable BLS Signatures with Chaum-Pedersen Proofs. IACR Cryptol. ePrint Arch. 2022 (2022)
Oana Ciobotaru, Fatemeh Shirazi, Alistair Stewart, Sergey Vasilyev
Accountable Light Client Systems for PoS Blockchains. IACR Cryptol. ePrint Arch. 2022 (2022)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart, Yuxin Sun
Outlier-Robust Learning of Ising Models Under Dobrushin's Condition. CoRR (2021)
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart
Robustness meets algorithms. Commun. ACM 64 (5) (2021)
Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia, Thanasis Pittas, Alistair Stewart
Statistical Query Lower Bounds for List-Decodable Linear Regression. CoRR (2021)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart, Yuxin Sun
Outlier-Robust Learning of Ising Models Under Dobrushin's Condition. COLT (2021)
Alfonso Cevallos, Alistair Stewart
A verifiably secure and proportional committee election rule. AFT (2021)
Ilias Diakonikolas, Daniel Kane, Ankit Pensia, Thanasis Pittas, Alistair Stewart
Statistical Query Lower Bounds for List-Decodable Linear Regression. NeurIPS (2021)
Jeff Burdges, Alfonso Cevallos, Peter Czaban, Rob Habermeier, Syed Hosseini, Fabio Lama, Handan Kilinç Alper, Ximin Luo, Fatemeh Shirazi, Alistair Stewart, Gavin Wood
Overview of Polkadot and its Design Considerations. IACR Cryptol. ePrint Arch. 2020 (2020)
Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Testing Bayesian Networks. IEEE Trans. Inf. Theory 66 (5) (2020)
Alfonso Cevallos, Alistair Stewart
Validator election in nominated proof-of-stake. CoRR (2020)
Alistair Stewart, Eleftherios Kokoris-Kogia
GRANDPA: a Byzantine Finality Gadget. CoRR (2020)
Jeff Burdges, Alfonso Cevallos, Peter Czaban, Rob Habermeier, Syed Hosseini, Fabio Lama, Handan Kilinç Alper, Ximin Luo, Fatemeh Shirazi, Alistair Stewart, Gavin Wood
Overview of Polkadot and its Design Considerations. CoRR (2020)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. Math. Oper. Res. 45 (1) (2020)
Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Jacob Steinhardt, Alistair Stewart
Sever: A Robust Meta-Algorithm for Stochastic Optimization. ICML (2019)
Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Ankur Moitra, Alistair Stewart
Robust Estimators in High-Dimensions Without the Computational Intractability. SIAM J. Comput. 48 (2) (2019)
Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis
Reachability for Branching Concurrent Stochastic Games. ICALP (2019)
Ilias Diakonikolas, Weihao Kong, Alistair Stewart
Efficient Algorithms and Lower Bounds for Robust Linear Regression. SODA (2019)
Brian Axelrod, Ilias Diakonikolas, Alistair Stewart, Anastasios Sidiropoulos, Gregory Valiant
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families. NeurIPS (2019)
Ilias Diakonikolas, Sushrut Karmalkar, Daniel Kane, Eric Price, Alistair Stewart
Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering. CoRR (2019)
Brian Axelrod, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart, Gregory Valiant
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families. CoRR (2019)
Ilias Diakonikolas, Daniel Kane, Sushrut Karmalkar, Eric Price, Alistair Stewart
Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering. NeurIPS (2019)
Alistair Stewart
Poster: GRANDPA Finality Gadget. CCS (2019)
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently. SODA (2018)
Yu Cheng, Ilias Diakonikolas, Daniel Kane, Alistair Stewart
Robust Learning of Fixed-Structure Bayesian Networks. NeurIPS (2018)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Sharp Bounds for Generalized Uniformity Testing. NeurIPS (2018)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
List-decodable robust mean estimation and learning mixtures of spherical gaussians. STOC (2018)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Inf. Comput. 261 (2018)
Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Testing Conditional Independence of Discrete Distributions. ITA (2018)
Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis
Reachability for Branching Concurrent Stochastic Games. CoRR (2018)
Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Testing conditional independence of discrete distributions. STOC (2018)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Learning geometric concepts with nasty noise. STOC (2018)
Ilias Diakonikolas, Weihao Kong, Alistair Stewart
Efficient Algorithms and Lower Bounds for Robust Linear Regression. CoRR (2018)
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Jacob Steinhardt, Alistair Stewart
Sever: A Robust Meta-Algorithm for Stochastic Optimization. CoRR (2018)
Alistair Stewart, Ilias Diakonikolas, Clément L. Canonne
Testing for Families of Distributions via the Fourier Transform. NeurIPS (2018)
Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart
A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities. CoRR (2018)
Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities. COLT (2018)
Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities. CoRR (2018)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussians. CoRR (2017)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Sharp Bounds for Generalized Uniformity Testing. Electron. Colloquium Comput. Complex. 24 (2017)
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart
Being Robust (in High Dimensions) Can Be Practical. ICML (2017)
Yu Cheng, Ilias Diakonikolas, Alistair Stewart
Playing Anonymous Games using Simple Strategies. SODA (2017)
Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Testing Bayesian Networks. COLT (2017)
Clément L. Canonne, Ilias Diakonikolas, Alistair Stewart
Fourier-Based Testing for Families of Distributions. Electron. Colloquium Comput. Complex. 24 (2017)
Clément L. Canonne, Ilias Diakonikolas, Alistair Stewart
Fourier-Based Testing for Families of Distributions. CoRR (2017)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Learning Multivariate Log-concave Distributions. COLT (2017)
Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Testing Conditional Independence of Discrete Distributions. CoRR (2017)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures. FOCS (2017)
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart
Being Robust (in High Dimensions) Can Be Practical. CoRR (2017)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Learning Geometric Concepts with Nasty Noise. CoRR (2017)
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently. CoRR (2017)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Sharp Bounds for Generalized Uniformity Testing. CoRR (2017)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. SIAM J. Comput. 46 (5) (2017)
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Zheng Li, Ankur Moitra, Alistair Stewart
Robust Estimators in High Dimensions without the Computational Intractability. CoRR (2016)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Efficient Robust Proper Learning of Log-concave Distributions. CoRR (2016)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
The fourier transform of poisson multinomial distributions and its algorithmic applications. STOC (2016)
Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Testing Bayesian Networks. CoRR (2016)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Properly Learning Poisson Binomial Distributions in Almost Polynomial Time. COLT (2016)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures. Electron. Colloquium Comput. Complex. 23 (2016)
Yu Cheng, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Robust Learning of Fixed-Structure Bayesian Networks. CoRR (2016)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables. COLT (2016)
Yu Cheng, Ilias Diakonikolas, Alistair Stewart
Playing Anonymous Games using Simple Strategies. CoRR (2016)
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart
Robust Estimators in High Dimensions without the Computational Intractability. FOCS (2016)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures. CoRR (2016)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Learning Multivariate Log-concave Distributions. CoRR (2016)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. CoRR (2015)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
The Fourier Transform of Poisson Multinomial Distributions and its Algorithmic Applications. CoRR (2015)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. ICALP (2) (2015)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Nearly Optimal Learning and Sparse Covers for Sums of Independent Integer Random Variables. CoRR (2015)
Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. J. ACM 62 (4) (2015)
Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart
Properly Learning Poisson Binomial Distributions in Almost Polynomial Time. CoRR (2015)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing. ACM Trans. Comput. Theory 6 (2) (2014)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. ICALP (2) (2013)
Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. CAV (2013)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method CoRR (2013)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing CoRR (2013)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. Electron. Colloquium Comput. Complex. 20 (2013)
Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata CoRR (2013)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars CoRR (2012)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars. STOC (2012)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. ICALP (1) (2012)
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations CoRR (2012)