  |
Items where Author is "Alon, N."
Group by: Item Type | No Grouping Jump to: Article | Book Section Number of items: 3. ArticleAlon, N. and Elboim, D. and Pach, János and Tardos, Gábor (2024) Random Necklaces Require Fewer Cuts. SIAM JOURNAL ON DISCRETE MATHEMATICS, 38 (2). pp. 1381-1408. ISSN 0895-4801 Ahlswede, R. and Alon, N. and Erdős, Péter and Ruszinkó, Miklós and Székely, L. A. (1997) Intersecting systems. COMBINATORICS PROBABILITY AND COMPUTING, 6 (2). pp. 127-137. ISSN 0963-5483 Book SectionAlon, N. and Capalbo, M. and Kohayakawa, Y. and Rödl, V. and Ruciński, A. and Szemerédi, Endre (2015) Near-optimum universal graphs for graphs with bounded degrees (Extended abstract). In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. Lecture Notes in Computer Science (2129). Springer, Berlin; Heidelberg; New York, pp. 170-180. ISBN 978-3-540-42470-3 |
