-
1
-
-
0033077324
-
The space complexity of approximating the frequency moments
-
Alon N., Matias Y., and Szegedy M. The space complexity of approximating the frequency moments. J. Comput. System Sci. 58 1 (1999) 137-147
-
(1999)
J. Comput. System Sci.
, vol.58
, Issue.1
, pp. 137-147
-
-
Alon, N.1
Matias, Y.2
Szegedy, M.3
-
2
-
-
57949113508
-
Combining geometry and combinatorics: A unified approach to sparse signal recovery
-
preprint
-
R. Berinde, A.C. Gilbert, P. Indyk, H. Karloff, M.J. Strauss, Combining geometry and combinatorics: A unified approach to sparse signal recovery, preprint, 2008
-
(2008)
-
-
Berinde, R.1
Gilbert, A.C.2
Indyk, P.3
Karloff, H.4
Strauss, M.J.5
-
3
-
-
31744440684
-
Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
-
Candes E., Romberg J., and Tao T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 52 (2006) 489-509
-
(2006)
IEEE Trans. Inform. Theory
, vol.52
, pp. 489-509
-
-
Candes, E.1
Romberg, J.2
Tao, T.3
-
4
-
-
34548030582
-
Group-theoretic algorithms for matrix multiplication
-
preprint
-
H. Cohn, R. Kleinberg, B. Szegedy, C. Umans, Group-theoretic algorithms for matrix multiplication, preprint
-
-
-
Cohn, H.1
Kleinberg, R.2
Szegedy, B.3
Umans, C.4
-
5
-
-
0001555328
-
Rapid multiplication of rectangular matrices
-
Coppersmith D. Rapid multiplication of rectangular matrices. SIAM J. Comput. 11 (1982) 467-471
-
(1982)
SIAM J. Comput.
, vol.11
, pp. 467-471
-
-
Coppersmith, D.1
-
6
-
-
0031097276
-
Rectangular matrix multiplication revisited
-
Coppersmith D. Rectangular matrix multiplication revisited. J. Complexity 13 (1997) 42-49
-
(1997)
J. Complexity
, vol.13
, pp. 42-49
-
-
Coppersmith, D.1
-
7
-
-
85023205150
-
Matrix multiplication via arithmetic progressions
-
Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9 (1990) 251-280
-
(1990)
J. Symbolic Comput.
, vol.9
, pp. 251-280
-
-
Coppersmith, D.1
Winograd, S.2
-
10
-
-
0020828424
-
Probabilistic counting algorithms for data base applications
-
Flajolet P., and Martin G. Probabilistic counting algorithms for data base applications. J. Comput. System Sci. 31 (1985) 182-209
-
(1985)
J. Comput. System Sci.
, vol.31
, pp. 182-209
-
-
Flajolet, P.1
Martin, G.2
-
11
-
-
84940654285
-
1 norm for sparse vectors
-
Allerton, Sep
-
1 norm for sparse vectors, in: Proc. 44th Annual Allerton Conf. Communication, Control, and Computing, Allerton, Sep. 2006
-
(2006)
Proc. 44th Annual Allerton Conf. Communication, Control, and Computing
-
-
Gilbert, A.C.1
Strauss, M.J.2
Tropp, J.A.3
Vershynin, R.4
-
12
-
-
57049125348
-
-
P. Indyk, Explicit constructions for compressed sensing of sparse signals, in: SODA, 2008
-
P. Indyk, Explicit constructions for compressed sensing of sparse signals, in: SODA, 2008
-
-
-
-
14
-
-
78650759634
-
-
M.A. Iwen, A deterministic sub-linear time sparse Fourier algorithm via non-adaptive compressed sensing methods, in: SODA, 2008
-
M.A. Iwen, A deterministic sub-linear time sparse Fourier algorithm via non-adaptive compressed sensing methods, in: SODA, 2008
-
-
-
-
15
-
-
84881194211
-
Geometry and the complexity of matrix multiplication
-
Landsberg J.M. Geometry and the complexity of matrix multiplication. Bull. Amer. Math. Soc. 45 2 (April 2008)
-
(2008)
Bull. Amer. Math. Soc.
, vol.45
, Issue.2
-
-
Landsberg, J.M.1
-
16
-
-
58449089505
-
Some algorithmic problems and results in compressed sensing
-
S. Muthukrishnan, Some algorithmic problems and results in compressed sensing, in: Allerton Conference, 2006
-
(2006)
Allerton Conference
-
-
Muthukrishnan, S.1
-
17
-
-
0011047766
-
On sets of integers which contain no three terms in arithmetical progression
-
Salem R., and Spencer D.C. On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. USA 28 (1942) 561-563
-
(1942)
Proc. Nat. Acad. Sci. USA
, vol.28
, pp. 561-563
-
-
Salem, R.1
Spencer, D.C.2
|