Stephen J. Dilworth

According to our database, Stephen J. Dilworth authored at least 9 papers between 2002 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

The weighted property (A) and the greedy algorithm.

Pablo M. Berná, Stephen J. Dilworth, Denka Kutzarova, Timur Oikhberg, Ben Wallis

J. Approx. Theory, 2019

2016

Banach spaces with a unique greedy basis.

Fernando Albiac, José L. Ansorena, Stephen J. Dilworth, Denka Kutzarova

J. Approx. Theory, 2016

2014

Renorming spaces with greedy bases.

Stephen J. Dilworth, Denka Kutzarova, Edward Odell, Thomas Schlumprecht, András Zsák

J. Approx. Theory, 2014

2011

Renormings and symmetry properties of 1-greedy bases.

Stephen J. Dilworth, Edward Odell, Thomas Schlumprecht, András Zsák

J. Approx. Theory, 2011

Breaking the k² barrier for explicit RIP matrices.

Jean Bourgain, Stephen J. Dilworth, Kevin Ford, Sergei Konyagin, Denka Kutzarova

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010

Explicit constructions of RIP matrices and related problems

Jean Bourgain, Stephen J. Dilworth, Kevin Ford, Sergei Konyagin, Denka Kutzarova

CoRR, 2010

A new approach to the Ramsey-type games and the Gowers dichotomy in <i>F</i>-spaces.

George Androulakis, Stephen J. Dilworth, Nigel J. Kalton

Comb., 2010

2008

Coefficient Quantization in Banach Spaces.

Stephen J. Dilworth, Edward Odell, Thomas Schlumprecht, András Zsák

Found. Comput. Math., 2008

2002

On Approximate l₁ Systems in Banach Spaces.

Stephen J. Dilworth, Denka Kutzarova, Przemyslaw Wojtaszczyk

J. Approx. Theory, 2002