Stephen J. Dilworth

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◁ ▷ joint publications with coauthor community group 1

> Home > Persons > Stephen J. Dilworth

Publications

2019
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/jat/BernaDKOW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jat/BernaDKOW19
Pablo M. Berná, Stephen J. Dilworth, Denka Kutzarova, Timur Oikhberg, Ben Wallis:
The weighted property (A) and the greedy algorithm. J. Approx. Theory 248 (2019)
2016
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jat/AlbiacADK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jat/AlbiacADK16
Fernando Albiac, José L. Ansorena, Stephen J. Dilworth, Denka Kutzarova:
Banach spaces with a unique greedy basis. J. Approx. Theory 210: 80-102 (2016)
2014
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jat/DilworthKOSZ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jat/DilworthKOSZ14
Stephen J. Dilworth, Denka Kutzarova, Edward Odell, Thomas Schlumprecht, András Zsák:
Renorming spaces with greedy bases. J. Approx. Theory 188: 39-56 (2014)
2011
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jat/DilworthOSZ11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jat/DilworthOSZ11
Stephen J. Dilworth, Edward Odell, Thomas Schlumprecht, András Zsák:
Renormings and symmetry properties of 1-greedy bases. J. Approx. Theory 163(9): 1049-1075 (2011)
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/BourgainDFKK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BourgainDFKK11
Jean Bourgain, Stephen J. Dilworth, Kevin Ford, Sergei Konyagin, Denka Kutzarova:
Breaking the k² barrier for explicit RIP matrices. STOC 2011: 637-644
2010
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorica/AndroulakisDK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/AndroulakisDK10
George Androulakis, Stephen J. Dilworth, Nigel J. Kalton:
A new approach to the Ramsey-type games and the Gowers dichotomy in F-spaces. Comb. 30(4): 359-385 (2010)
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1008-4535
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1008-4535
Jean Bourgain, Stephen J. Dilworth, Kevin Ford, Sergei Konyagin, Denka Kutzarova:
Explicit constructions of RIP matrices and related problems. CoRR abs/1008.4535 (2010)
2008
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/focm/DilworthOSZ08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/focm/DilworthOSZ08
Stephen J. Dilworth, Edward Odell, Thomas Schlumprecht, András Zsák:
Coefficient Quantization in Banach Spaces. Found. Comput. Math. 8(6): 703-736 (2008)
2002
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jat/DilworthKW02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jat/DilworthKW02
Stephen J. Dilworth, Denka Kutzarova, Przemyslaw Wojtaszczyk:
On Approximate l₁ Systems in Banach Spaces. J. Approx. Theory 114(2): 214-241 (2002)

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.