Fetching the paper…
Reading the bibliography…
We pursue a systematic study of the following problem.
Akhiezer, N. I. (1965) The classical moment problem and some related questions in analysis, Translated by N. Kemmer, Hafner Publishing Co., New York
1965
Earlier work this paper cites.
A. Joffe. On a set of almost deterministic k-independent random variables. Annals of Probability, 2:161-162, 1974
1974
Earlier work this paper cites.
1975
Earlier work this paper cites.
Kreĭn, M. G. and Nudel’man, A. A. (1977) The Markov moment problem and extremal problems, Ideas and problems of P. L. Čebyšev and A. A. Markov and their further development, Translated from the Russian by D. Louvish, Translations of Mathematical Monographs, Vol. 50, AMS
1977
Earlier work this paper cites.
MacWilliams, F. J. and Sloane, N. J. A. (1977) The theory of error-correcting codes, North-Holland Mathematical Library, Vol. 16, North-Holland Publishing Co., Amsterdam
1977
Earlier work this paper cites.
M. Fredman, J. Komlos and E. Szemerédi. Storing a sparse table with O(1) worstcase access time. In Proc. 23rd IEEE Symposium on Foundations of Computer Science, pages 165-169, 1982
1982
Earlier work this paper cites.
B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky, ”The Bit Extraction Problem or t-Resilient Functions,” Proc. 26 th IEEE Symposium on Foundations of Computer Science, 1985, pages 396–407
1985
Earlier work this paper cites.
R. Karp and A. Wigderson. A fast parallel algorithm for the maximum independent set problem. J. ACM, 32: 762-773, 1985
1985
Earlier work this paper cites.
Luby M. (1985) A simple parallel algorithm for the maximal independent set problem Proc, of the 17’th annual ACM symposium on Theory of computing . Providence, Rhode Island, US, 1 - 10
1985
Earlier work this paper cites.
Alon N., Babai L. and Itai A. (1986) A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms , 7 (4)
1986
Earlier work this paper cites.
Boros E., Prekopa A. (1989) Closed form two-sided bounds for probabilities that at least r and exactly r out of n events occur, Mathematics of Operations Research , 14 (2)
1989
Earlier work this paper cites.
B. Chor and O. Goldreich, On the power of two-point sampling, Journal of Complexity, vol. 5, pp. 96-106, 1989
1989
Earlier work this paper cites.
Linial N., Mansour Y., and Nisan N.. Constant depth circuits, Fourier transform, and learnability. In 30th Annual Symposium on Foundations of Computer Science, pages 574-579, 1989
1989
Earlier work this paper cites.
Y. Azar, R. Motwani and J. Naor. Approximating arbitrary probability distributions using small sample spaces. Manuscript, 1990
1990
Earlier work this paper cites.
N. Linial and N. Nisan (1990) Approximate inclusion-exclusion, Combinatorica , 10
1990
Earlier work this paper cites.
J. Aspnes, R. Beigel, M. Furst, S. Rudich: The expressive power of voting polynomials Proc. 23rd ACM Conference STOC, 1991,402-409
1991
Cited alongside, same era.
B. Berger and J. Rompel. Simulating ( log c n \log^{c}n )-wise independence in NC. Journal of the ACM, 38:1026-1046, 1991
1991
Cited alongside, same era.
R. Curto, L. A. Fialkow, Recursiveness, positivity, and truncated moment problems, Houston J. Math. , vol 17 (4), 1991
1991
Cited alongside, same era.
N. Alon, J. Bruck, J. Naor, M. Naor and R. Roth. Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Info. Theory, 38:509-516, 1992
1992
Cited alongside, same era.
N. Alon, O. Goldreich, J. Håstad and R. Peralta, Simple constructions of almost k-wise independent random variables. Random Struct. Algorithms 3 3 (1992), pp. 289-304 (preliminary version in FOCS90)
S. Chari, P. Rohatgi and A. Srinivasan. Improved algorithms via approximations of probability distributions. In Proc. 26th ACM Symposium on Theory of Computing, pages 584-592, 1994
1994
Later among the works it cites.
M. Luby and A. Wigderson. Pairwise independence and derandomization. Technical Report TR-95-035, International Computer Science Institute, Berkeley, California, 1995
1995
Later among the works it cites.
Meshulam R. (1995), On subsets of finite abelian groups with no 3-term arithmetic progressions. J. Combin. Theory Series A , 71 (1)
1995
Later among the works it cites.
Durrett R. (1996) Probability: theory and examples, second edition, Duxbury press, Belmont, CA
1996
Later among the works it cites.
Friedgut E. and Kalai G. (1996) Every Monotone Graph Property Has a Sharp Threshold Proc. Amer. Math. Soc. 124
1996
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1992
Cited alongside, same era.
G. Even, O. Goldreich, M. Luby, N. Nisan and B. Velićković. Approximations of general independent distributions. In Proc. 24th ACM Symposium on Theory of Computing, pages 10-16, 1992
1992
Cited alongside, same era.
N. Nisan and M. Szegedy. On the degree of boolean functions as real polynomial. In Proceedings of the 24th ACM Symposium on the Theory of Computing, pages 462–467. ACM, New York, 1992
1992
Cited alongside, same era.
L. J. Schulman. Sample spaces uniform on neighborhoods. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 17-25, 1992
1992
Cited alongside, same era.
D. Koller and N. Megiddo. Constructing small sample spaces satisfying given constraints. In Proc. of the 25th Annual ACM Symposium on Theory of Computing, pages 268-277, 1993
1993
Cited alongside, same era.
M. Luby. Removing randomness in parallel computation without a processor penalty. J. Comput. Syst. Sci., 47(2):250-286, 1993
1993
Cited alongside, same era.
J. Naor and M. Naor, Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22 4 (1993), pp. 838-856 (preliminary version in STOC90)
1993
Cited alongside, same era.
H. Karloff and Y. Mansour. On construction of k-wise independent random variables. In Proc. of the 26th Annual ACM Symposium on Theory of Computing, pages 564-573, 1994
1994
Cited alongside, same era.
O. Häggström (1997) Infinite clusters in dependent automorphism invariant percolation on trees, Annals of Probability , 25
1997
Later among the works it cites.
I. Benjamini, G. Kalai, O. Schramm, (1999) Noise sensitivity of Boolean functions and applications to percolation, Publications Mathe’matiques de l’IHE’S , 90
1999
Later among the works it cites.
Fukuda K. (1999), CDD+ version 0.76a1 (June 8 1999), Institute for Operations Research ETH-Zentrum, CH-8092 Zurich, Switzerland and Department of Mathematics ETFL, CH-1015 Lausanne, Switzerland. http://www.cs.mcgill.ca/ fukuda/soft/cddman/cddman.html
1999
Later among the works it cites.
G.R. Grimmett (1999) Percolation, 2nd Edition, Springer
1999
Later among the works it cites.
Hedayat, A. S. and Sloane, N. J. A. and Stufken, John (1999) Orthogonal arrays, Theory and applications, With a foreword by C. R. Rao, Springer-Verlag, New York
1999
Later among the works it cites.
Håstad J. (2001), A Slight Sharpening of LMN, J. Comput. Syst. Sci. 63 (3)
2001
Later among the works it cites.
O’Donnell R., Servidio R. A. (2003) New degree bounds for polynomial threshold functions, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing , 325 - 334
2003
Later among the works it cites.
Dumer I. and Yekhanin, S. (2004), Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance, IEEE Trans. Inform. Theory , 50 (10)
2004
Later among the works it cites.
I. Benjamini, G. Kozma, D, Romik (2006) Random walks with k-wise independent increments, Electronic Communications in Probability , 11
2006
Later among the works it cites.