×

zbMATH — the first resource for mathematics

Stewart, Alistair

Compute Distance To:
Author ID: stewart.alistair Recent zbMATH articles by "Stewart, Alistair"
Published as: Stewart, A.; Stewart, Alistair
Documents Indexed: 22 Publications since 1990

Publications by Year

Citations contained in zbMATH

14 Publications have been cited 55 times in 33 Documents Cited by Year
Robust estimators in high-dimensions without the computational intractability. Zbl 1421.68149
Diakonikolas, Ilias; Kamath, Gautam; Kane, Daniel; Li, Jerry; Moitra, Ankur; Stewart, Alistair
10
2019
Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars. Zbl 1286.68188
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis
8
2012
Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations. Zbl 1272.68458
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis
8
2012
Efficient algorithms and lower bounds for robust linear regression. Zbl 1432.68616
Diakonikolas, Ilias; Kong, Weihao; Stewart, Alistair
4
2019
Robustly learning a Gaussian: getting optimal error, efficiently. Zbl 1403.68185
Diakonikolas, Ilias; Kamath, Gautam; Kane, Daniel M.; Li, Jerry; Moitra, Ankur; Stewart, Alistair
4
2018
The Fourier transform of Poisson multinomial distributions and its algorithmic applications. Zbl 1373.68318
Diakonikolas, Ilias; Kane, Daniel M.; Stewart, Alistair
4
2016
Upper bounds for Newton’s method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata. Zbl 1426.68177
Stewart, Alistair; Etessami, Kousha; Yannakakis, Mihalis
4
2015
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Zbl 1394.60084
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis
4
2015
List-decodable robust mean estimation and learning mixtures of spherical Gaussians. Zbl 1428.68272
Diakonikolas, Ilias; Kane, Daniel M.; Stewart, Alistair
2
2018
Playing anonymous games using simple strategies. Zbl 1417.91017
Cheng, Yu; Diakonikolas, Ilias; Stewart, Alistair
2
2017
Reasoning about data-parallel array assignment. Zbl 0833.68027
Stewart, A.
2
1995
A polynomial time algorithm for computing extinction probabilities of multitype branching processes. Zbl 1378.68074
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis
1
2017
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. Zbl 1321.68309
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis
1
2014
A parallel multigrid FAS scheme for transputer networks. Zbl 0716.65103
Stewart, A.; Shaw, G. J.
1
1990
Robust estimators in high-dimensions without the computational intractability. Zbl 1421.68149
Diakonikolas, Ilias; Kamath, Gautam; Kane, Daniel; Li, Jerry; Moitra, Ankur; Stewart, Alistair
10
2019
Efficient algorithms and lower bounds for robust linear regression. Zbl 1432.68616
Diakonikolas, Ilias; Kong, Weihao; Stewart, Alistair
4
2019
Robustly learning a Gaussian: getting optimal error, efficiently. Zbl 1403.68185
Diakonikolas, Ilias; Kamath, Gautam; Kane, Daniel M.; Li, Jerry; Moitra, Ankur; Stewart, Alistair
4
2018
List-decodable robust mean estimation and learning mixtures of spherical Gaussians. Zbl 1428.68272
Diakonikolas, Ilias; Kane, Daniel M.; Stewart, Alistair
2
2018
Playing anonymous games using simple strategies. Zbl 1417.91017
Cheng, Yu; Diakonikolas, Ilias; Stewart, Alistair
2
2017
A polynomial time algorithm for computing extinction probabilities of multitype branching processes. Zbl 1378.68074
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis
1
2017
The Fourier transform of Poisson multinomial distributions and its algorithmic applications. Zbl 1373.68318
Diakonikolas, Ilias; Kane, Daniel M.; Stewart, Alistair
4
2016
Upper bounds for Newton’s method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata. Zbl 1426.68177
Stewart, Alistair; Etessami, Kousha; Yannakakis, Mihalis
4
2015
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Zbl 1394.60084
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis
4
2015
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. Zbl 1321.68309
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis
1
2014
Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars. Zbl 1286.68188
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis
8
2012
Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations. Zbl 1272.68458
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis
8
2012
Reasoning about data-parallel array assignment. Zbl 0833.68027
Stewart, A.
2
1995
A parallel multigrid FAS scheme for transputer networks. Zbl 0716.65103
Stewart, A.; Shaw, G. J.
1
1990

Citations by Year