Noga Alon - RankMe

727 papers A* 116A 15B 12C 1Misc 2Journal 537Unranked 37

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets. SODA Noga Alon, Shakhar Smorodinsky
2026	J	`jnl`	Universality for graphs with bounded density. J. Comb. Theory B Noga Alon, Natalie Dodson, Carmen Jackson, Rose McCarty, Rajko Nenadov, Lani Southern
2025	A	`conf`	A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions. ITCS Noga Alon, Nick Gravin, Tristan Pollner, Aviad Rubinstein, Hongao Wang, S. Matthew Weinberg, Qianfan Zhang
2025	J	`jnl`	Aggregating maximal cliques in real-world graphs. CoRR Noga Alon, Sabyasachi Basu, Shweta Jain, Haim Kaplan, Jakub Lacki, Blair D. Sullivan
2025	J	`jnl`	EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. Oper. Res. Hannaneh Akrami, Noga Alon, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta
2025	J	`jnl`	Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets. CoRR Noga Alon, Shakhar Smorodinsky
2025	J	`jnl`	Hitting $k$ Primes by Dice Rolls. Electron. J. Comb. Noga Alon, Yaakov Malinovsky, Lucy Martinez, Doron Zeilberger
2025	J	`jnl`	Induced matching treewidth and tree-independence number, revisited. CoRR Noga Alon, Martin Milanic, Pawel Rzazewski
2025	J	`jnl`	New Approximation Guarantees for The Inventory Staggering Problem. CoRR Noga Alon, Danny Segev
2025	J	`jnl`	Ordering Candidates via Vantage Points. Comb. Noga Alon, Colin Defant, Noah Kravitz, Daniel G. Zhu
2025	J	`jnl`	Sumsets in the Hypercube. SIAM J. Discret. Math. Noga Alon, Or Zamir
2024	J	`jnl`	A Bicriterion Concentration Inequality and Prophet Inequalities for CoRR Noga Alon, Nick Gravin, Tristan Pollner, Aviad Rubinstein, Hongao Wang, S. Matthew Weinberg, Qianfan Zhang
2024	A*	`conf`	A Unified Characterization of Private Learnability via Graph Theory. COLT Noga Alon, Shay Moran, Hilla Schefler, Amir Yehudayoff
2024	J	`jnl`	Cats in Cubes. Electron. J. Comb. Noah Kravitz, Noga Alon
2024	J	`jnl`	Connectivity graph-codes. Random Struct. Algorithms Noga Alon
2024	J	`jnl`	Diagonalization Games. Am. Math. Mon. Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran
2024	J	`jnl`	Erasure list-decodable codes and Turán hypercube problems. Finite Fields Their Appl. Noga Alon
2024	J	`jnl`	Erratum: Multitasking Capacity: Hardness Results and Improved Constructions. SIAM J. Discret. Math. Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner
2024	J	`jnl`	Graph-codes. Eur. J. Comb. Noga Alon
2024	J	`jnl`	Implicit Representation of Sparse Hereditary Families. Discret. Comput. Geom. Noga Alon
2024	J	`jnl`	Invertibility of Digraphs and Tournaments. SIAM J. Discret. Math. Noga Alon, Emil Powierski, Michael Savery, Alex D. Scott, Elizabeth Wilmer
2024	J	`jnl`	Logarithmically Larger Deletion Codes of All Distances. IEEE Trans. Inf. Theory Noga Alon, Gabriela Bourla, Ben Graham, Xiaoyu He, Noah Kravitz
2024	J	`jnl`	Optimal Preprocessing for Answering On-Line Product Queries. CoRR Noga Alon, Baruch Schieber
2024	A*	`conf`	Optimal Sample Complexity of Contrastive Learning. ICLR Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev
2024	J	`jnl`	Random Necklaces Require Fewer Cuts. SIAM J. Discret. Math. Noga Alon, Dor Elboim, János Pach, Gábor Tardos
2024	B	`conf`	Sublinear Time Shortest Path in Expander Graphs. MFCS Noga Alon, Allan Grønlund, Søren Fuglede Jørgensen, Kasper Green Larsen
2024	J	`jnl`	Sumsets in the Hypercube. CoRR Noga Alon, Or Zamir
2024	J	`jnl`	Turán graphs with bounded matching number. J. Comb. Theory B Noga Alon, Peter Frankl
2023	J	`jnl`	A Unified Characterization of Private Learnability via Graph Theory. CoRR Noga Alon, Shay Moran, Hilla Schefler, Amir Yehudayoff
2023	J	`jnl`	Boosting Simple Learners. TheoretiCS Noga Alon, Alon Gonen, Elad Hazan, Shay Moran
2023	J	`jnl`	Complete minors and average degree: A short proof. J. Graph Theory Noga Alon, Michael Krivelevich, Benny Sudakov
2023	J	`jnl`	Diagonalization Games. CoRR Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran
2023	J	`jnl`	Diagonalization Games. Electron. Colloquium Comput. Complex. Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran
2023	A*	`conf`	EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. EC Hannaneh Akrami, Noga Alon, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta
2023	J	`jnl`	Irregular subgraphs. Comb. Probab. Comput. Noga Alon, Fan Wei
2023	J	`jnl`	Largest subgraph from a hereditary property in a random graph. Discret. Math. Noga Alon, Michael Krivelevich, Wojciech Samotij
2023	J	`jnl`	New bounds on the maximum number of neighborly boxes in Rd. Eur. J. Comb. Noga Alon, Jaroslaw Grytczuk, Andrzej P. Kisielewicz, Krzysztof Przeslawski
2023	J	`jnl`	On bipartite coverings of graphs and multigraphs. CoRR Noga Alon
2023	J	`jnl`	Optimal Sample Complexity of Contrastive Learning. CoRR Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev
2023	J	`jnl`	Strong blocking sets and minimal codes from expander graphs. CoRR Noga Alon, Anurag Bishnoi, Shagnik Das, Alessandro Neri
2023	J	`jnl`	Structured Codes of Graphs. SIAM J. Discret. Math. Noga Alon, Anna Gujgiczer, János Körner, Aleksa Milojevic, Gábor Simonyi
2023	J	`jnl`	Sublinear Time Shortest Path in Expander Graphs. CoRR Noga Alon, Allan Grønlund, Søren Fuglede Jørgensen, Kasper Green Larsen
2023	J	`jnl`	The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs. SIAM J. Discret. Math. Noga Alon, Ehud Friedgut, Gil Kalai, Guy Kindler
2023	J	`jnl`	Typical and extremal aspects of friends-and-strangers graphs. J. Comb. Theory B Noga Alon, Colin Defant, Noah Kravitz
2022	J	`jnl`	Additive Approximation of Generalized Turán Questions. Algorithmica Noga Alon, Clara Shikhelman
2022	J	`jnl`	Identifying the Deviator. CoRR Noga Alon, Benjamin Gunby, Xiaoyu He, Eran Shmaya, Eilon Solan
2022	J	`jnl`	Implicit representation of sparse hereditary families. CoRR Noga Alon
2022	J	`jnl`	Invertibility of digraphs and tournaments. CoRR Noga Alon, Emil Powierski, Michael Savery, Alex Scott, Elizabeth Wilmer
2022	J	`jnl`	Logarithmically larger deletion codes of all distances. CoRR Noga Alon, Gabriela Bourla, Ben Graham, Xiaoyu He, Noah Kravitz
2022	J	`jnl`	On the hat guessing number of graphs. Discret. Math. Noga Alon, Jeremy Chizewer
2022	J	`jnl`	Private and Online Learnability Are Equivalent. J. ACM Noga Alon, Mark Bun, Roi Livni, Maryanthe Malliaris, Shay Moran
2022	J	`jnl`	The diameter of the uniform spanning tree of dense graphs. Comb. Probab. Comput. Noga Alon, Asaf Nachmias, Matan Shalev
2022	J	`jnl`	The runsort permuton. Adv. Appl. Math. Noga Alon, Colin Defant, Noah Kravitz
2022	J	`jnl`	The ε-t-Net Problem. Discret. Comput. Geom. Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
2022	J	`jnl`	Turán graphs with bounded matching number. CoRR Noga Alon, Peter Frankl
2021	A*	`conf`	A Theory of PAC Learnability of Partial Concept Classes. FOCS Noga Alon, Steve Hanneke, Ron Holzman, Shay Moran
2021	J	`jnl`	A Theory of PAC Learnability of Partial Concept Classes. CoRR Noga Alon, Steve Hanneke, Ron Holzman, Shay Moran
2021	J	`jnl`	Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs. Exp. Math. Noga Alon, Sebastian M. Cioaba, Brandon D. Gilbert, Jack H. Koolen, Brendan D. McKay
2021	J	`jnl`	Adversarial Laws of Large Numbers and Optimal Regret in Online Classification. CoRR Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev
2021	A*	`conf`	Adversarial laws of large numbers and optimal regret in online classification. STOC Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev
2021	A*	`conf`	Boosting simple learners. STOC Noga Alon, Alon Gonen, Elad Hazan, Shay Moran
2021	J	`jnl`	Divisible subdivisions. J. Graph Theory Noga Alon, Michael Krivelevich
2021	A*	`conf`	Efficient Splitting of Necklaces. ICALP Noga Alon, Andrei Graur
2021	J	`jnl`	Explicit Expanders of Every Degree and Size. Comb. Noga Alon
2021	J	`jnl`	Limitations on regularity lemmas for clustering graphs. Adv. Appl. Math. Noga Alon, Guy Moshkovitz
2021	J	`jnl`	List Ramsey numbers. J. Graph Theory Noga Alon, Matija Bucic, Tom Kalvari, Eden Kuperwasser, Tibor Szabó
2021	J	`jnl`	Mixing properties of colourings of the ℤd lattice. Comb. Probab. Comput. Noga Alon, Raimundo Briceño, Nishant Chandgotia, Alexander Magazinov, Yinon Spinka
2021	J	`jnl`	On the Hat Guessing Number of Graphs. CoRR Noga Alon, Jeremy Chizewer
2021	J	`jnl`	Partitioning all k-subsets into r-wise intersecting families. CoRR Noga Alon
2021	J	`jnl`	The Price of Bounded Preemption. ACM Trans. Parallel Comput. Noga Alon, Yossi Azar, Mark Berlin
2020	J	`jnl`	A probabilistic variant of Sperner 's theorem and of maximal r-cover free families. Discret. Math. Noga Alon, Shoni Gilboa, Shay Gueron
2020	J	`jnl`	Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs. CoRR Noga Alon, Adi Shraibman
2020	J	`jnl`	Boosting Simple Learners. CoRR Noga Alon, Alon Gonen, Elad Hazan, Shay Moran
2020	A*	`conf`	Closure Properties for Private Classification and Online Prediction. COLT Noga Alon, Amos Beimel, Shay Moran, Uri Stemmer
2020	J	`jnl`	Closure Properties for Private Classification and Online Prediction. CoRR Noga Alon, Amos Beimel, Shay Moran, Uri Stemmer
2020	J	`jnl`	Distributed Corruption Detection in Networks. Theory Comput. Noga Alon, Elchanan Mossel, Robin Pemantle
2020	J	`jnl`	Edge-statistics on large graphs. Comb. Probab. Comput. Noga Alon, Dan Hefetz, Michael Krivelevich, Mykhaylo Tyomkyn
2020	J	`jnl`	Efficient Removal Lemmas for Matrices. Order Noga Alon, Omri Ben-Eliezer
2020	J	`jnl`	Efficient Splitting of Measures and Necklaces. CoRR Noga Alon, Andrei Graur
2020	J	`jnl`	Explicit expanders of every degree and size. CoRR Noga Alon
2020	A*	`conf`	Hierarchical Clustering: A 0.585 Revenue Approximation. COLT Noga Alon, Yossi Azar, Danny Vainstein
2020	J	`jnl`	Hierarchical Clustering: a 0.585 Revenue Approximation. CoRR Noga Alon, Yossi Azar, Danny Vainstein
2020	J	`jnl`	Isoperimetry, stability, and irredundance in direct products. Discret. Math. Noga Alon, Colin Defant
2020	J	`jnl`	Multitasking Capacity: Hardness Results and Improved Constructions. SIAM J. Discret. Math. Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner, Alexander Y. Ku
2020	J	`jnl`	On the product dimension of clique factors. Eur. J. Comb. Noga Alon, Ryan Alweiss
2020	J	`jnl`	Out-colourings of digraphs. J. Graph Theory Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy
2020	—	`conf`	Palette Sparsification Beyond (Δ+1) Vertex Coloring. APPROX-RANDOM Noga Alon, Sepehr Assadi
2020	J	`jnl`	Palette Sparsification Beyond (Δ+1) Vertex Coloring. CoRR Noga Alon, Sepehr Assadi
2020	J	`jnl`	The hat guessing number of graphs. J. Comb. Theory B Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
2020	A*	`conf`	The ε-t-Net Problem. SoCG Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
2020	J	`jnl`	The ε-t-Net Problem. CoRR Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky
2020	J	`jnl`	Typical and Extremal Aspects of Friends-and-Strangers Graphs. CoRR Noga Alon, Colin Defant, Noah Kravitz
2020	J	`jnl`	Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Comb. Noga Alon, Mrinal Kumar, Ben Lee Volk
2019	A*	`conf`	Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. ICALP Noga Alon, Shiri Chechik, Sarel Cohen
2019	J	`jnl`	Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. CoRR Noga Alon, Shiri Chechik, Sarel Cohen
2019	J	`jnl`	Dynamics of Evolving Social Groups. ACM Trans. Economics and Comput. Noga Alon, Michal Feldman, Yishay Mansour, Sigal Oren, Moshe Tennenholtz
2019	J	`jnl`	H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups. Discret. Math. Noga Alon, Clara Shikhelman
2019	J	`jnl`	High-girth near-Ramanujan graphs with localized eigenvectors. CoRR Noga Alon, Shirshendu Ganguly, Nikhil Srivastava
2019	J	`jnl`	Induced Universal Hypergraphs. SIAM J. Discret. Math. Noga Alon, Nadav Sherman
2019	A*	`conf`	Limits of Private Learning with Access to Public Data. NeurIPS Raef Bassily, Shay Moran, Noga Alon
2019	J	`jnl`	Limits of Private Learning with Access to Public Data. CoRR Noga Alon, Raef Bassily, Shay Moran
2019	J	`jnl`	List-Decodable Zero-Rate Codes. IEEE Trans. Inf. Theory Noga Alon, Boris Bukh, Yury Polyanskiy
2019	J	`jnl`	On Generalized Regularity. CoRR Noga Alon, Guy Moshkovitz
2019	A*	`conf`	Private PAC learning implies finite Littlestone dimension. STOC Noga Alon, Roi Livni, Maryanthe Malliaris, Shay Moran
2019	J	`jnl`	Reliable communication over highly connected noisy networks. Distributed Comput. Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler
2019	B	`conf`	The Hat Guessing Number of Graphs. ISIT Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
2019	J	`jnl`	Traces of hypergraphs. J. Lond. Math. Soc. Noga Alon, Guy Moshkovitz, Noam Solomon
2018	J	`jnl`	Clique coloring of dense random graphs. J. Graph Theory Noga Alon, Michael Krivelevich
2018	J	`jnl`	Multitasking Capacity: Hardness Results and Improved Constructions. CoRR Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner, Alexander Y. Ku
2018	J	`jnl`	Private PAC learning implies finite Littlestone dimension. CoRR Noga Alon, Roi Livni, Maryanthe Malliaris, Shay Moran
2018	J	`jnl`	Ramsey-nice families of graphs. Eur. J. Comb. Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz, Zilin Jiang, Gal Kronenberg, Alon Naor
2018	J	`jnl`	Redesigning the Israeli Medical Internship Match. ACM Trans. Economics and Comput. Slava Bronfman, Noga Alon, Avinatan Hassidim, Assaf Romm
2018	J	`jnl`	The Minrank of Random Graphs over Arbitrary Fields. CoRR Noga Alon, Igor Balla, Lior Gishboliner, Adva Mond, Frank Mousset
2018	B	`conf`	The Price of Bounded Preemption. SPAA Noga Alon, Yossi Azar, Mark Berlin
2018	J	`jnl`	The hat guessing number of graphs. CoRR Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo
2018	A	`conf`	Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. CCC Noga Alon, Mrinal Kumar, Ben Lee Volk
2018	J	`jnl`	Uniformly Discrete Forests with Poor Visibility. Comb. Probab. Comput. Noga Alon
2017	—	`conf`	A graph-theoretic approach to multitasking. NIPS Noga Alon, Daniel Reichman, Igor Shinkar, Tal Wagner, Sebastian Musslick, Jonathan D. Cohen, Tom Griffiths, Biswadip Dey, Kayhan Özcimder
2017	J	`jnl`	Broadcast Transmission to Prioritizing Receivers. SIAM J. Discret. Math. Noga Alon, Guy Rutenberg
2017	J	`jnl`	Duplication Distance to the Root for Binary Sequences. IEEE Trans. Inf. Theory Noga Alon, Jehoshua Bruck, Farzad Farnoud Hassanzadeh, Siddharth Jain
2017	—	`conf`	Efficient Removal Lemmas for Matrices. APPROX-RANDOM Noga Alon, Omri Ben-Eliezer
2017	J	`jnl`	List-decodable zero-rate codes. CoRR Noga Alon, Boris Bukh, Yury Polyanskiy
2017	J	`jnl`	More on the Bipartite Decomposition of Random Graphs. J. Graph Theory Noga Alon, Tom Bohman, Hao Huang
2017	J	`jnl`	Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback. SIAM J. Comput. Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Shie Mannor, Yishay Mansour, Ohad Shamir
2017	A*	`conf`	Optimal Compression of Approximate Inner Products and Dimension Reduction. FOCS Noga Alon, Bo'az Klartag
2017	A*	`conf`	Optimal induced universal graphs for bounded-degree graphs. SODA Noga Alon, Rajko Nenadov
2017	J	`jnl`	Out-colourings of Digraphs. CoRR Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy
2017	J	`jnl`	Revenue and Reserve Prices in a Probabilistic Single Item Auction. Algorithmica Noga Alon, Moran Feldman, Moshe Tennenholtz
2017	—	`conf`	Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues. NIPS Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski, Yishay Mansour, Shay Moran, Amir Yehudayoff
2017	J	`jnl`	Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues. CoRR Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski, Yishay Mansour, Shay Moran, Amir Yehudayoff
2017	J	`jnl`	Testing Equality in Communication Graphs. IEEE Trans. Inf. Theory Noga Alon, Klim Efremenko, Benny Sudakov
2017	A*	`conf`	Testing Hereditary Properties of Ordered Graphs and Matrices. FOCS Noga Alon, Omri Ben-Eliezer, Eldar Fischer
2017	J	`jnl`	Testing hereditary properties of ordered graphs and matrices. CoRR Noga Alon, Omri Ben-Eliezer, Eldar Fischer
2017	J	`jnl`	Testing hereditary properties of ordered graphs and matrices. Electron. Colloquium Comput. Complex. Noga Alon, Omri Ben-Eliezer, Eldar Fischer
2016	—	`ch.`	Color Coding. Encyclopedia of Algorithms Noga Alon, Raphael Yuster, Uri Zwick
2016	J	`jnl`	Duplication Distance to the Root for Binary Sequences. CoRR Noga Alon, Jehoshua Bruck, Farzad Farnoud, Siddharth Jain
2016	A*	`conf`	Dynamics of Evolving Social Groups. EC Noga Alon, Michal Feldman, Yishay Mansour, Sigal Oren, Moshe Tennenholtz
2016	J	`jnl`	Dynamics of Evolving Social Groups. CoRR Noga Alon, Michal Feldman, Yishay Mansour, Sigal Oren, Moshe Tennenholtz
2016	J	`jnl`	Eigenvalues of K1, k-Free Graphs and the Connectivity of Their Independence Complexes. J. Graph Theory Ron Aharoni, Noga Alon, Eli Berger
2016	J	`jnl`	High girth augmented trees are huge. J. Comb. Theory A Noga Alon
2016	J	`jnl`	Linear Boolean Classification, Coding and the Critical Problem. IEEE Trans. Inf. Theory Emmanuel Abbe, Noga Alon, Afonso S. Bandeira, Colin Sandon
2016	J	`jnl`	Local and global colorability of graphs. Discret. Math. Noga Alon, Omri Ben-Eliezer
2016	J	`jnl`	Many T copies in H-free graphs. J. Comb. Theory B Noga Alon, Clara Shikhelman
2016	J	`jnl`	On Active and Passive Testing. Comb. Probab. Comput. Noga Alon, Rani Hod, Amit Weinstein
2016	J	`jnl`	On the Maximum Quartet Distance between Phylogenetic Trees. SIAM J. Discret. Math. Noga Alon, Humberto Naves, Benny Sudakov
2016	B	`conf`	On the duplication distance of binary strings. ISIT Noga Alon, Jehoshua Bruck, Farzad Farnoud, Siddharth Jain
2016	A*	`conf`	On the maximum quartet distance between phylogenetic trees. SODA Noga Alon, Humberto Naves, Benny Sudakov
2016	A*	`conf`	Reliable Communication over Highly Connected Noisy Networks. PODC Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler
2016	J	`jnl`	Removal Lemmas for Matrices. CoRR Noga Alon, Omri Ben-Eliezer
2016	A*	`conf`	Sign rank versus VC dimension. COLT Noga Alon, Shay Moran, Amir Yehudayoff
2016	J	`jnl`	Testing Equality in Communication Graphs. Electron. Colloquium Comput. Complex. Noga Alon, Klim Efremenko, Benny Sudakov
2015	J	`jnl`	Bipartite decomposition of random graphs. J. Comb. Theory B Noga Alon
2015	J	`jnl`	Chasing a Fast Robber on Planar Graphs and Random Graphs. J. Graph Theory Noga Alon, Abbas Mehrabian
2015	J	`jnl`	Comparable pairs in families of sets. J. Comb. Theory B Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov
2015	J	`jnl`	Corruption Detection on Networks. CoRR Noga Alon, Elchanan Mossel, Robin Pemantle
2015	J	`jnl`	Drawing outerplanar graphs using three edge lengths. Comput. Geom. Noga Alon, Ohad N. Feldheim
2015	J	`jnl`	Easily Testable Graph Properties. Comb. Probab. Comput. Noga Alon, Jacob Fox
2015	J	`jnl`	Efficient Global Learning of Entailment Graphs. Comput. Linguistics Jonathan Berant, Noga Alon, Ido Dagan, Jacob Goldberger
2015	A*	`conf`	How Robust Is the Wisdom of the Crowds? IJCAI Noga Alon, Michal Feldman, Omer Lev, Moshe Tennenholtz
2015	J	`jnl`	How to Put Through Your Agenda in Collective Binary Decisions. ACM Trans. Economics and Comput. Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger
2015	J	`jnl`	Local Correction with Constant Error Rate. Algorithmica Noga Alon, Amit Weinstein
2015	J	`jnl`	Many T copies in H-free graphs. Electron. Notes Discret. Math. Noga Alon, Clara Shikhelman
2015	J	`jnl`	On Rigid Matrices and U-Polynomials. Comput. Complex. Noga Alon, Gil Cohen
2015	J	`jnl`	On the maximum quartet distance between phylogenetic trees. CoRR Noga Alon, Humberto Naves, Benny Sudakov
2015	A*	`conf`	Online Learning with Feedback Graphs: Beyond Bandits. COLT Noga Alon, Nicolò Cesa-Bianchi, Ofer Dekel, Tomer Koren
2015	J	`jnl`	Online Learning with Feedback Graphs: Beyond Bandits. CoRR Noga Alon, Nicolò Cesa-Bianchi, Ofer Dekel, Tomer Koren
2015	J	`jnl`	Practically stabilizing SWMR atomic memory in message-passing systems. J. Comput. Syst. Sci. Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil
2015	A*	`conf`	Redesigning the Israeli Medical Internship Match. EC Slava Bronfman, Noga Alon, Avinatan Hassidim, Assaf Romm
2015	J	`jnl`	Reliable Communication over Highly Connected Noisy Networks. Electron. Colloquium Comput. Complex. Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler
2015	J	`jnl`	Separation Dimension of Bounded Degree Graphs. SIAM J. Discret. Math. Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
2015	J	`jnl`	Size and Degree Anti-Ramsey Numbers. Graphs Comb. Noga Alon
2015	A*	`conf`	Welfare Maximization with Limited Interaction. FOCS Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
2015	J	`jnl`	Welfare Maximization with Limited Interaction. CoRR Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
2015	J	`jnl`	Welfare Maximization with Limited Interaction. Electron. Colloquium Comput. Complex. Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
2014	A*	`conf`	Broadcast Throughput in Radio Networks: Routing vs. Network Coding. SODA Noga Alon, Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian
2014	J	`jnl`	Chasing robbers on random geometric graphs - An alternative approach. Discret. Appl. Math. Noga Alon, Pawel Pralat
2014	J	`jnl`	Correction: Basic Network Creation Games. SIAM J. Discret. Math. Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Panagiotis Kanellopoulos, Tom Leighton
2014	B	`conf`	Linear Boolean classification, coding and "the critical problem". ISIT Emmanuel Abbe, Noga Alon, Afonso S. Bandeira
2014	J	`jnl`	Linear Boolean classification, coding and "the critical problem". CoRR Emmanuel Abbe, Noga Alon, Afonso S. Bandeira
2014	J	`jnl`	Maximizing the Number of Nonnegative Subsets. SIAM J. Discret. Math. Noga Alon, Harout K. Aydinian, Hao Huang
2014	J	`jnl`	Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback. CoRR Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Shie Mannor, Yishay Mansour, Ohad Shamir
2014	J	`jnl`	On the Compatibility of Quartet Trees. SIAM J. Discret. Math. Noga Alon, Sagi Snir, Raphael Yuster
2014	A*	`conf`	On the compatibility of quartet trees. SODA Noga Alon, Sagi Snir, Raphael Yuster
2014	J	`jnl`	Separation dimension of bounded degree graphs. CoRR Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
2014	J	`jnl`	Sign rank, VC dimension and spectral gaps. Electron. Colloquium Comput. Complex. Noga Alon, Shay Moran, Amir Yehudayoff
2014	—	`conf`	The Cover Number of a Matrix and its Algorithmic Applications. APPROX-RANDOM Noga Alon, Troy Lee, Adi Shraibman
2014	J	`jnl`	Two notions of unit distance graphs. J. Comb. Theory A Noga Alon, Andrey Kupavskii
2013	J	`jnl`	A Note on Degenerate and Spectrally Degenerate Graphs. J. Graph Theory Noga Alon
2013	J	`jnl`	Adversarial Leakage in Games. SIAM J. Discret. Math. Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz
2013	J	`jnl`	Almost k-Wise vs. k-Wise Independent Permutations, and Uniformity for General Group Actions. Theory Comput. Noga Alon, Shachar Lovett
2013	J	`jnl`	Basic Network Creation Games. SIAM J. Discret. Math. Noga Alon, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Tom Leighton
2013	J	`jnl`	Beeping a maximal independent set. Distributed Comput. Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn
2013	A*	`conf`	Bundling Attacks in Judgment Aggregation. AAAI Noga Alon, Dvir Falik, Reshef Meir, Moshe Tennenholtz
2013	A*	`conf`	Differential pricing with inequity aversion in social networks. EC Noga Alon, Yishay Mansour, Moshe Tennenholtz
2013	—	`conf`	From Bandits to Experts: A Tale of Domination and Independence. NIPS Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour
2013	J	`jnl`	From Bandits to Experts: A Tale of Domination and Independence. CoRR Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour
2013	—	`conf`	How to Put through Your Agenda in Collective Binary Decisions. ADT Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger
2013	J	`jnl`	Matrix sparsification and nested dissection over arbitrary fields. J. ACM Noga Alon, Raphael Yuster
2013	J	`jnl`	Minimizing the Number of Carries in Addition. SIAM J. Discret. Math. Noga Alon
2013	J	`jnl`	Nearly Tight Bounds for Testing Function Isomorphism. SIAM J. Comput. Noga Alon, Eric Blais, Sourav Chakraborty, David García-Soriano, Arie Matsliah
2013	—	`ch.`	Neighborly Families of Boxes and Bipartite Coverings. The Mathematics of Paul Erdős II Noga Alon
2013	A	`conf`	On Rigid Matrices and U-polynomials. CCC Noga Alon, Gil Cohen
2013	J	`jnl`	On active and passive testing. CoRR Noga Alon, Rani Hod, Amit Weinstein
2013	J	`jnl`	On sunflowers and matrix multiplication. Comput. Complex. Noga Alon, Amir Shpilka, Christopher Umans
2013	J	`jnl`	Restricted Integer Partition Functions. Integers Noga Alon
2013	—	`conf`	The Asymmetric Matrix Partition Problem. WINE Noga Alon, Michal Feldman, Iftah Gamzu, Moshe Tennenholtz
2013	J	`jnl`	The Turán number of sparse spanning graphs. J. Comb. Theory B Noga Alon, Raphael Yuster
2013	—	`conf`	The Value of Ignorance about the Number of Players. AAAI (Late-Breaking Developments) Noga Alon, Reshef Meir, Moshe Tennenholtz
2013	A*	`conf`	The approximate rank of a matrix and its algorithmic applications: approximate rank. STOC Noga Alon, Troy Lee, Adi Shraibman, Santosh S. Vempala
2013	J	`jnl`	The chromatic number of random Cayley graphs. Eur. J. Comb. Noga Alon
2013	J	`jnl`	Two notions of unit distance graphs. CoRR Noga Alon, Andrey Kupavskii
2012	J	`jnl`	A Non-linear Lower Bound for Planar Epsilon-nets. Discret. Comput. Geom. Noga Alon
2012	—	`conf`	Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions. APPROX-RANDOM Noga Alon, Shachar Lovett
2012	J	`jnl`	Bayesian ignorance. Theor. Comput. Sci. Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz
2012	J	`jnl`	Beeping a Maximal Independent Set CoRR Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn
2012	J	`jnl`	Dense uniform hypergraphs have high list chromatic number. Discret. Math. Noga Alon, Alexandr V. Kostochka
2012	J	`jnl`	Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. J. Comb. Theory A Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov
2012	J	`jnl`	Local Correction with Constant Error Rate CoRR Noga Alon, Amit Weinstein
2012	J	`jnl`	Local correction of juntas. Inf. Process. Lett. Noga Alon, Amit Weinstein
2012	A*	`conf`	Nearly complete graphs decomposable into large induced matchings and their applications. STOC Noga Alon, Ankur Moitra, Benny Sudakov
2012	J	`jnl`	Nonnegative k-sums, fractional covers, and probability of small deviations. J. Comb. Theory B Noga Alon, Hao Huang, Benny Sudakov
2012	J	`jnl`	On Rigid Matrices and Subspace Polynomials. Electron. Colloquium Comput. Complex. Noga Alon, Gil Cohen
2012	A	`conf`	On Sunflowers and Matrix Multiplication. CCC Noga Alon, Amir Shpilka, Christopher Umans
2012	A*	`conf`	Optimizing budget allocation among channels and influencers. WWW Noga Alon, Iftah Gamzu, Moshe Tennenholtz
2012	A*	`conf`	Sequential voting with externalities: herding in social networks. EC Noga Alon, Moshe Babaioff, Ron Karidi, Ron Lavi, Moshe Tennenholtz
2012	A*	`conf`	Space-efficient local computation algorithms. SODA Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie
2012	J	`jnl`	The Approximate Rank of a Matrix and its Algorithmic Applications. Electron. Colloquium Comput. Complex. Noga Alon, Santosh S. Vempala
2012	J	`jnl`	The de Bruijn-Erdős theorem for hypergraphs. Des. Codes Cryptogr. Noga Alon, Keith E. Mellinger, Dhruv Mubayi, Jacques Verstraëte
2011	J	`jnl`	Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions. Electron. Colloquium Comput. Complex. Noga Alon, Shachar Lovett
2011	A	`conf`	Beeping a Maximal Independent Set. DISC Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn
2011	A	`conf`	Economical Graph Discovery. ICS Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz
2011	J	`jnl`	Hypergraph list coloring and Euclidean Ramsey theory. Random Struct. Algorithms Noga Alon, Alexandr V. Kostochka
2011	—	`conf`	List coloring and Euclidean Ramsey Theory. CCCG Noga Alon
2011	J	`jnl`	Local Correction of Boolean Functions CoRR Noga Alon, Amit Weinstein
2011	J	`jnl`	MIS on the fly CoRR Yehuda Afek, Noga Alon, Ziv Bar-Joseph
2011	J	`jnl`	Many Random Walks Are Faster Than One. Comb. Probab. Comput. Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle
2011	J	`jnl`	Modular Orientations of Random and Quasi-Random Regular Graphs. Comb. Probab. Comput. Noga Alon, Pawel Pralat
2011	J	`jnl`	Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications CoRR Noga Alon, Ankur Moitra, Benny Sudakov
2011	J	`jnl`	On Sunflowers and Matrix Multiplication. Electron. Colloquium Comput. Complex. Noga Alon, Amir Shpilka, Christopher Umans
2011	J	`jnl`	On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game. Electron. J. Comb. Noga Alon, Abbas Mehrabian
2011	J	`jnl`	On graphs and algebraic graphs that do not contain cycles of length 4. J. Graph Theory Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster
2011	C	`conf`	Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems. SSS Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil
2011	J	`jnl`	Solving MAX- Algorithmica Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2011	J	`jnl`	Space-efficient Local Computation Algorithms CoRR Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie
2011	J	`jnl`	Sparse Balanced Partitions and the Complexity of Subgraph Problems. SIAM J. Discret. Math. Noga Alon, Dániel Marx
2011	B	`conf`	Sum of us: strategyproof selection from the selectors. TARK Noga Alon, Felix A. Fischer, Ariel D. Procaccia, Moshe Tennenholtz
2011	J	`jnl`	Testing perfection is hard CoRR Noga Alon, Jacob Fox
2011	J	`jnl`	The Number of Electron. J. Comb. Noga Alon, Simi Haber, Michael Krivelevich
2011	J	`jnl`	The structure of almost all graphs in a hereditary property. J. Comb. Theory B Noga Alon, József Balogh, Béla Bollobás, Robert Morris
2010	A*	`conf`	A Non-linear Lower Bound for Planar Epsilon-Nets. FOCS Noga Alon
2010	J	`jnl`	A note on competitive diffusion through social networks. Inf. Process. Lett. Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz
2010	J	`jnl`	A note on regular Ramsey graphs. J. Graph Theory Noga Alon, Sonny Ben-Shimon, Michael Krivelevich
2010	A	`conf`	Adversarial Leakage in Games. ICS Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz
2010	J	`jnl`	Another Abstraction of the Erdös-Szekeres Happy End Theorem. Electron. J. Comb. Noga Alon, Ehsan Chiniforooshan, Vasek Chvátal, François Genest
2010	J	`jnl`	Approximate Maximum Parsimony and Ancestral Maximum Likelihood. IEEE ACM Trans. Comput. Biol. Bioinform. Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
2010	J	`jnl`	Balanced families of perfect hash functions and their applications. ACM Trans. Algorithms Noga Alon, Shai Gutner
2010	B	`conf`	Basic network creation games. SPAA Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton
2010	A*	`conf`	Bayesian ignorance. PODC Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz
2010	A	`conf`	Brief Announcement: Sharing Memory in a Self-stabilizing Manner. DISC Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil
2010	J	`jnl`	Introduction. Comb. Probab. Comput. Noga Alon, Béla Bollobás
2010	—	`ch.`	On Constant Time Approximation of Parameters of Bounded Degree Graphs. Property Testing Noga Alon
2010	J	`jnl`	Playing to Retain the Advantage. Comb. Probab. Comput. Noga Alon, Dan Hefetz, Michael Krivelevich
2010	J	`jnl`	Practically Stabilizing Atomic Memory CoRR Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil
2010	J	`jnl`	Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM J. Comput. Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
2010	A*	`conf`	Solving Linear Systems through Nested Dissection. FOCS Noga Alon, Raphael Yuster
2010	A*	`conf`	Solving MAX-r-SAT Above a Tight Lower Bound. SODA Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2010	J	`jnl`	Strategyproof Approximation of the Minimax on Networks. Math. Oper. Res. Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz
2010	—	`conf`	Testing Boolean Function Isomorphism. APPROX-RANDOM Noga Alon, Eric Blais
2010	J	`jnl`	The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus. SIAM J. Discret. Math. Noga Alon, Ohad N. Feldheim
2010	J	`jnl`	The inverse Banzhaf problem. Soc. Choice Welf. Noga Alon, Paul H. Edelman
2010	J	`jnl`	Typical peak sidelobe level of binary sequences. IEEE Trans. Inf. Theory Noga Alon, Simon Litsyn, Alexander Shpunt
2010	A*	`conf`	Voting Paradoxes. COLT Noga Alon
2010	J	`jnl`	Walking in circles. Discret. Math. Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz
2009	J	`jnl`	A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. SIAM J. Comput. Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira
2009	J	`jnl`	Admission control to minimize rejections and online set cover with repetitions. ACM Trans. Algorithms Noga Alon, Yossi Azar, Shai Gutner
2009	—	`conf`	Balanced Hashing, Color Coding and Approximate Counting. IWPEC Noga Alon, Shai Gutner
2009	J	`jnl`	Balanced Hashing, Color Coding and Approximate Counting. Electron. Colloquium Comput. Complex. Noga Alon, Shai Gutner
2009	J	`jnl`	Can a Graph Have Distinct Regular Partitions? SIAM J. Discret. Math. Noga Alon, Asaf Shapira, Uri Stav
2009	A*	`conf`	Choice-Memory Tradeoff in Allocations. FOCS Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
2009	—	`conf`	Deterministic Approximation Algorithms for the Nearest Codeword Problem. APPROX-RANDOM Noga Alon, Rina Panigrahy, Sergey Yekhanin
2009	—	`conf`	Deterministic approximation algorithms for the nearest codeword problem. Algebraic Methods in Computational Complexity Noga Alon, Rina Panigrahy, Sergey Yekhanin
2009	J	`jnl`	Economical Elimination of Cycles in the Torus. Comb. Probab. Comput. Noga Alon
2009	—	`conf`	Fast FAST. ICALP (1) Noga Alon, Daniel Lokshtanov, Saket Saurabh
2009	J	`jnl`	Hardness of edge-modification problems. Theor. Comput. Sci. Noga Alon, Uri Stav
2009	J	`jnl`	Induced subgraphs with distinct sizes. Random Struct. Algorithms Noga Alon, Alexandr V. Kostochka
2009	J	`jnl`	Introduction. Comb. Probab. Comput. Noga Alon, Béla Bollobás
2009	J	`jnl`	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Algorithmica Noga Alon, Shai Gutner
2009	A*	`conf`	On the power of two, three and four probes. SODA Noga Alon, Uriel Feige
2009	J	`jnl`	Optimal Monotone Encodings. IEEE Trans. Inf. Theory Noga Alon, Rani Hod
2009	J	`jnl`	Perturbed Identity Matrices Have High Rank: Proof and Applications. Comb. Probab. Comput. Noga Alon
2009	J	`jnl`	Playing to retain the advantage. Electron. Notes Discret. Math. Dan Hefetz, Noga Alon, Michael Krivelevich
2009	J	`jnl`	Polychromatic Colorings of Plane Graphs. Discret. Comput. Geom. Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein
2009	J	`jnl`	Sizes of Induced Subgraphs of Ramsey Graphs. Comb. Probab. Comput. Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij
2009	J	`jnl`	Spanning Directed Trees with Many Leaves. SIAM J. Discret. Math. Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2009	J	`jnl`	Stability-type results for hereditary properties. J. Graph Theory Noga Alon, Uri Stav
2009	J	`jnl`	Strategyproof Approximation Mechanisms for Location on Networks CoRR Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz
2009	J	`jnl`	Sum of Us: Strategyproof Selection from the Selectors CoRR Noga Alon, Felix A. Fischer, Ariel D. Procaccia, Moshe Tennenholtz
2009	J	`jnl`	Tell Me Who I Am: An Interactive Recommendation System. Theory Comput. Syst. Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir
2009	J	`jnl`	The Online Set Cover Problem. SIAM J. Comput. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2009	J	`jnl`	Uniformly cross intersecting families. Comb. Noga Alon, Eyal Lubetzky
2008	J	`jnl`	A Characterization of the (Natural) Graph Properties Testable with One-Sided Error. SIAM J. Comput. Noga Alon, Asaf Shapira
2008	J	`jnl`	A note on regular Ramsey graphs CoRR Noga Alon, Sonny Ben-Shimon, Michael Krivelevich
2008	J	`jnl`	A separation theorem in property testing. Comb. Noga Alon, Asaf Shapira
2008	J	`jnl`	Admission Control to Minimize Rejections and Online Set Cover with Repetitions CoRR Noga Alon, Yossi Azar, Shai Gutner
2008	J	`jnl`	An Elementary Construction of Constant-Degree Expanders. Comb. Probab. Comput. Noga Alon, Oded Schwartz, Asaf Shapira
2008	J	`jnl`	An isoperimetric inequality in the universal cover of the punctured plane. Discret. Math. Noga Alon, Adi Pinchasi, Rom Pinchasi
2008	J	`jnl`	Balanced Families of Perfect Hash Functions and Their Applications CoRR Noga Alon, Shai Gutner
2008	A	`conf`	Biomolecular network motif counting and discovery by color coding. ISMB Noga Alon, Phuong Dao, Iman Hajirasouliha, Fereydoun Hormozdiari, Süleyman Cenk Sahinalp
2008	J	`jnl`	Breaking the rhythm on graphs. Discret. Math. Noga Alon, Jaroslaw Grytczuk
2008	A*	`conf`	Broadcasting with Side Information. FOCS Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim
2008	J	`jnl`	Broadcasting with side information CoRR Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein
2008	J	`jnl`	Cleaning Regular Graphs with Brushes. SIAM J. Discret. Math. Noga Alon, Pawel Pralat, Nicholas C. Wormald
2008	—	`ch.`	Color Coding. Encyclopedia of Algorithms Noga Alon, Raphael Yuster, Uri Zwick
2008	J	`jnl`	Conflict-Free colorings of Shallow Discs. Int. J. Comput. Geom. Appl. Noga Alon, Shakhar Smorodinsky
2008	J	`jnl`	Deterministic Approximation Algorithms for the Nearest Codeword Problem. Electron. Colloquium Comput. Complex. Noga Alon, Rina Panigrahy, Sergey Yekhanin
2008	J	`jnl`	Every Monotone Graph Property Is Testable. SIAM J. Comput. Noga Alon, Asaf Shapira
2008	J	`jnl`	Kernels for the Dominating Set Problem on Graphs with an Excluded Minor. Electron. Colloquium Comput. Complex. Noga Alon, Shai Gutner
2008	J	`jnl`	Large Nearly Regular Induced Subgraphs. SIAM J. Discret. Math. Noga Alon, Michael Krivelevich, Benny Sudakov
2008	J	`jnl`	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs CoRR Noga Alon, Shai Gutner
2008	B	`conf`	Many random walks are faster than one. SPAA Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle
2008	—	`conf`	Optimal Monotone Encodings. ICALP (1) Noga Alon, Rani Hod
2008	A*	`conf`	Optimal universal graphs with deterministic embedding. SODA Noga Alon, Michael R. Capalbo
2008	J	`jnl`	Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. ACM Trans. Algorithms Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos
2008	—	`conf`	Polychromatic colorings of plane graphs. SCG Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein
2008	J	`jnl`	Problems and results in extremal combinatorics - II. Discret. Math. Noga Alon
2008	—	`conf`	Small Sample Spaces Cannot Fool Low Degree Polynomials. APPROX-RANDOM Noga Alon, Ido Ben-Eliezer, Michael Krivelevich
2008	J	`jnl`	Spanning directed trees with many leaves CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2008	J	`jnl`	Testing Triangle-Freeness in General Graphs. SIAM J. Discret. Math. Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron
2008	J	`jnl`	The Grothendieck constant of random and pseudo-random graphs. Discret. Optim. Noga Alon, Eli Berger
2008	J	`jnl`	The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence. Electron. J. Comb. Noga Alon, Shmuel Friedland
2008	—	`book`	The Probabilistic Method, Third Edition. Noga Alon, Joel H. Spencer
2008	—	`conf`	The complexity of the outer face in arrangements of random segments. SCG Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir
2008	J	`jnl`	The maximum edit distance from hereditary graph properties. J. Comb. Theory B Noga Alon, Uri Stav
2008	A*	`conf`	Weak ε-nets and interval chains. SODA Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky
2008	J	`jnl`	Weak ε-nets and interval chains. J. ACM Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky
2008	J	`jnl`	What is the furthest graph from a hereditary property? Random Struct. Algorithms Noga Alon, Uri Stav
2008	A*	`conf`	k-Wise Independent Random Graphs. FOCS Noga Alon, Asaf Nussboim
2007	J	`jnl`	Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. Inf. Comput. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
2007	A*	`conf`	An elementary construction of constant-degree expanders. SODA Noga Alon, Oded Schwartz, Asaf Shapira
2007	J	`jnl`	Approximating the maximum clique minor and some subgraph homeomorphism problems. Theor. Comput. Sci. Noga Alon, Andrzej Lingas, Martin Wahlen
2007	A*	`conf`	Balanced Families of Perfect Hash Functions and Their Applications. ICALP Noga Alon, Shai Gutner
2007	J	`jnl`	Better Algorithms and Bounds for Directed Maximum Leaf Problems CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	—	`conf`	Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	Misc	`conf`	Can a Graph Have Distinct Regular Partitions? COCOON Noga Alon, Asaf Shapira, Uri Stav
2007	J	`jnl`	Codes And Xor Graph Products. Comb. Noga Alon, Eyal Lubetzky
2007	J	`jnl`	Edge Colouring with Delays. Comb. Probab. Comput. Noga Alon, Vera Asodi
2007	J	`jnl`	Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. SIAM J. Comput. Noga Alon, Eldar Fischer, Ilan Newman
2007	J	`jnl`	Embedding nearly-spanning bounded degree trees. Comb. Noga Alon, Michael Krivelevich, Benny Sudakov
2007	A	`conf`	Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. ESA Noga Alon, Raphael Yuster
2007	A*	`conf`	Finding Disjoint Paths in Expanders Deterministically and Online. FOCS Noga Alon, Michael R. Capalbo
2007	J	`jnl`	Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon. SIAM J. Discret. Math. Noga Alon, Eyal Lubetzky
2007	J	`jnl`	Guessing secrets efficiently via list decoding. ACM Trans. Algorithms Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan
2007	J	`jnl`	Hardness of fully dense problems. Inf. Comput. Nir Ailon, Noga Alon
2007	A*	`conf`	Improved approximation for directed cut problems. STOC Amit Agarwal, Noga Alon, Moses Charikar
2007	J	`jnl`	Independent sets in tensor graph powers. J. Graph Theory Noga Alon, Eyal Lubetzky
2007	Misc	`conf`	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. COCOON Noga Alon, Shai Gutner
2007	J	`jnl`	Maximum directed cuts in acyclic digraphs. J. Graph Theory Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
2007	J	`jnl`	On (epsilon, k)-min-wise independent permutations. Random Struct. Algorithms Noga Alon, Toshiya Itoh, Tatsuya Nagatani
2007	J	`jnl`	On graphs with subgraphs having large independence numbers. J. Graph Theory Noga Alon, Benny Sudakov
2007	J	`jnl`	Parameterized Algorithms for Directed Maximum Leaf Problems CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	A*	`conf`	Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	J	`jnl`	Partitioning multi-dimensional sets in a small number of "uniform" parts. Eur. J. Comb. Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin
2007	J	`jnl`	Privileged users in zero-error transmission over a noisy channel. Comb. Noga Alon, Eyal Lubetzky
2007	A*	`conf`	Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
2007	J	`jnl`	Sparse universal graphs for bounded-degree graphs. Random Struct. Algorithms Noga Alon, Michael R. Capalbo
2007	A*	`conf`	Testing k-wise and almost k-wise independence. STOC Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie
2007	J	`jnl`	Tracing Many Users With Almost No Rate Penalty. IEEE Trans. Inf. Theory Noga Alon, Vera Asodi
2007	J	`jnl`	Turán's Theorem in the Hypercube. SIAM J. Discret. Math. Noga Alon, Anja Krech, Tibor Szabó
2006	J	`jnl`	A Characterization of Easily Testable Induced Subgraphs. Comb. Probab. Comput. Noga Alon, Asaf Shapira
2006	J	`jnl`	A Ramsey-type result for the hypercube. J. Graph Theory Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák
2006	A*	`conf`	A combinatorial characterization of the testable graph properties: it's all about regularity. STOC Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira
2006	J	`jnl`	A general approach to online network optimization problems. ACM Trans. Algorithms Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2006	—	`conf`	Additive Approximation for Edge-Deletion Problems (Abstract). ICALP (1) Noga Alon, Asaf Shapira, Benny Sudakov
2006	J	`jnl`	Algorithmic construction of sets for ACM Trans. Algorithms Noga Alon, Dana Moshkovitz, Shmuel Safra
2006	J	`jnl`	An Elementary Construction of Constant-Degree Expanders. Electron. Colloquium Comput. Complex. Noga Alon, Oded Schwartz, Asaf Shapira
2006	J	`jnl`	Approximating the Cut-Norm via Grothendieck's Inequality. SIAM J. Comput. Noga Alon, Assaf Naor
2006	—	`conf`	Conflict-free colorings of shallow discs. SCG Noga Alon, Shakhar Smorodinsky
2006	J	`jnl`	Dominating sets in k-majority tournaments. J. Comb. Theory B Noga Alon, Graham R. Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler
2006	J	`jnl`	Explicit construction of linear sized tolerant networks. Discret. Math. Noga Alon, Fan R. K. Chung
2006	J	`jnl`	Feasible Schedules for Rotating Transmissions. Comb. Probab. Comput. Noga Alon
2006	J	`jnl`	H-Free Graphs of Large Minimum Degree. Electron. J. Comb. Noga Alon, Benny Sudakov
2006	J	`jnl`	Measures of Pseudorandomness for Finite Sequences: Minimal Values. Comb. Probab. Comput. Noga Alon, Yoshiharu Kohayakawa, Christian Mauduit, Carlos Gustavo T. de A. Moreira, Vojtech Rödl
2006	J	`jnl`	Multi-Node Graphs: A Framework for Multiplexed Biological Assays. J. Comput. Biol. Noga Alon, Vera Asodi, Charles Cantor, Simon Kasif, John Rachlin
2006	J	`jnl`	On An Extremal Hypergraph Problem Of Brown, Erdös And Sós. Comb. Noga Alon, Asaf Shapira
2006	J	`jnl`	Ranking Tournaments. SIAM J. Discret. Math. Noga Alon
2006	J	`jnl`	Regular graphs whose subgraphs tend to be acyclic. Random Struct. Algorithms Noga Alon, Eitan Bachmat
2006	J	`jnl`	Splitting digraphs. Comb. Probab. Comput. Noga Alon
2006	B	`conf`	Tell me who I am: an interactive recommendation system. SPAA Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir
2006	A*	`conf`	Testing triangle-freeness in general graphs. SODA Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron
2006	J	`jnl`	The Number Of Orientations Having No Fixed Tournament. Comb. Noga Alon, Raphael Yuster
2006	J	`jnl`	The Shannon capacity of a graph and the independence numbers of its powers CoRR Noga Alon, Eyal Lubetzky
2006	J	`jnl`	The Shannon capacity of a graph and the independence numbers of its powers. IEEE Trans. Inf. Theory Noga Alon, Eyal Lubetzky
2006	J	`jnl`	Tracing a single user. Eur. J. Comb. Noga Alon, Vera Asodi
2005	A*	`conf`	A Characterization of the (natural) Graph Properties Testable with One-Sided Error. FOCS Noga Alon, Asaf Shapira
2005	A*	`conf`	Additive Approximation for Edge-Deletion Problems. FOCS Noga Alon, Asaf Shapira, Benny Sudakov
2005	B	`conf`	Admission control to minimize rejections and online set cover with repetitions. SPAA Noga Alon, Yossi Azar, Shai Gutner
2005	J	`jnl`	Crossing patterns of semi-algebraic sets. J. Comb. Theory A Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir
2005	J	`jnl`	Discrepancy Games. Electron. J. Comb. Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó
2005	A*	`conf`	Estimating arbitrary subset sums with few probes. PODS Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup
2005	A*	`conf`	Every monotone graph property is testable. STOC Noga Alon, Asaf Shapira
2005	J	`jnl`	Homomorphisms in Graph Property Testing - A Survey Electron. Colloquium Comput. Complex. Asaf Shapira, Noga Alon
2005	J	`jnl`	Learning a Hidden Subgraph. SIAM J. Discret. Math. Noga Alon, Vera Asodi
2005	J	`jnl`	Linear Equations, Arithmetic Progressions and Hypergraph Property Testing. Theory Comput. Noga Alon, Asaf Shapira
2005	A*	`conf`	Linear equations, arithmetic progressions and hypergraph property testing. SODA Noga Alon, Asaf Shapira
2005	J	`jnl`	Nonrepetitive colorings of graphs. Electron. Notes Discret. Math. Noga Alon, Jaroslaw Grytczuk
2005	J	`jnl`	On a Hypergraph Matching Problem. Graphs Comb. Noga Alon, Raphael Yuster
2005	A*	`conf`	Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. SODA Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos
2005	J	`jnl`	Partitioning multi-dimensional sets in a small number of "uniform" parts Electron. Colloquium Comput. Complex. Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin
2005	A*	`conf`	Quadratic forms on graphs. STOC Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor
2005	J	`jnl`	Sharp Bounds For Some Multicolor Ramsey Numbers. Comb. Noga Alon, Vojtech Rödl
2005	J	`jnl`	Testing Reed-Muller codes. IEEE Trans. Inf. Theory Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
2005	J	`jnl`	Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Comput. Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
2004	A*	`conf`	A characterization of easily testable induced subgraphs. SODA Noga Alon, Asaf Shapira
2004	A*	`conf`	A general approach to online network optimization problems. SODA Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2004	J	`jnl`	Algorithms with large domination ratio. J. Algorithms Noga Alon, Gregory Z. Gutin, Michael Krivelevich
2004	A*	`conf`	Approximating the cut-norm via Grothendieck's inequality. STOC Noga Alon, Assaf Naor
2004	J	`jnl`	Dense graphs are antimagic. J. Graph Theory Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster
2004	—	`conf`	Edge Coloring with Delays. APPROX-RANDOM Noga Alon, Vera Asodi
2004	—	`conf`	Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices. NIPS Nathan Srebro, Noga Alon, Tommi S. Jaakkola
2004	J	`jnl`	Learning a Hidden Matching. SIAM J. Comput. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
2004	A*	`conf`	Learning a Hidden Subgraph. ICALP Noga Alon, Vera Asodi
2004	J	`jnl`	New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. Comb. Probab. Comput. Noga Alon, Uri Stav
2004	J	`jnl`	Testing of Clustering. SIAM Rev. Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
2004	J	`jnl`	Testing subgraphs in directed graphs. J. Comput. Syst. Sci. Noga Alon, Asaf Shapira
2003	J	`jnl`	A Coding Theory Bound and Zero-Sum Square Matrices. Graphs Comb. Noga Alon, Simon Litsyn, Raphael Yuster
2003	J	`jnl`	A simple algorithm for edge-coloring bipartite multigraphs. Inf. Process. Lett. Noga Alon
2003	J	`jnl`	Almost k-wise independence versus k-wise independence. Inf. Process. Lett. Noga Alon, Oded Goldreich, Yishay Mansour
2003	J	`jnl`	Factor Discret. Math. Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2003	J	`jnl`	Generalized hashing and parent-identifying codes. J. Comb. Theory A Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
2003	J	`jnl`	Induced subgraphs of prescribed size. J. Graph Theory Noga Alon, Michael Krivelevich, Benny Sudakov
2003	J	`jnl`	Maximum cuts and judicious partitions in graphs without short cycles. J. Comb. Theory B Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov
2003	J	`jnl`	Partitioning into graphs with only small components. J. Comb. Theory B Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan
2003	J	`jnl`	Problems and results in extremal combinatorics--I. Discret. Math. Noga Alon
2003	J	`jnl`	Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. Random Struct. Algorithms Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin
2003	J	`jnl`	Random sampling and approximation of MAX-CSPs. J. Comput. Syst. Sci. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2003	J	`jnl`	Smaller Explicit Superconcentrators. Internet Math. Noga Alon, Michael R. Capalbo
2003	A*	`conf`	Smaller explicit superconcentrators. SODA Noga Alon, Michael R. Capalbo
2003	—	`conf`	Testing Low-Degree Polynomials over GF(2(. RANDOM-APPROX Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
2003	J	`jnl`	Testing of Clustering. SIAM J. Discret. Math. Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
2003	J	`jnl`	Testing satisfiability. J. Algorithms Noga Alon, Asaf Shapira
2003	A*	`conf`	Testing subgraphs in directed graphs. STOC Noga Alon, Asaf Shapira
2003	A*	`conf`	The online set cover problem. STOC Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2003	J	`jnl`	Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. Comb. Probab. Comput. Noga Alon, Michael Krivelevich, Benny Sudakov
2003	J	`jnl`	Typechecking XML views of relational databases. ACM Trans. Comput. Log. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
2003	J	`jnl`	XML with data values: typechecking revisited. J. Comput. Syst. Sci. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
2002	J	`jnl`	A Ramsey-type problem and the Turán numbers. J. Graph Theory Noga Alon, Paul Erdös, David S. Gunderson, Michael Molloy
2002	J	`jnl`	Algorithmic Aspects of Acyclic Edge Colorings. Algorithmica Noga Alon, Ayal Zaks
2002	J	`jnl`	Almost k-wise independence versus k-wise independence. Electron. Colloquium Comput. Complex. Noga Alon, Oded Goldreich, Yishay Mansour
2002	J	`jnl`	Covering a hypergraph of subgraphs. Discret. Math. Noga Alon
2002	A*	`conf`	Explicit Unique-Neighbor Expanders. FOCS Noga Alon, Michael R. Capalbo
2002	J	`jnl`	Game domination number. Discret. Math. Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó
2002	A*	`conf`	Guessing secrets efficiently via list decoding. SODA Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan
2002	A*	`conf`	Learning a Hidden Matching. FOCS Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
2002	J	`jnl`	Nonrepetitive colorings of graphs. Random Struct. Algorithms Noga Alon, Jaroslaw Grytczuk, Mariusz Haluszczak, Oliver Riordan
2002	J	`jnl`	On partitions of discrete boxes. Discret. Math. Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman
2002	J	`jnl`	On the discrepancy of combinatorial rectangles. Random Struct. Algorithms Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen
2002	A*	`conf`	Random sampling and approximation of MAX-CSP problems. STOC Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2002	J	`jnl`	Scalable Secure Storage When Half the System Is Faulty. Inf. Comput. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
2002	J	`jnl`	Testing k-colorability. SIAM J. Discret. Math. Noga Alon, Michael Krivelevich
2002	A*	`conf`	Testing satisfiability. SODA Noga Alon, Asaf Shapira
2002	J	`jnl`	Testing subgraphs in large graphs. Random Struct. Algorithms Noga Alon
2002	J	`jnl`	The Chromatic Number Of Graph Powers. Comb. Probab. Comput. Noga Alon, Bojan Mohar
2002	J	`jnl`	The Moore Bound for Irregular Graphs. Graphs Comb. Noga Alon, Shlomo Hoory, Nathan Linial
2002	J	`jnl`	Tracking Join and Self-Join Sizes in Limited Storage. J. Comput. Syst. Sci. Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario Szegedy
2002	J	`jnl`	Transversal numbers for hypergraphs arising in geometry. Adv. Appl. Math. Noga Alon, Gil Kalai, Jirí Matousek, Roy Meshulam
2002	J	`jnl`	Voting paradoxes and digraphs realizations. Adv. Appl. Math. Noga Alon
2001	J	`jnl`	Acyclic edge colorings of graphs. J. Graph Theory Noga Alon, Benny Sudakov, Ayal Zaks
2001	B	`conf`	An optimal procedure for gap closing in whole genome shotgun sequencing. RECOMB Richard Beigel, Noga Alon, Simon Kasif, Mehmet Serkan Apaydin, Lance Fortnow
2001	J	`jnl`	Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. SIAM J. Discret. Math. Noga Alon, Benny Sudakov, Uri Zwick
2001	A*	`conf`	Constructing worst case instances for semidefinite programming based approximation algorithms. SODA Noga Alon, Benny Sudakov, Uri Zwick
2001	J	`jnl`	Equireplicate Balanced Binary Codes for Oligo Arrays. SIAM J. Discret. Math. Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa
2001	J	`jnl`	Large induced forests in sparse graphs. J. Graph Theory Noga Alon, Dhruv Mubayi, Robin Thomas
2001	J	`jnl`	Linear Arboricity and Linear k-Arboricity of Regular Graphs. Graphs Comb. Noga Alon, Vanessa Teague, Nicholas C. Wormald
2001	A	`conf`	Lower Bounds for Approximations by Low Degree Polynomials Over Z CCC Noga Alon, Richard Beigel
2001	—	`conf`	Near-optimum Universal Graphs for Graphs with Bounded Degrees. RANDOM-APPROX Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2001	J	`jnl`	On the Complexity of Arrangements of Circles in the Plane. Discret. Comput. Geom. Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir
2001	J	`jnl`	On the maximum number of Hamiltonian paths in tournaments. Random Struct. Algorithms Ilan Adler, Noga Alon, Sheldon M. Ross
2001	J	`jnl`	Parent-Identifying Codes. J. Comb. Theory A Noga Alon, Eldar Fischer, Mario Szegedy
2001	J	`jnl`	Ramsey-type Theorems with Forbidden Subgraphs. Comb. Noga Alon, János Pach, József Solymosi
2001	J	`jnl`	Random Sampling and Approximation of MAX-CSP Problems Electron. Colloquium Comput. Complex. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2001	A*	`conf`	Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications. FOCS Noga Alon, Alexander Lubotzky, Avi Wigderson
2001	A*	`conf`	Testing Subgraphs in Large Graphs. FOCS Noga Alon
2001	A*	`conf`	Typechecking XML Views of Relational Databases. LICS Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
2001	J	`jnl`	Unextendible Product Bases. J. Comb. Theory A Noga Alon, László Lovász
2001	A*	`conf`	XML with Data Values: Typechecking Revisited. PODS Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
2000	J	`jnl`	Bipartite Subgraphs And The Smallest Eigenvalue. Comb. Probab. Comput. Noga Alon, Benny Sudakov
2000	J	`jnl`	Decreasing the diameter of bounded degree graphs. J. Graph Theory Noga Alon, András Gyárfás, Miklós Ruszinkó
2000	J	`jnl`	Degrees and choice numbers. Random Struct. Algorithms Noga Alon
2000	J	`jnl`	Efficient Testing of Large Graphs. Comb. Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
2000	J	`jnl`	Every Eur. J. Comb. Noga Alon, Raphael Yuster
2000	J	`jnl`	Locally Thin Set Families. Comb. Probab. Comput. Noga Alon, Emanuela Fachini, János Körner
2000	J	`jnl`	Long cycles in critical graphs. J. Graph Theory Noga Alon, Michael Krivelevich, Paul D. Seymour
2000	J	`jnl`	On a Problem in Shuffling. J. Comb. Theory A Noga Alon, Kenneth A. Berman, Daniel J. Kleitman
2000	J	`jnl`	On the Number of Permutations Avoiding a Given Pattern. J. Comb. Theory A Noga Alon, Ehud Friedgut
2000	J	`jnl`	Packing Ferrers Shapes. Comb. Probab. Comput. Noga Alon, Miklós Bóna, Joel Spencer
2000	J	`jnl`	Regular Languages are Testable with a Constant Number of Queries. SIAM J. Comput. Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
2000	A*	`conf`	Scalable Secure Storage when Half the System Is Faulty. ICALP Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
2000	J	`jnl`	String Quartets In Binary. Comb. Probab. Comput. Noga Alon, János Körner, Angelo Monti
2000	A*	`conf`	Testing of Clustering. FOCS Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
2000	—	`book`	The Probabilistic Method, Second Edition Noga Alon, Joel H. Spencer
2000	A*	`conf`	Universality and Tolerance. FOCS Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
1999	J	`jnl`	Coloring Graphs with Sparse Neighborhoods. J. Comb. Theory B Noga Alon, Michael Krivelevich, Benny Sudakov
1999	A*	`conf`	Efficient Testing of Large Graphs. FOCS Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
1999	—	`conf`	Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. RANDOM-APPROX Noga Alon, Uri Arad, Yossi Azar
1999	J	`jnl`	Large Sets of Nearly Orthogonal Vectors. Graphs Comb. Noga Alon, Mario Szegedy
1999	J	`jnl`	Linear Hash Functions. J. ACM Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
1999	J	`jnl`	List Coloring of Random and Pseudo-Random Graphs. Comb. Noga Alon, Michael Krivelevich, Benny Sudakov
1999	J	`jnl`	Non-averaging Subsets and Non-vanishing Transversals. J. Comb. Theory A Noga Alon, Imre Z. Ruzsa
1999	J	`jnl`	Norm-Graphs: Variations and Applications. J. Comb. Theory B Noga Alon, Lajos Rónyai, Tibor Szabó
1999	J	`jnl`	On Two Segmentation Problems. J. Algorithms Noga Alon, Benny Sudakov
1999	J	`jnl`	Refining the Graph Density Condition for the Existence of Almost K-factors. Ars Comb. Noga Alon, Eldar Fischer
1999	J	`jnl`	Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs. Eur. J. Comb. Noga Alon, Peter Hamburger, Alexandr V. Kostochka
1999	A*	`conf`	Regular Languages Are Testable with a Constant Number of Queries. FOCS Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
1999	J	`jnl`	Separable Partitions. Discret. Appl. Math. Noga Alon, Shmuel Onn
1999	J	`jnl`	The Space Complexity of Approximating the Frequency Moments. J. Comput. Syst. Sci. Noga Alon, Yossi Matias, Mario Szegedy
1999	A*	`conf`	Tracking Join and Self-Join Sizes in Limited Storage. PODS Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario Szegedy
1998	J	`jnl`	Approximating the independence number via the theta-function. Math. Program. Noga Alon, Nabil Kahalé
1998	J	`jnl`	Bipartite subgraphs of integer weighted graphs. Discret. Math. Noga Alon, Eran Halperin
1998	A*	`conf`	Finding a Large Hidden Clique in a Random Graph. SODA Noga Alon, Michael Krivelevich, Benny Sudakov
1998	J	`jnl`	Finding a large hidden clique in a random graph. Random Struct. Algorithms Noga Alon, Michael Krivelevich, Benny Sudakov
1998	J	`jnl`	On the Capacity of Digraphs. Eur. J. Comb. Noga Alon
1998	J	`jnl`	On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Algorithmica Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
1998	J	`jnl`	Perfect Matchings in ε-regular Graphs. Electron. J. Comb. Noga Alon, Vojtech Rödl, Andrzej Rucinski
1998	J	`jnl`	Piercing d -Intervals. Discret. Comput. Geom. Noga Alon
1998	J	`jnl`	Progressions in Sequences of Nearly Consecutive Integers. J. Comb. Theory A Noga Alon, Ayal Zaks
1998	B	`conf`	Spectral Techniques in Graph Algorithms. LATIN Noga Alon
1998	J	`jnl`	T-choosability in Graphs. Discret. Appl. Math. Noga Alon, Ayal Zaks
1998	J	`jnl`	The Shannon Capacity of a Union. Comb. Noga Alon
1997	J	`jnl`	A Note on Graph Colorings and Graph Polynomials. J. Comb. Theory B Noga Alon, Michael Tarsi
1997	J	`jnl`	A Spectral Technique for Coloring Random 3-Colorable Graphs. SIAM J. Comput. Noga Alon, Nabil Kahalé
1997	J	`jnl`	A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture. Electron. J. Comb. Noga Alon, Daniel J. Kleitman
1997	J	`jnl`	Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs. J. Comb. Theory A Noga Alon, Van H. Vu
1997	A*	`conf`	Approximation Schemes for Scheduling. SODA Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid
1997	J	`jnl`	Choosability and fractional chromatic numbers. Discret. Math. Noga Alon, Zsolt Tuza, Margit Voigt
1997	J	`jnl`	Coins with Arbitrary Weights. J. Algorithms Noga Alon, Dmitry N. Kozlov
1997	J	`jnl`	Constructive Bounds for a Ramsey-Type Problem. Graphs Comb. Noga Alon, Michael Krivelevich
1997	J	`jnl`	Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap. J. Comb. Theory B Noga Alon, Yair Caro, Raphael Yuster
1997	J	`jnl`	Finding and Counting Given Length Cycles. Algorithmica Noga Alon, Raphael Yuster, Uri Zwick
1997	J	`jnl`	Improved Parallel Approximation of a Class of Integer Programming Problems. Algorithmica Noga Alon, Aravind Srinivasan
1997	J	`jnl`	Intersecting Systems. Comb. Probab. Comput. Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
1997	A*	`conf`	Is Linear Hashing Good? STOC Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
1997	J	`jnl`	On the Degree, Size, and Chromatic Index of a Uniform Hypergraph. J. Comb. Theory A Noga Alon, Jeong Han Kim
1997	J	`jnl`	On the Edge-Expansion of Graphs. Comb. Probab. Comput. Noga Alon
1997	J	`jnl`	On the Exponent of the All Pairs Shortest Path Problem. J. Comput. Syst. Sci. Noga Alon, Zvi Galil, Oded Margalit
1997	J	`jnl`	Packings with large minimum kissing numbers. Discret. Math. Noga Alon
1997	J	`jnl`	Properly colored Hamilton cycles in edge-colored complete graphs. Random Struct. Algorithms Noga Alon, Gregory Z. Gutin
1997	J	`jnl`	Scale-sensitive dimensions, uniform convergence, and learnability. J. ACM Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler
1997	J	`jnl`	Short Certificates for Tournaments. Electron. J. Comb. Noga Alon, Miklós Ruszinkó
1997	J	`jnl`	The Concentration of the Chromatic Number of Random Graphs. Comb. Noga Alon, Michael Krivelevich
1996	J	`jnl`	2-factors in dense graphs. Discret. Math. Noga Alon, Eldar Fischer
1996	J	`jnl`	A linear time erasure-resilient code with nearly optimal recovery. IEEE Trans. Inf. Theory Noga Alon, Michael Luby
1996	J	`jnl`	Approximate Hypergraph Coloring. Nord. J. Comput. Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
1996	J	`jnl`	Bipartite Subgraphs. Comb. Noga Alon
1996	—	`conf`	Derandomization Via Small Sample Spaces (Abstract). SWAT Noga Alon
1996	J	`jnl`	Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions. Algorithmica Noga Alon, Moni Naor
1996	J	`jnl`	Disjoint Directed Cycles. J. Comb. Theory, Ser. B Noga Alon
1996	J	`jnl`	Edge-disjoint cycles in regular directed graphs. J. Graph Theory Noga Alon, Colin McDiarmid, Michael Molloy
1996	A*	`conf`	Improved Parallel Approximation of a Class of Integer Programming Programming Problems. ICALP Noga Alon, Aravind Srinivasan
1996	J	`jnl`	Independence numbers of locally sparse graphs and a Ramsey type problem. Random Struct. Algorithms Noga Alon
1996	J	`jnl`	Matching Nuts and Bolts Faster. Inf. Process. Lett. Noga Alon, Phillip G. Bradford, Rudolf Fleischer
1996	J	`jnl`	On J. Graph Theory Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich
1996	A	`conf`	On-line and Off-line Approximation Algorithms for Vector Covering Problems. ESA Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
1996	J	`jnl`	Source coding and graph entropies. IEEE Trans. Inf. Theory Noga Alon, Alon Orlitsky
1996	A*	`conf`	The Geometry of Coin-Weighing Problems. FOCS Noga Alon, Dmitry N. Kozlov, Van H. Vu
1996	A*	`conf`	The Space Complexity of Approximating the Frequency Moments. STOC Noga Alon, Yossi Matias, Mario Szegedy
1996	J	`jnl`	Vertex transversals that dominate. J. Graph Theory Noga Alon, Michael R. Fellows, Donovan R. Hare
1995	J	`jnl`	A Graph-Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput. Noga Alon, Richard M. Karp, David Peleg, Douglas B. West
1995	J	`jnl`	A Lattice Point Problem and Additive Number Theory. Comb. Noga Alon, Moshe Dubiner
1995	J	`jnl`	Bounding the Piercing Number. Discret. Comput. Geom. Noga Alon, Gil Kalai
1995	J	`jnl`	Color-Coding. J. ACM Noga Alon, Raphael Yuster, Uri Zwick
1995	J	`jnl`	Covering with Latin Transversals. Discret. Appl. Math. Noga Alon, Joel Spencer, Prasad Tetali
1995	J	`jnl`	Derandomized Graph Products. Comput. Complex. Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman
1995	J	`jnl`	Disjoint Systems. Random Struct. Algorithms Noga Alon, Benny Sudakov
1995	A	`conf`	Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. ESA Noga Alon, Zvi Galil, Moti Yung
1995	A*	`conf`	Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). FOCS Noga Alon, Jeff Edmonds, Michael Luby
1995	J	`jnl`	Long Non-Crossing Configurations in the Plane. Fundam. Informaticae Noga Alon, Sridhar Rajagopalan, Subhash Suri
1995	J	`jnl`	Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Random Struct. Algorithms Noga Alon, Alan M. Frieze, Dominic Welsh
1995	J	`jnl`	Repeated communication and Ramsey graphs. IEEE Trans. Inf. Theory Noga Alon, Alon Orlitsky
1995	J	`jnl`	The 123 Theorem and Its Extensions. J. Comb. Theory A Noga Alon, Raphael Yuster
1995	J	`jnl`	The Acyclic Orientation Game on Random Graphs. Random Struct. Algorithms Noga Alon, Zsolt Tuza
1995	J	`jnl`	epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials. Inf. Process. Lett. Noga Alon, Yishay Mansour
1994	J	`jnl`	A lower bound on the expected length of one-to-one codes. IEEE Trans. Inf. Theory Noga Alon, Alon Orlitsky
1994	A*	`conf`	A spectral technique for coloring random 3-colorable graphs (preliminary version). STOC Noga Alon, Nabil Kahalé
1994	J	`jnl`	Can Visibility Graphs Be Represented Compactly?. Discret. Comput. Geom. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
1994	J	`jnl`	Color-Coding Electron. Colloquium Comput. Complex. Noga Alon, Raphael Yuster, Uri Zwick
1994	A*	`conf`	Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. STOC Noga Alon, Raphael Yuster, Uri Zwick
1994	J	`jnl`	Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition. SIAM J. Discret. Math. Noga Alon, Jehoshua Bruck
1994	J	`jnl`	Explicit Ramsey graphs and orthonormal labelings. Electron. J. Comb. Noga Alon
1994	A	`conf`	Finding and Counting Given Length Cycles (Extended Abstract). ESA Noga Alon, Raphael Yuster, Uri Zwick
1994	J	`jnl`	Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. Theor. Comput. Sci. Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
1994	A*	`conf`	Matching Nuts and Bolts. SODA Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
1994	J	`jnl`	Packing of partial designs. Graphs Comb. Noga Alon
1994	J	`jnl`	Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. J. ACM Noga Alon, Nimrod Megiddo
1994	J	`jnl`	Planar Separators. SIAM J. Discret. Math. Noga Alon, Paul D. Seymour, Robin Thomas
1994	J	`jnl`	Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case Electron. Colloquium Comput. Complex. Noga Alon, Alan M. Frieze, Dominic Welsh
1994	A*	`conf`	Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs FOCS Noga Alon, Alan M. Frieze, Dominic Welsh
1994	J	`jnl`	Probabilistic methods in coloring and decomposition problems. Discret. Math. Noga Alon
1994	J	`jnl`	Random Cayley Graphs and Expanders. Random Struct. Algorithms Noga Alon, Yuval Roichman
1994	J	`jnl`	Routing Permutations on Graphs Via Matchings. SIAM J. Discret. Math. Noga Alon, Fan R. K. Chung, Ronald L. Graham
1994	J	`jnl`	Subdivided graphs have linear ramsey numbers. J. Graph Theory Noga Alon
1994	J	`jnl`	Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely). J. Comput. Syst. Sci. Noga Alon, Pavel Pudlák
1994	J	`jnl`	The Algorithmic Aspects of the Regularity Lemma. J. Algorithms Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
1993	J	`jnl`	Addendum to "Simple Construction of Almost k-wise Independent Random Variables". Random Struct. Algorithms Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
1993	J	`jnl`	Bisection of trees and sequences. Discret. Math. Noga Alon, Yair Caro, Ilia Krasikov
1993	—	`conf`	Can Visibility Graphs be Represented Compactly? SCG Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
1993	J	`jnl`	Coin-Flipping Games Immune Against Linear-Sized Coalitions. SIAM J. Comput. Noga Alon, Moni Naor
1993	J	`jnl`	Covering the Cube by Affine Hyperplanes. Eur. J. Comb. Noga Alon, Zoltán Füredi
1993	—	`conf`	Disjoint Systems (Extended Abstract). Algebraic Coding Noga Alon, Benny Sudakov
1993	—	`conf`	Long Non-Crossing Configurations in the Plane. SCG Noga Alon, Sridhar Rajagopalan, Subhash Suri
1993	J	`jnl`	On three zero-sum Ramsey-type problems. J. Graph Theory Noga Alon, Yair Caro
1993	J	`jnl`	On-Line Steine Trees in the Euclidean Plane. Discret. Comput. Geom. Noga Alon, Yossi Azar
1993	A*	`conf`	Routing permutations on graphs via matchings. STOC Noga Alon, Fan R. K. Chung, Ronald L. Graham
1993	A*	`conf`	Scale-sensitive Dimensions, Uniform Convergence, and Learnability FOCS Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler
1993	J	`jnl`	Threshold Functions for H-factors. Comb. Probab. Comput. Noga Alon, Raphael Yuster
1992	J	`jnl`	Almost Graphs Comb. Noga Alon, Raphael Yuster
1992	J	`jnl`	Choice Numbers of Graphs: a Probabilistic Approach. Comb. Probab. Comput. Noga Alon
1992	J	`jnl`	Colorings and orientations of graphs. Comb. Noga Alon, Michael Tarsi
1992	A*	`conf`	Comparison-Sorting and Selecting in Totally Monotone Matrices. SODA Noga Alon, Yossi Azar
1992	J	`jnl`	Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inf. Theory Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth
1992	A*	`conf`	Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths FOCS Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi
1992	J	`jnl`	Generalized sum graphs. Graphs Comb. Noga Alon, Edward R. Scheinerman
1992	A*	`conf`	Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract) FOCS Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
1992	—	`conf`	On-Line Steiner Trees in the Euclidean Plane. SCG Noga Alon, Yossi Azar
1992	J	`jnl`	Partitioning a rectangle into small perimeter rectangles. Discret. Math. Noga Alon, Daniel J. Kleitman
1992	—	`conf`	Piercing Convex Sets. SCG Noga Alon, Daniel J. Kleitman
1992	J	`jnl`	Point Selections and Weak e-Nets for Convex Hulls. Comb. Probab. Comput. Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman
1992	—	`conf`	Random Cayley Graphs and Expanders (Abstract). Expanding Graphs Noga Alon, Yuval Roichman
1992	J	`jnl`	Simple Construction of Almost k-wise Independent Random Variables. Random Struct. Algorithms Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
1992	J	`jnl`	Single Round Simulation on Radio Networks. J. Algorithms Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
1992	J	`jnl`	Spanning subgraphs of random graphs. Graphs Comb. Noga Alon, Zoltán Füredi
1992	J	`jnl`	Star arboricity. Comb. Noga Alon, Colin McDiarmid, Bruce A. Reed
1992	A*	`conf`	The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) FOCS Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
1992	—	`book`	The Probabilistic Method Noga Alon, Joel Spencer
1992	J	`jnl`	The String Chromatic Number of a Graph. Random Struct. Algorithms Noga Alon
1992	J	`jnl`	Transmitting in the Discret. Appl. Math. Noga Alon
1992	A*	`conf`	Witnesses for Boolean Matrix Multiplication and for Shortest Paths FOCS Noga Alon, Zvi Galil, Oded Margalit, Moni Naor
1991	—	`conf`	A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract). On-Line Algorithms Noga Alon, Richard M. Karp, David Peleg, Douglas B. West
1991	J	`jnl`	A Lower Bound for Radio Broadcast. J. Comput. Syst. Sci. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
1991	J	`jnl`	A Parallel Algorithmic Version of the Local Lemma. Random Struct. Algorithms Noga Alon
1991	A*	`conf`	A parallel algorithmic version of the Local Lemma FOCS Noga Alon
1991	J	`jnl`	Acyclic Coloring of Graphs. Random Struct. Algorithms Noga Alon, Colin McDiarmid, Bruce A. Reed
1991	J	`jnl`	Additive bases of vector spaces over prime fields. J. Comb. Theory A Noga Alon, Nathan Linial, Roy Meshulam
1991	J	`jnl`	Efficient Simulation of Finite Automata by Neural Nets. J. ACM Noga Alon, A. K. Dewdney, Teunis J. Ott
1991	J	`jnl`	Multicolored forests in bipartite decompositions of graphs. J. Comb. Theory B Noga Alon, Richard A. Brualdi, Bryan L. Shader
1991	J	`jnl`	Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems. J. Comb. Theory A Noga Alon, László Babai, Hiroshi Suzuki
1991	A*	`conf`	On the Exponent of the All Pairs Shortest Path Problem FOCS Noga Alon, Zvi Galil, Oded Margalit
1991	J	`jnl`	Parallel comparison algorithms for approximation problems. Comb. Noga Alon, Yossi Azar
1991	J	`jnl`	Ramsey graphs contain many distinct induced subgraphs. Graphs Comb. Noga Alon, András Hajnal
1991	J	`jnl`	Set systems with no union of cardinality 0 modulo Graphs Comb. Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer
1990	A*	`conf`	A Separator Theorem for Graphs with an Excluded Minor and its Applications STOC Noga Alon, Paul D. Seymour, Robin Thomas
1990	A*	`conf`	Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract) FOCS Noga Alon, Moni Naor
1990	J	`jnl`	Generating Pseudo-Random Permutations and Maximum Flow Algorithms. Inf. Process. Lett. Noga Alon
1990	J	`jnl`	Linear Circuits over GF(2). SIAM J. Comput. Noga Alon, Mauricio Karchmer, Avi Wigderson
1990	J	`jnl`	Not All Graphs are Segment T-graphs. Eur. J. Comb. Noga Alon, Meir Katchalski, Edward R. Scheinerman
1990	A*	`conf`	Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time FOCS Noga Alon, Nimrod Megiddo
1990	J	`jnl`	Ramsey graphs cannot be defined by real polynomials. J. Graph Theory Noga Alon
1990	A*	`conf`	Simple Constructions of Almost k-Wise Independent Random Variables FOCS Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
1990	J	`jnl`	The CW-Inequalities for Vectors in l Eur. J. Comb. Noga Alon
1990	J	`jnl`	The Number of Spanning Trees in Regular Graphs. Random Struct. Algorithms Noga Alon
1990	J	`jnl`	The maximum number of Hamiltonian paths in tournaments. Comb. Noga Alon
1990	J	`jnl`	Transversal numbers of uniform hypergraphs. Graphs Comb. Noga Alon
1990	J	`jnl`	Universal sequences for complete graphs. Discret. Appl. Math. Noga Alon, Yossi Azar, Yiftach Ravid
1989	J	`jnl`	A counterexample to the rank-coloring conjecture. J. Graph Theory Noga Alon, Paul D. Seymour
1989	J	`jnl`	A nowhere-zero point in liner mappings. Comb. Noga Alon, Michael Tarsi
1989	J	`jnl`	Ascending waves. J. Comb. Theory A Noga Alon, Joel H. Spencer
1989	J	`jnl`	Biased Coins and Randomized Algorithms. Adv. Comput. Res. Noga Alon, Michael O. Rabin
1989	J	`jnl`	Combinatorial reconstruction problems. J. Comb. Theory B Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty
1989	J	`jnl`	Cutting Disjoint Disks by Straight Lines. Discret. Comput. Geom. Noga Alon, Meir Katchalski, William R. Pulleyblank
1989	J	`jnl`	Cycles of length 0 modulo J. Comb. Theory B Noga Alon, Nathan Linial
1989	J	`jnl`	Disjoint Edges in Geometric Graphs. Discret. Comput. Geom. Noga Alon, Paul Erdös
1989	J	`jnl`	Finding an Approximate Maximum. SIAM J. Comput. Noga Alon, Yossi Azar
1989	J	`jnl`	Graphs with a small number of distinct induced subgraphs. Discret. Math. Noga Alon, Béla Bollobás
1989	J	`jnl`	Legitimate colorings of projective planes. Graphs Comb. Noga Alon, Zoltán Füredi
1989	J	`jnl`	On Neciporuk's Theorem for Branching Programs. Theor. Comput. Sci. Noga Alon, Uri Zwick
1989	A*	`conf`	On the Complexity of Radio Communication (Extended Abstract) STOC Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
1989	J	`jnl`	Sub-Ramsey numbers for arithmetic progressions. Graphs Comb. Noga Alon, Yair Caro, Zsolt Tuza
1989	J	`jnl`	The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. Discret. Comput. Geom. Noga Alon, Meir Katchalski, William R. Pulleyblank
1989	J	`jnl`	The star arboricity of graphs. Discret. Math. I. Algor, Noga Alon
1988	J	`jnl`	Balancing sets of vectors. IEEE Trans. Inf. Theory Noga Alon, Ernest E. Bergmann, Don Coppersmith, Andrew M. Odlyzko
1988	J	`jnl`	Every 8-uniform 8-regular hypergraph is 2-colorable. Graphs Comb. Noga Alon, Z. Bregman
1988	J	`jnl`	Explicit construction of linear sized tolerant networks. Discret. Math. Noga Alon, Fan R. K. Chung
1988	J	`jnl`	Meanders and Their Applications in Lower Bounds Arguments. J. Comput. Syst. Sci. Noga Alon, Wolfgang Maass
1988	J	`jnl`	On sums of subsets of a set of integers. Comb. Noga Alon, Gregory Freiman
1988	A*	`conf`	Parallel Comparison Algorithms for Approximation Problems FOCS Noga Alon, Yossi Azar
1988	J	`jnl`	Sorting, Approximate Sorting, and Searching in Rounds. SIAM J. Discret. Math. Noga Alon, Yossi Azar
1988	J	`jnl`	Sums of subsequences modulo prime powers. Discret. Math. Noga Alon
1988	J	`jnl`	The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. SIAM J. Comput. Noga Alon, Yossi Azar
1987	J	`jnl`	Better Expanders and Superconcentrators. J. Algorithms Noga Alon, Zvi Galil, V. D. Milman
1987	J	`jnl`	Large induced degenerate subgraphs. Graphs Comb. Noga Alon, Jeff Kahn, Paul D. Seymour
1987	A	`conf`	On Disseminating Information Reliably without Broadcasting. ICDCS Noga Alon, Amnon Barak, Udi Manber
1987	J	`jnl`	On the kernel of intersecting families. Graphs Comb. Noga Alon, Zoltán Füredi
1987	—	`conf`	Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. SCG Noga Alon, David Haussler, Emo Welzl
1987	J	`jnl`	Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. J. Graph Theory Noga Alon, Daniel J. Kleitman, Carsten Thomassen, Michael E. Saks, Paul D. Seymour
1987	A*	`conf`	The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms FOCS Noga Alon, Yossi Azar
1987	J	`jnl`	The monotone circuit complexity of Boolean functions. Comb. Noga Alon, Ravi B. Boppana
1987	J	`jnl`	The smallets n-uniform hypergraph with positive discrepancy. Comb. Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour
1986	J	`jnl`	A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms Noga Alon, László Babai, Alon Itai
1986	J	`jnl`	Covering a Square by Small Perimeter Rectangles. Discret. Comput. Geom. Noga Alon, Daniel J. Kleitman
1986	J	`jnl`	Covering graphs by the minimum number of equivalence relations. Comb. Noga Alon
1986	J	`jnl`	Decomposition of the complete Graphs Comb. Noga Alon
1986	J	`jnl`	Eigenvalues and expanders. Comb. Noga Alon
1986	J	`jnl`	Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory. Comb. Noga Alon
1986	J	`jnl`	Explicit construction of exponential sized families of k-independent sets. Discret. Math. Noga Alon
1986	J	`jnl`	Extremal Problems Concerning Transformations of the Set of Edges of the Complete Graph. Eur. J. Comb. Noga Alon, Yair Caro
1986	A*	`conf`	Meanders, Ramsey Theory and Lower Bounds for Branching Programs FOCS Noga Alon, Wolfgang Maass
1986	J	`jnl`	On the intersection of edges of a geometric graph by straight lines. Discret. Math. Noga Alon, Micha A. Perles
1986	J	`jnl`	Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory. J. Comb. Theory A Noga Alon, Kenneth A. Berman
1986	J	`jnl`	The longest cycle of a graph with a large minimal degree. J. Graph Theory Noga Alon
1986	J	`jnl`	The number of small semispaces of a finite set of points in the plane. J. Comb. Theory A Noga Alon, Ervin Györi
1986	A*	`conf`	Tight Complexity Bounds for Parallel Comparison Sorting FOCS Noga Alon, Yossi Azar, Uzi Vishkin
1985	J	`jnl`	A Simple Proof of the Upper Bound Theorem. Eur. J. Comb. Noga Alon, Gil Kalai
1985	J	`jnl`	An Application of Graph Theory to Additive Number Theory. Eur. J. Comb. Noga Alon, Paul Erdös
1985	J	`jnl`	An Extremal Problem for Sets with Applications to Graph Theory. J. Comb. Theory A Noga Alon
1985	J	`jnl`	Asynchronous threshold networks. Graphs Comb. Noga Alon
1985	J	`jnl`	Even edge colorings of a graph. J. Comb. Theory B Noga Alon, Yoshimi Egawa
1985	A*	`conf`	Expanders, Sorting in Rounds and Superconcentrators of Limited Depth STOC Noga Alon
1985	A*	`conf`	Geometrical Realization of Set Systems and Probabilistic Communication Complexity FOCS Noga Alon, Peter Frankl, Vojtech Rödl
1985	J	`jnl`	Hypergraphs with high chromatic number. Graphs Comb. Noga Alon
1985	J	`jnl`	Separating Pairs of Points by Standard Boxes. Eur. J. Comb. Noga Alon, Zoltán Füredi, Meir Katchalski
1985	J	`jnl`	The maximum number of disjoint pairs in a family of subsets. Graphs Comb. Noga Alon, Peter Frankl
1985	J	`jnl`	lambda J. Comb. Theory B Noga Alon, V. D. Milman
1984	J	`jnl`	A note on subdigraphs of digraphs with large outdegrees. Discret. Math. Noga Alon
1984	A*	`conf`	Eigenvalues, Expanders and Superconcentrators (Extended Abstract) FOCS Noga Alon, V. D. Milman
1984	J	`jnl`	Every 4-regular graph plus an edge contains a 3-regular subgraph. J. Comb. Theory B Noga Alon, Shmuel Friedland, Gil Kalai
1984	J	`jnl`	Regular subgraphs of almost regular graphs. J. Comb. Theory B Noga Alon, Shmuel Friedland, Gil Kalai
1983	J	`jnl`	On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems. J. Graph Theory Noga Alon
1983	J	`jnl`	On the density of sets of vectors. Discret. Math. Noga Alon