Universality for graphs with bounded density.

Noga Alon Alon Nilli נוגה אלון Princeton University, USA Tel Aviv University, Sackler School of Mathematics, Israel ACM Paris Kanellakis Theory and Practice Award Dijkstra Prize Gödel Prize http://www.math.tau.ac.il/~nogaa/ https://scholar.google.com/citations?user=vOYl40wAAAAJ https://dl.acm.org/profile/81100305768 https://dl.acm.org/profile/81100563249 https://zbmath.org/authors/?q=ai:alon.noga https://mathscinet.ams.org/mathscinet/MRAuthorID/25060 https://mathgenealogy.org/id.php?id=58918 https://en.wikipedia.org/wiki/Noga_Alon https://orcid.org/0000-0003-1332-4883 https://www.wikidata.org/entity/Q92927 http://isni.org/isni/0000000078351522 https://viaf.org/viaf/2603775 https://id.loc.gov/authorities/names/n91031420 https://d-nb.info/gnd/170483320 https://awards.acm.org/award_winners/alon_6955744 https://www.wikidata.org/entity/Q130964615

Noga Alon Natalie Dodson Carmen Jackson Rose McCarty Rajko Nenadov Lani Southern Universality for graphs with bounded density. 2026 245-266 178 J. Comb. Theory B https://doi.org/10.1016/j.jctb.2026.01.004 db/journals/jctb/jctb178.html#AlonDJMNS26 streams/journals/jctb

Noga Alon Shakhar Smorodinsky Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets. 6223-6232 2026 SODA https://doi.org/10.1137/1.9781611978971.223 conf/soda/2026 db/conf/soda/soda2026.html#AlonS26

Noga Alon Colin Defant Noah Kravitz Daniel G. Zhu Ordering Candidates via Vantage Points. 25 2025 April 45 Comb. 2 https://doi.org/10.1007/s00493-025-00148-0 db/journals/combinatorica/combinatorica45.html#AlonDKZ25 streams/journals/combinatorica

Noga Alon Yaakov Malinovsky Lucy Martinez Doron Zeilberger Hitting $k$ Primes by Dice Rolls. 2025 32 Electron. J. Comb. 4 https://doi.org/10.37236/13878 db/journals/combinatorics/combinatorics32.html#AlonMMZ25 streams/journals/combinatorics

Hannaneh Akrami Noga Alon Bhaskar Ray Chaudhury Jugal Garg Kurt Mehlhorn Ruta Mehta EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. 738-751 2025 73 Oper. Res. 2 https://doi.org/10.1287/opre.2023.0433 db/journals/ior/ior73.html#AkramiACGMM25 streams/journals/ior

Noga Alon Or Zamir Sumsets in the Hypercube. 314-326 2025 39 SIAM J. Discret. Math. 1 https://doi.org/10.1137/24m165569x db/journals/siamdm/siamdm39.html#AlonZ25 streams/journals/siamdm

Noga Alon Nick Gravin Tristan Pollner Aviad Rubinstein Hongao Wang S. Matthew Weinberg Qianfan Zhang 0002 A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions. 4:1-4:22 2025 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2025.4 conf/innovations/2025 db/conf/innovations/innovations2025.html#AlonGPRWW025

Noga Alon Danny Segev New Approximation Guarantees for The Inventory Staggering Problem. 2025 June abs/2506.10339 CoRR https://doi.org/10.48550/arXiv.2506.10339 db/journals/corr/corr2506.html#abs-2506-10339 streams/journals/corr

Noga Alon Shakhar Smorodinsky Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets. 2025 June abs/2506.17777 CoRR https://doi.org/10.48550/arXiv.2506.17777 db/journals/corr/corr2506.html#abs-2506-17777 streams/journals/corr

Noga Alon Martin Milanic Pawel Rzazewski Induced matching treewidth and tree-independence number, revisited. 2025 November abs/2511.03864 CoRR https://doi.org/10.48550/arXiv.2511.03864 db/journals/corr/corr2511.html#abs-2511-03864 streams/journals/corr

Noga Alon Sabyasachi Basu Shweta Jain 0007 Haim Kaplan Jakub Lacki Blair D. Sullivan Aggregating maximal cliques in real-world graphs. 2025 December abs/2512.03960 CoRR https://doi.org/10.48550/arXiv.2512.03960 db/journals/corr/corr2512.html#abs-2512-03960 streams/journals/corr

Noah Kravitz Noga Alon Cats in Cubes. 2024 31 Electron. J. Comb. 3 https://doi.org/10.37236/11735 db/journals/combinatorics/combinatorics31.html#KravitzA24 streams/journals/combinatorics

Noga Alon Implicit Representation of Sparse Hereditary Families. 476-482 2024 September 72 Discret. Comput. Geom. 2 https://doi.org/10.1007/s00454-023-00521-0 db/journals/dcg/dcg72.html#Alon24 streams/journals/dcg

Noga Alon Graph-codes. 103880 2024 February 116 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2023.103880 db/journals/ejc/ejc116.html#Alon24

Noga Alon Erasure list-decodable codes and Turán hypercube problems. 102513 2024 100 Finite Fields Their Appl. https://doi.org/10.1016/j.ffa.2024.102513 db/journals/ffa/ffa100.html#Alon24 streams/journals/ffa

Noga Alon Peter Frankl Turán graphs with bounded matching number. 223-229 2024 March 165 J. Comb. Theory B https://doi.org/10.1016/j.jctb.2023.12.002 db/journals/jctb/jctb165.html#AlonF24

Noga Alon Connectivity graph-codes. 451-459 2024 65 Random Struct. Algorithms 3 https://doi.org/10.1002/rsa.21222 db/journals/rsa/rsa65.html#Alon24 streams/journals/rsa

Noga Alon Emil Powierski Michael Savery Alex D. Scott Elizabeth Wilmer Invertibility of Digraphs and Tournaments. 327-347 2024 March 38 SIAM J. Discret. Math. 1 https://doi.org/10.1137/23m1547135 https://www.wikidata.org/entity/Q129995947 db/journals/siamdm/siamdm38.html#AlonPSSW24

Noga Alon Dor Elboim János Pach Gábor Tardos Random Necklaces Require Fewer Cuts. 1381-1408 2024 38 SIAM J. Discret. Math. 2 https://doi.org/10.1137/22m1506699 db/journals/siamdm/siamdm38.html#AlonEPT24

Noga Alon Jonathan D. Cohen 0003 Thomas L. Griffiths 0001 Pasin Manurangsi Daniel Reichman 0001 Igor Shinkar Tal Wagner Erratum: Multitasking Capacity: Hardness Results and Improved Constructions. 2001-2003 2024 38 SIAM J. Discret. Math. 2 https://doi.org/10.1137/23m1603856 db/journals/siamdm/siamdm38.html#Alon00M0SW24

Noga Alon Olivier Bousquet Kasper Green Larsen Shay Moran Shlomo Moran Diagonalization Games. 866-879 2024 November 131 Am. Math. Mon. 10 https://doi.org/10.1080/00029890.2024.2393992 db/journals/tamm/tamm131.html#AlonBLMM24 streams/journals/tamm

Noga Alon Gabriela Bourla Ben Graham Xiaoyu He Noah Kravitz Logarithmically Larger Deletion Codes of All Distances. 125-130 2024 January 70 IEEE Trans. Inf. Theory 1 https://doi.org/10.1109/TIT.2023.3304565 db/journals/tit/tit70.html#AlonBGHK24

Noga Alon Shay Moran Hilla Schefler Amir Yehudayoff A Unified Characterization of Private Learnability via Graph Theory. 94-129 2024 COLT https://proceedings.mlr.press/v247/alon24a.html conf/colt/2024 db/conf/colt/colt2024.html#AlonMSY24 Noga Alon Dmitrii Avdiukhin Dor Elboim Orr Fischer Grigory Yaroslavtsev Optimal Sample Complexity of Contrastive Learning. 2024 ICLR https://openreview.net/forum?id=NU9AYHJvYe conf/iclr/2024 db/conf/iclr/iclr2024.html#AlonAEFY24 Noga Alon Allan Grønlund Søren Fuglede Jørgensen Kasper Green Larsen Sublinear Time Shortest Path in Expander Graphs. 8:1-8:13 2024 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2024.8 conf/mfcs/2024 db/conf/mfcs/mfcs2024.html#AlonGJL24

Noga Alon Or Zamir Sumsets in the Hypercube. 2024 abs/2403.16589 CoRR https://doi.org/10.48550/arXiv.2403.16589 db/journals/corr/corr2403.html#abs-2403-16589

Noga Alon Baruch Schieber Optimal Preprocessing for Answering On-Line Product Queries. 2024 abs/2406.06321 CoRR https://doi.org/10.48550/arXiv.2406.06321 db/journals/corr/corr2406.html#abs-2406-06321

Noga Alon Nick Gravin Tristan Pollner Aviad Rubinstein Hongao Wang S. Matthew Weinberg Qianfan Zhang 0002 A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions. 2024 abs/2411.11741 CoRR https://doi.org/10.48550/arXiv.2411.11741 db/journals/corr/corr2411.html#abs-2411-11741 streams/journals/corr

Noga Alon Fan Wei Irregular subgraphs. 269-283 2023 March 32 Comb. Probab. Comput. 2 https://doi.org/10.1017/S0963548322000220 db/journals/cpc/cpc32.html#AlonW23

Noga Alon Michael Krivelevich Wojciech Samotij Largest subgraph from a hereditary property in a random graph. 113480 2023 September 346 Discret. Math. 9 https://doi.org/10.1016/j.disc.2023.113480 db/journals/dm/dm346.html#AlonKS23

Noga Alon Jaroslaw Grytczuk Andrzej P. Kisielewicz Krzysztof Przeslawski New bounds on the maximum number of neighborly boxes in Rd. 103797 2023 December 114 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2023.103797 db/journals/ejc/ejc114.html#AlonGKP23

Noga Alon Colin Defant Noah Kravitz Typical and extremal aspects of friends-and-strangers graphs. 3-42 2023 158 J. Comb. Theory B Part https://doi.org/10.1016/j.jctb.2022.03.001 db/journals/jctb/jctb158.html#AlonDK23

Noga Alon Michael Krivelevich Benny Sudakov Complete minors and average degree: A short proof. 599-602 2023 July 103 J. Graph Theory 3 https://doi.org/10.1002/jgt.22937 db/journals/jgt/jgt103.html#AlonKS23

Noga Alon Anna Gujgiczer János Körner Aleksa Milojevic Gábor Simonyi Structured Codes of Graphs. 379-403 2023 March 37 SIAM J. Discret. Math. 1 https://doi.org/10.1137/22m1487989 db/journals/siamdm/siamdm37.html#AlonGKMS23

Noga Alon Ehud Friedgut Gil Kalai Guy Kindler The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs. 2717-2729 2023 December 37 SIAM J. Discret. Math. 4 https://doi.org/10.1137/22m1515975 db/journals/siamdm/siamdm37.html#AlonFKK23

Noga Alon Alon Gonen Elad Hazan Shay Moran Boosting Simple Learners. 2023 2 TheoretiCS 8 https://doi.org/10.46298/theoretics.23.8 db/journals/theoretics/theoretics2.html#AlonGHM23

Hannaneh Akrami Noga Alon Bhaskar Ray Chaudhury Jugal Garg Kurt Mehlhorn Ruta Mehta EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. 61 2023 EC https://doi.org/10.1145/3580507.3597799 https://www.wikidata.org/entity/Q130964620 conf/sigecom/2023 db/conf/sigecom/sigecom2023.html#AkramiACGMM23

Noga Alon Olivier Bousquet Kasper Green Larsen Shay Moran Shlomo Moran Diagonalization Games. 2023 abs/2301.01924 CoRR https://doi.org/10.48550/arXiv.2301.01924 db/journals/corr/corr2301.html#abs-2301-01924

Noga Alon Shay Moran Hilla Schefler Amir Yehudayoff A Unified Characterization of Private Learnability via Graph Theory. 2023 abs/2304.03996 CoRR https://doi.org/10.48550/arXiv.2304.03996 db/journals/corr/corr2304.html#abs-2304-03996

Noga Alon Anurag Bishnoi Shagnik Das Alessandro Neri 0002 Strong blocking sets and minimal codes from expander graphs. 2023 abs/2305.15297 CoRR https://doi.org/10.48550/arXiv.2305.15297 db/journals/corr/corr2305.html#abs-2305-15297

Noga Alon Allan Grønlund Søren Fuglede Jørgensen Kasper Green Larsen Sublinear Time Shortest Path in Expander Graphs. 2023 abs/2307.06113 CoRR https://doi.org/10.48550/arXiv.2307.06113 db/journals/corr/corr2307.html#abs-2307-06113

Noga Alon On bipartite coverings of graphs and multigraphs. 2023 abs/2307.16784 CoRR https://doi.org/10.48550/arXiv.2307.16784 db/journals/corr/corr2307.html#abs-2307-16784

Noga Alon Dmitrii Avdiukhin Dor Elboim Orr Fischer Grigory Yaroslavtsev Optimal Sample Complexity of Contrastive Learning. 2023 abs/2312.00379 CoRR https://doi.org/10.48550/arXiv.2312.00379 db/journals/corr/corr2312.html#abs-2312-00379

Noga Alon Olivier Bousquet Kasper Green Larsen Shay Moran Shlomo Moran Diagonalization Games. TR23-002 2023 TR23 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2023/002 db/journals/eccc/eccc2023.html#AlonBLMM23

Noga Alon Colin Defant Noah Kravitz The runsort permuton. 102361 2022 139 Adv. Appl. Math. https://doi.org/10.1016/j.aam.2022.102361 db/journals/aam/aam139.html#AlonDK22

Noga Alon Clara Shikhelman Additive Approximation of Generalized Turán Questions. 464-481 2022 84 Algorithmica 2 https://doi.org/10.1007/s00453-021-00899-4 db/journals/algorithmica/algorithmica84.html#AlonS22

Noga Alon Asaf Nachmias Matan Shalev The diameter of the uniform spanning tree of dense graphs. 1010-1030 2022 31 Comb. Probab. Comput. 6 https://doi.org/10.1017/S0963548322000062 db/journals/cpc/cpc31.html#AlonNS22

Noga Alon Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky The ε-t-Net Problem. 618-644 2022 68 Discret. Comput. Geom. 2 https://doi.org/10.1007/s00454-022-00376-x db/journals/dcg/dcg68.html#AlonJKSY22

Noga Alon Jeremy Chizewer On the hat guessing number of graphs. 112785 2022 345 Discret. Math. 4 https://doi.org/10.1016/j.disc.2021.112785 db/journals/dm/dm345.html#AlonC22

Noga Alon Mark Bun Roi Livni Maryanthe Malliaris Shay Moran Private and Online Learnability Are Equivalent. 28:1-28:34 2022 69 J. ACM 4 https://doi.org/10.1145/3526074 db/journals/jacm/jacm69.html#AlonBLMM22

Noga Alon Implicit representation of sparse hereditary families. 2022 abs/2201.00328 CoRR https://arxiv.org/abs/2201.00328 db/journals/corr/corr2201.html#abs-2201-00328

Noga Alon Benjamin Gunby Xiaoyu He Eran Shmaya Eilon Solan Identifying the Deviator. 2022 abs/2203.03744 CoRR https://doi.org/10.48550/arXiv.2203.03744 db/journals/corr/corr2203.html#abs-2203-03744

Noga Alon Gabriela Bourla Ben Graham Xiaoyu He Noah Kravitz Logarithmically larger deletion codes of all distances. 2022 abs/2209.11882 CoRR https://doi.org/10.48550/arXiv.2209.11882 db/journals/corr/corr2209.html#abs-2209-11882

Noga Alon Peter Frankl Turán graphs with bounded matching number. 2022 abs/2210.15076 CoRR https://doi.org/10.48550/arXiv.2210.15076 db/journals/corr/corr2210.html#abs-2210-15076

Noga Alon Emil Powierski Michael Savery Alex Scott 0001 Elizabeth Wilmer Invertibility of digraphs and tournaments. 2022 abs/2212.11969 CoRR https://doi.org/10.48550/arXiv.2212.11969 db/journals/corr/corr2212.html#abs-2212-11969

Noga Alon Guy Moshkovitz Limitations on regularity lemmas for clustering graphs. 102135 2021 124 Adv. Appl. Math. https://doi.org/10.1016/j.aam.2020.102135 https://www.wikidata.org/entity/Q124852057 db/journals/aam/aam124.html#AlonM21

Noga Alon Explicit Expanders of Every Degree and Size. 447-463 2021 41 Comb. 4 https://doi.org/10.1007/s00493-020-4429-x db/journals/combinatorica/combinatorica41.html#Alon21

Noga Alon Raimundo Briceño Nishant Chandgotia Alexander Magazinov Yinon Spinka Mixing properties of colourings of the ℤd lattice. 360-373 2021 30 Comb. Probab. Comput. 3 https://doi.org/10.1017/S0963548320000395 db/journals/cpc/cpc30.html#AlonBCMS21

Noga Alon Sebastian M. Cioaba Brandon D. Gilbert Jack H. Koolen Brendan D. McKay Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs. 372-382 2021 30 Exp. Math. 3 https://doi.org/10.1080/10586458.2018.1542643 db/journals/em/em30.html#AlonCGKM21

Noga Alon Matija Bucic Tom Kalvari Eden Kuperwasser Tibor Szabó List Ramsey numbers. 109-128 2021 96 J. Graph Theory 1 https://doi.org/10.1002/jgt.22610 https://www.wikidata.org/entity/Q114236154 db/journals/jgt/jgt96.html#AlonBKKS21

Noga Alon Michael Krivelevich Divisible subdivisions. 623-629 2021 98 J. Graph Theory 4 https://doi.org/10.1002/jgt.22716 db/journals/jgt/jgt98.html#AlonK21

Noga Alon Yossi Azar Mark Berlin The Price of Bounded Preemption. 3:1-3:21 2021 8 ACM Trans. Parallel Comput. 1 https://doi.org/10.1145/3434377 db/journals/topc/topc8.html#AlonAB21

Noga Alon Steve Hanneke Ron Holzman Shay Moran A Theory of PAC Learnability of Partial Concept Classes. 658-671 2021 FOCS https://doi.org/10.1109/FOCS52979.2021.00070 conf/focs/2021 db/conf/focs/focs2021.html#AlonHHM21 Noga Alon Andrei Graur Efficient Splitting of Necklaces. 14:1-14:17 2021 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2021.14 conf/icalp/2021 db/conf/icalp/icalp2021.html#AlonG21 Noga Alon Omri Ben-Eliezer Yuval Dagan Shay Moran Moni Naor Eylon Yogev Adversarial laws of large numbers and optimal regret in online classification. 447-455 2021 STOC https://doi.org/10.1145/3406325.3451041 https://www.wikidata.org/entity/Q130968544 conf/stoc/2021 db/conf/stoc/stoc2021.html#AlonBDMNY21 Noga Alon Alon Gonen Elad Hazan Shay Moran Boosting simple learners. 481-489 2021 STOC https://doi.org/10.1145/3406325.3451030 conf/stoc/2021 db/conf/stoc/stoc2021.html#AlonGHM21

Noga Alon Omri Ben-Eliezer Yuval Dagan Shay Moran Moni Naor Eylon Yogev Adversarial Laws of Large Numbers and Optimal Regret in Online Classification. 2021 abs/2101.09054 CoRR https://arxiv.org/abs/2101.09054 db/journals/corr/corr2101.html#abs-2101-09054

Noga Alon Jeremy Chizewer On the Hat Guessing Number of Graphs. 2021 abs/2107.05995 CoRR https://arxiv.org/abs/2107.05995 db/journals/corr/corr2107.html#abs-2107-05995

Noga Alon Steve Hanneke Ron Holzman Shay Moran A Theory of PAC Learnability of Partial Concept Classes. 2021 abs/2107.08444 CoRR https://arxiv.org/abs/2107.08444 db/journals/corr/corr2107.html#abs-2107-08444

Noga Alon Partitioning all k-subsets into r-wise intersecting families. 2021 abs/2107.12741 CoRR https://arxiv.org/abs/2107.12741 db/journals/corr/corr2107.html#abs-2107-12741

Noga Alon Mrinal Kumar 0001 Ben Lee Volk Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. 149-178 2020 40 Comb. 2 https://doi.org/10.1007/s00493-019-4009-0 db/journals/combinatorica/combinatorica40.html#AlonKV20

Noga Alon Dan Hefetz Michael Krivelevich Mykhaylo Tyomkyn Edge-statistics on large graphs. 163-189 2020 29 Comb. Probab. Comput. 2 https://doi.org/10.1017/S0963548319000294 https://www.wikidata.org/entity/Q126795050 db/journals/cpc/cpc29.html#AlonHKT20

Noga Alon Colin Defant Isoperimetry, stability, and irredundance in direct products. 111902 2020 343 Discret. Math. 7 https://doi.org/10.1016/j.disc.2020.111902 db/journals/dm/dm343.html#AlonD20

Noga Alon Shoni Gilboa Shay Gueron A probabilistic variant of Sperner 's theorem and of maximal r-cover free families. 112027 2020 343 Discret. Math. 10 https://doi.org/10.1016/j.disc.2020.112027 db/journals/dm/dm343.html#AlonGG20

Noga Alon Ryan Alweiss On the product dimension of clique factors. 103097 2020 86 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2020.103097 db/journals/ejc/ejc86.html#AlonA20

Noga Alon Omri Ben-Eliezer Chong Shangguan Itzhak Tamo The hat guessing number of graphs. 119-149 2020 144 J. Comb. Theory B https://doi.org/10.1016/j.jctb.2020.01.003 db/journals/jctb/jctb144.html#AlonBST20

Noga Alon Jørgen Bang-Jensen Stéphane Bessy Out-colourings of digraphs. 88-112 2020 93 J. Graph Theory 1 https://doi.org/10.1002/jgt.22476 https://www.wikidata.org/entity/Q127448584 db/journals/jgt/jgt93.html#AlonBB20

Noga Alon Omri Ben-Eliezer Efficient Removal Lemmas for Matrices. 83-101 2020 37 Order 1 https://doi.org/10.1007/s11083-019-09494-3 https://www.wikidata.org/entity/Q124792018 db/journals/order/order37.html#AlonB20

Noga Alon Jonathan D. Cohen 0003 Thomas L. Griffiths 0001 Pasin Manurangsi Daniel Reichman 0001 Igor Shinkar Tal Wagner Alexander Y. Ku Multitasking Capacity: Hardness Results and Improved Constructions. 885-903 2020 34 SIAM J. Discret. Math. 1 https://doi.org/10.1137/18M1224672 db/journals/siamdm/siamdm34.html#AlonCGMRSWK20

Noga Alon Elchanan Mossel Robin Pemantle Distributed Corruption Detection in Networks. 1-23 2020 16 Theory Comput. https://doi.org/10.4086/toc.2020.v016a001 db/journals/toc/toc16.html#AlonMP20

Noga Alon Sepehr Assadi Palette Sparsification Beyond (Δ+1) Vertex Coloring. 6:1-6:22 2020 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.6 conf/approx/2020 db/conf/approx/approx2020.html#AlonA20 Noga Alon Amos Beimel Shay Moran Uri Stemmer Closure Properties for Private Classification and Online Prediction. 119-152 2020 COLT http://proceedings.mlr.press/v125/alon20a.html conf/colt/2020 db/conf/colt/colt2020.html#AlonBMS20 Noga Alon Yossi Azar Danny Vainstein Hierarchical Clustering: A 0.585 Revenue Approximation. 153-162 2020 COLT http://proceedings.mlr.press/v125/alon20b.html conf/colt/2020 db/conf/colt/colt2020.html#AlonAV20 Noga Alon Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky The ε-t-Net Problem. 5:1-5:15 2020 SoCG https://doi.org/10.4230/LIPIcs.SoCG.2020.5 conf/compgeom/2020 db/conf/compgeom/compgeom2020.html#AlonJKSY20

Noga Alon Adi Shraibman Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs. 2020 abs/2001.00387 CoRR http://arxiv.org/abs/2001.00387 db/journals/corr/corr2001.html#abs-2001-00387

Noga Alon Alon Gonen Elad Hazan Shay Moran Boosting Simple Learners. 2020 abs/2001.11704 CoRR https://arxiv.org/abs/2001.11704 db/journals/corr/corr2001.html#abs-2001-11704

Noga Alon Amos Beimel Shay Moran Uri Stemmer Closure Properties for Private Classification and Online Prediction. 2020 abs/2003.04509 CoRR https://arxiv.org/abs/2003.04509 db/journals/corr/corr2003.html#abs-2003-04509

Noga Alon Bruno Jartoux Chaya Keller Shakhar Smorodinsky Yelena Yuditsky The ε-t-Net Problem. 2020 abs/2003.07061 CoRR https://arxiv.org/abs/2003.07061 db/journals/corr/corr2003.html#abs-2003-07061

Noga Alon Explicit expanders of every degree and size. 2020 abs/2003.11673 CoRR https://arxiv.org/abs/2003.11673 db/journals/corr/corr2003.html#abs-2003-11673

Noga Alon Yossi Azar Danny Vainstein Hierarchical Clustering: a 0.585 Revenue Approximation. 2020 abs/2006.01933 CoRR https://arxiv.org/abs/2006.01933 db/journals/corr/corr2006.html#abs-2006-01933

Noga Alon Sepehr Assadi Palette Sparsification Beyond (Δ+1) Vertex Coloring. 2020 abs/2006.10456 CoRR https://arxiv.org/abs/2006.10456 db/journals/corr/corr2006.html#abs-2006-10456

Noga Alon Andrei Graur Efficient Splitting of Measures and Necklaces. 2020 abs/2006.16613 CoRR https://arxiv.org/abs/2006.16613 db/journals/corr/corr2006.html#abs-2006-16613

Noga Alon Colin Defant Noah Kravitz Typical and Extremal Aspects of Friends-and-Strangers Graphs. 2020 abs/2009.07840 CoRR https://arxiv.org/abs/2009.07840 db/journals/corr/corr2009.html#abs-2009-07840

Noga Alon Mark Braverman Klim Efremenko Ran Gelles Bernhard Haeupler Reliable communication over highly connected noisy networks. 505-515 2019 32 Distributed Comput. 6 https://doi.org/10.1007/s00446-017-0303-5 db/journals/dc/dc32.html#AlonBEGH19

Noga Alon Clara Shikhelman H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups. 988-996 2019 342 Discret. Math. 4 https://doi.org/10.1016/j.disc.2018.11.012 db/journals/dm/dm342.html#AlonS19

Noga Alon Guy Moshkovitz Noam Solomon Traces of hypergraphs. 498-517 2019 100 J. Lond. Math. Soc. 2 https://doi.org/10.1112/jlms.12233 db/journals/jlms/jlms100.html#AlonMS19

Noga Alon Nadav Sherman Induced Universal Hypergraphs. 629-642 2019 33 SIAM J. Discret. Math. 2 https://doi.org/10.1137/18M1163750 db/journals/siamdm/siamdm33.html#AlonS19

Noga Alon Michal Feldman Yishay Mansour Sigal Oren Moshe Tennenholtz Dynamics of Evolving Social Groups. 14:1-14:27 2019 7 ACM Trans. Economics and Comput. 3 https://doi.org/10.1145/3355948 db/journals/teco/teco7.html#AlonFMOT19

Noga Alon Boris Bukh Yury Polyanskiy List-Decodable Zero-Rate Codes. 1657-1667 2019 65 IEEE Trans. Inf. Theory 3 https://doi.org/10.1109/TIT.2018.2868957 db/journals/tit/tit65.html#AlonBP19

Noga Alon Shiri Chechik Sarel Cohen Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. 12:1-12:14 2019 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2019.12 conf/icalp/2019 db/conf/icalp/icalp2019.html#AlonCC19 Noga Alon Omri Ben-Eliezer Chong Shangguan Itzhak Tamo The Hat Guessing Number of Graphs. 490-494 2019 ISIT https://doi.org/10.1109/ISIT.2019.8849500 conf/isit/2019 db/conf/isit/isit2019.html#AlonBST19 Raef Bassily Shay Moran Noga Alon Limits of Private Learning with Access to Public Data. 10342-10352 2019 NeurIPS https://proceedings.neurips.cc/paper/2019/hash/9a6a1aaafe73c572b7374828b03a1881-Abstract.html http://papers.nips.cc/paper/9222-limits-of-private-learning-with-access-to-public-data conf/nips/2019 db/conf/nips/nips2019.html#BassilyMA19 Noga Alon Roi Livni Maryanthe Malliaris Shay Moran Private PAC learning implies finite Littlestone dimension. 852-860 2019 STOC https://doi.org/10.1145/3313276.3316312 conf/stoc/2019 db/conf/stoc/stoc2019.html#AlonLMM19

Noga Alon Shiri Chechik Sarel Cohen Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. 2019 abs/1905.07483 CoRR http://arxiv.org/abs/1905.07483 db/journals/corr/corr1905.html#abs-1905-07483

Noga Alon Shirshendu Ganguly Nikhil Srivastava High-girth near-Ramanujan graphs with localized eigenvectors. 2019 abs/1908.03694 CoRR http://arxiv.org/abs/1908.03694 db/journals/corr/corr1908.html#abs-1908-03694

Noga Alon Raef Bassily Shay Moran Limits of Private Learning with Access to Public Data. 2019 abs/1910.11519 CoRR http://arxiv.org/abs/1910.11519 db/journals/corr/corr1910.html#abs-1910-11519

Noga Alon Guy Moshkovitz On Generalized Regularity. 2019 abs/1911.02000 CoRR http://arxiv.org/abs/1911.02000 db/journals/corr/corr1911.html#abs-1911-02000

Noga Alon Uniformly Discrete Forests with Poor Visibility. 442-448 2018 27 Comb. Probab. Comput. 4 https://doi.org/10.1017/S0963548317000505 db/journals/cpc/cpc27.html#Alon18

Ron Aharoni Noga Alon Michal Amir Penny Haxell Dan Hefetz Zilin Jiang Gal Kronenberg Alon Naor Ramsey-nice families of graphs. 29-44 2018 72 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2018.04.007 db/journals/ejc/ejc72.html#AharoniAAHHJKN18

Noga Alon Michael Krivelevich Clique coloring of dense random graphs. 428-433 2018 88 J. Graph Theory 3 https://doi.org/10.1002/jgt.22222 db/journals/jgt/jgt88.html#AlonK18

Slava Bronfman Noga Alon Avinatan Hassidim Assaf Romm Redesigning the Israeli Medical Internship Match. 21:1-21:18 2018 6 ACM Trans. Economics and Comput. 3-4 https://doi.org/10.1145/3274646 https://www.wikidata.org/entity/Q129202154 db/journals/teco/teco6.html#BronfmanAHR18

Noga Alon Mrinal Kumar 0001 Ben Lee Volk Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. 11:1-11:16 2018 CCC https://doi.org/10.4230/LIPIcs.CCC.2018.11 conf/coco/2018 db/conf/coco/coco2018.html#AlonKV18 Noga Alon Yossi Azar Mark Berlin The Price of Bounded Preemption. 301-310 2018 SPAA https://doi.org/10.1145/3210377.3210407 conf/spaa/2018 db/conf/spaa/spaa2018.html#AlonAB18

Noga Alon Roi Livni Maryanthe Malliaris Shay Moran Private PAC learning implies finite Littlestone dimension. 2018 abs/1806.00949 CoRR http://arxiv.org/abs/1806.00949 db/journals/corr/corr1806.html#abs-1806-00949

Noga Alon Igor Balla Lior Gishboliner Adva Mond Frank Mousset The Minrank of Random Graphs over Arbitrary Fields. 2018 abs/1809.01873 CoRR http://arxiv.org/abs/1809.01873 db/journals/corr/corr1809.html#abs-1809-01873

Noga Alon Jonathan D. Cohen 0003 Thomas L. Griffiths 0001 Pasin Manurangsi Daniel Reichman 0001 Igor Shinkar Tal Wagner Alexander Y. Ku Multitasking Capacity: Hardness Results and Improved Constructions. 2018 abs/1809.02835 CoRR http://arxiv.org/abs/1809.02835 db/journals/corr/corr1809.html#abs-1809-02835

Noga Alon Omri Ben-Eliezer Chong Shangguan Itzhak Tamo The hat guessing number of graphs. 2018 abs/1812.09752 CoRR http://arxiv.org/abs/1812.09752 db/journals/corr/corr1812.html#abs-1812-09752

Noga Alon Moran Feldman Moshe Tennenholtz Revenue and Reserve Prices in a Probabilistic Single Item Auction. 1-15 2017 77 Algorithmica 1 https://doi.org/10.1007/s00453-015-0055-1 db/journals/algorithmica/algorithmica77.html#AlonFT17

Noga Alon Tom Bohman Hao Huang 0005 More on the Bipartite Decomposition of Random Graphs. 45-52 2017 84 J. Graph Theory 1 https://doi.org/10.1002/jgt.22010 db/journals/jgt/jgt84.html#AlonBH17

Noga Alon Nicolò Cesa-Bianchi Claudio Gentile Shie Mannor Yishay Mansour Ohad Shamir Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback. 1785-1826 2017 46 SIAM J. Comput. 6 https://doi.org/10.1137/140989455 db/journals/siamcomp/siamcomp46.html#AlonCGMMS17

Noga Alon Guy Rutenberg Broadcast Transmission to Prioritizing Receivers. 2517-2529 2017 31 SIAM J. Discret. Math. 4 https://doi.org/10.1137/16M1098243 db/journals/siamdm/siamdm31.html#AlonR17

Noga Alon Klim Efremenko Benny Sudakov Testing Equality in Communication Graphs. 7569-7574 2017 63 IEEE Trans. Inf. Theory 11 https://doi.org/10.1109/TIT.2017.2744608 db/journals/tit/tit63.html#AlonES17

Noga Alon Jehoshua Bruck Farzad Farnoud Hassanzadeh Siddharth Jain Duplication Distance to the Root for Binary Sequences. 7793-7803 2017 63 IEEE Trans. Inf. Theory 12 https://doi.org/10.1109/TIT.2017.2730864 db/journals/tit/tit63.html#AlonBHJ17

Noga Alon Omri Ben-Eliezer Efficient Removal Lemmas for Matrices. 25:1-25:18 2017 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.25 conf/approx/2017 db/conf/approx/approx2017.html#AlonB17 Noga Alon Bo'az Klartag Optimal Compression of Approximate Inner Products and Dimension Reduction. 639-650 2017 FOCS https://doi.org/10.1109/FOCS.2017.65 https://doi.ieeecomputersociety.org/10.1109/FOCS.2017.65 conf/focs/2017 db/conf/focs/focs2017.html#AlonK17 Noga Alon Omri Ben-Eliezer Eldar Fischer Testing Hereditary Properties of Ordered Graphs and Matrices. 848-858 2017 FOCS https://doi.org/10.1109/FOCS.2017.83 https://doi.ieeecomputersociety.org/10.1109/FOCS.2017.83 conf/focs/2017 db/conf/focs/focs2017.html#AlonBF17 Noga Alon Moshe Babaioff Yannai A. Gonczarowski Yishay Mansour Shay Moran Amir Yehudayoff Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues. 1656-1665 2017 NIPS https://proceedings.neurips.cc/paper/2017/hash/eddb904a6db773755d2857aacadb1cb0-Abstract.html http://papers.nips.cc/paper/6763-submultiplicative-glivenko-cantelli-and-uniform-convergence-of-revenues conf/nips/2017 db/conf/nips/nips2017.html#AlonBGMMY17 Noga Alon Daniel Reichman 0001 Igor Shinkar Tal Wagner Sebastian Musslick Jonathan D. Cohen 0003 Tom Griffiths 0001 Biswadip Dey Kayhan Özcimder A graph-theoretic approach to multitasking. 2100-2109 2017 NIPS https://proceedings.neurips.cc/paper/2017/hash/c850371fda6892fbfd1c5a5b457e5777-Abstract.html http://papers.nips.cc/paper/6805-a-graph-theoretic-approach-to-multitasking conf/nips/2017 db/conf/nips/nips2017.html#Alon0SWMCGDO17 Noga Alon Rajko Nenadov Optimal induced universal graphs for bounded-degree graphs. 1149-1157 2017 SODA https://doi.org/10.1137/1.9781611974782.74 http://dl.acm.org/citation.cfm?id=3039760 https://www.wikidata.org/entity/Q105584136 conf/soda/2017 db/conf/soda/soda2017.html#AlonN17

Noga Alon Omri Ben-Eliezer Eldar Fischer Testing hereditary properties of ordered graphs and matrices. 2017 abs/1704.02367 CoRR http://arxiv.org/abs/1704.02367 db/journals/corr/corr1704.html#AlonBF17

Noga Alon Moshe Babaioff Yannai A. Gonczarowski Yishay Mansour Shay Moran Amir Yehudayoff Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues. 2017 abs/1705.08430 CoRR http://arxiv.org/abs/1705.08430 db/journals/corr/corr1705.html#AlonBGMMY17

Noga Alon Jørgen Bang-Jensen Stéphane Bessy Out-colourings of Digraphs. 2017 abs/1706.06441 CoRR http://arxiv.org/abs/1706.06441 db/journals/corr/corr1706.html#AlonBB17

Noga Alon Boris Bukh Yury Polyanskiy List-decodable zero-rate codes. 2017 abs/1710.10663 CoRR http://arxiv.org/abs/1710.10663 db/journals/corr/corr1710.html#abs-1710-10663

Noga Alon Omri Ben-Eliezer Eldar Fischer Testing hereditary properties of ordered graphs and matrices. TR17-058 2017 TR17 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2017/058 db/journals/eccc/eccc24.html#AlonBF17

Noga Alon Rani Hod Amit Weinstein On Active and Passive Testing. 1-20 2016 25 Comb. Probab. Comput. 1 https://doi.org/10.1017/S0963548315000292 db/journals/cpc/cpc25.html#AlonHW16

Noga Alon Omri Ben-Eliezer Local and global colorability of graphs. 428-442 2016 339 Discret. Math. 2 https://doi.org/10.1016/j.disc.2015.09.006 db/journals/dm/dm339.html#AlonB16

Noga Alon Clara Shikhelman Many T copies in H-free graphs. 146-172 2016 121 J. Comb. Theory B https://doi.org/10.1016/j.jctb.2016.03.004 db/journals/jct/jctb121.html#AlonS16

Noga Alon High girth augmented trees are huge. 7-15 2016 144 J. Comb. Theory A https://doi.org/10.1016/j.jcta.2016.06.004 db/journals/jct/jcta144.html#Alon16

Ron Aharoni Noga Alon Eli Berger Eigenvalues of K1, k-Free Graphs and the Connectivity of Their Independence Complexes. 384-391 2016 83 J. Graph Theory 4 https://doi.org/10.1002/jgt.22004 db/journals/jgt/jgt83.html#AharoniAB16

Noga Alon Humberto Naves Benny Sudakov On the Maximum Quartet Distance between Phylogenetic Trees. 718-735 2016 30 SIAM J. Discret. Math. 2 https://doi.org/10.1137/15M1041754 db/journals/siamdm/siamdm30.html#AlonNS16

Emmanuel Abbe Noga Alon Afonso S. Bandeira Colin Sandon Linear Boolean Classification, Coding and the Critical Problem. 1667-1673 2016 62 IEEE Trans. Inf. Theory 4 https://doi.org/10.1109/TIT.2016.2531085 db/journals/tit/tit62.html#AbbeABS16

Noga Alon Shay Moran Amir Yehudayoff Sign rank versus VC dimension. 47-80 2016 COLT http://proceedings.mlr.press/v49/alon16.html conf/colt/2016 db/conf/colt/colt2016.html#AlonMY16 Noga Alon Jehoshua Bruck Farzad Farnoud Siddharth Jain On the duplication distance of binary strings. 260-264 2016 ISIT https://doi.org/10.1109/ISIT.2016.7541301 conf/isit/2016 db/conf/isit/isit2016.html#AlonBFJ16 Noga Alon Mark Braverman Klim Efremenko Ran Gelles Bernhard Haeupler Reliable Communication over Highly Connected Noisy Networks. 165-173 2016 PODC https://doi.org/10.1145/2933057.2933085 conf/podc/2016 db/conf/podc/podc2016.html#AlonBEGH16 Noga Alon Michal Feldman Yishay Mansour Sigal Oren Moshe Tennenholtz Dynamics of Evolving Social Groups. 637-654 2016 EC https://doi.org/10.1145/2940716.2940744 conf/sigecom/2016 db/conf/sigecom/sigecom2016.html#AlonFMOT16 Noga Alon Humberto Naves Benny Sudakov On the maximum quartet distance between phylogenetic trees. 2095-2106 2016 SODA https://doi.org/10.1137/1.9781611974331.ch146 http://dl.acm.org/citation.cfm?id=2884581 conf/soda/2016 db/conf/soda/soda2016.html#AlonNS16 Noga Alon Raphael Yuster Uri Zwick Color Coding. 335-338 2016 Encyclopedia of Algorithms https://doi.org/10.1007/978-1-4939-2864-4_76 db/reference/algo/algo2016.html#AlonYZ16

Noga Alon Michal Feldman Yishay Mansour Sigal Oren Moshe Tennenholtz Dynamics of Evolving Social Groups. 2016 abs/1605.09548 CoRR http://arxiv.org/abs/1605.09548 db/journals/corr/corr1605.html#AlonFMOT16

Noga Alon Omri Ben-Eliezer Removal Lemmas for Matrices. 2016 abs/1609.04235 CoRR http://arxiv.org/abs/1609.04235 db/journals/corr/corr1609.html#AlonB16

Noga Alon Jehoshua Bruck Farzad Farnoud Siddharth Jain Duplication Distance to the Root for Binary Sequences. 2016 abs/1611.05537 CoRR http://arxiv.org/abs/1611.05537 db/journals/corr/corr1611.html#AlonBFJ16

Noga Alon Klim Efremenko Benny Sudakov Testing Equality in Communication Graphs. TR16-086 2016 TR16 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2016/086 db/journals/eccc/eccc23.html#AlonES16

Noga Alon Amit Weinstein Local Correction with Constant Error Rate. 496-516 2015 71 Algorithmica 2 https://doi.org/10.1007/s00453-013-9817-9 db/journals/algorithmica/algorithmica71.html#AlonW15

Noga Alon Gil Cohen On Rigid Matrices and U-Polynomials. 851-879 2015 24 Comput. Complex. 4 https://doi.org/10.1007/s00037-015-0112-9 db/journals/cc/cc24.html#AlonC15

Jonathan Berant Noga Alon Ido Dagan Jacob Goldberger Efficient Global Learning of Entailment Graphs. 249-291 2015 41 Comput. Linguistics 2 https://doi.org/10.1162/COLI_a_00220 db/journals/coling/coling41.html#BerantADG15

Noga Alon Ohad N. Feldheim Drawing outerplanar graphs using three edge lengths. 260-267 2015 48 Comput. Geom. 3 https://doi.org/10.1016/j.comgeo.2014.10.006 db/journals/comgeo/comgeo48.html#AlonF15

Noga Alon Jacob Fox Easily Testable Graph Properties. 646-657 2015 24 Comb. Probab. Comput. 4 https://doi.org/10.1017/S0963548314000765 https://www.wikidata.org/entity/Q105585016 db/journals/cpc/cpc24.html#AlonF15

Noga Alon Clara Shikhelman Many T copies in H-free graphs. 683-689 2015 49 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2015.06.092 db/journals/endm/endm49.html#AlonS15

Noga Alon Size and Degree Anti-Ramsey Numbers. 1833-1839 2015 31 Graphs Comb. 6 https://doi.org/10.1007/s00373-015-1583-9 db/journals/gc/gc31.html#Alon15

Noga Alon Hagit Attiya Shlomi Dolev Swan Dubois Maria Potop-Butucaru Sébastien Tixeuil Practically stabilizing SWMR atomic memory in message-passing systems. 692-701 2015 81 J. Comput. Syst. Sci. 4 https://doi.org/10.1016/j.jcss.2014.11.014 https://www.wikidata.org/entity/Q56806110 db/journals/jcss/jcss81.html#AlonADDPT15

Noga Alon Bipartite decomposition of random graphs. 220-235 2015 113 J. Comb. Theory B https://doi.org/10.1016/j.jctb.2015.03.001 db/journals/jct/jctb113.html#Alon15

Noga Alon Shagnik Das Roman Glebov Benny Sudakov Comparable pairs in families of sets. 164-185 2015 115 J. Comb. Theory B https://doi.org/10.1016/j.jctb.2015.05.009 db/journals/jct/jctb115.html#AlonDGS15

Noga Alon Abbas Mehrabian Chasing a Fast Robber on Planar Graphs and Random Graphs. 81-96 2015 78 J. Graph Theory 2 https://doi.org/10.1002/jgt.21791 db/journals/jgt/jgt78.html#AlonM15

Noga Alon Manu Basavaraju L. Sunil Chandran Rogers Mathew Deepak Rajendraprasad Separation Dimension of Bounded Degree Graphs. 59-64 2015 29 SIAM J. Discret. Math. 1 https://doi.org/10.1137/140973013 db/journals/siamdm/siamdm29.html#AlonBCMR15

Noga Alon Robert Bredereck Jiehua Chen 0001 Stefan Kratsch Rolf Niedermeier Gerhard J. Woeginger How to Put Through Your Agenda in Collective Binary Decisions. 5:1-5:28 2015 4 ACM Trans. Economics and Comput. 1 https://doi.org/10.1145/2837467 https://www.wikidata.org/entity/Q130957556 db/journals/teco/teco4.html#AlonBCKNW15

Noga Alon Nicolò Cesa-Bianchi Ofer Dekel Tomer Koren Online Learning with Feedback Graphs: Beyond Bandits. 23-35 2015 COLT http://proceedings.mlr.press/v40/Alon15.html conf/colt/2015 db/conf/colt/colt2015.html#AlonCDK15 Noga Alon Noam Nisan Ran Raz Omri Weinstein Welfare Maximization with Limited Interaction. 1499-1512 2015 FOCS https://doi.org/10.1109/FOCS.2015.95 https://doi.ieeecomputersociety.org/10.1109/FOCS.2015.95 conf/focs/2015 db/conf/focs/focs2015.html#AlonNRW15 Noga Alon Michal Feldman Omer Lev Moshe Tennenholtz How Robust Is the Wisdom of the Crowds? 2055-2061 2015 IJCAI http://ijcai.org/Abstract/15/291 conf/ijcai/2015 db/conf/ijcai/ijcai2015.html#AlonFLT15 Slava Bronfman Noga Alon Avinatan Hassidim Assaf Romm Redesigning the Israeli Medical Internship Match. 753-754 2015 EC https://doi.org/10.1145/2764468.2764534 conf/sigecom/2015 db/conf/sigecom/sigecom2015.html#BronfmanAHR15

Noga Alon Nicolò Cesa-Bianchi Ofer Dekel Tomer Koren Online Learning with Feedback Graphs: Beyond Bandits. 2015 abs/1502.07617 CoRR http://arxiv.org/abs/1502.07617 db/journals/corr/corr1502.html#AlonCDK15

Noga Alon Noam Nisan Ran Raz Omri Weinstein Welfare Maximization with Limited Interaction. 2015 abs/1504.01780 CoRR http://arxiv.org/abs/1504.01780 db/journals/corr/corr1504.html#AlonNRW15

Noga Alon Humberto Naves Benny Sudakov On the maximum quartet distance between phylogenetic trees. 2015 abs/1505.04344 CoRR http://arxiv.org/abs/1505.04344 db/journals/corr/corr1505.html#AlonNS15

Noga Alon Elchanan Mossel Robin Pemantle Corruption Detection on Networks. 2015 abs/1505.05637 CoRR http://arxiv.org/abs/1505.05637 db/journals/corr/corr1505.html#AlonMP15

Noga Alon Mark Braverman Klim Efremenko Ran Gelles Bernhard Haeupler Reliable Communication over Highly Connected Noisy Networks. TR15-014 2015 TR15 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2015/014 db/journals/eccc/eccc22.html#AlonBEGH15

Noga Alon Noam Nisan Ran Raz Omri Weinstein Welfare Maximization with Limited Interaction. TR15-054 2015 TR15 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2015/054 db/journals/eccc/eccc22.html#AlonNRW15

Noga Alon Pawel Pralat Chasing robbers on random geometric graphs - An alternative approach. 149-152 2014 178 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2014.06.004 db/journals/dam/dam178.html#AlonP14

Noga Alon Andrey Kupavskii Two notions of unit distance graphs. 1-17 2014 125 J. Comb. Theory A https://doi.org/10.1016/j.jcta.2014.02.006 db/journals/jct/jcta125.html#AlonK14

Noga Alon Harout K. Aydinian Hao Huang 0005 Maximizing the Number of Nonnegative Subsets. 811-816 2014 28 SIAM J. Discret. Math. 2 https://doi.org/10.1137/130947295 db/journals/siamdm/siamdm28.html#AlonAH14

Noga Alon Sagi Snir Raphael Yuster On the Compatibility of Quartet Trees. 1493-1507 2014 28 SIAM J. Discret. Math. 3 https://doi.org/10.1137/130941043 db/journals/siamdm/siamdm28.html#AlonSY14

Noga Alon Erik D. Demaine MohammadTaghi Hajiaghayi Panagiotis Kanellopoulos Tom Leighton Correction: Basic Network Creation Games. 1638-1640 2014 28 SIAM J. Discret. Math. 3 https://doi.org/10.1137/140955343 db/journals/siamdm/siamdm28.html#AlonDHKL14

Noga Alon Troy Lee Adi Shraibman The Cover Number of a Matrix and its Algorithmic Applications. 34-47 2014 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.34 conf/approx/2014 db/conf/approx/approx2014.html#AlonLS14 Emmanuel Abbe Noga Alon Afonso S. Bandeira Linear Boolean classification, coding and "the critical problem". 1231-1235 2014 ISIT https://doi.org/10.1109/ISIT.2014.6875029 conf/isit/2014 db/conf/isit/isit2014.html#AbbeAB14 Noga Alon Sagi Snir Raphael Yuster On the compatibility of quartet trees. 535-545 2014 SODA https://doi.org/10.1137/1.9781611973402.40 conf/soda/2014 db/conf/soda/soda2014.html#AlonSY14 Noga Alon Mohsen Ghaffari 0001 Bernhard Haeupler Majid Khabbazian Broadcast Throughput in Radio Networks: Routing vs. Network Coding. 1831-1843 2014 SODA https://doi.org/10.1137/1.9781611973402.132 conf/soda/2014 db/conf/soda/soda2014.html#AlonGHK14

Emmanuel Abbe Noga Alon Afonso S. Bandeira Linear Boolean classification, coding and "the critical problem". 2014 abs/1401.6528 CoRR http://arxiv.org/abs/1401.6528 db/journals/corr/corr1401.html#AbbeAB14

Noga Alon Manu Basavaraju L. Sunil Chandran Rogers Mathew Deepak Rajendraprasad Separation dimension of bounded degree graphs. 2014 abs/1407.5075 CoRR http://arxiv.org/abs/1407.5075 db/journals/corr/corr1407.html#AlonBCMR14

Noga Alon Nicolò Cesa-Bianchi Claudio Gentile Shie Mannor Yishay Mansour Ohad Shamir Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback. 2014 abs/1409.8428 CoRR http://arxiv.org/abs/1409.8428 db/journals/corr/corr1409.html#AlonCGMMS14

Noga Alon Shay Moran Amir Yehudayoff Sign rank, VC dimension and spectral gaps. TR14-135 2014 TR14 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2014/135 db/journals/eccc/eccc21.html#AlonMY14

Noga Alon Amir Shpilka Christopher Umans On sunflowers and matrix multiplication. 219-243 2013 22 Comput. Complex. 2 https://doi.org/10.1007/s00037-013-0060-1 db/journals/cc/cc22.html#AlonSU13

Yehuda Afek Noga Alon Ziv Bar-Joseph Alejandro Cornejo Bernhard Haeupler Fabian Kuhn Beeping a maximal independent set. 195-208 2013 26 Distributed Comput. 4 https://doi.org/10.1007/s00446-012-0175-7 https://www.wikidata.org/entity/Q57203501 db/journals/dc/dc26.html#AfekABCHK13

Noga Alon The chromatic number of random Cayley graphs. 1232-1243 2013 34 Eur. J. Comb. 8 https://doi.org/10.1016/j.ejc.2013.05.007 db/journals/ejc/ejc34.html#Alon13

Noga Alon Restricted Integer Partition Functions. A16 2013 13 Integers http://math.colgate.edu/~integers/n16/n16.Abstract.html db/journals/int/int13.html#Alon13

Noga Alon Raphael Yuster Matrix sparsification and nested dissection over arbitrary fields. 25:1-25:18 2013 60 J. ACM 4 https://doi.org/10.1145/2508028.2505989 db/journals/jacm/jacm60.html#AlonY13

Noga Alon Raphael Yuster The Turán number of sparse spanning graphs. 337-343 2013 103 J. Comb. Theory B 3 https://doi.org/10.1016/j.jctb.2013.02.002 db/journals/jct/jctb103.html#AlonY13

Noga Alon A Note on Degenerate and Spectrally Degenerate Graphs. 1-6 2013 72 J. Graph Theory 1 https://doi.org/10.1002/jgt.21627 db/journals/jgt/jgt72.html#Alon13

Noga Alon Eric Blais Sourav Chakraborty 0001 David García-Soriano Arie Matsliah Nearly Tight Bounds for Testing Function Isomorphism. 459-493 2013 42 SIAM J. Comput. 2 https://doi.org/10.1137/110832677 db/journals/siamcomp/siamcomp42.html#AlonBCGM13

Noga Alon Yuval Emek Michal Feldman Moshe Tennenholtz Adversarial Leakage in Games. 363-385 2013 27 SIAM J. Discret. Math. 1 https://doi.org/10.1137/110858021 db/journals/siamdm/siamdm27.html#AlonEFT13

Noga Alon Minimizing the Number of Carries in Addition. 562-566 2013 27 SIAM J. Discret. Math. 1 https://doi.org/10.1137/120890612 db/journals/siamdm/siamdm27.html#Alon13

Noga Alon Erik D. Demaine Mohammad Taghi Hajiaghayi Tom Leighton Basic Network Creation Games. 656-668 2013 27 SIAM J. Discret. Math. 2 https://doi.org/10.1137/090771478 db/journals/siamdm/siamdm27.html#AlonDHL13

Noga Alon Shachar Lovett Almost k-Wise vs. k-Wise Independent Permutations, and Uniformity for General Group Actions. 559-577 2013 9 Theory Comput. https://doi.org/10.4086/toc.2013.v009a015 db/journals/toc/toc9.html#AlonL13

Noga Alon Dvir Falik Reshef Meir Moshe Tennenholtz Bundling Attacks in Judgment Aggregation. 2013 AAAI https://doi.org/10.1609/aaai.v27i1.8611 https://www.wikidata.org/entity/Q126175215 conf/aaai/2013 db/conf/aaai/aaai2013.html#AlonFMT13 39-45 Noga Alon Reshef Meir Moshe Tennenholtz The Value of Ignorance about the Number of Players. 2013 AAAI (Late-Breaking Developments) http://www.aaai.org/ocs/index.php/WS/AAAIW13/paper/view/7033 conf/aaai/2013late db/conf/aaai/late2013.html#AlonMT13 Noga Alon Robert Bredereck Jiehua Chen 0001 Stefan Kratsch Rolf Niedermeier Gerhard J. Woeginger How to Put through Your Agenda in Collective Binary Decisions. 30-44 2013 ADT https://doi.org/10.1007/978-3-642-41575-3_3 conf/aldt/2013 db/conf/aldt/adt2013.html#AlonBCKNW13 Noga Alon Gil Cohen On Rigid Matrices and U-polynomials. 197-206 2013 CCC https://doi.org/10.1109/CCC.2013.28 https://doi.ieeecomputersociety.org/10.1109/CCC.2013.28 conf/coco/2013 db/conf/coco/coco2013.html#AlonC13 Noga Alon Nicolò Cesa-Bianchi Claudio Gentile Yishay Mansour From Bandits to Experts: A Tale of Domination and Independence. 1610-1618 2013 NIPS https://proceedings.neurips.cc/paper/2013/hash/9e3cfc48eccf81a0d57663e129aef3cb-Abstract.html http://papers.nips.cc/paper/4908-from-bandits-to-experts-a-tale-of-domination-and-independence conf/nips/2013 db/conf/nips/nips2013.html#AlonCGM13 Noga Alon Yishay Mansour Moshe Tennenholtz Differential pricing with inequity aversion in social networks. 9-24 2013 EC https://doi.org/10.1145/2492002.2482545 https://www.wikidata.org/entity/Q106376692 conf/sigecom/2013 db/conf/sigecom/sigecom2013.html#AlonMT13 Noga Alon Troy Lee Adi Shraibman Santosh S. Vempala The approximate rank of a matrix and its algorithmic applications: approximate rank. 675-684 2013 STOC https://doi.org/10.1145/2488608.2488694 conf/stoc/2013 db/conf/stoc/stoc2013.html#AlonLSV13 Noga Alon Michal Feldman Iftah Gamzu Moshe Tennenholtz The Asymmetric Matrix Partition Problem. 1-14 2013 WINE https://doi.org/10.1007/978-3-642-45046-4_1 conf/wine/2013 db/conf/wine/wine2013.html#AlonFGT13 Noga Alon Neighborly Families of Boxes and Bipartite Coverings. 15-20 2013 The Mathematics of Paul Erdős II https://doi.org/10.1007/978-1-4614-7254-4_2 books/daglib/0038064 db/books/collections/GNB2013a.html#Alon13

Noga Alon Andrey Kupavskii Two notions of unit distance graphs. 2013 abs/1306.3916 CoRR http://arxiv.org/abs/1306.3916 db/journals/corr/corr1306.html#abs-1306-3916

Noga Alon Nicolò Cesa-Bianchi Claudio Gentile Yishay Mansour From Bandits to Experts: A Tale of Domination and Independence. 2013 CoRR http://arxiv.org/abs/1307.4564 abs/1307.4564 db/journals/corr/corr1307.html#AlonCGM13

Noga Alon Rani Hod Amit Weinstein On active and passive testing. 2013 CoRR http://arxiv.org/abs/1307.7364 abs/1307.7364 db/journals/corr/corr1307.html#AlonHW13

Noga Alon Keith E. Mellinger Dhruv Mubayi Jacques Verstraëte The de Bruijn-Erdős theorem for hypergraphs. 233-245 2012 65 Des. Codes Cryptogr. 3 https://doi.org/10.1007/s10623-011-9555-4 db/journals/dcc/dcc65.html#AlonMMV12

Noga Alon A Non-linear Lower Bound for Planar Epsilon-nets. 235-244 2012 47 Discret. Comput. Geom. 2 https://doi.org/10.1007/s00454-010-9323-7 db/journals/dcg/dcg47.html#Alon12

Noga Alon Alexandr V. Kostochka Dense uniform hypergraphs have high list chromatic number. 2119-2125 2012 312 Discret. Math. 14 https://doi.org/10.1016/j.disc.2011.05.013 db/journals/dm/dm312.html#AlonK12

Noga Alon Amit Weinstein Local correction of juntas. 223-226 2012 112 Inf. Process. Lett. 6 https://doi.org/10.1016/j.ipl.2011.12.005 db/journals/ipl/ipl112.html#AlonW12

Noga Alon Hao Huang 0005 Benny Sudakov Nonnegative k-sums, fractional covers, and probability of small deviations. 784-796 2012 102 J. Comb. Theory B 3 https://doi.org/10.1016/j.jctb.2011.12.002 https://www.wikidata.org/entity/Q105583653 db/journals/jct/jctb102.html#AlonHS12

Noga Alon Peter Frankl Hao Huang 0005 Vojtech Rödl Andrzej Rucinski 0001 Benny Sudakov Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. 1200-1215 2012 119 J. Comb. Theory A 6 https://doi.org/10.1016/j.jcta.2012.02.004 https://www.wikidata.org/entity/Q105583655 db/journals/jct/jcta119.html#AlonFHRRS12

Noga Alon Yuval Emek Michal Feldman Moshe Tennenholtz Bayesian ignorance. 1-11 2012 452 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.05.017 db/journals/tcs/tcs452.html#AlonEFT12

Noga Alon Shachar Lovett Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions. 350-361 2012 APPROX-RANDOM https://doi.org/10.1007/978-3-642-32512-0_30 conf/approx/2012 db/conf/approx/approx2012.html#AlonL12 Noga Alon Amir Shpilka Christopher Umans On Sunflowers and Matrix Multiplication. 214-223 2012 CCC https://doi.org/10.1109/CCC.2012.26 https://doi.ieeecomputersociety.org/10.1109/CCC.2012.26 conf/coco/2012 db/conf/coco/coco2012.html#AlonSU12 Noga Alon Moshe Babaioff Ron Karidi Ron Lavi Moshe Tennenholtz Sequential voting with externalities: herding in social networks. 36 2012 EC https://doi.org/10.1145/2229012.2229019 conf/sigecom/2012 db/conf/sigecom/sigecom2012.html#AlonBKLT12 Noga Alon Ronitt Rubinfeld Shai Vardi Ning Xie 0002 Space-efficient local computation algorithms. 1132-1139 2012 SODA https://doi.org/10.1137/1.9781611973099.89 https://dl.acm.org/citation.cfm?id=2095205 conf/soda/2012 db/conf/soda/soda2012.html#AlonRVX12 Noga Alon Ankur Moitra Benny Sudakov Nearly complete graphs decomposable into large induced matchings and their applications. 1079-1090 2012 STOC https://doi.org/10.1145/2213977.2214074 conf/stoc/2012 db/conf/stoc/stoc2012.html#AlonMS12 Noga Alon Iftah Gamzu Moshe Tennenholtz Optimizing budget allocation among channels and influencers. 381-388 2012 WWW https://doi.org/10.1145/2187836.2187888 conf/www/2012 db/conf/www/www2012.html#AlonGT12

Yehuda Afek Noga Alon Ziv Bar-Joseph Alejandro Cornejo Bernhard Haeupler Fabian Kuhn Beeping a Maximal Independent Set http://arxiv.org/abs/1206.0150 2012 CoRR abs/1206.0150 db/journals/corr/corr1206.html#abs-1206-0150

Noga Alon Amit Weinstein Local Correction with Constant Error Rate http://arxiv.org/abs/1210.5677 2012 CoRR abs/1210.5677 db/journals/corr/corr1210.html#abs-1210-5677

Noga Alon Gil Cohen On Rigid Matrices and Subspace Polynomials. TR12-133 2012 TR12 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2012/133 db/journals/eccc/eccc19.html#AlonC12

Noga Alon Santosh S. Vempala The Approximate Rank of a Matrix and its Algorithmic Applications. TR12-169 2012 TR12 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2012/169 db/journals/eccc/eccc19.html#AlonV12

Noga Alon Gregory Z. Gutin Eun Jung Kim 0002 Stefan Szeider Anders Yeo Solving MAX-r-SAT Above a Tight Lower Bound. 638-655 2011 61 Algorithmica 3 https://doi.org/10.1007/s00453-010-9428-7 db/journals/algorithmica/algorithmica61.html#AlonGKSY11

Noga Alon Simi Haber Michael Krivelevich The Number of f-Matchings in Almost Every Tree is a Zero Residue. 2011 18 Electron. J. Comb. 1 https://doi.org/10.37236/517 db/journals/combinatorics/combinatorics18.html#AlonHK11

Noga Alon Abbas Mehrabian On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game. 2011 18 Electron. J. Comb. 1 https://doi.org/10.37236/506 https://www.wikidata.org/entity/Q123344493 db/journals/combinatorics/combinatorics18.html#AlonM11

Noga Alon Pawel Pralat Modular Orientations of Random and Quasi-Random Regular Graphs. 321-329 2011 20 Comb. Probab. Comput. 3 https://doi.org/10.1017/S0963548310000544 db/journals/cpc/cpc20.html#AlonP11

Noga Alon Chen Avin Michal Koucký 0001 Gady Kozma Zvi Lotker Mark R. Tuttle Many Random Walks Are Faster Than One. 481-502 2011 20 Comb. Probab. Comput. 4 https://doi.org/10.1017/S0963548311000125 db/journals/cpc/cpc20.html#AlonAKKLT11

Noga Alon József Balogh Béla Bollobás Robert Morris 0001 The structure of almost all graphs in a hereditary property. 85-110 2011 101 J. Comb. Theory B 2 https://doi.org/10.1016/j.jctb.2010.10.001 db/journals/jct/jctb101.html#AlonBBM11

Noga Alon H. Tracy Hall Christian Knauer Rom Pinchasi Raphael Yuster On graphs and algebraic graphs that do not contain cycles of length 4. 91-102 2011 68 J. Graph Theory 2 https://doi.org/10.1002/jgt.20542 db/journals/jgt/jgt68.html#AlonHKPY11

Noga Alon Alexandr V. Kostochka Hypergraph list coloring and Euclidean Ramsey theory. 377-390 2011 39 Random Struct. Algorithms 3 https://doi.org/10.1002/rsa.20361 db/journals/rsa/rsa39.html#AlonK11

Noga Alon Dániel Marx Sparse Balanced Partitions and the Complexity of Subgraph Problems. 631-644 2011 25 SIAM J. Discret. Math. 2 https://doi.org/10.1137/100812653 db/journals/siamdm/siamdm25.html#AlonM11

Noga Alon List coloring and Euclidean Ramsey Theory. 2011 CCCG http://www.cccg.ca/proceedings/2011/papers/invited2.pdf conf/cccg/2011 db/conf/cccg/cccg2011.html#Alon11 Noga Alon Yuval Emek Michal Feldman Moshe Tennenholtz Economical Graph Discovery. 476-486 2011 ICS http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/29.html conf/innovations/2011 db/conf/innovations/innovations2011.html#AlonEFT11 Noga Alon Hagit Attiya Shlomi Dolev Swan Dubois Maria Potop-Butucaru Sébastien Tixeuil Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems. 19-31 2011 SSS https://doi.org/10.1007/978-3-642-24550-3_4 conf/sss/2011 db/conf/sss/sss2011.html#AlonADDPT11 Noga Alon Felix A. Fischer Ariel D. Procaccia Moshe Tennenholtz Sum of us: strategyproof selection from the selectors. 101-110 2011 TARK https://doi.org/10.1145/2000378.2000390 conf/tark/2011 db/conf/tark/tark2011.html#AlonFPT11 Yehuda Afek Noga Alon Ziv Bar-Joseph Alejandro Cornejo Bernhard Haeupler Fabian Kuhn Beeping a Maximal Independent Set. 32-50 2011 DISC https://doi.org/10.1007/978-3-642-24100-0_3 https://www.wikidata.org/entity/Q57203511 conf/wdag/2011 db/conf/wdag/disc2011.html#AfekABCHK11

Yehuda Afek Noga Alon Ziv Bar-Joseph MIS on the fly http://arxiv.org/abs/1106.2126 2011 CoRR abs/1106.2126 db/journals/corr/corr1106.html#abs-1106-2126

Noga Alon Amit Weinstein Local Correction of Boolean Functions http://arxiv.org/abs/1109.3639 2011 CoRR abs/1109.3639 db/journals/corr/corr1109.html#abs-1109-3639

Noga Alon Ronitt Rubinfeld Shai Vardi Ning Xie 0002 Space-efficient Local Computation Algorithms http://arxiv.org/abs/1109.6178 2011 CoRR abs/1109.6178 db/journals/corr/corr1109.html#abs-1109-6178

Noga Alon Jacob Fox Testing perfection is hard http://arxiv.org/abs/1110.2828 2011 CoRR abs/1110.2828 db/journals/corr/corr1110.html#abs-1110-2828

Noga Alon Ankur Moitra Benny Sudakov Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications http://arxiv.org/abs/1111.0253 2011 CoRR abs/1111.0253 db/journals/corr/corr1111.html#abs-1111-0253

Noga Alon Shachar Lovett Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions. TR11-049 2011 TR11 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2011/049 db/journals/eccc/eccc18.html#AlonL11

Noga Alon Amir Shpilka Christopher Umans On Sunflowers and Matrix Multiplication. TR11-067 2011 TR11 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2011/067 db/journals/eccc/eccc18.html#AlonSU11

Noga Alon Ehsan Chiniforooshan Vasek Chvátal François Genest Another Abstraction of the Erdös-Szekeres Happy End Theorem. 2010 17 Electron. J. Comb. 1 https://doi.org/10.37236/460 db/journals/combinatorics/combinatorics17.html#AlonCCG10

Noga Alon Dan Hefetz Michael Krivelevich Playing to Retain the Advantage. 481-491 2010 19 Comb. Probab. Comput. 4 https://doi.org/10.1017/S0963548310000064 db/journals/cpc/cpc19.html#AlonHK10

Noga Alon Béla Bollobás Introduction. 641 2010 19 Comb. Probab. Comput. 5-6 https://doi.org/10.1017/S0963548310000362 db/journals/cpc/cpc19.html#AlonB10

Noga Alon Michal Feldman Ariel D. Procaccia Moshe Tennenholtz Walking in circles. 3432-3435 2010 310 Discret. Math. 23 https://doi.org/10.1016/j.disc.2010.08.007 db/journals/dm/dm310.html#AlonFPT10

Noga Alon Michal Feldman Ariel D. Procaccia Moshe Tennenholtz A note on competitive diffusion through social networks. 221-225 2010 110 Inf. Process. Lett. 6 https://doi.org/10.1016/j.ipl.2009.12.009 db/journals/ipl/ipl110.html#AlonFPT10

Noga Alon Sonny Ben-Shimon Michael Krivelevich A note on regular Ramsey graphs. 244-249 2010 64 J. Graph Theory 3 https://doi.org/10.1002/jgt.20453 db/journals/jgt/jgt64.html#AlonBK10

Noga Alon Michal Feldman Ariel D. Procaccia Moshe Tennenholtz Strategyproof Approximation of the Minimax on Networks. 513-526 2010 35 Math. Oper. Res. 3 https://doi.org/10.1287/moor.1100.0457 db/journals/mor/mor35.html#AlonFPT10

Noga Alon Paul H. Edelman The inverse Banzhaf problem. 371-377 2010 34 Soc. Choice Welf. 3 https://doi.org/10.1007/s00355-009-0402-8 db/journals/scw/scw34.html#AlonE10

Noga Alon Amin Coja-Oghlan Hiêp Hàn Mihyun Kang Vojtech Rödl Mathias Schacht Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. 2336-2362 2010 39 SIAM J. Comput. 6 https://doi.org/10.1137/070709529 https://www.wikidata.org/entity/Q105584148 db/journals/siamcomp/siamcomp39.html#AlonCHKRS10

Noga Alon Ohad N. Feldheim The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus. 892-894 2010 24 SIAM J. Discret. Math. 3 https://doi.org/10.1137/100789671 db/journals/siamdm/siamdm24.html#AlonF10

Noga Alon Shai Gutner Balanced families of perfect hash functions and their applications. 2010 6 ACM Trans. Algorithms 3 https://doi.org/10.1145/1798596.1798607 db/journals/talg/talg6.html#AlonG10 54:1-54:12

Noga Alon Benny Chor Fabio Pardi Anat Rapoport Approximate Maximum Parsimony and Ancestral Maximum Likelihood. 183-187 2010 7 IEEE ACM Trans. Comput. Biol. Bioinform. 1 https://doi.org/10.1109/TCBB.2008.13 https://doi.ieeecomputersociety.org/10.1109/TCBB.2008.13 https://dl.acm.org/doi/10.1109/TCBB.2008.13 https://www.wikidata.org/entity/Q43762875 db/journals/tcbb/tcbb7.html#AlonCPR10

Noga Alon Simon Litsyn Alexander Shpunt Typical peak sidelobe level of binary sequences. 545-554 2010 56 IEEE Trans. Inf. Theory 1 https://doi.org/10.1109/TIT.2009.2034803 db/journals/tit/tit56.html#AlonLS10

Noga Alon Eric Blais Testing Boolean Function Isomorphism. 394-405 2010 APPROX-RANDOM https://doi.org/10.1007/978-3-642-15369-3_30 conf/approx/2010 db/conf/approx/approx2010.html#AlonB10 Noga Alon Voting Paradoxes. 27 2010 COLT http://colt2010.haifa.il.ibm.com/papers/COLT2010proceedings.pdf#page=35 conf/colt/2010 db/conf/colt/colt2010.html#Alon10 Noga Alon Raphael Yuster Solving Linear Systems through Nested Dissection. 225-234 2010 FOCS https://doi.org/10.1109/FOCS.2010.28 https://doi.ieeecomputersociety.org/10.1109/FOCS.2010.28 conf/focs/2010 db/conf/focs/focs2010.html#AlonY10 Noga Alon A Non-linear Lower Bound for Planar Epsilon-Nets. 341-346 2010 FOCS https://doi.org/10.1109/FOCS.2010.39 https://doi.ieeecomputersociety.org/10.1109/FOCS.2010.39 conf/focs/2010 db/conf/focs/focs2010.html#Alon10 Noga Alon Yuval Emek Michal Feldman Moshe Tennenholtz Adversarial Leakage in Games. 111-119 2010 ICS http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/10.html conf/innovations/2010 db/conf/innovations/innovations2010.html#AlonEFT10 Noga Alon Yuval Emek Michal Feldman Moshe Tennenholtz Bayesian ignorance. 384-391 2010 PODC https://doi.org/10.1145/1835698.1835785 conf/podc/2010 db/conf/podc/podc2010.html#AlonEFT10 Noga Alon Gregory Z. Gutin Eun Jung Kim 0002 Stefan Szeider Anders Yeo Solving MAX-r-SAT Above a Tight Lower Bound. 511-517 2010 SODA https://doi.org/10.1137/1.9781611973075.44 conf/soda/2010 db/conf/soda/soda2010.html#AlonGKSY10 Noga Alon Erik D. Demaine MohammadTaghi Hajiaghayi Tom Leighton Basic network creation games. 106-113 2010 SPAA https://doi.org/10.1145/1810479.1810502 conf/spaa/2010 db/conf/spaa/spaa2010.html#AlonDHL10 Noga Alon Hagit Attiya Shlomi Dolev Swan Dubois Maria Gradinariu Sébastien Tixeuil Brief Announcement: Sharing Memory in a Self-stabilizing Manner. 525-527 2010 DISC https://doi.org/10.1007/978-3-642-15763-9_49 conf/wdag/2010 db/conf/wdag/disc2010.html#AlonADDGT10 Noga Alon On Constant Time Approximation of Parameters of Bounded Degree Graphs. 234-239 2010 Property Testing https://doi.org/10.1007/978-3-642-16367-8_14 conf/propertytesting/2010 db/conf/propertytesting/propertytesting2010.html#Alon10

Noga Alon Hagit Attiya Shlomi Dolev Swan Dubois Maria Gradinariu Sébastien Tixeuil Practically Stabilizing Atomic Memory http://arxiv.org/abs/1007.1802 2010 CoRR abs/1007.1802 db/journals/corr/corr1007.html#abs-1007-1802

Noga Alon Shai Gutner Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. 544-556 2009 54 Algorithmica 4 https://doi.org/10.1007/s00453-008-9204-0 db/journals/algorithmica/algorithmica54.html#AlonG09

Noga Alon Eyal Lubetzky Uniformly cross intersecting families. 389-431 2009 29 Comb. 4 https://doi.org/10.1007/s00493-009-2332-6 db/journals/combinatorica/combinatorica29.html#AlonL09

Noga Alon Béla Bollobás Introduction. 1 2009 18 Comb. Probab. Comput. 1-2 https://doi.org/10.1017/S0963548309009766 db/journals/cpc/cpc18.html#AlonB09

Noga Alon Perturbed Identity Matrices Have High Rank: Proof and Applications. 3-15 2009 18 Comb. Probab. Comput. 1-2 https://doi.org/10.1017/S0963548307008917 db/journals/cpc/cpc18.html#Alon09

Noga Alon József Balogh Alexandr V. Kostochka Wojciech Samotij Sizes of Induced Subgraphs of Ramsey Graphs. 459-476 2009 18 Comb. Probab. Comput. 4 https://doi.org/10.1017/S0963548309009869 db/journals/cpc/cpc18.html#AlonBKS09

Noga Alon Economical Elimination of Cycles in the Torus. 619-627 2009 18 Comb. Probab. Comput. 5 https://doi.org/10.1017/S0963548309009997 db/journals/cpc/cpc18.html#Alon09a

Noga Alon Robert Berke Kevin Buchin Maike Buchin Péter Csorba Saswata Shannigrahi Bettina Speckmann Philipp Zumstein Polychromatic Colorings of Plane Graphs. 421-442 2009 42 Discret. Comput. Geom. 3 https://doi.org/10.1007/s00454-009-9171-5 https://www.wikidata.org/entity/Q56475784 db/journals/dcg/dcg42.html#AlonBBBCSSZ09

Dan Hefetz Noga Alon Michael Krivelevich Playing to retain the advantage. 423-427 2009 34 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2009.07.070 db/journals/endm/endm34.html#HefetzAK09

Noga Alon Uri Stav Stability-type results for hereditary properties. 65-83 2009 62 J. Graph Theory 1 https://doi.org/10.1002/jgt.20388 db/journals/jgt/jgt62.html#AlonS09

Noga Alon Baruch Awerbuch Yossi Azar Boaz Patt-Shamir Tell Me Who I Am: An Interactive Recommendation System. 261-279 2009 45 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-008-9100-7 db/journals/mst/mst45.html#AlonAAP09

Noga Alon Alexandr V. Kostochka Induced subgraphs with distinct sizes. 45-53 2009 34 Random Struct. Algorithms 1 https://doi.org/10.1002/rsa.20250 db/journals/rsa/rsa34.html#AlonK09

Noga Alon Eldar Fischer Ilan Newman Asaf Shapira A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. 143-167 2009 39 SIAM J. Comput. 1 https://doi.org/10.1137/060667177 https://www.wikidata.org/entity/Q105584121 db/journals/siamcomp/siamcomp39.html#AlonFNS09

Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Naor The Online Set Cover Problem. 361-370 2009 39 SIAM J. Comput. 2 https://doi.org/10.1137/060661946 db/journals/siamcomp/siamcomp39.html#AlonAABN09

Noga Alon Asaf Shapira Uri Stav Can a Graph Have Distinct Regular Partitions? 278-287 2009 23 SIAM J. Discret. Math. 1 https://doi.org/10.1137/070695952 db/journals/siamdm/siamdm23.html#AlonSS09

Noga Alon Fedor V. Fomin Gregory Z. Gutin Michael Krivelevich Saket Saurabh 0001 Spanning Directed Trees with Many Leaves. 466-476 2009 23 SIAM J. Discret. Math. 1 https://doi.org/10.1137/070710494 https://www.wikidata.org/entity/Q60488751 db/journals/siamdm/siamdm23.html#AlonFGKS09

Noga Alon Yossi Azar Shai Gutner Admission control to minimize rejections and online set cover with repetitions. 2009 6 ACM Trans. Algorithms 1 https://doi.org/10.1145/1644015.1644026 db/journals/talg/talg6.html#AlonAG09 11:1-11:13

Noga Alon Uri Stav Hardness of edge-modification problems. 4920-4927 2009 410 Theor. Comput. Sci. 47-49 https://doi.org/10.1016/j.tcs.2009.07.002 db/journals/tcs/tcs410.html#AlonS09

Noga Alon Rani Hod Optimal Monotone Encodings. 1343-1353 2009 55 IEEE Trans. Inf. Theory 3 https://doi.org/10.1109/TIT.2008.2011507 db/journals/tit/tit55.html#AlonH09

Noga Alon Rina Panigrahy Sergey Yekhanin Deterministic Approximation Algorithms for the Nearest Codeword Problem. 339-351 2009 APPROX-RANDOM https://doi.org/10.1007/978-3-642-03685-9_26 conf/approx/2009 db/conf/approx/approx2009.html#AlonPY09 Noga Alon Eyal Lubetzky Ori Gurel-Gurevich Choice-Memory Tradeoff in Allocations. 230-238 2009 FOCS https://doi.org/10.1109/FOCS.2009.49 https://doi.ieeecomputersociety.org/10.1109/FOCS.2009.49 conf/focs/2009 db/conf/focs/focs2009.html#AlonLG09 Noga Alon Daniel Lokshtanov Saket Saurabh 0001 Fast FAST. 49-58 2009 ICALP (1) https://doi.org/10.1007/978-3-642-02927-1_6 conf/icalp/2009-1 db/conf/icalp/icalp2009-1.html#AlonLS09 Noga Alon Shai Gutner Balanced Hashing, Color Coding and Approximate Counting. 1-16 2009 IWPEC https://doi.org/10.1007/978-3-642-11269-0_1 conf/iwpec/2009 db/conf/iwpec/iwpec2009.html#AlonG09 Noga Alon Uriel Feige On the power of two, three and four probes. 346-354 2009 SODA https://doi.org/10.1137/1.9781611973068.39 http://dl.acm.org/citation.cfm?id=1496770.1496809 conf/soda/2009 db/conf/soda/soda2009.html#AlonF09 Noga Alon Rina Panigrahy Sergey Yekhanin Deterministic approximation algorithms for the nearest codeword problem. 2009 Algebraic Methods in Computational Complexity http://drops.dagstuhl.de/opus/volltexte/2010/2413/ conf/dagstuhl/2009P9421 db/conf/dagstuhl/P9421.html#AlonPY09

Noga Alon Michal Feldman Ariel D. Procaccia Moshe Tennenholtz Strategyproof Approximation Mechanisms for Location on Networks http://arxiv.org/abs/0907.2049 2009 CoRR abs/0907.2049 db/journals/corr/corr0907.html#abs-0907-2049

Noga Alon Felix A. Fischer Ariel D. Procaccia Moshe Tennenholtz Sum of Us: Strategyproof Selection from the Selectors http://arxiv.org/abs/0910.4699 2009 CoRR abs/0910.4699 db/journals/corr/corr0910.html#abs-0910-4699

Noga Alon Shai Gutner Balanced Hashing, Color Coding and Approximate Counting. TR09-012 2009 TR09 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2009/012 db/journals/eccc/eccc16.html#AlonG09

Noga Alon Joel H. Spencer The Probabilistic Method, Third Edition. I-XV, 1-352 Wiley 2008 Wiley-Interscience series in discrete mathematics and optimization 978-0-470-17020-5

Noga Alon Asaf Shapira A separation theorem in property testing. 261-281 2008 28 Comb. 3 https://doi.org/10.1007/s00493-008-2321-1 db/journals/combinatorica/combinatorica28.html#AlonS08

Noga Alon Shmuel Friedland The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence. 2008 15 Electron. J. Comb. 1 http://www.combinatorics.org/Volume_15/Abstracts/v15i1n13.html db/journals/combinatorics/combinatorics15.html#AlonF08

Noga Alon Oded Schwartz Asaf Shapira An Elementary Construction of Constant-Degree Expanders. 319-327 2008 17 Comb. Probab. Comput. 3 https://doi.org/10.1017/S0963548307008851 db/journals/cpc/cpc17.html#AlonSS08

Noga Alon Eli Berger The Grothendieck constant of random and pseudo-random graphs. 323-327 2008 5 Discret. Optim. 2 https://doi.org/10.1016/j.disopt.2006.06.004 db/journals/disopt/disopt5.html#AlonB08

Noga Alon Jaroslaw Grytczuk Breaking the rhythm on graphs. 1375-1380 2008 308 Discret. Math. 8 https://doi.org/10.1016/j.disc.2007.07.063 db/journals/dm/dm308.html#AlonG08

Noga Alon Problems and results in extremal combinatorics - II. 4460-4472 2008 308 Discret. Math. 19 https://doi.org/10.1016/j.disc.2007.08.090 db/journals/dm/dm308.html#Alon08

Noga Alon Adi Pinchasi Rom Pinchasi An isoperimetric inequality in the universal cover of the punctured plane. 5691-5701 2008 308 Discret. Math. 23 https://doi.org/10.1016/j.disc.2007.10.033 db/journals/dm/dm308.html#AlonPP08

Noga Alon Shakhar Smorodinsky Conflict-Free colorings of Shallow Discs. 599-604 2008 18 Int. J. Comput. Geom. Appl. 6 https://doi.org/10.1142/S0218195908002775 db/journals/ijcga/ijcga18.html#AlonS08

Noga Alon Haim Kaplan Gabriel Nivasch Micha Sharir Shakhar Smorodinsky Weak ε-nets and interval chains. 2008 55 J. ACM 6 https://doi.org/10.1145/1455248.1455252 db/journals/jacm/jacm55.html#AlonKNSS08 28:1-28:32

Noga Alon Uri Stav The maximum edit distance from hereditary graph properties. 672-697 2008 98 J. Comb. Theory B 4 https://doi.org/10.1016/j.jctb.2007.10.001 db/journals/jct/jctb98.html#AlonS08

Noga Alon Uri Stav What is the furthest graph from a hereditary property? 87-104 2008 33 Random Struct. Algorithms 1 https://doi.org/10.1002/rsa.20209 db/journals/rsa/rsa33.html#AlonS08

Noga Alon Asaf Shapira A Characterization of the (Natural) Graph Properties Testable with One-Sided Error. 1703-1727 2008 37 SIAM J. Comput. 6 https://doi.org/10.1137/06064888X https://www.wikidata.org/entity/Q105584134 db/journals/siamcomp/siamcomp37.html#AlonS08

Noga Alon Asaf Shapira Every Monotone Graph Property Is Testable. 505-522 2008 38 SIAM J. Comput. 2 https://doi.org/10.1137/050633445 https://www.wikidata.org/entity/Q105584113 db/journals/siamcomp/siamcomp38.html#AlonS08a

Noga Alon Tali Kaufman Michael Krivelevich Dana Ron Testing Triangle-Freeness in General Graphs. 786-819 2008 22 SIAM J. Discret. Math. 2 https://doi.org/10.1137/07067917X db/journals/siamdm/siamdm22.html#AlonKKR08

Noga Alon Michael Krivelevich Benny Sudakov Large Nearly Regular Induced Subgraphs. 1325-1337 2008 22 SIAM J. Discret. Math. 4 https://doi.org/10.1137/070704927 db/journals/siamdm/siamdm22.html#AlonKS08

Noga Alon Pawel Pralat Nicholas C. Wormald Cleaning Regular Graphs with Brushes. 233-250 2008 23 SIAM J. Discret. Math. 1 https://doi.org/10.1137/070703053 db/journals/siamdm/siamdm23.html#AlonPW08

Noga Alon Mihai Badoiu Erik D. Demaine Martin Farach-Colton Mohammad Taghi Hajiaghayi Anastasios Sidiropoulos Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. 2008 4 ACM Trans. Algorithms 4 https://doi.org/10.1145/1383369.1383377 https://www.wikidata.org/entity/Q59701034 db/journals/talg/talg4.html#AlonBDFHS08 46:1-46:21

Noga Alon Ido Ben-Eliezer Michael Krivelevich Small Sample Spaces Cannot Fool Low Degree Polynomials. 266-275 2008 APPROX-RANDOM https://doi.org/10.1007/978-3-540-85363-3_22 conf/approx/2008 db/conf/approx/approx2008.html#AlonBK08 Noga Alon Dan Halperin Oren Nechushtan Micha Sharir The complexity of the outer face in arrangements of random segments. 69-78 2008 SCG https://doi.org/10.1145/1377676.1377689 conf/compgeom/2008 db/conf/compgeom/compgeom2008.html#AlonHNS08 Noga Alon Robert Berke Kevin Buchin Maike Buchin Péter Csorba Saswata Shannigrahi Bettina Speckmann Philipp Zumstein Polychromatic colorings of plane graphs. 338-345 2008 SCG https://doi.org/10.1145/1377676.1377734 https://www.wikidata.org/entity/Q56475815 conf/compgeom/2008 db/conf/compgeom/compgeom2008.html#AlonBBBCSSZ08 Noga Alon Asaf Nussboim k-Wise Independent Random Graphs. 813-822 2008 FOCS https://doi.org/10.1109/FOCS.2008.61 https://doi.ieeecomputersociety.org/10.1109/FOCS.2008.61 conf/focs/2008 db/conf/focs/focs2008.html#AlonN08 Noga Alon Eyal Lubetzky Uri Stav Amit Weinstein Avinatan Hassidim Broadcasting with Side Information. 823-832 2008 FOCS https://doi.org/10.1109/FOCS.2008.41 https://doi.ieeecomputersociety.org/10.1109/FOCS.2008.41 conf/focs/2008 db/conf/focs/focs2008.html#AlonLSWH08 Noga Alon Rani Hod Optimal Monotone Encodings. 258-270 2008 ICALP (1) https://doi.org/10.1007/978-3-540-70575-8_22 conf/icalp/2008-1 db/conf/icalp/icalp2008-1.html#AlonH08 Noga Alon Phuong Dao Iman Hajirasouliha Fereydoun Hormozdiari Süleyman Cenk Sahinalp Biomolecular network motif counting and discovery by color coding. 241-249 2008 ISMB https://doi.org/10.1093/bioinformatics/btn163 https://www.wikidata.org/entity/Q34789976 conf/ismb/2008 db/conf/ismb/ismb2008.html#AlonDHHS08 Noga Alon Michael R. Capalbo Optimal universal graphs with deterministic embedding. 373-378 2008 SODA http://dl.acm.org/citation.cfm?id=1347082.1347123 conf/soda/2008 db/conf/soda/soda2008.html#AlonC08 Noga Alon Haim Kaplan Gabriel Nivasch Micha Sharir Shakhar Smorodinsky Weak ε-nets and interval chains. 1194-1203 2008 SODA http://dl.acm.org/citation.cfm?id=1347082.1347212 conf/soda/2008 db/conf/soda/soda2008.html#AlonKNSS08 Noga Alon Chen Avin Michal Koucký 0001 Gady Kozma Zvi Lotker Mark R. Tuttle Many random walks are faster than one. 119-128 2008 SPAA https://doi.org/10.1145/1378533.1378557 conf/spaa/2008 db/conf/spaa/spaa2008.html#AlonAKKLT08 Noga Alon Raphael Yuster Uri Zwick Color Coding. 2008 Encyclopedia of Algorithms https://doi.org/10.1007/978-0-387-30162-4_76 https://www.wikidata.org/entity/Q60299146 reference/algo/2008 db/reference/algo/algo2008.html#AlonYZ08

Noga Alon Fedor V. Fomin Gregory Z. Gutin Michael Krivelevich Saket Saurabh 0001 Spanning directed trees with many leaves http://arxiv.org/abs/0803.0701 2008 CoRR abs/0803.0701 db/journals/corr/corr0803.html#abs-0803-0701

Noga Alon Yossi Azar Shai Gutner Admission Control to Minimize Rejections and Online Set Cover with Repetitions http://arxiv.org/abs/0803.2842 2008 CoRR abs/0803.2842 db/journals/corr/corr0803.html#abs-0803-2842

Noga Alon Shai Gutner Balanced Families of Perfect Hash Functions and Their Applications http://arxiv.org/abs/0805.4300 2008 CoRR abs/0805.4300 db/journals/corr/corr0805.html#abs-0805-4300

Noga Alon Avinatan Hassidim Eyal Lubetzky Uri Stav Amit Weinstein Broadcasting with side information http://arxiv.org/abs/0806.3246 2008 CoRR abs/0806.3246 db/journals/corr/corr0806.html#abs-0806-3246

Noga Alon Shai Gutner Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs http://arxiv.org/abs/0806.4735 2008 CoRR abs/0806.4735 db/journals/corr/corr0806.html#abs-0806-4735

Noga Alon Sonny Ben-Shimon Michael Krivelevich A note on regular Ramsey graphs http://arxiv.org/abs/0812.2386 2008 CoRR abs/0812.2386 db/journals/corr/corr0812.html#abs-0812-2386

Noga Alon Shai Gutner Kernels for the Dominating Set Problem on Graphs with an Excluded Minor. 2008 TR08 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-066/index.html TR08-066 db/journals/eccc/eccc15.html#AlonG08

Noga Alon Rina Panigrahy Sergey Yekhanin Deterministic Approximation Algorithms for the Nearest Codeword Problem. 2008 TR08 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-065/index.html TR08-065 db/journals/eccc/eccc15.html#AlonPY08

Noga Alon Eyal Lubetzky Codes And Xor Graph Products. 13-33 2007 27 Comb. 1 https://doi.org/10.1007/s00493-007-0042-5 db/journals/combinatorica/combinatorica27.html#AlonL07

Noga Alon Michael Krivelevich Benny Sudakov Embedding nearly-spanning bounded degree trees. 629-644 2007 27 Comb. 6 https://doi.org/10.1007/s00493-007-2182-z https://www.wikidata.org/entity/Q105583422 db/journals/combinatorica/combinatorica27.html#AlonKS07

Noga Alon Eyal Lubetzky Privileged users in zero-error transmission over a noisy channel. 737-743 2007 27 Comb. 6 https://doi.org/10.1007/s00493-007-2263-z db/journals/combinatorica/combinatorica27.html#AlonL07a

Noga Alon Vera Asodi Edge Colouring with Delays. 173-191 2007 16 Comb. Probab. Comput. 2 https://doi.org/10.1017/S0963548306007851 db/journals/cpc/cpc16.html#AlonA07

Noga Alon Ilan Newman Alexander Shen 0001 Gábor Tardos Nikolai K. Vereshchagin Partitioning multi-dimensional sets in a small number of "uniform" parts. 134-144 2007 28 Eur. J. Comb. 1 https://doi.org/10.1016/j.ejc.2005.08.002 https://www.wikidata.org/entity/Q57349768 db/journals/ejc/ejc28.html#AlonNSTV07

Noga Alon Haim Kaplan Michael Krivelevich Dahlia Malkhi Julien P. Stern Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. 1114-1116 2007 205 Inf. Comput. 7 https://doi.org/10.1016/j.ic.2006.02.007 db/journals/iandc/iandc205.html#AlonKKMS07

Nir Ailon Noga Alon Hardness of fully dense problems. 1117-1129 2007 205 Inf. Comput. 8 https://doi.org/10.1016/j.ic.2007.02.006 https://www.wikidata.org/entity/Q56486199 db/journals/iandc/iandc205.html#AilonA07

Noga Alon Eyal Lubetzky Independent sets in tensor graph powers. 73-87 2007 54 J. Graph Theory 1 https://doi.org/10.1002/jgt.20194 db/journals/jgt/jgt54.html#AlonL07

Noga Alon Béla Bollobás András Gyárfás Jenö Lehel Alex D. Scott Maximum directed cuts in acyclic digraphs. 1-13 2007 55 J. Graph Theory 1 https://doi.org/10.1002/jgt.20215 db/journals/jgt/jgt55.html#AlonBGLS07

Noga Alon Benny Sudakov On graphs with subgraphs having large independence numbers. 149-157 2007 56 J. Graph Theory 2 https://doi.org/10.1002/jgt.20264 db/journals/jgt/jgt56.html#AlonS07

Noga Alon Michael R. Capalbo Sparse universal graphs for bounded-degree graphs. 123-133 2007 31 Random Struct. Algorithms 2 https://doi.org/10.1002/rsa.20143 https://www.wikidata.org/entity/Q105583253 db/journals/rsa/rsa31.html#AlonC07

Noga Alon Toshiya Itoh Tatsuya Nagatani On (epsilon, k)-min-wise independent permutations. 384-389 2007 31 Random Struct. Algorithms 3 https://doi.org/10.1002/rsa.20184 db/journals/rsa/rsa31.html#AlonIN07

Noga Alon Eldar Fischer Ilan Newman Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. 959-976 2007 37 SIAM J. Comput. 3 https://doi.org/10.1137/050627915 https://www.wikidata.org/entity/Q57838767 db/journals/siamcomp/siamcomp37.html#AlonFN07

Noga Alon Anja Krech Tibor Szabó Turán's Theorem in the Hypercube. 66-72 2007 21 SIAM J. Discret. Math. 1 https://doi.org/10.1137/060649422 db/journals/siamdm/siamdm21.html#AlonKS07

Noga Alon Eyal Lubetzky Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon. 329-348 2007 21 SIAM J. Discret. Math. 2 https://doi.org/10.1137/060657893 db/journals/siamdm/siamdm21.html#AlonL07

Noga Alon Venkatesan Guruswami Tali Kaufman Madhu Sudan 0001 Guessing secrets efficiently via list decoding. 2007 3 ACM Trans. Algorithms 4 https://doi.org/10.1145/1290672.1290679 db/journals/talg/talg3.html#AlonGKS07 42

Noga Alon Andrzej Lingas Martin Wahlen Approximating the maximum clique minor and some subgraph homeomorphism problems. 149-158 2007 374 Theor. Comput. Sci. 1-3 https://doi.org/10.1016/j.tcs.2006.12.021 db/journals/tcs/tcs374.html#AlonLW07

Noga Alon Vera Asodi Tracing Many Users With Almost No Rate Penalty. 437-439 2007 53 IEEE Trans. Inf. Theory 1 https://doi.org/10.1109/TIT.2006.887089 db/journals/tit/tit53.html#AlonA07

Noga Alon Shai Gutner Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. 394-405 2007 conf/cocoon/2007 COCOON https://doi.org/10.1007/978-3-540-73545-8_39 db/conf/cocoon/cocoon2007.html#AlonG07 Noga Alon Asaf Shapira Uri Stav Can a Graph Have Distinct Regular Partitions? 428-438 2007 conf/cocoon/2007 COCOON https://doi.org/10.1007/978-3-540-73545-8_42 db/conf/cocoon/cocoon2007.html#AlonSS07 Noga Alon Raphael Yuster Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. 175-186 2007 conf/esa/2007 ESA https://doi.org/10.1007/978-3-540-75520-3_17 db/conf/esa/esa2007.html#AlonY07 Noga Alon Michael R. Capalbo Finding Disjoint Paths in Expanders Deterministically and Online. 518-524 2007 FOCS https://doi.org/10.1109/FOCS.2007.19 https://doi.ieeecomputersociety.org/10.1109/FOCS.2007.19 conf/focs/2007 db/conf/focs/focs2007.html#AlonC07 Noga Alon Fedor V. Fomin Gregory Z. Gutin Michael Krivelevich Saket Saurabh 0001 Better Algorithms and Bounds for Directed Maximum Leaf Problems. 316-327 2007 conf/fsttcs/2007 FSTTCS https://doi.org/10.1007/978-3-540-77050-3_26 db/conf/fsttcs/fsttcs2007.html#AlonFGKS07 Noga Alon Fedor V. Fomin Gregory Z. Gutin Michael Krivelevich Saket Saurabh 0001 Parameterized Algorithms for Directed Maximum Leaf Problems. 352-362 2007 conf/icalp/2007 ICALP https://doi.org/10.1007/978-3-540-73420-8_32 db/conf/icalp/icalp2007.html#AlonFGKS07 Noga Alon Shai Gutner Balanced Families of Perfect Hash Functions and Their Applications. 435-446 2007 conf/icalp/2007 ICALP https://doi.org/10.1007/978-3-540-73420-8_39 db/conf/icalp/icalp2007.html#AlonG07 Noga Alon Amin Coja-Oghlan Hiêp Hàn Mihyun Kang Vojtech Rödl Mathias Schacht Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. 789-800 2007 conf/icalp/2007 ICALP https://doi.org/10.1007/978-3-540-73420-8_68 db/conf/icalp/icalp2007.html#AlonCHKRS07 Noga Alon Oded Schwartz Asaf Shapira An elementary construction of constant-degree expanders. 454-458 2007 conf/soda/2007 SODA http://dl.acm.org/citation.cfm?id=1283383.1283431 db/conf/soda/soda2007.html#AlonSS07 Noga Alon Alexandr Andoni Tali Kaufman Kevin Matulef Ronitt Rubinfeld Ning Xie 0002 Testing k-wise and almost k-wise independence. 496-505 2007 conf/stoc/2007 STOC https://doi.org/10.1145/1250790.1250863 https://www.wikidata.org/entity/Q57568012 db/conf/stoc/stoc2007.html#AlonAKMRX07 Amit Agarwal Noga Alon Moses Charikar Improved approximation for directed cut problems. 671-680 2007 conf/stoc/2007 STOC https://doi.org/10.1145/1250790.1250888 db/conf/stoc/stoc2007.html#AgarwalAC07

Noga Alon Fedor V. Fomin Gregory Z. Gutin Michael Krivelevich Saket Saurabh 0001 Better Algorithms and Bounds for Directed Maximum Leaf Problems http://arxiv.org/abs/0707.1095 2007 CoRR abs/0707.1095 db/journals/corr/corr0707.html#abs-0707-1095

Noga Alon Fedor V. Fomin Gregory Z. Gutin Michael Krivelevich Saket Saurabh 0001 Parameterized Algorithms for Directed Maximum Leaf Problems http://arxiv.org/abs/cs/0702049 2007 CoRR abs/cs/0702049 db/journals/corr/corr0702.html#abs-cs-0702049

Noga Alon Raphael Yuster The Number Of Orientations Having No Fixed Tournament. 1-16 2006 26 Comb. 1 https://doi.org/10.1007/s00493-006-0001-6 https://www.wikidata.org/entity/Q105583368 db/journals/combinatorica/combinatorica26.html#AlonY06

Noga Alon Asaf Shapira On An Extremal Hypergraph Problem Of Brown, Erdös And Sós. 627-645 2006 26 Comb. 6 https://doi.org/10.1007/s00493-006-0035-9 db/journals/combinatorica/combinatorica26.html#AlonS06

Noga Alon Benny Sudakov H-Free Graphs of Large Minimum Degree. 2006 13 Electron. J. Comb. 1 https://doi.org/10.37236/1045 db/journals/combinatorics/combinatorics13.html#AlonS06

Noga Alon Yoshiharu Kohayakawa Christian Mauduit Carlos Gustavo T. de A. Moreira Vojtech Rödl Measures of Pseudorandomness for Finite Sequences: Minimal Values. 1-29 2006 15 Comb. Probab. Comput. 1-2 https://doi.org/10.1017/S0963548305007170 db/journals/cpc/cpc15.html#AlonKMMR06

Noga Alon Feasible Schedules for Rotating Transmissions. 783-787 2006 15 Comb. Probab. Comput. 5 https://doi.org/10.1017/S0963548306007632 db/journals/cpc/cpc15.html#Alon06

Noga Alon Asaf Shapira A Characterization of Easily Testable Induced Subgraphs. 791-805 2006 15 Comb. Probab. Comput. 6 https://doi.org/10.1017/S0963548306007759 db/journals/cpc/cpc15.html#AlonS06

Noga Alon Splitting digraphs. 933-937 2006 15 Comb. Probab. Comput. 6 https://doi.org/10.1017/S0963548306008042 db/journals/cpc/cpc15.html#Alon06a

Noga Alon Fan R. K. Chung Explicit construction of linear sized tolerant networks. 1068-1071 2006 306 Discret. Math. 10-11 https://doi.org/10.1016/j.disc.2006.03.025 db/journals/dm/dm306.html#AlonC06

Noga Alon Vera Asodi Tracing a single user. 1227-1234 2006 27 Eur. J. Comb. 8 https://doi.org/10.1016/j.ejc.2006.05.001 db/journals/ejc/ejc27.html#AlonA06

Noga Alon Vera Asodi Charles Cantor Simon Kasif John Rachlin Multi-Node Graphs: A Framework for Multiplexed Biological Assays. 1659-1672 2006 13 J. Comput. Biol. 10 https://doi.org/10.1089/cmb.2006.13.1659 https://www.wikidata.org/entity/Q40250151 db/journals/jcb/jcb13.html#AlonACKR06

Noga Alon Graham R. Brightwell Hal A. Kierstead Alexandr V. Kostochka Peter Winkler 0001 Dominating sets in k-majority tournaments. 374-387 2006 96 J. Comb. Theory B 3 https://doi.org/10.1016/j.jctb.2005.09.003 db/journals/jct/jctb96.html#AlonBKKW06

Noga Alon Rados Radoicic Benny Sudakov Jan Vondrák A Ramsey-type result for the hypercube. 196-208 2006 53 J. Graph Theory 3 https://doi.org/10.1002/jgt.20181 db/journals/jgt/jgt53.html#AlonRSV06

Noga Alon Eitan Bachmat Regular graphs whose subgraphs tend to be acyclic. 324-337 2006 29 Random Struct. Algorithms 3 https://doi.org/10.1002/rsa.20107 db/journals/rsa/rsa29.html#AlonB06

Noga Alon Assaf Naor Approximating the Cut-Norm via Grothendieck's Inequality. 787-803 2006 35 SIAM J. Comput. 4 https://doi.org/10.1137/S0097539704441629 db/journals/siamcomp/siamcomp35.html#AlonN06

Noga Alon Ranking Tournaments. 137-142 2006 20 SIAM J. Discret. Math. 1 https://doi.org/10.1137/050623905 db/journals/siamdm/siamdm20.html#Alon06

Noga Alon Dana Moshkovitz Shmuel Safra Algorithmic construction of sets for k-restrictions. 153-177 2006 2 ACM Trans. Algorithms 2 https://doi.org/10.1145/1150334.1150336 https://www.wikidata.org/entity/Q56443115 db/journals/talg/talg2.html#AlonMS06

Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Naor A general approach to online network optimization problems. 640-660 2006 2 ACM Trans. Algorithms 4 https://doi.org/10.1145/1198513.1198522 db/journals/talg/talg2.html#AlonAABN06

Noga Alon Eyal Lubetzky The Shannon capacity of a graph and the independence numbers of its powers. 2172-2176 2006 52 IEEE Trans. Inf. Theory 5 https://doi.org/10.1109/TIT.2006.872856 db/journals/tit/tit52.html#AlonL06

Noga Alon Shakhar Smorodinsky Conflict-free colorings of shallow discs. 41-43 2006 conf/compgeom/2006 SCG https://doi.org/10.1145/1137856.1137864 db/conf/compgeom/compgeom2006.html#AlonS06 Noga Alon Asaf Shapira Benny Sudakov Additive Approximation for Edge-Deletion Problems (Abstract). 1-2 2006 conf/icalp/2006-1 ICALP (1) https://doi.org/10.1007/11786986_1 db/conf/icalp/icalp2006-1.html#AlonSS06 Noga Alon Tali Kaufman Michael Krivelevich Dana Ron Testing triangle-freeness in general graphs. 279-288 2006 conf/soda/2006 SODA http://dl.acm.org/citation.cfm?id=1109557.1109589 db/conf/soda/soda2006.html#AlonKKR06 Noga Alon Baruch Awerbuch Yossi Azar Boaz Patt-Shamir Tell me who I am: an interactive recommendation system. 1-10 2006 conf/spaa/2006 SPAA https://doi.org/10.1145/1148109.1148111 db/conf/spaa/spaa2006.html#AlonAAP06 Noga Alon Eldar Fischer Ilan Newman Asaf Shapira A combinatorial characterization of the testable graph properties: it's all about regularity. 251-260 2006 conf/stoc/2006 STOC https://doi.org/10.1145/1132516.1132555 db/conf/stoc/stoc2006.html#Shapira06

Noga Alon Eyal Lubetzky The Shannon capacity of a graph and the independence numbers of its powers http://arxiv.org/abs/cs/0608021 2006 CoRR abs/cs/0608021 db/journals/corr/corr0608.html#abs-cs-0608021

Noga Alon Oded Schwartz Asaf Shapira An Elementary Construction of Constant-Degree Expanders. 2006 TR06 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-119/index.html TR06-119 db/journals/eccc/eccc13.html#AlonSS06

Noga Alon Vojtech Rödl Sharp Bounds For Some Multicolor Ramsey Numbers. 125-141 2005 25 Comb. 2 https://doi.org/10.1007/s00493-005-0011-9 db/journals/combinatorica/combinatorica25.html#AlonR05

Noga Alon Michael Krivelevich Joel Spencer Tibor Szabó Discrepancy Games. 2005 12 Electron. J. Comb. https://doi.org/10.37236/1948 db/journals/combinatorics/combinatorics12.html#AlonKSS05

Noga Alon Michael Merritt Omer Reingold Gadi Taubenfeld Rebecca N. Wright Tight bounds for shared memory systems accessed by Byzantine processes. 99-109 2005 18 Distributed Comput. 2 https://doi.org/10.1007/s00446-005-0125-8 https://www.wikidata.org/entity/Q59701086 db/journals/dc/dc18.html#AlonMRTW05

Noga Alon Jaroslaw Grytczuk Nonrepetitive colorings of graphs. 353-355 2005 22 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2005.06.077 db/journals/endm/endm22.html#AlonG05

Noga Alon Raphael Yuster On a Hypergraph Matching Problem. 377-384 2005 21 Graphs Comb. 4 https://doi.org/10.1007/s00373-005-0628-x db/journals/gc/gc21.html#AlonY05

Noga Alon János Pach Rom Pinchasi Rados Radoicic Micha Sharir Crossing patterns of semi-algebraic sets. 310-326 2005 111 J. Comb. Theory A 2 https://doi.org/10.1016/j.jcta.2004.12.008 db/journals/jct/jcta111.html#AlonPPRS05

Noga Alon Vera Asodi Learning a Hidden Subgraph. 697-712 2005 18 SIAM J. Discret. Math. 4 https://doi.org/10.1137/S0895480103431071 db/journals/siamdm/siamdm18.html#AlonA05

Noga Alon Tali Kaufman Michael Krivelevich Simon Litsyn Dana Ron Testing Reed-Muller codes. 4032-4039 2005 51 IEEE Trans. Inf. Theory 11 https://doi.org/10.1109/TIT.2005.856958 db/journals/tit/tit51.html#AlonKKLR05

Noga Alon Asaf Shapira Linear Equations, Arithmetic Progressions and Hypergraph Property Testing. 177-216 2005 1 Theory Comput. 1 https://doi.org/10.4086/toc.2005.v001a009 db/journals/toc/toc1.html#AlonS05

Noga Alon Asaf Shapira Benny Sudakov Additive Approximation for Edge-Deletion Problems. 419-428 2005 conf/focs/2005 FOCS https://doi.org/10.1109/SFCS.2005.11 https://doi.ieeecomputersociety.org/10.1109/SFCS.2005.11 db/conf/focs/focs2005.html#AlonSS05 Noga Alon Asaf Shapira A Characterization of the (natural) Graph Properties Testable with One-Sided Error. 429-438 2005 conf/focs/2005 FOCS https://doi.org/10.1109/SFCS.2005.5 https://doi.ieeecomputersociety.org/10.1109/SFCS.2005.5 db/conf/focs/focs2005.html#AlonS05 Noga Alon Nick G. Duffield Carsten Lund Mikkel Thorup Estimating arbitrary subset sums with few probes. 317-325 2005 conf/pods/2005 PODS https://doi.org/10.1145/1065167.1065209 db/conf/pods/pods2005.html#AlonDLT05 Noga Alon Mihai Badoiu Erik D. Demaine Martin Farach-Colton Mohammad Taghi Hajiaghayi Anastasios Sidiropoulos Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. 650-659 2005 conf/soda/2005 SODA http://dl.acm.org/citation.cfm?id=1070432.1070523 db/conf/soda/soda2005.html#AlonBDFHS05 Noga Alon Asaf Shapira Linear equations, arithmetic progressions and hypergraph property testing. 708-717 2005 conf/soda/2005 SODA http://dl.acm.org/citation.cfm?id=1070432.1070532 db/conf/soda/soda2005.html#AlonS05 Noga Alon Yossi Azar Shai Gutner Admission control to minimize rejections and online set cover with repetitions. 238-244 2005 conf/spaa/2005 SPAA https://doi.org/10.1145/1073970.1074010 db/conf/spaa/spaa2005.html#AlonAG05 Noga Alon Asaf Shapira Every monotone graph property is testable. 128-137 2005 conf/stoc/2005 STOC https://doi.org/10.1145/1060590.1060611 db/conf/stoc/stoc2005.html#AlonS05 Noga Alon Konstantin Makarychev Yury Makarychev Assaf Naor Quadratic forms on graphs. 486-493 2005 conf/stoc/2005 STOC https://doi.org/10.1145/1060590.1060664 db/conf/stoc/stoc2005.html#AlonMMN05

Asaf Shapira Noga Alon Homomorphisms in Graph Property Testing - A Survey Electron. Colloquium Comput. Complex. 2005 TR05 TR05-085 db/journals/eccc/eccc12.html#TR05-085 https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-085/index.html

Noga Alon Ilan Newman Alexander Shen 0001 Gábor Tardos Nikolai K. Vereshchagin Partitioning multi-dimensional sets in a small number of "uniform" parts Electron. Colloquium Comput. Complex. 2005 TR05 TR05-095 db/journals/eccc/eccc12.html#TR05-095 https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-095/index.html

Alon Nilli Tight Estimates for Eigenvalues of Regular Graphs. 2004 11 Electron. J. Comb. 1 https://doi.org/10.37236/1850 db/journals/combinatorics/combinatorics11.html#Nilli04

Noga Alon Uri Stav New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. 795-807 2004 13 Comb. Probab. Comput. 6 https://doi.org/10.1017/S0963548304006388 db/journals/cpc/cpc13.html#AlonS04

Noga Alon Gregory Z. Gutin Michael Krivelevich Algorithms with large domination ratio. 118-131 2004 50 J. Algorithms 1 https://doi.org/10.1016/j.jalgor.2003.09.003 db/journals/jal/jal50.html#AlonGK04

Noga Alon Asaf Shapira Testing subgraphs in directed graphs. 354-382 2004 69 J. Comput. Syst. Sci. 3 https://doi.org/10.1016/j.jcss.2004.04.008 db/journals/jcss/jcss69.html#AlonS04

Noga Alon Gil Kaplan Arieh Lev Yehuda Roditty Raphael Yuster Dense graphs are antimagic. 297-309 2004 47 J. Graph Theory 4 https://doi.org/10.1002/jgt.20027 db/journals/jgt/jgt47.html#AlonKLRY04

Noga Alon Richard Beigel Simon Kasif Steven Rudich Benny Sudakov Learning a Hidden Matching. 487-501 2004 33 SIAM J. Comput. 2 https://doi.org/10.1137/S0097539702420139 db/journals/siamcomp/siamcomp33.html#AlonBKRS04

Noga Alon Seannie Dar Michal Parnas Dana Ron Testing of Clustering. 285-308 2004 46 SIAM Rev. 2 https://doi.org/10.1137/S0036144503437178 db/journals/siamrev/siamrev46.html#AlonDPR04

Noga Alon Vera Asodi Edge Coloring with Delays. 237-248 https://doi.org/10.1007/978-3-540-27821-4_22 2004 conf/approx/2004 APPROX-RANDOM db/conf/approx/approx2004.html#AlonA04 Noga Alon Vera Asodi Learning a Hidden Subgraph. 110-121 https://doi.org/10.1007/978-3-540-27836-8_12 2004 conf/icalp/2004 ICALP db/conf/icalp/icalp2004.html#AlonA04 Nathan Srebro Noga Alon Tommi S. Jaakkola Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices. 2004 conf/nips/2004 NIPS https://proceedings.neurips.cc/paper/2004/hash/f1b0775946bc0329b35b823b86eeb5f5-Abstract.html http://papers.nips.cc/paper/2700-generalization-error-bounds-for-collaborative-prediction-with-low-rank-matrices db/conf/nips/nips2004.html#SrebroAJ04 1321-1328 Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Naor A general approach to online network optimization problems. 577-586 2004 conf/soda/2004 SODA http://dl.acm.org/citation.cfm?id=982792.982879 db/conf/soda/soda2004.html#AlonAABN04 Noga Alon Asaf Shapira A characterization of easily testable induced subgraphs. 942-951 2004 conf/soda/2004 SODA http://dl.acm.org/citation.cfm?id=982792.982934 db/conf/soda/soda2004.html#AlonS04 Noga Alon Assaf Naor Approximating the cut-norm via Grothendieck's inequality. 72-80 2004 conf/stoc/2004 STOC https://doi.org/10.1145/1007352.1007371 https://www.wikidata.org/entity/Q105337412 db/conf/stoc/stoc2004.html#AlonN04

Noga Alon Michael Krivelevich Benny Sudakov Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. 477-494 2003 12 Comb. Probab. Comput. 5-6 db/journals/cpc/cpc12.html#AlonKS03 https://doi.org/10.1017/S0963548303005741

Noga Alon Guillaume Fertin Arthur L. Liestman Thomas C. Shermer Ladislav Stacho Factor d-domatic colorings of graphs. 17-25 2003 262 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(02)00518-6 db/journals/dm/dm262.html#AlonFLSS03

Noga Alon Problems and results in extremal combinatorics--I. 31-53 2003 273 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(03)00227-9 db/journals/dm/dm273.html#Alon03

Noga Alon Simon Litsyn Raphael Yuster A Coding Theory Bound and Zero-Sum Square Matrices. 449-457 2003 19 Graphs Comb. 4 https://doi.org/10.1007/s00373-003-0533-0 db/journals/gc/gc19.html#AlonLY03

Noga Alon Michael R. Capalbo Smaller Explicit Superconcentrators. 2003 1 Internet Math. 2 db/journals/im/im1.html#AlonC03 https://doi.org/10.1080/15427951.2004.10129083 151-163

Noga Alon A simple algorithm for edge-coloring bipartite multigraphs. 301-302 2003 85 Inf. Process. Lett. 6 https://doi.org/10.1016/S0020-0190(02)00446-5 https://www.wikidata.org/entity/Q56390588 db/journals/ipl/ipl85.html#Alon03

Noga Alon Oded Goldreich 0001 Yishay Mansour Almost k-wise independence versus k-wise independence. 107-110 2003 88 Inf. Process. Lett. 3 https://doi.org/10.1016/S0020-0190(03)00359-4 db/journals/ipl/ipl88.html#AlonGM03

Noga Alon Asaf Shapira Testing satisfiability. 87-103 2003 47 J. Algorithms 2 https://doi.org/10.1016/S0196-6774(03)00019-1 db/journals/jal/jal47.html#AlonS03

Noga Alon Tova Milo Frank Neven Dan Suciu Victor Vianu XML with data values: typechecking revisited. 688-727 2003 66 J. Comput. Syst. Sci. 4 https://doi.org/10.1016/S0022-0000(03)00032-1 db/journals/jcss/jcss66.html#AlonMNSV03

Noga Alon Wenceslas Fernandez de la Vega Ravi Kannan Marek Karpinski Random sampling and approximation of MAX-CSPs. 212-243 2003 67 J. Comput. Syst. Sci. 2 https://doi.org/10.1016/S0022-0000(03)00008-4 db/journals/jcss/jcss67.html#AlonVKK03

Noga Alon Guoli Ding Bogdan Oporowski Dirk Vertigan Partitioning into graphs with only small components. 231-243 2003 87 J. Comb. Theory B 2 https://doi.org/10.1016/S0095-8956(02)00006-0 db/journals/jct/jctb87.html#AlonDV03

Noga Alon Béla Bollobás Michael Krivelevich Benny Sudakov Maximum cuts and judicious partitions in graphs without short cycles. 329-346 2003 88 J. Comb. Theory B 2 https://doi.org/10.1016/S0095-8956(03)00036-4 db/journals/jct/jctb88.html#AlonBKS03

Noga Alon Gérard D. Cohen Michael Krivelevich Simon Litsyn Generalized hashing and parent-identifying codes. 207-215 2003 104 J. Comb. Theory A 1 https://doi.org/10.1016/j.jcta.2003.08.001 db/journals/jct/jcta104.html#AlonCKL03

Noga Alon Michael Krivelevich Benny Sudakov Induced subgraphs of prescribed size. 239-251 2003 43 J. Graph Theory 4 https://doi.org/10.1002/jgt.10117 db/journals/jgt/jgt43.html#AlonKS03

Noga Alon Tao Jiang 0003 Zevi Miller Dan Pritikin Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. 409-433 2003 23 Random Struct. Algorithms 4 https://doi.org/10.1002/rsa.10102 https://www.wikidata.org/entity/Q105583284 db/journals/rsa/rsa23.html#AlonJMP03

Noga Alon Seannie Dar Michal Parnas Dana Ron Testing of Clustering. 393-417 2003 16 SIAM J. Discret. Math. 3 https://doi.org/10.1137/S0895480102410973 db/journals/siamdm/siamdm16.html#AlonDPR03

Noga Alon Tova Milo Frank Neven Dan Suciu Victor Vianu Typechecking XML views of relational databases. 315-354 2003 4 ACM Trans. Comput. Log. 3 https://doi.org/10.1145/772062.772065 db/journals/tocl/tocl4.html#AlonMNSV03

Noga Alon Tali Kaufman Michael Krivelevich Simon Litsyn Dana Ron Testing Low-Degree Polynomials over GF(2(. 188-199 https://doi.org/10.1007/978-3-540-45198-3_17 2003 conf/random/2003 RANDOM-APPROX db/conf/random/random2003.html#AlonKKLR03 Noga Alon Michael R. Capalbo Smaller explicit superconcentrators. 340-346 2003 conf/soda/2003 SODA http://dl.acm.org/citation.cfm?id=644108.644164 db/conf/soda/soda2003.html#AlonC03 Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Naor The online set cover problem. 100-105 2003 conf/stoc/2003 STOC https://doi.org/10.1145/780542.780558 db/conf/stoc/stoc2003.html#AlonAA03 Noga Alon Asaf Shapira Testing subgraphs in directed graphs. 700-709 2003 conf/stoc/2003 STOC https://doi.org/10.1145/780542.780644 db/conf/stoc/stoc2003.html#AlonS03

Noga Alon Gil Kalai Jirí Matousek 0001 Roy Meshulam Transversal numbers for hypergraphs arising in geometry. 79-101 2002 29 Adv. Appl. Math. 1 https://doi.org/10.1016/S0196-8858(02)00003-9 https://www.wikidata.org/entity/Q105333976 db/journals/aam/aam29.html#AlonK0M02

Noga Alon Voting paradoxes and digraphs realizations. 126-135 2002 29 Adv. Appl. Math. 1 https://doi.org/10.1016/S0196-8858(02)00007-6 db/journals/aam/aam29.html#Alon02

Noga Alon Ayal Zaks Algorithmic Aspects of Acyclic Edge Colorings. 611-614 2002 32 Algorithmica 4 https://doi.org/10.1007/s00453-001-0093-8 db/journals/algorithmica/algorithmica32.html#AlonZ02

Noga Alon Bojan Mohar The Chromatic Number Of Graph Powers. 2002 11 Comb. Probab. Comput. 1 db/journals/cpc/cpc11.html#AlonM02 https://doi.org/10.1017/S0963548301004965 1-10

Noga Alon József Balogh Béla Bollobás Tamás Szabó Game domination number. 23-33 2002 256 Discret. Math. 1-2 https://doi.org/10.1016/S0012-365X(00)00358-7 db/journals/dm/dm256.html#AlonBBS02

Noga Alon Covering a hypergraph of subgraphs. 249-254 2002 257 Discret. Math. 2-3 https://doi.org/10.1016/S0012-365X(02)00427-2 db/journals/dm/dm257.html#Alon02

Noga Alon Tom Bohman Ron Holzman Daniel J. Kleitman On partitions of discrete boxes. 255-258 2002 257 Discret. Math. 2-3 https://doi.org/10.1016/S0012-365X(02)00428-4 https://www.wikidata.org/entity/Q101165570 db/journals/dm/dm257.html#AlonBHK02

Noga Alon Shlomo Hoory Nathan Linial The Moore Bound for Irregular Graphs. 53-57 2002 18 Graphs Comb. 1 https://doi.org/10.1007/s003730200002 db/journals/gc/gc18.html#AlonHL02

Noga Alon Haim Kaplan Michael Krivelevich Dahlia Malkhi Julien P. Stern Scalable Secure Storage When Half the System Is Faulty. 203-213 2002 174 Inf. Comput. 2 https://doi.org/10.1006/inco.2002.3148 db/journals/iandc/iandc174.html#AlonKKMS02

Noga Alon Phillip B. Gibbons Yossi Matias Mario Szegedy Tracking Join and Self-Join Sizes in Limited Storage. 719-747 2002 64 J. Comput. Syst. Sci. 3 https://doi.org/10.1006/jcss.2001.1813 db/journals/jcss/jcss64.html#AlonGMS02

Noga Alon Paul Erdös David S. Gunderson Michael Molloy 0001 A Ramsey-type problem and the Turán numbers. 120-129 2002 40 J. Graph Theory 2 https://doi.org/10.1002/jgt.10032 https://www.wikidata.org/entity/Q105659467 db/journals/jgt/jgt40.html#AlonEGM02

Noga Alon Benjamin Doerr Tomasz Luczak 0001 Tomasz Schoen On the discrepancy of combinatorial rectangles. 205-215 2002 21 Random Struct. Algorithms 3-4 https://doi.org/10.1002/rsa.10055 db/journals/rsa/rsa21.html#AlonDLS02

Noga Alon Jaroslaw Grytczuk Mariusz Haluszczak Oliver Riordan Nonrepetitive colorings of graphs. 336-346 2002 21 Random Struct. Algorithms 3-4 https://doi.org/10.1002/rsa.10057 db/journals/rsa/rsa21.html#AlonGHR02

Noga Alon Testing subgraphs in large graphs. 359-370 2002 21 Random Struct. Algorithms 3-4 https://doi.org/10.1002/rsa.10056 https://www.wikidata.org/entity/Q105583182 db/journals/rsa/rsa21.html#Alon02

Noga Alon Michael Krivelevich Testing k-colorability. 211-227 2002 15 SIAM J. Discret. Math. 2 https://doi.org/10.1137/S0895480199358655 db/journals/siamdm/siamdm15.html#AlonK02

Noga Alon Michael R. Capalbo Explicit Unique-Neighbor Expanders. 73- 2002 conf/focs/2002 FOCS https://doi.org/10.1109/SFCS.2002.1181884 https://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181884 https://www.wikidata.org/entity/Q56047328 db/conf/focs/focs2002.html#AlonC02 Noga Alon Richard Beigel Simon Kasif Steven Rudich Benny Sudakov Learning a Hidden Matching. 197- 2002 conf/focs/2002 FOCS https://doi.org/10.1109/SFCS.2002.1181943 https://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181943 db/conf/focs/focs2002.html#AlonBKRS02 Noga Alon Venkatesan Guruswami Tali Kaufman Madhu Sudan 0001 Guessing secrets efficiently via list decoding. 254-262 2002 conf/soda/2002 SODA http://dl.acm.org/citation.cfm?id=545381.545414 db/conf/soda/soda2002.html#AlonGKS02 Noga Alon Asaf Shapira Testing satisfiability. 645-654 2002 conf/soda/2002 SODA http://dl.acm.org/citation.cfm?id=545381.545467 db/conf/soda/soda2002.html#AlonS02 Noga Alon Wenceslas Fernandez de la Vega Ravi Kannan Marek Karpinski Random sampling and approximation of MAX-CSP problems. 232-239 2002 conf/stoc/2002 STOC https://doi.org/10.1145/509907.509945 db/conf/stoc/stoc2002.html#AlonVKK02

Noga Alon Oded Goldreich 0001 Yishay Mansour Almost k-wise independence versus k-wise independence. Electron. Colloquium Comput. Complex. 2002 TR02 TR02-048 db/journals/eccc/eccc9.html#ECCC-TR02-048 https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-048/index.html

Noga Alon János Pach József Solymosi Ramsey-type Theorems with Forbidden Subgraphs. 155-170 2001 21 Comb. 2 https://doi.org/10.1007/s004930100016 db/journals/combinatorica/combinatorica21.html#AlonPS01

Emanuela Fachini Alon Nilli Recursive bounds for perfect hashing. 307-311 2001 111 Discret. Appl. Math. 3 db/journals/dam/dam111.html#FachiniN01 https://doi.org/10.1016/S0166-218X(00)00291-2 https://www.wikidata.org/entity/Q127064083

Noga Alon Hagit Last Rom Pinchasi Micha Sharir On the Complexity of Arrangements of Circles in the Plane. 465-492 2001 26 Discret. Comput. Geom. 4 https://doi.org/10.1007/s00454-001-0043-x db/journals/dcg/dcg26.html#AlonLPS01

Noga Alon Vanessa Teague Nicholas C. Wormald Linear Arboricity and Linear k-Arboricity of Regular Graphs. 11-16 2001 17 Graphs Comb. 1 https://doi.org/10.1007/PL00007233 https://www.wikidata.org/entity/Q57310373 db/journals/gc/gc17.html#AlonTW01

Noga Alon László Lovász 0001 Unextendible Product Bases. 169-179 2001 95 J. Comb. Theory A 1 https://doi.org/10.1006/jcta.2000.3122 db/journals/jct/jcta95.html#AlonL01

Noga Alon Eldar Fischer Mario Szegedy Parent-Identifying Codes. 349-359 2001 95 J. Comb. Theory A 2 https://doi.org/10.1006/jcta.2001.3177 db/journals/jct/jcta95.html#AlonFS01

Noga Alon Benny Sudakov Ayal Zaks Acyclic edge colorings of graphs. 157-167 2001 37 J. Graph Theory 3 https://doi.org/10.1002/jgt.1010 https://www.wikidata.org/entity/Q56390605 db/journals/jgt/jgt37.html#AlonSZ01

Noga Alon Dhruv Mubayi Robin Thomas 0001 Large induced forests in sparse graphs. 113-123 2001 38 J. Graph Theory 3 https://doi.org/10.1002/jgt.1028 db/journals/jgt/jgt38.html#AlonMT01

Ilan Adler Noga Alon Sheldon M. Ross On the maximum number of Hamiltonian paths in tournaments. 291-296 2001 18 Random Struct. Algorithms 3 db/journals/rsa/rsa18.html#AdlerAR01 https://doi.org/10.1002/rsa.1010

Noga Alon Charles J. Colbourn Alan C. H. Ling Martin Tompa Equireplicate Balanced Binary Codes for Oligo Arrays. 481-497 2001 14 SIAM J. Discret. Math. 4 https://doi.org/10.1137/S0895480101383895 db/journals/siamdm/siamdm14.html#AlonCLT01

Noga Alon Benny Sudakov Uri Zwick Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. 58-72 2001 15 SIAM J. Discret. Math. 1 https://doi.org/10.1137/S0895480100379713 db/journals/siamdm/siamdm15.html#AlonSZ01

Noga Alon Richard Beigel Lower Bounds for Approximations by Low Degree Polynomials Over Zm. 184-187 https://doi.org/10.1109/CCC.2001.933885 https://doi.ieeecomputersociety.org/10.1109/CCC.2001.933885 2001 conf/coco/2001 CCC db/conf/coco/coco2001.html#AlonB01 Noga Alon Testing Subgraphs in Large Graphs. 434-441 2001 conf/focs/2001 FOCS db/conf/focs/focs2001.html#Alon01 https://doi.org/10.1109/SFCS.2001.959918 https://doi.ieeecomputersociety.org/10.1109/SFCS.2001.959918 Noga Alon Alexander Lubotzky Avi Wigderson Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications. 630-637 2001 conf/focs/2001 FOCS db/conf/focs/focs2001.html#AlonLW01 https://doi.org/10.1109/SFCS.2001.959939 https://doi.ieeecomputersociety.org/10.1109/SFCS.2001.959939 Noga Alon Tova Milo Frank Neven Dan Suciu Victor Vianu Typechecking XML Views of Relational Databases. 421-430 2001 conf/lics/2001 LICS db/conf/lics/lics2001.html#AlonMNSV01 https://doi.org/10.1109/LICS.2001.932517 https://doi.ieeecomputersociety.org/10.1109/LICS.2001.932517 Noga Alon Tova Milo Frank Neven Dan Suciu Victor Vianu XML with Data Values: Typechecking Revisited. 2001 conf/pods/2001 PODS db/conf/pods/pods2001.html#AlonMNSV01 https://doi.org/10.1145/375551.375570 http://www.acm.org/sigs/sigmod/pods/proc01/online/p29.pdf Noga Alon Michael R. Capalbo Yoshiharu Kohayakawa Vojtech Rödl Andrzej Rucinski 0001 Endre Szemerédi Near-optimum Universal Graphs for Graphs with Bounded Degrees. 170-180 2001 conf/random/2001 RANDOM-APPROX https://doi.org/10.1007/3-540-44666-4_20 https://www.wikidata.org/entity/Q105584927 db/conf/random/random2001.html#AlonCKRRS01 Richard Beigel Noga Alon Simon Kasif Mehmet Serkan Apaydin Lance Fortnow An optimal procedure for gap closing in whole genome shotgun sequencing. 22-30 2001 conf/recomb/2001 RECOMB https://doi.org/10.1145/369133.369152 db/conf/recomb/recomb2001.html#BeigelAKAF01 Noga Alon Benny Sudakov Uri Zwick Constructing worst case instances for semidefinite programming based approximation algorithms. 92-100 2001 conf/soda/2001 SODA http://dl.acm.org/citation.cfm?id=365411.365424 db/conf/soda/soda2001.html#AlonSZ01

Noga Alon Wenceslas Fernandez de la Vega Ravi Kannan Marek Karpinski Random Sampling and Approximation of MAX-CSP Problems Electron. Colloquium Comput. Complex. 2001 TR01 TR01-100 db/journals/eccc/eccc8.html#ECCC-TR01-100 https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-100/index.html

Noga Alon Joel H. Spencer The Probabilistic Method, Second Edition John Wiley 2000 978-0-47137046-8 978-0-47172215-1 https://doi.org/10.1002/0471722154

Noga Alon Eldar Fischer Michael Krivelevich Mario Szegedy Efficient Testing of Large Graphs. 451-476 2000 20 Comb. 4 https://doi.org/10.1007/s004930070001 https://www.wikidata.org/entity/Q105584595 db/journals/combinatorica/combinatorica20.html#AlonFKS00

Noga Alon Benny Sudakov Bipartite Subgraphs And The Smallest Eigenvalue. 2000 9 Comb. Probab. Comput. 1 db/journals/cpc/cpc9.html#AlonS00 http://journals.cambridge.org/action/displayAbstract?aid=46757 1-12

Noga Alon Miklós Bóna Joel Spencer Packing Ferrers Shapes. 2000 9 Comb. Probab. Comput. 3 db/journals/cpc/cpc9.html#AlonBS00 http://journals.cambridge.org/action/displayAbstract?aid=54641 205-211

Noga Alon János Körner Angelo Monti String Quartets In Binary. 2000 9 Comb. Probab. Comput. 5 db/journals/cpc/cpc9.html#AlonKM00 http://journals.cambridge.org/action/displayAbstract?aid=65797 381-390

Noga Alon Emanuela Fachini János Körner Locally Thin Set Families. 2000 9 Comb. Probab. Comput. 6 db/journals/cpc/cpc9.html#AlonFK00 http://journals.cambridge.org/action/displayAbstract?aid=72363 481-488

Alon Nilli Triangle-free graphs with large chromatic numbers. 261-262 2000 211 Discret. Math. https://doi.org/10.1016/S0012-365X(99)00109-0 db/journals/dm/dm211.html#Nilli00

Noga Alon Raphael Yuster EveryH-decomposition ofKnhas a Nearly Resolvable Alternative. 839-845 2000 21 Eur. J. Comb. 7 https://doi.org/10.1006/eujc.2000.0400 db/journals/ejc/ejc21.html#Yuster00

Noga Alon Ehud Friedgut On the Number of Permutations Avoiding a Given Pattern. 133-140 2000 89 J. Comb. Theory A 1 https://doi.org/10.1006/jcta.1999.3002 db/journals/jct/jcta89.html#AlonF00

Noga Alon Kenneth A. Berman Daniel J. Kleitman On a Problem in Shuffling. 5-14 2000 91 J. Comb. Theory A 1-2 https://doi.org/10.1006/jcta.2000.3087 db/journals/jct/jcta91.html#AlonBK00

Noga Alon András Gyárfás Miklós Ruszinkó Decreasing the diameter of bounded degree graphs. 161-172 2000 35 J. Graph Theory 3 https://doi.org/10.1002/1097-0118(200011)35:3<161::AID-JGT1>3.0.CO;2-Y db/journals/jgt/jgt35.html#AlonGR00

Noga Alon Michael Krivelevich Paul D. Seymour Long cycles in critical graphs. 193-196 2000 35 J. Graph Theory 3 https://doi.org/10.1002/1097-0118(200011)35:3<193::AID-JGT4>3.0.CO;2-G db/journals/jgt/jgt35.html#AlonKS00

Noga Alon Degrees and choice numbers. 364-368 2000 16 Random Struct. Algorithms 4 db/journals/rsa/rsa16.html#Alon00 https://doi.org/10.1002/1098-2418(200007)16:4<364::AID-RSA5>3.0.CO;2-0

Noga Alon Michael Krivelevich Ilan Newman Mario Szegedy Regular Languages are Testable with a Constant Number of Queries. 1842-1862 2000 30 SIAM J. Comput. 6 https://doi.org/10.1137/S0097539700366528 db/journals/siamcomp/siamcomp30.html#AlonKNS00

Noga Alon Michael R. Capalbo Yoshiharu Kohayakawa Vojtech Rödl Andrzej Rucinski 0001 Endre Szemerédi Universality and Tolerance. 14-21 2000 conf/focs/2000 FOCS db/conf/focs/focs2000.html#AlonCKRRS00 https://doi.org/10.1109/SFCS.2000.892007 https://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892007 https://www.wikidata.org/entity/Q105584774 Noga Alon Seannie Dar Michal Parnas Dana Ron Testing of Clustering. 240-250 2000 conf/focs/2000 FOCS db/conf/focs/focs2000.html#AlonDPR00 https://doi.org/10.1109/SFCS.2000.892111 https://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892111 Noga Alon Haim Kaplan Michael Krivelevich Dahlia Malkhi Julien P. Stern Scalable Secure Storage when Half the System Is Faulty. 576-587 https://doi.org/10.1007/3-540-45022-X_49 2000 conf/icalp/2000 ICALP db/conf/icalp/icalp2000.html#AlonKKMS00

Noga Alon Eldar Fischer Refining the Graph Density Condition for the Existence of Almost K-factors. 1999 52 Ars Comb. db/journals/arscom/arscom52.html#AlonF99

Noga Alon Michael Krivelevich Benny Sudakov List Coloring of Random and Pseudo-Random Graphs. 453-472 1999 19 Comb. 4 https://doi.org/10.1007/s004939970001 db/journals/combinatorica/combinatorica19.html#AlonKS99

Noga Alon Shmuel Onn Separable Partitions. 39-51 1999 91 Discret. Appl. Math. 1-3 https://doi.org/10.1016/S0166-218X(98)00142-5 db/journals/dam/dam91.html#AlonO99

Noga Alon Peter Hamburger Alexandr V. Kostochka Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs. 469-481 1999 20 Eur. J. Comb. 6 https://doi.org/10.1006/eujc.1998.0295 db/journals/ejc/ejc20.html#AlonHK99

Noga Alon Mario Szegedy Large Sets of Nearly Orthogonal Vectors. 1-4 1999 15 Graphs Comb. 1 https://doi.org/10.1007/PL00021187 db/journals/gc/gc15.html#AlonS99

Noga Alon Martin Dietzfelbinger Peter Bro Miltersen Erez Petrank Gábor Tardos Linear Hash Functions. 667-683 1999 46 J. ACM 5 https://doi.org/10.1145/324133.324179 db/journals/jacm/jacm46.html#AlonDMPT99

Noga Alon Benny Sudakov On Two Segmentation Problems. 173-184 1999 33 J. Algorithms 1 db/journals/jal/jal33.html#AlonS99 https://doi.org/10.1006/jagm.1999.1024

Noga Alon Yossi Matias Mario Szegedy The Space Complexity of Approximating the Frequency Moments. 137-147 1999 58 J. Comput. Syst. Sci. 1 db/journals/jcss/jcss58.html#AlonMS99 https://doi.org/10.1006/jcss.1997.1545 https://www.wikidata.org/entity/Q56386814

Noga Alon Lajos Rónyai Tibor Szabó Norm-Graphs: Variations and Applications. 280-290 1999 76 J. Comb. Theory B 2 https://doi.org/10.1006/jctb.1999.1906 https://www.wikidata.org/entity/Q29039716 db/journals/jct/jctb76.html#AlonRS99

Noga Alon Michael Krivelevich Benny Sudakov Coloring Graphs with Sparse Neighborhoods. 73-82 1999 77 J. Comb. Theory B 1 https://doi.org/10.1006/jctb.1999.1910 db/journals/jct/jctb77.html#AlonKS99

Noga Alon Imre Z. Ruzsa Non-averaging Subsets and Non-vanishing Transversals. 1-13 1999 86 1 J. Comb. Theory A https://doi.org/10.1006/jcta.1998.2926 db/journals/jct/jcta86.html#AlonR99

Alon Nilli Short odd cycles in 4-chromatic graphs. 145-147 1999 31 J. Graph Theory 2 https://doi.org/10.1002/(SICI)1097-0118(199906)31:2<145::AID-JGT7>3.0.CO;2-E db/journals/jgt/jgt31.html#Nilli99

Noga Alon Michael Krivelevich Ilan Newman Mario Szegedy Regular Languages Are Testable with a Constant Number of Queries. 645-655 1999 conf/focs/1999 FOCS https://doi.org/10.1109/SFFCS.1999.814641 https://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814641 db/conf/focs/focs99.html#AlonKNS99 Noga Alon Eldar Fischer Michael Krivelevich Mario Szegedy Efficient Testing of Large Graphs. 656-666 1999 conf/focs/1999 FOCS https://doi.org/10.1109/SFFCS.1999.814642 https://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814642 db/conf/focs/focs99.html#AlonFKS99 Noga Alon Phillip B. Gibbons Yossi Matias Mario Szegedy Tracking Join and Self-Join Sizes in Limited Storage. 10-20 1999 PODS db/conf/pods/pods99.html#AlonGMS99 conf/pods/99 https://doi.org/10.1145/303976.303978 DiSC2_1/out/papers/pods/trackingjoinandnophy.pdf ... conf/sigmod/AcharyaGPR99a conf/stoc/AlonMS96 journals/debu/BarbaraDFHHIJJNPRS97 conf/sigmod/GangulyGMS96 conf/sigmod/GibbonsM98 ... ... conf/vldb/GibbonsMP97 ... conf/sigmod/HaasH99 conf/sigmod/HellersteinHW97 conf/pods/HaasNSS93 conf/vldb/HaasNSS95 conf/pods/HouOT88 conf/sigmod/IoannidisP95 journals/jcss/LiptonN95 conf/sigmod/LiptonNS90 conf/sigmod/RajagopalanML98 ... phd/Poosala97 journals/toms/Vitter85 journals/tkde/VrbskyL93 Noga Alon Uri Arad Yossi Azar Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. 16-27 1999 conf/random/1999 RANDOM-APPROX db/conf/random/random1999.html#AlonAA99 https://doi.org/10.1007/978-3-540-48413-4_3

Noga Alon Yossi Azar János Csirik Leah Epstein Sergey V. Sevastianov Arjen P. A. Vestjens Gerhard J. Woeginger On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. 104-118 1998 21 Algorithmica 1 db/journals/algorithmica/algorithmica21.html#AlonACESVW98 https://doi.org/10.1007/PL00009203

Noga Alon The Shannon Capacity of a Union. 301-310 1998 18 Comb. 3 https://doi.org/10.1007/PL00009824 db/journals/combinatorica/combinatorica18.html#Alon98

Noga Alon Vojtech Rödl Andrzej Rucinski 0001 Perfect Matchings in ε-regular Graphs. 1998 5 Electron. J. Comb. https://doi.org/10.37236/1351 db/journals/combinatorics/combinatorics5.html#AlonRR98

Noga Alon Ayal Zaks T-choosability in Graphs. 1-13 1998 82 Discret. Appl. Math. 1-3 https://doi.org/10.1016/S0166-218X(97)00124-8 db/journals/dam/dam82.html#AlonZ98

Noga Alon Piercing d -Intervals. 333-334 1998 19 Discret. Comput. Geom. 3 https://doi.org/10.1007/PL00009349 https://www.wikidata.org/entity/Q100329012 db/journals/dcg/dcg19.html#Alon98

Noga Alon Eran Halperin Bipartite subgraphs of integer weighted graphs. 19-29 1998 181 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(97)00041-1 db/journals/dm/dm181.html#AlonH98

Noga Alon On the Capacity of Digraphs. 1-5 1998 19 Eur. J. Comb. 1 https://doi.org/10.1006/eujc.1997.0148 db/journals/ejc/ejc19.html#Alon98

Noga Alon Ayal Zaks Progressions in Sequences of Nearly Consecutive Integers. 99-109 1998 84 J. Comb. Theory A 1 https://doi.org/10.1006/jcta.1998.2886 db/journals/jct/jcta84.html#AlonZ98

Noga Alon Nabil Kahalé Approximating the independence number via the theta-function. 253-264 1998 80 Math. Program. db/journals/mp/mp80.html#AlonK98 https://doi.org/10.1007/BF01581168

Noga Alon Michael Krivelevich Benny Sudakov Finding a large hidden clique in a random graph. 457-466 1998 13 Random Struct. Algorithms 3-4 db/journals/rsa/rsa13.html#AlonKS98 https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4<457::AID-RSA14>3.0.CO;2-W

Noga Alon Spectral Techniques in Graph Algorithms. 206-215 https://doi.org/10.1007/BFb0054322 1998 conf/latin/1998 LATIN db/conf/latin/latin98.html#Alon98 Noga Alon Michael Krivelevich Benny Sudakov Finding a Large Hidden Clique in a Random Graph. 594-598 1998 conf/soda/1998 SODA db/conf/soda/soda98.html#AlonKS98 http://dl.acm.org/citation.cfm?id=314613.315014

Noga Alon Raphael Yuster Uri Zwick Finding and Counting Given Length Cycles. 209-223 1997 17 Algorithmica 3 db/journals/algorithmica/algorithmica17.html#AlonYZ97 https://doi.org/10.1007/BF02523189

Noga Alon Aravind Srinivasan Improved Parallel Approximation of a Class of Integer Programming Problems. 449-462 1997 17 Algorithmica 4 db/journals/algorithmica/algorithmica17.html#AlonS97 https://doi.org/10.1007/BF02523683

Noga Alon Michael Krivelevich The Concentration of the Chromatic Number of Random Graphs. 303-313 1997 17 Comb. 3 db/journals/combinatorica/combinatorica17.html#AlonK97 https://doi.org/10.1007/BF01215914

Noga Alon Miklós Ruszinkó Short Certificates for Tournaments. 1997 4 Electron. J. Comb. 1 https://doi.org/10.37236/1297 db/journals/combinatorics/combinatorics4.html#AlonR97

Noga Alon Daniel J. Kleitman A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture. 1997 4 Electron. J. Comb. 2 https://doi.org/10.37236/1316 https://www.wikidata.org/entity/Q123365202 db/journals/combinatorics/combinatorics4.html#AlonK97

Rudolf Ahlswede Noga Alon Péter L. Erdös Miklós Ruszinkó László A. Székely Intersecting Systems. 127-137 1997 6 Comb. Probab. Comput. 2 db/journals/cpc/cpc6.html#AhlswedeAERS97 http://journals.cambridge.org/action/displayAbstract?aid=46519

Noga Alon On the Edge-Expansion of Graphs. 145-152 1997 6 Comb. Probab. Comput. 2 db/journals/cpc/cpc6.html#Alon97 http://journals.cambridge.org/action/displayAbstract?aid=46517

Noga Alon Zsolt Tuza Margit Voigt Choosability and fractional chromatic numbers. 31-38 1997 165-166 Discret. Math. https://doi.org/10.1016/S0012-365X(96)00159-8 db/journals/dm/dm165.html#AlonTV97

Noga Alon Packings with large minimum kissing numbers. 249-251 1997 175 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(97)00071-X db/journals/dm/dm175.html#Alon97

Noga Alon Michael Krivelevich Constructive Bounds for a Ramsey-Type Problem. 217-225 1997 13 Graphs Comb. 3 https://doi.org/10.1007/BF03352998 db/journals/gc/gc13.html#AlonK97

Noga Alon Shai Ben-David Nicolò Cesa-Bianchi David Haussler Scale-sensitive dimensions, uniform convergence, and learnability. 615-631 1997 44 J. ACM 4 https://doi.org/10.1145/263867.263927 https://www.wikidata.org/entity/Q59538624 db/journals/jacm/jacm44.html#AlonBCH97

Noga Alon Dmitry N. Kozlov Coins with Arbitrary Weights. 162-176 1997 25 J. Algorithms 1 db/journals/jal/jal25.html#AlonK97 https://doi.org/10.1006/jagm.1997.0871

Noga Alon Zvi Galil Oded Margalit On the Exponent of the All Pairs Shortest Path Problem. 255-262 1997 54 J. Comput. Syst. Sci. 2 db/journals/jcss/jcss54.html#AlonGM97 https://doi.org/10.1006/jcss.1997.1388

Noga Alon Michael Tarsi A Note on Graph Colorings and Graph Polynomials. 197-201 1997 70 J. Comb. Theory B 1 https://doi.org/10.1006/jctb.1997.1753 db/journals/jct/jctb70.html#AlonT97

Noga Alon Yair Caro Raphael Yuster Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap. 144-161 1997 71 J. Comb. Theory B 2 https://doi.org/10.1006/jctb.1997.1768 db/journals/jct/jctb71.html#AlonCY97

Noga Alon Jeong Han Kim On the Degree, Size, and Chromatic Index of a Uniform Hypergraph. 165-170 1997 77 J. Comb. Theory A 1 https://doi.org/10.1006/jcta.1996.2728 db/journals/jct/jcta77.html#AlonK97

Noga Alon Van H. Vu Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs. 133-160 1997 79 J. Comb. Theory A 1 https://doi.org/10.1006/jcta.1997.2780 db/journals/jct/jcta79.html#AlonV97

Noga Alon Gregory Z. Gutin Properly colored Hamilton cycles in edge-colored complete graphs. 179-186 1997 11 Random Struct. Algorithms 2 db/journals/rsa/rsa11.html#AlonG97 https://doi.org/10.1002/(SICI)1098-2418(199709)11:2<179::AID-RSA5>3.0.CO;2-P

Noga Alon Nabil Kahalé A Spectral Technique for Coloring Random 3-Colorable Graphs. 1733-1748 1997 26 SIAM J. Comput. 6 db/journals/siamcomp/siamcomp26.html#AlonK97 https://doi.org/10.1137/S0097539794270248

Noga Alon Yossi Azar Gerhard J. Woeginger Tal Yadid Approximation Schemes for Scheduling. 493-500 1997 conf/soda/1997 SODA db/conf/soda/soda97.html#AlonAWY97 http://dl.acm.org/citation.cfm?id=314161.314371 Noga Alon Martin Dietzfelbinger Peter Bro Miltersen Erez Petrank Gábor Tardos Is Linear Hashing Good? 465-474 1997 conf/stoc/1997 STOC https://doi.org/10.1145/258533.258639 db/conf/stoc/stoc1997.html#AlonDMPT97

Noga Alon Moni Naor Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions. 434-449 1996 16 Algorithmica 4/5 db/journals/algorithmica/algorithmica16.html#AlonN96 https://doi.org/10.1007/BF01940874

Noga Alon Bipartite Subgraphs. 301-311 1996 16 Comb. 3 db/journals/combinatorica/combinatorica16.html#Alon96 https://doi.org/10.1007/BF01261315

Noga Alon Eldar Fischer 2-factors in dense graphs. 13-23 1996 152 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(95)00242-O db/journals/dm/dm152.html#AlonF96

Noga Alon Phillip G. Bradford Rudolf Fleischer Matching Nuts and Bolts Faster. 123-127 1996 59 Inf. Process. Lett. 3 db/journals/ipl/ipl59.html#AlonBF96 https://doi.org/10.1016/0020-0190(96)00104-4

Noga Alon Raphael Yuster H-Factors in Dense Graphs. 269-282 1996 66 J. Comb. Theory B 2 https://doi.org/10.1006/jctb.1996.0020 db/journals/jct/jctb66.html#AlonY96

Noga Alon Disjoint Directed Cycles. 167-178 1996 68 J. Comb. Theory, Ser. B 2 https://doi.org/10.1006/jctb.1996.0062 db/journals/jct/jctb68.html#Alon96

Noga Alon Michael R. Fellows Donovan R. Hare Vertex transversals that dominate. 21-31 1996 21 J. Graph Theory 1 https://doi.org/10.1002/(SICI)1097-0118(199601)21:1<21::AID-JGT3>3.0.CO;2-O db/journals/jgt/jgt21.html#AlonFH96

Noga Alon Colin McDiarmid Michael Molloy 0001 Edge-disjoint cycles in regular directed graphs. 231-237 1996 22 J. Graph Theory 3 https://doi.org/10.1002/(SICI)1097-0118(199607)22:3<231::AID-JGT3>3.0.CO;2-N db/journals/jgt/jgt22.html#AlonMM96

Noga Alon Paul Erdös Ron Holzman Michael Krivelevich On k-saturated graphs with restrictions on the degrees. 1-20 1996 23 J. Graph Theory 1 https://doi.org/10.1002/(SICI)1097-0118(199609)23:1<1::AID-JGT1>3.0.CO;2-O db/journals/jgt/jgt23.html#AlonEHK96

Noga Alon Pierre Kelsen Sanjeev Mahajan Ramesh Hariharan Approximate Hypergraph Coloring. 425-439 1996 3 Nord. J. Comput. 4 db/journals/njc/njc3.html#AlonKMH96

Noga Alon Independence numbers of locally sparse graphs and a Ramsey type problem. 271-278 1996 9 Random Struct. Algorithms 3 db/journals/rsa/rsa9.html#Alon96 https://doi.org/10.1002/(SICI)1098-2418(199610)9:3<271::AID-RSA1>3.0.CO;2-U

Noga Alon Alon Orlitsky Source coding and graph entropies. 1329-1339 1996 42 IEEE Trans. Inf. Theory 5 db/journals/tit/tit42.html#AlonO96 https://doi.org/10.1109/18.532875

Noga Alon Michael Luby A linear time erasure-resilient code with nearly optimal recovery. 1732-1736 1996 42 IEEE Trans. Inf. Theory 6 db/journals/tit/tit42.html#AlonL96 https://doi.org/10.1109/18.556669

Noga Alon János Csirik Sergey V. Sevastianov Arjen P. A. Vestjens Gerhard J. Woeginger On-line and Off-line Approximation Algorithms for Vector Covering Problems. 406-418 1996 conf/esa/1996 ESA db/conf/esa/esa96.html#AlonCSVW96 https://doi.org/10.1007/3-540-61680-2_71 Noga Alon Dmitry N. Kozlov Van H. Vu The Geometry of Coin-Weighing Problems. 524-532 1996 conf/focs/1996 FOCS db/conf/focs/focs96.html#AlonKV96 https://doi.org/10.1109/SFCS.1996.548511 https://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548511 Noga Alon Aravind Srinivasan Improved Parallel Approximation of a Class of Integer Programming Programming Problems. 562-573 1996 conf/icalp/1996 ICALP db/conf/icalp/icalp96.html#AlonS96 https://doi.org/10.1007/3-540-61440-0_159 Noga Alon Yossi Matias Mario Szegedy The Space Complexity of Approximating the Frequency Moments. 20-29 1996 conf/stoc/1996 STOC https://doi.org/10.1145/237814.237823 https://www.wikidata.org/entity/Q57482549 db/conf/stoc/stoc1996.html#AlonMS96 Noga Alon Derandomization Via Small Sample Spaces (Abstract). 1-3 1996 conf/swat/1996 SWAT db/conf/swat/swat96.html#Alon96 https://doi.org/10.1007/3-540-61422-2_115

Noga Alon Uriel Feige Avi Wigderson David Zuckerman Derandomized Graph Products. 60-75 1995 5 Comput. Complex. 1 db/journals/cc/cc5.html#AlonFWZ95 https://doi.org/10.1007/BF01277956

Noga Alon Moshe Dubiner A Lattice Point Problem and Additive Number Theory. 301-309 1995 15 Comb. 3 db/journals/combinatorica/combinatorica15.html#AlonD95 https://doi.org/10.1007/BF01299737 https://www.wikidata.org/entity/Q60568639

Noga Alon Joel Spencer Prasad Tetali Covering with Latin Transversals. 1-10 1995 57 Discret. Appl. Math. 1 https://doi.org/10.1016/0166-218X(93)E0136-M db/journals/dam/dam57.html#AlonST95

Noga Alon Gil Kalai Bounding the Piercing Number. 245-256 1995 13 Discret. Comput. Geom. db/journals/dcg/dcg13.html#AlonK95 https://doi.org/10.1007/BF02574042 https://www.wikidata.org/entity/Q100329014

Noga Alon Sridhar Rajagopalan Subhash Suri Long Non-Crossing Configurations in the Plane. 385-394 1995 22 Fundam. Informaticae 4 db/journals/fuin/fuin22.html#AlonRS95 https://doi.org/10.3233/FI-1995-2245

Noga Alon Yishay Mansour epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials. 337-342 1995 54 Inf. Process. Lett. 6 db/journals/ipl/ipl54.html#AlonM95 https://doi.org/10.1016/0020-0190(95)00032-8

Noga Alon Raphael Yuster Uri Zwick Color-Coding. 844-856 1995 42 J. ACM 4 db/journals/jacm/jacm42.html#AlonYZ95 https://doi.org/10.1145/210332.210337 https://www.wikidata.org/entity/Q56639265

Noga Alon Raphael Yuster The 123 Theorem and Its Extensions. 322-331 1995 72 J. Comb. Theory A 2 db/journals/jct/jcta72.html#AlonY95

Noga Alon Benny Sudakov Disjoint Systems. 13-20 1995 6 Random Struct. Algorithms 1 db/journals/rsa/rsa6.html#AlonS95 https://doi.org/10.1002/rsa.3240060103

Noga Alon Zsolt Tuza The Acyclic Orientation Game on Random Graphs. 261-268 1995 6 Random Struct. Algorithms 2/3 db/journals/rsa/rsa6.html#AlonT95 https://doi.org/10.1002/rsa.3240060213

Noga Alon Alan M. Frieze Dominic Welsh Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. 459-478 1995 6 Random Struct. Algorithms 4 db/journals/rsa/rsa6.html#AlonFW95 https://doi.org/10.1002/rsa.3240060409 https://www.wikidata.org/entity/Q29393798

Noga Alon Richard M. Karp David Peleg Douglas B. West A Graph-Theoretic Game and Its Application to the k-Server Problem. 78-100 1995 24 SIAM J. Comput. 1 db/journals/siamcomp/siamcomp24.html#AlonKPW95 https://doi.org/10.1137/S0097539792224474 https://www.wikidata.org/entity/Q106158661

Noga Alon Alon Orlitsky Repeated communication and Ramsey graphs. 1276-1289 1995 41 IEEE Trans. Inf. Theory 5 db/journals/tit/tit41.html#AlonO95 https://doi.org/10.1109/18.412676

Noga Alon Zvi Galil Moti Yung Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. 523-537 1995 conf/esa/1995 ESA db/conf/esa/esa95.html#AlonGY95 https://doi.org/10.1007/3-540-60313-1_168 Noga Alon Jeff Edmonds Michael Luby Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). 512-519 1995 conf/focs/1995 FOCS db/conf/focs/focs95.html#AlonEL95 https://doi.org/10.1109/SFCS.1995.492581 https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492581

Noga Alon Explicit Ramsey graphs and orthonormal labelings. 1994 1 Electron. J. Comb. https://doi.org/10.37236/1192 https://www.wikidata.org/entity/Q105585034 db/journals/combinatorics/combinatorics1.html#Alon94

Alon Nilli Perfect Hashing and Probability. 407-409 1994 3 Comb. Probab. Comput. db/journals/cpc/cpc3.html#Nilli94 https://doi.org/10.1017/S0963548300001280

Pankaj K. Agarwal Noga Alon Boris Aronov Subhash Suri Can Visibility Graphs Be Represented Compactly?. 347-365 1994 12 Discret. Comput. Geom. db/journals/dcg/dcg12.html#AgarwalAAS94 https://doi.org/10.1007/BF02574385 https://www.wikidata.org/entity/Q56001794

Noga Alon Probabilistic methods in coloring and decomposition problems. 31-46 1994 127 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(92)00465-4 db/journals/dm/dm127.html#Alon94

Noga Alon Packing of partial designs. 11-18 1994 10 Graphs Comb. 1 https://doi.org/10.1007/BF01202465 db/journals/gc/gc10.html#Alon94

Noga Alon Nimrod Megiddo Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. 422-434 1994 41 J. ACM 2 db/journals/jacm/jacm41.html#AlonM94 https://doi.org/10.1145/174652.174661

Noga Alon Richard A. Duke Hanno Lefmann Vojtech Rödl Raphael Yuster The Algorithmic Aspects of the Regularity Lemma. 80-109 1994 16 J. Algorithms 1 db/journals/jal/jal16.html#AlonDLRY94 https://doi.org/10.1006/jagm.1994.1005 https://www.wikidata.org/entity/Q105583227

Noga Alon Pavel Pudlák Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely). 194-202 1994 48 J. Comput. Syst. Sci. 1 db/journals/jcss/jcss48.html#AlonP94 https://doi.org/10.1016/S0022-0000(05)80027-3

Noga Alon Subdivided graphs have linear ramsey numbers. 343-347 1994 18 J. Graph Theory 4 https://doi.org/10.1002/jgt.3190180406 db/journals/jgt/jgt18.html#Alon94

Noga Alon Yuval Roichman Random Cayley Graphs and Expanders. 271-285 1994 5 Random Struct. Algorithms 2 db/journals/rsa/rsa5.html#AlonR94 https://doi.org/10.1002/rsa.3240050203

Noga Alon Jehoshua Bruck Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition. 1-8 1994 7 SIAM J. Discret. Math. 1 https://doi.org/10.1137/S0895480191218496 db/journals/siamdm/siamdm7.html#AlonB94

Noga Alon Paul D. Seymour Robin Thomas 0001 Planar Separators. 184-193 1994 7 SIAM J. Discret. Math. 2 https://doi.org/10.1137/S0895480191198768 db/journals/siamdm/siamdm7.html#AlonST94

Noga Alon Fan R. K. Chung Ronald L. Graham Routing Permutations on Graphs Via Matchings. 513-530 1994 7 SIAM J. Discret. Math. 3 https://doi.org/10.1137/S0895480192236628 db/journals/siamdm/siamdm7.html#AlonCG94

Noga Alon Gil Kalai Moty Ricklin Larry J. Stockmeyer Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. 175-201 1994 130 Theor. Comput. Sci. 1 db/journals/tcs/tcs130.html#AlonKRS94 https://doi.org/10.1016/0304-3975(94)90158-9

Noga Alon Alon Orlitsky A lower bound on the expected length of one-to-one codes. 1670-1672 1994 40 IEEE Trans. Inf. Theory 5 db/journals/tit/tit40.html#AlonO94 https://doi.org/10.1109/18.333891 https://www.wikidata.org/entity/Q114830306

Noga Alon Raphael Yuster Uri Zwick Finding and Counting Given Length Cycles (Extended Abstract). 354-364 1994 conf/esa/1994 ESA db/conf/esa/esa94.html#AlonYZ94 https://doi.org/10.1007/BFb0049422 https://www.wikidata.org/entity/Q60299182 Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs Noga Alon Alan M. Frieze Dominic Welsh 24-35 conf/focs/FOCS35 1994 FOCS db/conf/focs/focs94.html#AlonFW94 https://doi.org/10.1109/SFCS.1994.365708 https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365708 Noga Alon Manuel Blum 0001 Amos Fiat Sampath Kannan Moni Naor Rafail Ostrovsky Matching Nuts and Bolts. 690-696 1994 conf/soda/1994 SODA db/conf/soda/soda94.html#AlonBFKNO94 http://dl.acm.org/citation.cfm?id=314464.314673 Noga Alon Raphael Yuster Uri Zwick Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. 326-335 1994 conf/stoc/STOC26 STOC https://doi.org/10.1145/195058.195179 db/conf/stoc/stoc1994.html#AlonYZ94 Noga Alon Nabil Kahalé A spectral technique for coloring random 3-colorable graphs (preliminary version). 346-355 1994 conf/stoc/STOC26 STOC https://doi.org/10.1145/195058.195187 db/conf/stoc/stoc1994.html#AlonK94

Noga Alon Alan M. Frieze Dominic Welsh Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case Electron. Colloquium Comput. Complex. 1994 TR94 TR94-005 db/journals/eccc/eccc1.html#ECCC-TR94-005 https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-005/index.html

Noga Alon Raphael Yuster Uri Zwick Color-Coding Electron. Colloquium Comput. Complex. 1994 TR94 TR94-009 db/journals/eccc/eccc1.html#ECCC-TR94-009 https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-009/index.html

Noga Alon Raphael Yuster Threshold Functions for H-factors. 137-144 1993 2 Comb. Probab. Comput. db/journals/cpc/cpc2.html#AlonY93 https://doi.org/10.1017/S0963548300000559

Noga Alon Yossi Azar On-Line Steine Trees in the Euclidean Plane. 113-121 1993 10 Discret. Comput. Geom. db/journals/dcg/dcg10.html#AlonA93 https://doi.org/10.1007/BF02573969

Noga Alon Yair Caro Ilia Krasikov Bisection of trees and sequences. 3-7 1993 114 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(93)90350-3 db/journals/dm/dm114.html#AlonCK93

Noga Alon Zoltán Füredi Covering the Cube by Affine Hyperplanes. 79-83 1993 14 Eur. J. Comb. 2 https://doi.org/10.1006/eujc.1993.1011 db/journals/ejc/ejc14.html#AlonF93

Noga Alon Yair Caro On three zero-sum Ramsey-type problems. 177-192 1993 17 J. Graph Theory 2 https://doi.org/10.1002/jgt.3190170207 db/journals/jgt/jgt17.html#AlonC93

Noga Alon Oded Goldreich 0001 Johan Håstad René Peralta 0001 Addendum to "Simple Construction of Almost k-wise Independent Random Variables". 119-120 1993 4 Random Struct. Algorithms 1 db/journals/rsa/rsa4.html#AlonGHP93 https://doi.org/10.1002/rsa.3240040109

Noga Alon Moni Naor Coin-Flipping Games Immune Against Linear-Sized Coalitions. 403-417 1993 22 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp22.html#AlonN93 https://doi.org/10.1137/0222030

Noga Alon Sridhar Rajagopalan Subhash Suri Long Non-Crossing Configurations in the Plane. 257-263 1993 conf/compgeom/1993 SCG https://doi.org/10.1145/160985.161145 db/conf/compgeom/compgeom93.html#AlonRS93 Pankaj K. Agarwal Noga Alon Boris Aronov Subhash Suri Can Visibility Graphs be Represented Compactly? 338-347 1993 conf/compgeom/1993 SCG https://doi.org/10.1145/160985.161160 db/conf/compgeom/compgeom93.html#AgarwalAAS93 Noga Alon Benny Sudakov Disjoint Systems (Extended Abstract). 159-163 1993 conf/fiwac/1993 Algebraic Coding db/conf/fiwac/fiwac1993.html#AlonS93 https://doi.org/10.1007/3-540-57843-9_17 Scale-sensitive Dimensions, Uniform Convergence, and Learnability Noga Alon Shai Ben-David Nicolò Cesa-Bianchi David Haussler 292-301 conf/focs/FOCS34 1993 FOCS db/conf/focs/focs93.html#AlonBCH93 https://doi.org/10.1109/SFCS.1993.366858 https://doi.ieeecomputersociety.org/10.1109/SFCS.1993.366858 https://www.wikidata.org/entity/Q59538635 Noga Alon Fan R. K. Chung Ronald L. Graham Routing permutations on graphs via matchings. 583-591 1993 conf/stoc/STOC25 STOC https://doi.org/10.1145/167088.167239 db/conf/stoc/stoc1993.html#AlonCG93 Noga Alon Joel Spencer The Probabilistic Method John Wiley 1992 0-471-53588-5 http://cs.nyu.edu/cs/faculty/spencer/nogabook/nogabook.html

Noga Alon Michael Tarsi Colorings and orientations of graphs. 125-134 1992 12 Comb. 2 db/journals/combinatorica/combinatorica12.html#AlonT92 https://doi.org/10.1007/BF01204715 https://www.wikidata.org/entity/Q56390729

Noga Alon Colin McDiarmid Bruce A. Reed Star arboricity. 375-380 1992 12 Comb. 4 db/journals/combinatorica/combinatorica12.html#AlonMR92 https://doi.org/10.1007/BF01305230

Noga Alon Choice Numbers of Graphs: a Probabilistic Approach. 107-114 1992 1 Comb. Probab. Comput. db/journals/cpc/cpc1.html#Alon92 https://doi.org/10.1017/S0963548300000122

Noga Alon Imre Bárány Zoltán Füredi Daniel J. Kleitman Point Selections and Weak e-Nets for Convex Hulls. 189-200 1992 1 Comb. Probab. Comput. db/journals/cpc/cpc1.html#AlonBFK92 https://doi.org/10.1017/S0963548300000225 https://www.wikidata.org/entity/Q101133139

Noga Alon Transmitting in the n-Dimensional Cube. 9-11 1992 37/38 Discret. Appl. Math. db/journals/dam/dam37.html#Alon92 https://doi.org/10.1016/0166-218X(92)90121-P

Noga Alon Daniel J. Kleitman Partitioning a rectangle into small perimeter rectangles. 111-119 1992 103 Discret. Math. 2 https://doi.org/10.1016/0012-365X(92)90261-D db/journals/dm/dm103.html#AlonK92

Noga Alon Edward R. Scheinerman Generalized sum graphs. 23-29 1992 8 Graphs Comb. 1 https://doi.org/10.1007/BF01271705 db/journals/gc/gc8.html#AlonS92

Noga Alon Zoltán Füredi Spanning subgraphs of random graphs. 91-94 1992 8 Graphs Comb. 1 https://doi.org/10.1007/BF01271712 https://www.wikidata.org/entity/Q105583433 db/journals/gc/gc8.html#AlonF92

Noga Alon Raphael Yuster AlmostH-factors in dense graphs. 95-102 1992 8 Graphs Comb. 2 https://doi.org/10.1007/BF02350627 db/journals/gc/gc8.html#AlonY92

Noga Alon Amotz Bar-Noy Nathan Linial David Peleg Single Round Simulation on Radio Networks. 188-210 1992 13 J. Algorithms 2 db/journals/jal/jal13.html#AlonBLP92 https://doi.org/10.1016/0196-6774(92)90015-5 https://www.wikidata.org/entity/Q132858658

Noga Alon The String Chromatic Number of a Graph. 1-8 1992 3 Random Struct. Algorithms 1 db/journals/rsa/rsa3.html#Alan92 https://doi.org/10.1002/rsa.3240030102 https://www.wikidata.org/entity/Q56390830

Noga Alon Oded Goldreich 0001 Johan Håstad René Peralta 0001 Simple Construction of Almost k-wise Independent Random Variables. 289-304 1992 3 Random Struct. Algorithms 3 db/journals/rsa/rsa3.html#AlonGHP92 https://doi.org/10.1002/rsa.3240030308 https://www.wikidata.org/entity/Q56959163

Noga Alon Jehoshua Bruck Joseph Naor Moni Naor Ron M. Roth Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. 509-516 1992 38 IEEE Trans. Inf. Theory 2 db/journals/tit/tit38.html#AlonBNNR92 https://doi.org/10.1109/18.119713

Noga Alon Daniel J. Kleitman Piercing Convex Sets. 157-160 1992 conf/compgeom/1992 SCG https://doi.org/10.1145/142675.142711 db/conf/compgeom/compgeom92.html#AlonK92 Noga Alon Yossi Azar On-Line Steiner Trees in the Euclidean Plane. 337-343 1992 conf/compgeom/1992 SCG https://doi.org/10.1145/142675.142744 db/conf/compgeom/compgeom92.html#AlonA92 Noga Alon Yuval Roichman Random Cayley Graphs and Expanders (Abstract). 1-3 1992 Expanding Graphs conf/dimacs/dimacs10 db/conf/dimacs/dimacs10.html#AlonR92 https://doi.org/10.1090/dimacs/010/01 Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract) Noga Alon Gil Kalai Moty Ricklin Larry J. Stockmeyer 334-343 conf/focs/FOCS33 1992 FOCS db/conf/focs/focs92.html#AlonKRS92 https://doi.org/10.1109/SFCS.1992.267757 https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267757 Witnesses for Boolean Matrix Multiplication and for Shortest Paths Noga Alon Zvi Galil Oded Margalit Moni Naor 417-426 conf/focs/FOCS33 1992 FOCS db/conf/focs/focs92.html#AlonGMN92 https://doi.org/10.1109/SFCS.1992.267748 https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267748 The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) Noga Alon Richard A. Duke Hanno Lefmann Vojtech Rödl Raphael Yuster 473-481 conf/focs/FOCS33 1992 FOCS db/conf/focs/focs92.html#AlonDLRY92 https://doi.org/10.1109/SFCS.1992.267804 https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267804 Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths Miklós Ajtai Noga Alon Jehoshua Bruck Robert Cypher Ching-Tien Ho Moni Naor Endre Szemerédi 693-702 conf/focs/FOCS33 1992 FOCS db/conf/focs/focs92.html#AjtaiABCHNS92 https://doi.org/10.1109/SFCS.1992.267781 https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267781 Noga Alon Yossi Azar Comparison-Sorting and Selecting in Totally Monotone Matrices. 403-408 1992 conf/soda/1992 SODA http://dl.acm.org/citation.cfm?id=139404.139484 db/conf/soda/soda92.html#AlonA92

Noga Alon Yossi Azar Parallel comparison algorithms for approximation problems. 97-122 1991 11 Comb. 2 db/journals/combinatorica/combinatorica11.html#AlonA91 https://doi.org/10.1007/BF01206355

Alon Nilli On the second eigenvalue of a graph. 207-210 1991 91 Discret. Math. 2 https://doi.org/10.1016/0012-365X(91)90112-F db/journals/dm/dm91.html#Nilli91

Noga Alon András Hajnal Ramsey graphs contain many distinct induced subgraphs. 1-6 1991 7 Graphs Comb. 1 https://doi.org/10.1007/BF01789457 db/journals/gc/gc7.html#AlonH91

Noga Alon Daniel J. Kleitman Richard J. Lipton Roy Meshulam Michael O. Rabin Joel H. Spencer Set systems with no union of cardinality 0 modulom. 97-99 1991 7 Graphs Comb. 2 https://doi.org/10.1007/BF01788135 db/journals/gc/gc7.html#AlonKLMRS91

Noga Alon A. K. Dewdney Teunis J. Ott Efficient Simulation of Finite Automata by Neural Nets. 495-514 1991 38 J. ACM 2 db/journals/jacm/jacm38.html#AlonDO91 https://doi.org/10.1145/103516.103523

Noga Alon Amotz Bar-Noy Nathan Linial David Peleg A Lower Bound for Radio Broadcast. 290-298 1991 43 J. Comput. Syst. Sci. 2 db/journals/jcss/jcss43.html#AlonBLP91 https://doi.org/10.1016/0022-0000(91)90015-W

Noga Alon Richard A. Brualdi Bryan L. Shader Multicolored forests in bipartite decompositions of graphs. 143-148 1991 53 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(91)90059-S db/journals/jct/jctb53.html#AlonBS91a

Noga Alon Nathan Linial Roy Meshulam Additive bases of vector spaces over prime fields. 203-210 1991 57 J. Comb. Theory A 2 https://doi.org/10.1016/0097-3165(91)90045-I db/journals/jct/jcta57.html#AlonLM91

Noga Alon László Babai Hiroshi Suzuki Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems. 165-180 1991 58 J. Comb. Theory A 2 https://doi.org/10.1016/0097-3165(91)90058-O db/journals/jct/jcta58.html#AlonBS91

Noga Alon Colin McDiarmid Bruce A. Reed Acyclic Coloring of Graphs. 277-288 1991 2 Random Struct. Algorithms 3 db/journals/rsa/rsa2.html#AlonMR91 https://doi.org/10.1002/rsa.3240020303 https://www.wikidata.org/entity/Q60698846

Noga Alon A Parallel Algorithmic Version of the Local Lemma. 367-378 1991 2 Random Struct. Algorithms 4 db/journals/rsa/rsa2.html#Alon91 https://doi.org/10.1002/rsa.3240020403 https://www.wikidata.org/entity/Q124968806

Noga Alon Richard M. Karp David Peleg Douglas B. West A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract). 1-10 1991 On-Line Algorithms conf/dimacs/dimacs7 db/conf/dimacs/dimacs7.html#AlonKPW91 https://doi.org/10.1090/dimacs/007/01 On the Exponent of the All Pairs Shortest Path Problem Noga Alon Zvi Galil Oded Margalit 569-575 conf/focs/FOCS32 1991 FOCS db/conf/focs/focs91.html#AlonGM91 A parallel algorithmic version of the Local Lemma Noga Alon 586-593 conf/focs/FOCS32 1991 FOCS db/conf/focs/focs91.html#Alon91 https://doi.org/10.1109/SFCS.1991.185423 https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185423

Noga Alon The maximum number of Hamiltonian paths in tournaments. 319-324 1990 10 Comb. 4 db/journals/combinatorica/combinatorica10.html#Alon90 https://doi.org/10.1007/BF02128667

Noga Alon Yossi Azar Yiftach Ravid Universal sequences for complete graphs. 25-28 1990 27 Discret. Appl. Math. 1-2 https://doi.org/10.1016/0166-218X(90)90125-V db/journals/dam/dam27.html#AlonAR90

Noga Alon The CW-Inequalities for Vectors in l1. 1-5 1990 11 Eur. J. Comb. 1 https://doi.org/10.1016/S0195-6698(13)80049-2 db/journals/ejc/ejc11.html#Alon90

Noga Alon Meir Katchalski Edward R. Scheinerman Not All Graphs are Segment T-graphs. 7-13 1990 11 Eur. J. Comb. 1 https://doi.org/10.1016/S0195-6698(13)80050-9 db/journals/ejc/ejc11.html#AlonKS90

Noga Alon Transversal numbers of uniform hypergraphs. 1-4 1990 6 Graphs Comb. 1 https://doi.org/10.1007/BF01787474 db/journals/gc/gc6.html#Alon90

Noga Alon Generating Pseudo-Random Permutations and Maximum Flow Algorithms. 201-204 1990 35 Inf. Process. Lett. 4 db/journals/ipl/ipl35.html#Alon90 https://doi.org/10.1016/0020-0190(90)90024-R

Noga Alon Ramsey graphs cannot be defined by real polynomials. 651-661 1990 14 J. Graph Theory 6 https://doi.org/10.1002/jgt.3190140605 db/journals/jgt/jgt14.html#Alon90

Noga Alon The Number of Spanning Trees in Regular Graphs. 175-182 1990 1 Random Struct. Algorithms 2 db/journals/rsa/rsa1.html#Alon90 https://doi.org/10.1002/rsa.3240010204

Noga Alon Mauricio Karchmer Avi Wigderson Linear Circuits over GF(2). 1064-1067 1990 19 SIAM J. Comput. 6 db/journals/siamcomp/siamcomp19.html#AlonKW90 https://doi.org/10.1137/0219074

Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract) Noga Alon Moni Naor 46-54 conf/focs/FOCS31a 1990 FOCS db/conf/focs/focs90.html#AlonN90 https://doi.org/10.1109/FSCS.1990.89523 https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89523 Simple Constructions of Almost k-Wise Independent Random Variables Noga Alon Oded Goldreich 0001 Johan Håstad René Peralta 0001 544-553 conf/focs/FOCS31b 1990 FOCS db/conf/focs/focs90.html#AlonGHP90 https://doi.org/10.1109/FSCS.1990.89575 https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89575 Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time Noga Alon Nimrod Megiddo 574-582 conf/focs/FOCS31b 1990 FOCS db/conf/focs/focs90.html#AlonM90 https://doi.org/10.1109/FSCS.1990.89578 https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89578 A Separator Theorem for Graphs with an Excluded Minor and its Applications Noga Alon Paul D. Seymour Robin Thomas 0001 293-299 conf/stoc/STOC22 1990 STOC db/conf/stoc/stoc90.html#AlonST90 https://doi.org/10.1145/100216.100254

Noga Alon Michael O. Rabin Biased Coins and Randomized Algorithms. 499-507 1989 5 Adv. Comput. Res. db/journals/acr/acr5.html#AlonR89

Noga Alon Michael Tarsi A nowhere-zero point in liner mappings. 393-396 1989 9 Comb. 4 db/journals/combinatorica/combinatorica9.html#AlonT89 https://doi.org/10.1007/BF02125351 https://www.wikidata.org/entity/Q64117605

Noga Alon Meir Katchalski William R. Pulleyblank Cutting Disjoint Disks by Straight Lines. 239-243 1989 4 Discret. Comput. Geom. db/journals/dcg/dcg4.html#AlonKP89 https://doi.org/10.1007/BF02187724

Noga Alon Meir Katchalski William R. Pulleyblank The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. 245-251 1989 4 Discret. Comput. Geom. db/journals/dcg/dcg4.html#AlonKP89a https://doi.org/10.1007/BF02187725

Noga Alon Paul Erdös Disjoint Edges in Geometric Graphs. 287-290 1989 4 Discret. Comput. Geom. db/journals/dcg/dcg4.html#AlonE89 https://doi.org/10.1007/BF02187731 https://www.wikidata.org/entity/Q59701087

I. Algor Noga Alon The star arboricity of graphs. 11-22 1989 75 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(89)90073-3 db/journals/dm/dm75.html#AlgorA89

Noga Alon Béla Bollobás Graphs with a small number of distinct induced subgraphs. 23-30 1989 75 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(89)90074-5 db/journals/dm/dm75.html#AlonB89

Noga Alon Zoltán Füredi Legitimate colorings of projective planes. 95-106 1989 5 Graphs Comb. 1 https://doi.org/10.1007/BF01788662 db/journals/gc/gc5.html#AlonF89

Noga Alon Yair Caro Zsolt Tuza Sub-Ramsey numbers for arithmetic progressions. 307-314 1989 5 Graphs Comb. 1 https://doi.org/10.1007/BF01788685 db/journals/gc/gc5.html#AlonCT89

Noga Alon Nathan Linial Cycles of length 0 modulo k in directed graphs. 114-119 1989 47 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(89)90071-3 db/journals/jct/jctb47.html#AlonL89

Noga Alon Yair Caro Ilia Krasikov Yehuda Roditty Combinatorial reconstruction problems. 153-161 1989 47 J. Comb. Theory B 2 https://doi.org/10.1016/0095-8956(89)90016-6 https://www.wikidata.org/entity/Q56213622 db/journals/jct/jctb47.html#AlonCKR89

Noga Alon Joel H. Spencer Ascending waves. 275-287 1989 52 J. Comb. Theory A 2 https://doi.org/10.1016/0097-3165(89)90033-2 db/journals/jct/jcta52.html#AlonS89

Noga Alon Paul D. Seymour A counterexample to the rank-coloring conjecture. 523-525 1989 13 J. Graph Theory 4 https://doi.org/10.1002/jgt.3190130413 https://www.wikidata.org/entity/Q123346984 db/journals/jgt/jgt13.html#AlonS89

Noga Alon Yossi Azar Finding an Approximate Maximum. 258-267 1989 18 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp18.html#AlonA89 https://doi.org/10.1137/0218017

Noga Alon Uri Zwick On Neciporuk's Theorem for Branching Programs. 331-342 1989 64 Theor. Comput. Sci. 3 db/journals/tcs/tcs64.html#AlonZ89 https://doi.org/10.1016/0304-3975(89)90054-6

On the Complexity of Radio Communication (Extended Abstract) Noga Alon Amotz Bar-Noy Nathan Linial David Peleg 274-285 conf/stoc/STOC21 1989 STOC db/conf/stoc/stoc89.html#AlonBLP89 https://doi.org/10.1145/73007.73033

Noga Alon Gregory Freiman On sums of subsets of a set of integers. 297-306 1988 8 Comb. 4 db/journals/combinatorica/combinatorica8.html#AlonF88 https://doi.org/10.1007/BF02189086

Noga Alon Sums of subsequences modulo prime powers. 87-88 1988 71 Discret. Math. 1 https://doi.org/10.1016/0012-365X(88)90032-5 db/journals/dm/dm71.html#Alon88

Noga Alon Fan R. K. Chung Explicit construction of linear sized tolerant networks. 15-19 1988 72 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(88)90189-6 https://www.wikidata.org/entity/Q105583521 db/journals/dm/dm72.html#AlonC88

Noga Alon Z. Bregman Every 8-uniform 8-regular hypergraph is 2-colorable. 303-306 1988 4 Graphs Comb. 1 https://doi.org/10.1007/BF01864169 db/journals/gc/gc4.html#AlonB88

Noga Alon Wolfgang Maass 0001 Meanders and Their Applications in Lower Bounds Arguments. 118-129 1988 37 J. Comput. Syst. Sci. 2 db/journals/jcss/jcss37.html#AlonM88 https://doi.org/10.1016/0022-0000(88)90002-5

Alon Nilli The average size of an independent set in graphs with a given chromatic number. 112-114 1988 45 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(88)90060-3 db/journals/jct/jctb45.html#Nilli88

Noga Alon Yossi Azar The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. 1178-1192 1988 17 SIAM J. Comput. 6 db/journals/siamcomp/siamcomp17.html#AlonA88 https://doi.org/10.1137/0217074

Noga Alon Yossi Azar Sorting, Approximate Sorting, and Searching in Rounds. 269-280 1988 1 SIAM J. Discret. Math. 3 db/journals/siamdm/siamdm1.html#AlonA88 https://doi.org/10.1137/0401028

Noga Alon Ernest E. Bergmann Don Coppersmith Andrew M. Odlyzko Balancing sets of vectors. 128-130 1988 34 IEEE Trans. Inf. Theory 1 db/journals/tit/tit34.html#AlonBCO88 https://doi.org/10.1109/18.2610

Parallel Comparison Algorithms for Approximation Problems Noga Alon Yossi Azar 194-203 conf/focs/FOCS29 1988 FOCS db/conf/focs/focs88.html#AlonA88 https://doi.org/10.1109/SFCS.1988.21937 https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21937

Noga Alon Ravi B. Boppana The monotone circuit complexity of Boolean functions. 1-22 1987 7 Comb. 1 db/journals/combinatorica/combinatorica7.html#AlonB87 https://doi.org/10.1007/BF02579196 https://www.wikidata.org/entity/Q30000144

Noga Alon Daniel J. Kleitman Carl Pomerance Michael E. Saks Paul D. Seymour The smallets n-uniform hypergraph with positive discrepancy. 151-160 1987 7 Comb. 2 db/journals/combinatorica/combinatorica7.html#AlonKPSS87 https://doi.org/10.1007/BF02579446

Noga Alon Zoltán Füredi On the kernel of intersecting families. 91-94 1987 3 Graphs Comb. 1 https://doi.org/10.1007/BF01788533 db/journals/gc/gc3.html#AlonF87

Noga Alon Jeff Kahn 0001 Paul D. Seymour Large induced degenerate subgraphs. 203-211 1987 3 Graphs Comb. 1 https://doi.org/10.1007/BF01788542 db/journals/gc/gc3.html#AlonKS87

Noga Alon Zvi Galil V. D. Milman Better Expanders and Superconcentrators. 337-347 1987 8 J. Algorithms 3 db/journals/jal/jal8.html#AlonGM87 https://doi.org/10.1016/0196-6774(87)90014-9

Noga Alon Daniel J. Kleitman Carsten Thomassen Michael E. Saks Paul D. Seymour Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. 367-371 1987 11 J. Graph Theory 3 https://doi.org/10.1002/jgt.3190110311 db/journals/jgt/jgt11.html#AlonKTSS87

Noga Alon David Haussler Emo Welzl Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. 331-340 1987 conf/compgeom/1987 SCG https://doi.org/10.1145/41958.41994 https://www.wikidata.org/entity/Q56214747 db/conf/compgeom/compgeom87.html#AlonHW87 The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms Noga Alon Yossi Azar 489-498 conf/focs/FOCS28 1987 FOCS db/conf/focs/focs87.html#AlonA87 https://doi.org/10.1109/SFCS.1987.54 https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.54 Noga Alon Amnon Barak Udi Manber On Disseminating Information Reliably without Broadcasting. 74-81 1987 conf/icdcs/1987 ICDCS db/conf/icdcs/icdcs87.html#AlonBM87

Noga Alon Eigenvalues and expanders. 83-96 1986 6 Comb. 2 db/journals/combinatorica/combinatorica6.html#Alon86 https://doi.org/10.1007/BF02579166 https://www.wikidata.org/entity/Q97007656

Noga Alon Covering graphs by the minimum number of equivalence relations. 201-206 1986 6 Comb. 3 db/journals/combinatorica/combinatorica6.html#Alon86a https://doi.org/10.1007/BF02579381 https://www.wikidata.org/entity/Q100329040

Noga Alon Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory. 207-219 1986 6 Comb. 3 db/journals/combinatorica/combinatorica6.html#Alon86b https://doi.org/10.1007/BF02579382 https://www.wikidata.org/entity/Q56047325

Noga Alon Daniel J. Kleitman Covering a Square by Small Perimeter Rectangles. 1-7 1986 1 Discret. Comput. Geom. db/journals/dcg/dcg1.html#AlonK86 https://doi.org/10.1007/BF02187679

Noga Alon Explicit construction of exponential sized families of k-independent sets. 191-193 1986 58 Discret. Math. 2 https://doi.org/10.1016/0012-365X(86)90161-5 db/journals/dm/dm58.html#Alon86

Noga Alon Micha A. Perles On the intersection of edges of a geometric graph by straight lines. 75-90 1986 60 Discret. Math. https://doi.org/10.1016/0012-365X(86)90004-X db/journals/dm/dm60.html#AlonP86

Noga Alon Yair Caro Extremal Problems Concerning Transformations of the Set of Edges of the Complete Graph. 93-104 1986 7 Eur. J. Comb. 2 https://doi.org/10.1016/S0195-6698(86)80034-8 db/journals/ejc/ejc7.html#AlonC86

Noga Alon Decomposition of the completer-graph into completer-partiter-graphs. 95-100 1986 2 Graphs Comb. 1 https://doi.org/10.1007/BF01788083 db/journals/gc/gc2.html#Alon86

Noga Alon László Babai Alon Itai A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. 567-583 1986 7 J. Algorithms 4 db/journals/jal/jal7.html#AlonBI86 https://doi.org/10.1016/0196-6774(86)90019-2 https://www.wikidata.org/entity/Q29396733

Noga Alon Ervin Györi The number of small semispaces of a finite set of points in the plane. 154-157 1986 41 J. Comb. Theory A 1 https://doi.org/10.1016/0097-3165(86)90122-6 https://www.wikidata.org/entity/Q29036422 db/journals/jct/jcta41.html#AlonG86

Noga Alon Kenneth A. Berman Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory. 91-97 1986 43 J. Comb. Theory A 1 https://doi.org/10.1016/0097-3165(86)90026-9 https://www.wikidata.org/entity/Q124853600 db/journals/jct/jcta43.html#AlonB86

Noga Alon The longest cycle of a graph with a large minimal degree. 123-127 1986 10 J. Graph Theory 1 https://doi.org/10.1002/jgt.3190100115 db/journals/jgt/jgt10.html#Alon86

Meanders, Ramsey Theory and Lower Bounds for Branching Programs Noga Alon Wolfgang Maass 0001 410-417 conf/focs/FOCS27 1986 FOCS db/conf/focs/focs86.html#AlonM86 https://doi.org/10.1109/SFCS.1986.31 https://doi.ieeecomputersociety.org/10.1109/SFCS.1986.31 Tight Complexity Bounds for Parallel Comparison Sorting Noga Alon Yossi Azar Uzi Vishkin 502-510 conf/focs/FOCS27 1986 FOCS db/conf/focs/focs86.html#AlonAV86 https://doi.org/10.1109/SFCS.1986.57 https://doi.ieeecomputersociety.org/10.1109/SFCS.1986.57

Noga Alon Paul Erdös An Application of Graph Theory to Additive Number Theory. 201-203 1985 6 Eur. J. Comb. 3 https://doi.org/10.1016/S0195-6698(85)80027-5 https://www.wikidata.org/entity/Q59701035 db/journals/ejc/ejc6.html#AlonE85

Noga Alon Zoltán Füredi Meir Katchalski Separating Pairs of Points by Standard Boxes. 205-210 1985 6 Eur. J. Comb. 3 https://doi.org/10.1016/S0195-6698(85)80028-7 db/journals/ejc/ejc6.html#AlonFK85

Noga Alon Gil Kalai A Simple Proof of the Upper Bound Theorem. 211-214 1985 6 Eur. J. Comb. 3 https://doi.org/10.1016/S0195-6698(85)80029-9 https://www.wikidata.org/entity/Q100329018 db/journals/ejc/ejc6.html#AlonK85

Noga Alon Peter Frankl The maximum number of disjoint pairs in a family of subsets. 13-21 1985 1 Graphs Comb. 1 https://doi.org/10.1007/BF02582924 db/journals/gc/gc1.html#AlonF85

Noga Alon Asynchronous threshold networks. 305-310 1985 1 Graphs Comb. 1 https://doi.org/10.1007/BF02582959 db/journals/gc/gc1.html#Alon85

Noga Alon Hypergraphs with high chromatic number. 387-389 1985 1 Graphs Comb. 1 https://doi.org/10.1007/BF02582966 db/journals/gc/gc1.html#Alon85a

Noga Alon V. D. Milman lambda1, Isoperimetric inequalities for graphs, and superconcentrators. 73-88 1985 38 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(85)90092-9 https://www.wikidata.org/entity/Q97007892 db/journals/jct/jctb38.html#AlonM85

Noga Alon Yoshimi Egawa Even edge colorings of a graph. 93-94 1985 38 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(85)90094-2 db/journals/jct/jctb38.html#AlonE85

Noga Alon An Extremal Problem for Sets with Applications to Graph Theory. 82-89 1985 40 J. Comb. Theory A 1 db/journals/jct/jcta40.html#Alon85 https://doi.org/10.1016/0097-3165(85)90048-2 https://www.wikidata.org/entity/Q100329026

Geometrical Realization of Set Systems and Probabilistic Communication Complexity Noga Alon Peter Frankl Vojtech Rödl 277-280 conf/focs/FOCS26 1985 FOCS db/conf/focs/focs85.html#AlonFR85 https://doi.org/10.1109/SFCS.1985.30 https://doi.ieeecomputersociety.org/10.1109/SFCS.1985.30 Expanders, Sorting in Rounds and Superconcentrators of Limited Depth Noga Alon 98-102 conf/stoc/STOC17 1985 STOC db/conf/stoc/stoc85.html#Alon85 https://doi.org/10.1145/22145.22156

Noga Alon A note on subdigraphs of digraphs with large outdegrees. 321-322 1984 49 Discret. Math. 3 https://doi.org/10.1016/0012-365X(84)90172-9 db/journals/dm/dm49.html#Alon84

Noga Alon Shmuel Friedland Gil Kalai Regular subgraphs of almost regular graphs. 79-91 1984 37 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(84)90047-9 db/journals/jct/jctb37.html#AlonFK84

Noga Alon Shmuel Friedland Gil Kalai Every 4-regular graph plus an edge contains a 3-regular subgraph. 92-93 1984 37 J. Comb. Theory B 1 https://doi.org/10.1016/0095-8956(84)90048-0 db/journals/jct/jctb37.html#AlonFK84a

Eigenvalues, Expanders and Superconcentrators (Extended Abstract) Noga Alon V. D. Milman 320-322 conf/focs/FOCS25 1984 FOCS db/conf/focs/focs84.html#AlonM84 https://doi.org/10.1109/SFCS.1984.715931 https://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715931

Noga Alon On the density of sets of vectors. 199-202 1983 46 Discret. Math. 2 https://doi.org/10.1016/0012-365X(83)90253-4 db/journals/dm/dm46.html#Alon83

Noga Alon On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems. 91-94 1983 7 J. Graph Theory 1 https://doi.org/10.1002/jgt.3190070112 https://www.wikidata.org/entity/Q123285719 db/journals/jgt/jgt7.html#Alon83

Emmanuel Abbe Ilan Adler Yehuda Afek Amit Agarwal Pankaj K. Agarwal Ron Aharoni Rudolf Ahlswede Nir Ailon Miklós Ajtai Hannaneh Akrami I. Algor Ryan Alweiss Michal Amir Alexandr Andoni Mehmet Serkan Apaydin Uri Arad Boris Aronov Vera Asodi Sepehr Assadi Hagit Attiya Dmitrii Avdiukhin Chen Avin Baruch Awerbuch Harout K. Aydinian Yossi Azar László Babai Moshe Babaioff Eitan Bachmat Mihai Badoiu Igor Balla József Balogh Afonso S. Bandeira Jørgen Bang-Jensen Ziv Bar-Joseph Amotz Bar-Noy Amnon Barak Imre Bárány Manu Basavaraju Raef Bassily Sabyasachi Basu Richard Beigel Amos Beimel Shai Ben-David Ido Ben-Eliezer Omri Ben-Eliezer Sonny Ben-Shimon Jonathan Berant Eli Berger Ernest E. Bergmann Robert Berke Mark Berlin Kenneth A. Berman Stéphane Bessy Anurag Bishnoi Eric Blais Manuel Blum 0001 Tom Bohman Béla Bollobás Miklós Bóna Ravi B. Boppana Gabriela Bourla Olivier Bousquet Phillip G. Bradford Mark Braverman Robert Bredereck Z. Bregman Raimundo Briceño Graham R. Brightwell Slava Bronfman Richard A. Brualdi Jehoshua Bruck Niv Buchbinder Kevin Buchin Maike Buchin Matija Bucic Boris Bukh Mark Bun Charles Cantor Michael R. Capalbo Yair Caro Nicolò Cesa-Bianchi Sourav Chakraborty 0001 Nishant Chandgotia L. Sunil Chandran Moses Charikar Bhaskar Ray Chaudhury Shiri Chechik Jiehua Chen 0001 Ehsan Chiniforooshan Jeremy Chizewer Benny Chor Vasek Chvátal Sebastian M. Cioaba Gérard D. Cohen Gil Cohen Jonathan D. Cohen 0003 Sarel Cohen Amin Coja-Oghlan Charles J. Colbourn Don Coppersmith Alejandro Cornejo János Csirik Péter Csorba Robert Cypher Ido Dagan Yuval Dagan Phuong Dao Seannie Dar Shagnik Das Colin Defant Ofer Dekel Erik D. Demaine A. K. Dewdney Biswadip Dey Martin Dietzfelbinger Guoli Ding Natalie Dodson Benjamin Doerr Shlomi Dolev Moshe Dubiner Swan Dubois Nick G. Duffield Richard A. Duke Paul H. Edelman Jeff Edmonds Klim Efremenko Yoshimi Egawa Dor Elboim Yuval Emek Leah Epstein Paul Erdös Péter L. Erdös Emanuela Fachini Dvir Falik Martin Farach-Colton Farzad FarnoudFarzad Farnoud Hassanzadeh Uriel Feige Ohad N. Feldheim Michal Feldman Moran Feldman Michael R. Fellows Guillaume Fertin Amos Fiat Eldar Fischer Felix A. Fischer Orr Fischer Rudolf Fleischer Fedor V. Fomin Lance Fortnow Jacob Fox Peter Frankl Gregory Freiman Ehud Friedgut Shmuel Friedland Alan M. Frieze Zoltán Füredi Zvi Galil Iftah Gamzu Shirshendu Ganguly David García-Soriano Jugal Garg Ran Gelles François Genest Claudio Gentile Mohsen Ghaffari 0001 Phillip B. Gibbons Brandon D. Gilbert Shoni Gilboa Lior Gishboliner Roman Glebov Jacob Goldberger Oded Goldreich 0001 Yannai A. Gonczarowski Alon Gonen Ben Graham Fan Chung GrahamFan R. K. Chung Ronald L. Graham Andrei Graur Nick Gravin Thomas L. Griffiths 0001Tom Griffiths 0001 Jaroslaw Grytczuk Shay Gueron Anna Gujgiczer Benjamin Gunby David S. Gunderson Ori Gurel-Gurevich Venkatesan Guruswami Gregory Z. Gutin Shai Gutner András Gyárfás Ervin Györi Simi Haber Bernhard Haeupler Mohammad HajiaghayiMohammadTaghi HajiaghayiMohammad Taghi Hajiaghayi Iman Hajirasouliha András Hajnal H. Tracy Hall Dan Halperin Eran Halperin Mariusz Haluszczak Peter Hamburger Hiêp Hàn Steve Hanneke Donovan R. Hare Ramesh Hariharan Avinatan Hassidim Johan Håstad David Haussler Penny E. HaxellPenny Haxell Elad Hazan Xiaoyu He Dan Hefetz C. T. Howard HoChing-Tien Ho Rani Hod Ron Holzman Shlomo Hoory Fereydoun Hormozdiari Hao Huang 0005 Alon Itai Toshiya Itoh Tommi S. Jaakkola Carmen Jackson Shweta Jain 0007 Siddharth Jain Bruno Jartoux Tao Jiang 0003 Zilin Jiang Allan Grønlund JørgensenAllan Grønlund Søren Fuglede Jørgensen Nabil Kahalé Jeff Kahn 0001 Gil Kalai Tom Kalvari Panagiotis Kanellopoulos Mihyun Kang Ravi Kannan Sampath Kannan Gil Kaplan Haim Kaplan Mauricio Karchmer Ron Karidi Richard M. Karp Marek Karpinski Simon Kasif Meir Katchalski Tali Kaufman Chaya Keller Pierre Kelsen Majid Khabbazian Hal A. Kierstead Eun Jung Kim 0002 Jeong Han Kim Guy Kindler Andrzej P. Kisielewicz Bo'az Klartag Daniel J. Kleitman Christian Knauer Yoshiharu Kohayakawa Jack H. Koolen Tomer Koren János Körner Alexandr V. Kostochka Michal Koucký 0001 Dmitry N. Kozlov Gady Kozma Ilia Krasikov Stefan Kratsch Noah Kravitz Anja Krech Michael Krivelevich Gal Kronenberg Alexander Y. Ku Fabian Kuhn Mrinal Kumar 0001 Andrey Kupavskii Eden Kuperwasser Jakub Lacki Kasper Green Larsen Hagit Last Ron Lavi Troy Lee Hanno Lefmann Jenö Lehel Frank Thomson LeightonTom Leighton Arieh Lev Omer Lev Arthur L. Liestman Alan C. H. Ling Andrzej Lingas Nathan Linial Richard J. Lipton Simon Litsyn Roi Livni Daniel Lokshtanov Zvi Lotker László Lovász 0001 Shachar Lovett Eyal Lubetzky Alexander Lubotzky Michael Luby Tomasz Luczak 0001 Carsten Lund Wolfgang Maass 0001 Alexander Magazinov Sanjeev Mahajan Konstantin Makarychev Yury Makarychev Yaakov Malinovsky Dahlia Malkhi Maryanthe Malliaris Udi Manber Shie Mannor Yishay Mansour Pasin Manurangsi Oded Margalit Lucy Martinez Dániel Marx Rogers Mathew Yossi Matias Jirí Matousek 0001 Arie Matsliah Kevin Matulef Christian Mauduit Rose McCarty Colin McDiarmid Brendan D. McKay Nimrod Megiddo Kurt Mehlhorn Abbas Mehrabian Ruta Mehta Reshef Meir Keith E. Mellinger Michael Merritt Roy Meshulam Martin Milanic Zevi Miller V. D. Milman Tova Milo Aleksa Milojevic Peter Bro Miltersen Bojan Mohar Ankur Moitra Michael Molloy 0001 Adva Mond Angelo Monti Shay Moran Shlomo Moran Carlos Gustavo T. de A. Moreira Robert Morris 0001 Dana Moshkovitz Guy Moshkovitz Elchanan Mossel Frank Mousset Dhruv Mubayi Sebastian Musslick Asaf Nachmias Tatsuya Nagatani Alon Naor Assaf Naor Joseph Naor Moni Naor Humberto Naves Oren Nechushtan Rajko Nenadov Alessandro Neri 0002 Frank Neven Ilan Newman Rolf Niedermeier Noam Nisan Gabriel Nivasch Asaf Nussboim Andrew M. Odlyzko Shmuel Onn Bogdan Oporowski Sigal Oren Alon Orlitsky Rafail Ostrovsky Teunis J. Ott Kayhan Özcimder János Pach Rina Panigrahy Fabio Pardi Michal Parnas Boaz Patt-Shamir David Peleg Robin Pemantle René Peralta 0001 Micha A. Perles Erez Petrank Adi Pinchasi Rom Pinchasi Tristan Pollner Yury Polyanskiy Carl Pomerance Maria Potop-ButucaruMaria Gradinariu Emil Powierski Pawel Pralat Dan Pritikin Ariel D. Procaccia Krzysztof Przeslawski Pavel Pudlák William R. Pulleyblank Michael O. Rabin John Rachlin Rados Radoicic Sridhar Rajagopalan Deepak Rajendraprasad Anat Rapoport Yiftach Ravid Ran Raz Bruce A. Reed Daniel Reichman 0001 Omer Reingold Moty Ricklin Oliver Riordan Yehuda Roditty Vojtech Rödl Yuval Roichman Assaf Romm Dana Ron Lajos Rónyai Sheldon M. Ross Ron M. Roth Ronitt Rubinfeld Aviad Rubinstein Andrzej Rucinski 0001 Steven Rudich Miklós Ruszinkó Guy Rutenberg Imre Z. Ruzsa Pawel Rzazewski Shmuel Safra Süleyman Cenk Sahinalp Michael E. Saks Wojciech Samotij Colin Sandon Saket Saurabh 0001 Michael Savery Mathias Schacht Hilla Schefler Edward R. Scheinerman Baruch Schieber Tomasz Schoen Oded Schwartz Alex D. ScottAlex Scott 0001 Danny Segev Sergey SevastyanovSergey V. Sevastianov Paul D. Seymour Bryan L. Shader Matan Shalev Ohad Shamir Chong Shangguan Saswata Shannigrahi Asaf Shapira Micha Sharir Alexander Shen 0001 Nadav Sherman Thomas C. Shermer Clara Shikhelman Igor Shinkar Eran Shmaya Amir Shpilka Alexander Shpunt Adi Shraibman Anastasios Sidiropoulos Gábor Simonyi Shakhar Smorodinsky Sagi Snir Eilon Solan Noam Solomon József Solymosi Lani Southern Bettina Speckmann Joel H. SpencerJoel Spencer Yinon Spinka Nathan Srebro Aravind Srinivasan Nikhil Srivastava Ladislav Stacho Uri Stav Uri Stemmer Julien P. Stern Larry J. Stockmeyer Dan Suciu Benny Sudakov Madhu Sudan 0001 Blair D. Sullivan Subhash Suri Hiroshi Suzuki Tamás Szabó Tibor Szabó Mario Szegedy Stefan Szeider László A. Székely Endre Szemerédi Itzhak Tamo Gábor Tardos Michael Tarsi Gadi Taubenfeld Vanessa Teague Moshe Tennenholtz Prasad Tetali Robin Thomas 0001 Carsten Thomassen Mikkel Thorup Sébastien Tixeuil Martin Tompa Mark R. Tuttle Zsolt Tuza Mykhaylo Tyomkyn Christopher Umans Danny Vainstein Shai Vardi Wenceslas Fernandez de la Vega Santosh S. Vempala Nikolai K. Vereshchagin Jacques Verstraëte Dirk L. VertiganDirk Vertigan Arjen P. A. Vestjens Victor Vianu Uzi Vishkin Margit Voigt Ben lee VolkBen Lee Volk Jan Vondrák Van H. Vu Tal Wagner Martin Wahlen Hongao Wang Fan Wei S. Matthew Weinberg Amit Weinstein Omri Weinstein Dominic Welsh Emo Welzl Douglas B. West Avi Wigderson Elizabeth Wilmer Peter Winkler 0001 Gerhard J. Woeginger Nicholas C. Wormald Rebecca N. Wright Ning Xie 0002 Tal Yadid Grigory Yaroslavtsev Amir Yehudayoff Sergey Yekhanin Anders Yeo Eylon Yogev Yelena Yuditsky Moti Yung Raphael Yuster Ayal Zaks Or Zamir Doron Zeilberger Qianfan Zhang 0002 Daniel G. Zhu David Zuckerman Philipp Zumstein Uri Zwick