( en | de | ru )

 

Disambiguation of "Alon, Noga"

Author of the publication

copydeleteadd this publication to your clipboard
On the Exponent of the All Pairs Shortest Path Problem

, , and . FOCS, page 569-575. IEEE Computer Society, (1991)

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. You can also use the button next to the name to display some publications already assigned to the person.

Noga Alon

Alon Geller

Alon Tauber

Alon Padovicz

Oliver Noga

 

Other publications of authors with the same name

XML with Data Values: Typechecking Revisited., , , , and . PODS, ACM, (2001)Every monotone graph property is testable., and . STOC, page 128-137. ACM, (2005)Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs., , and . STOC, page 326-335. ACM, (1994)An optimal procedure for gap closing in whole genome shotgun sequencing., , , , and . RECOMB, page 22-30. ACM, (2001)Online Learning with Feedback Graphs: Beyond Bandits., , , and . COLT, volume 40 of JMLR Workshop and Conference Proceedings, page 23-35. JMLR.org, (2015)Many random walks are faster than one, , , , , and . SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, page 119--128. New York, NY, USA, ACM, (2008)Private PAC learning implies finite Littlestone dimension., , , and . STOC, page 852-860. ACM, (2019)Finding and Counting Given Length Cycles (Extended Abstract)., , and . ESA, volume 855 of Lecture Notes in Computer Science, page 354-364. Springer, (1994)The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence., and . Electr. J. Comb., (2008)Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover., and . ESA, volume 4698 of Lecture Notes in Computer Science, page 175-186. Springer, (2007)