default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlistair Stewart
Person information
- affiliation: University of Southern California, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2021
[j8]Ilias Diakonikolas, Gautam Kamath
, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart:
Robustness meets algorithms. Commun. ACM 64(5): 107-115 (2021)- 2020
- [j7]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): 34-62 (2020) - [j6]Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Testing Bayesian Networks. IEEE Trans. Inf. Theory 66(5): 3132-3170 (2020) - 2019
- [j5]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): 742-864 (2019) - 2018
- [j4]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: 355-382 (2018) - 2017
- [j3]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. SIAM J. Comput. 46(5): 1515-1553 (2017) - 2015
- [j2]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): 30:1-30:33 (2015) - 2014
- [j1]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): 9:1-9:23 (2014)
Conference and Workshop Papers
- 2024
- [c34]Emanuele Giunta, Alistair Stewart:
Unbiasable Verifiable Random Functions. EUROCRYPT (4) 2024: 142-167 - 2022
- [c33]Ilias Diakonikolas, Chrystalla Pavlou, John Peebles, Alistair Stewart:
Efficient Approximation Algorithms for the Inverse Semivalue Problem. AAMAS 2022: 354-362 - 2021
- [c32]Alfonso Cevallos, Alistair Stewart:
A verifiably secure and proportional committee election rule. AFT 2021: 29-42 - [c31]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart, Yuxin Sun:
Outlier-Robust Learning of Ising Models Under Dobrushin's Condition. COLT 2021: 1645-1682 - [c30]Ilias Diakonikolas, Daniel Kane, Ankit Pensia, Thanasis Pittas, Alistair Stewart:
Statistical Query Lower Bounds for List-Decodable Linear Regression. NeurIPS 2021: 3191-3204 - 2019
- [c29]Alistair Stewart:
Poster: GRANDPA Finality Gadget. CCS 2019: 2649-2651 - [c28]Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis:
Reachability for Branching Concurrent Stochastic Games. ICALP 2019: 115:1-115:14 - [c27]Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Jacob Steinhardt, Alistair Stewart:
Sever: A Robust Meta-Algorithm for Stochastic Optimization. ICML 2019: 1596-1606 - [c26]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: 7721-7733 - [c25]Ilias Diakonikolas, Daniel Kane, Sushrut Karmalkar, Eric Price, Alistair Stewart:
Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering. NeurIPS 2019: 10688-10699 - [c24]Ilias Diakonikolas, Weihao Kong, Alistair Stewart:
Efficient Algorithms and Lower Bounds for Robust Linear Regression. SODA 2019: 2745-2754 - 2018
- [c23]Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart:
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities. COLT 2018: 1234-1262 - [c22]Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Testing Conditional Independence of Discrete Distributions. ITA 2018: 1-57 - [c21]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Sharp Bounds for Generalized Uniformity Testing. NeurIPS 2018: 6204-6213 - [c20]Alistair Stewart, Ilias Diakonikolas, Clément L. Canonne:
Testing for Families of Distributions via the Fourier Transform. NeurIPS 2018: 10084-10095 - [c19]Yu Cheng, Ilias Diakonikolas, Daniel Kane, Alistair Stewart:
Robust Learning of Fixed-Structure Bayesian Networks. NeurIPS 2018: 10304-10316 - [c18]Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart:
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently. SODA 2018: 2683-2702 - [c17]Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Testing conditional independence of discrete distributions. STOC 2018: 735-748 - [c16]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
List-decodable robust mean estimation and learning mixtures of spherical gaussians. STOC 2018: 1047-1060 - [c15]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Learning geometric concepts with nasty noise. STOC 2018: 1061-1073 - 2017
- [c14]Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Testing Bayesian Networks. COLT 2017: 370-448 - [c13]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Learning Multivariate Log-concave Distributions. COLT 2017: 711-727 - [c12]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures. FOCS 2017: 73-84 - [c11]Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart:
Being Robust (in High Dimensions) Can Be Practical. ICML 2017: 999-1008 - [c10]Yu Cheng, Ilias Diakonikolas, Alistair Stewart:
Playing Anonymous Games using Simple Strategies. SODA 2017: 616-631 - 2016
- [c9]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables. COLT 2016: 831-849 - [c8]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Properly Learning Poisson Binomial Distributions in Almost Polynomial Time. COLT 2016: 850-878 - [c7]Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart:
Robust Estimators in High Dimensions without the Computational Intractability. FOCS 2016: 655-664 - [c6]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
The fourier transform of poisson multinomial distributions and its algorithmic applications. STOC 2016: 1060-1073 - 2015
- [c5]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: 184-196 - 2013
- [c4]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: 495-510 - [c3]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. ICALP (2) 2013: 199-211 - 2012
- [c2]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. ICALP (1) 2012: 314-326 - [c1]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars. STOC 2012: 579-588
Informal and Other Publications
- 2024
- [i47]Emanuele Giunta, Alistair Stewart:
Unbiasable Verifiable Random Functions. IACR Cryptol. ePrint Arch. 2024: 435 (2024) - [i46]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: 961 (2024) - 2023
- [i45]Jeffrey Burdges, Handan Kilinç Alper, Alistair Stewart, Sergey Vasilyev:
Ethical identity, ring VRFs, and zero-knowledge continuations. IACR Cryptol. ePrint Arch. 2023: 2 (2023) - [i44]Jeffrey Burdges, Handan Kilinç Alper, Alistair Stewart, Sergey Vasilyev:
Sassafras and Semi-Anonymous Single Leader Election. IACR Cryptol. ePrint Arch. 2023: 31 (2023) - 2022
- [i43]Aleixo Sanchez, Alistair Stewart, Fatemeh Shirazi:
Bridging Sapling: Private Cross-Chain Transfers. CoRR abs/2204.10611 (2022) - [i42]Oana Ciobotaru, Fatemeh Shirazi, Alistair Stewart, Sergey Vasilyev:
Accountable Light Client Systems for PoS Blockchains. IACR Cryptol. ePrint Arch. 2022: 1205 (2022) - [i41]Jeff Burdges, Oana Ciobotaru, Syed Lavasani, Alistair Stewart:
Efficient Aggregatable BLS Signatures with Chaum-Pedersen Proofs. IACR Cryptol. ePrint Arch. 2022: 1611 (2022) - 2021
- [i40]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart, Yuxin Sun:
Outlier-Robust Learning of Ising Models Under Dobrushin's Condition. CoRR abs/2102.02171 (2021) - [i39]Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia, Thanasis Pittas, Alistair Stewart:
Statistical Query Lower Bounds for List-Decodable Linear Regression. CoRR abs/2106.09689 (2021) - 2020
- [i38]Alfonso Cevallos, Alistair Stewart:
Validator election in nominated proof-of-stake. CoRR abs/2004.12990 (2020) - [i37]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 abs/2005.13456 (2020) - [i36]Alistair Stewart, Eleftherios Kokoris-Kogia:
GRANDPA: a Byzantine Finality Gadget. CoRR abs/2007.01560 (2020) - [i35]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: 641 (2020) - 2019
- [i34]Brian Axelrod, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart, Gregory Valiant:
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families. CoRR abs/1907.08306 (2019) - [i33]Ilias Diakonikolas, Sushrut Karmalkar, Daniel Kane, Eric Price, Alistair Stewart:
Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering. CoRR abs/1911.08085 (2019) - 2018
- [i32]Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart:
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities. CoRR abs/1802.10575 (2018) - [i31]Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Jacob Steinhardt, Alistair Stewart:
Sever: A Robust Meta-Algorithm for Stochastic Optimization. CoRR abs/1803.02815 (2018) - [i30]Ilias Diakonikolas, Weihao Kong, Alistair Stewart:
Efficient Algorithms and Lower Bounds for Robust Linear Regression. CoRR abs/1806.00040 (2018) - [i29]Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis:
Reachability for Branching Concurrent Stochastic Games. CoRR abs/1806.03907 (2018) - [i28]Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart:
A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities. CoRR abs/1812.05524 (2018) - 2017
- [i27]Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart:
Being Robust (in High Dimensions) Can Be Practical. CoRR abs/1703.00893 (2017) - [i26]Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart:
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently. CoRR abs/1704.03866 (2017) - [i25]Clément L. Canonne, Ilias Diakonikolas, Alistair Stewart:
Fourier-Based Testing for Families of Distributions. CoRR abs/1706.05738 (2017) - [i24]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Learning Geometric Concepts with Nasty Noise. CoRR abs/1707.01242 (2017) - [i23]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Sharp Bounds for Generalized Uniformity Testing. CoRR abs/1709.02087 (2017) - [i22]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussians. CoRR abs/1711.07211 (2017) - [i21]Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Testing Conditional Independence of Discrete Distributions. CoRR abs/1711.11560 (2017) - [i20]Clément L. Canonne, Ilias Diakonikolas, Alistair Stewart:
Fourier-Based Testing for Families of Distributions. Electron. Colloquium Comput. Complex. TR17 (2017) - [i19]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Sharp Bounds for Generalized Uniformity Testing. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i18]Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Zheng Li, Ankur Moitra, Alistair Stewart:
Robust Estimators in High Dimensions without the Computational Intractability. CoRR abs/1604.06443 (2016) - [i17]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Learning Multivariate Log-concave Distributions. CoRR abs/1605.08188 (2016) - [i16]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Efficient Robust Proper Learning of Log-concave Distributions. CoRR abs/1606.03077 (2016) - [i15]Yu Cheng, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Robust Learning of Fixed-Structure Bayesian Networks. CoRR abs/1606.07384 (2016) - [i14]Yu Cheng, Ilias Diakonikolas, Alistair Stewart:
Playing Anonymous Games using Simple Strategies. CoRR abs/1608.07336 (2016) - [i13]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures. CoRR abs/1611.03473 (2016) - [i12]Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Testing Bayesian Networks. CoRR abs/1612.03156 (2016) - [i11]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. TR16 (2016) - 2015
- [i10]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. CoRR abs/1502.05533 (2015) - [i9]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Nearly Optimal Learning and Sparse Covers for Sums of Independent Integer Random Variables. CoRR abs/1505.00662 (2015) - [i8]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
The Fourier Transform of Poisson Multinomial Distributions and its Algorithmic Applications. CoRR abs/1511.03592 (2015) - [i7]Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart:
Properly Learning Poisson Binomial Distributions in Almost Polynomial Time. CoRR abs/1511.04066 (2015) - 2013
- [i6]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 abs/1302.3741 (2013) - [i5]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. CoRR abs/1302.6411 (2013) - [i4]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. CoRR abs/1304.5429 (2013) - [i3]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. TR13 (2013) - 2012
- [i2]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars. CoRR abs/1201.2374 (2012) - [i1]Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. CoRR abs/1202.4798 (2012)
Coauthor Index
[j8] [j6] [j5] [c33] [c31] [c30] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [c14] [c13] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [i40] [i39] [i34] [i33] [i32] [i31] [i30] [i28] [i27] [i26] [i25] [i24] [i23] [i22] [i21] [i20] [i19] [i18] [i17] [i16] [i15] [i14] [i13] [i12] [i11] [i9] [i8] [i7]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
