Search: in all items in current results
Select / remove query terms:
Found 377 results in 0.432 sec. (Time to generate facets: 0 sec.)
Pages: 1  2  3  4  5  6  7  8  9  10  >>
Noga Alon, Yossi Matias, Mario Szegedy: The Space Complexity of Approximating the Frequency Moments. J. Comput. Syst. Sci. (JCSS) 58(1):137-147 (1999)
Cited 404 times
Noga Alon, Yossi Matias, Mario Szegedy: The Space Complexity of Approximating the Frequency Moments. STOC 1996
Read article - Cited 404 times
Noga Alon, Oded Goldreich, Johan Håstad, René Peralta: Simple Constructions of Almost k-Wise Independent Random Variables FOCS 1990
Cited 223 times
Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy: Efficient Testing of Large Graphs. Combinatorica 20(4):451-476 (2000)
Read article - Cited 111 times
Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy: Efficient Testing of Large Graphs. FOCS 1999
Read article - Cited 111 times
Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory (TIT) 38(2):509- (1992)
Cited 100 times
Noga Alon, Paul D. Seymour, Robin Thomas: A Separator Theorem for Graphs with an Excluded Minor and its Applications STOC 1990
Cited 78 times
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario Szegedy: Tracking Join and Self-Join Sizes in Limited Storage. J. Comput. Syst. Sci. (JCSS) 64(3):719-747 (2002)
Read article - Cited 76 times
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario Szegedy: Tracking Join and Self-Join Sizes in Limited Storage. PODS 1999
Read article - Cited 76 times
Noga Alon, Richard M. Karp, David Peleg, Douglas B. West: A Graph-Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput. (SIAMCOMP) 24(1):78-100 (1995)
Cited 75 times
Pages: 1  2  3  4  5  6  7  8  9  10  >>
Powered by Cloud Mining using the DBLP data.