( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
k-Wise Independent Random Graphs.

, и . FOCS, стр. 813-822. IEEE Computer Society, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Noga Alon

Alon Geller

Alon Tauber

Alon Padovicz

Oliver Noga

 

Другие публикации лиц с тем же именем

The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence., и . Electr. J. Comb., (2008)Online Learning with Feedback Graphs: Beyond Bandits., , , и . COLT, том 40 из JMLR Workshop and Conference Proceedings, стр. 23-35. JMLR.org, (2015)Private PAC learning implies finite Littlestone dimension., , , и . STOC, стр. 852-860. ACM, (2019)An optimal procedure for gap closing in whole genome shotgun sequencing., , , , и . RECOMB, стр. 22-30. ACM, (2001)Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover., и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 175-186. Springer, (2007)On-line and Off-line Approximation Algorithms for Vector Covering Problems., , , , и . ESA, том 1136 из Lecture Notes in Computer Science, стр. 406-418. Springer, (1996)Finding and Counting Given Length Cycles (Extended Abstract)., , и . ESA, том 855 из Lecture Notes in Computer Science, стр. 354-364. Springer, (1994)Many random walks are faster than one, , , , , и . SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, стр. 119--128. New York, NY, USA, ACM, (2008)The Hat Guessing Number of Graphs., , , и . ISIT, стр. 490-494. IEEE, (2019)Biased Coins and Randomized Algorithms., и . Adv. Comput. Res., (1989)