Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarNoga Alon
Alon Nilli
Person information
- affiliation: Tel Aviv University, Sackler School of Mathematics, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[j395]Noga Alon, Boris Bukh, Yury Polyanskiy:
List-Decodable Zero-Rate Codes. IEEE Trans. Information Theory 65(3): 1657-1667 (2019)- 2018
- [j394]Noga Alon:
Uniformly Discrete Forests with Poor Visibility. Combinatorics, Probability & Computing 27(4): 442-448 (2018) - [j393]Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz, Zilin Jiang, Gal Kronenberg, Alon Naor:
Ramsey-nice families of graphs. Eur. J. Comb. 72: 29-44 (2018) - [j392]Noga Alon, Michael Krivelevich:
Clique coloring of dense random graphs. Journal of Graph Theory 88(3): 428-433 (2018) - [j391]Slava Bronfman, Noga Alon, Avinatan Hassidim, Assaf Romm:
Redesigning the Israeli Medical Internship Match. ACM Trans. Economics and Comput. 6(3-4): 21:1-21:18 (2018) - [c164]Noga Alon, Mrinal Kumar, Ben Lee Volk:
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. CCC 2018: 11:1-11:16 - [c163]
- [i60]Noga Alon, Roi Livni, Maryanthe Malliaris, Shay Moran:
Private PAC learning implies finite Littlestone dimension. CoRR abs/1806.00949 (2018) - [i59]Noga Alon, Igor Balla, Lior Gishboliner, Adva Mond, Frank Mousset:
The Minrank of Random Graphs over Arbitrary Fields. CoRR abs/1809.01873 (2018) - [i58]Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner, Alexander Y. Ku:
Multitasking Capacity: Hardness Results and Improved Constructions. CoRR abs/1809.02835 (2018) - [i57]Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:
The hat guessing number of graphs. CoRR abs/1812.09752 (2018) - 2017
- [j390]Noga Alon, Moran Feldman, Moshe Tennenholtz:
Revenue and Reserve Prices in a Probabilistic Single Item Auction. Algorithmica 77(1): 1-15 (2017) - [j389]Noga Alon, Tom Bohman, Hao Huang:
More on the Bipartite Decomposition of Random Graphs. Journal of Graph Theory 84(1): 45-52 (2017) - [j388]Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Shie Mannor, Yishay Mansour, Ohad Shamir:
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback. SIAM J. Comput. 46(6): 1785-1826 (2017) - [j387]Noga Alon, Guy Rutenberg:
Broadcast Transmission to Prioritizing Receivers. SIAM J. Discrete Math. 31(4): 2517-2529 (2017) - [j386]Noga Alon, Klim Efremenko, Benny Sudakov:
Testing Equality in Communication Graphs. IEEE Trans. Information Theory 63(11): 7569-7574 (2017) - [j385]Noga Alon, Jehoshua Bruck, Farzad Farnoud Hassanzadeh, Siddharth Jain:
Duplication Distance to the Root for Binary Sequences. IEEE Trans. Information Theory 63(12): 7793-7803 (2017) - [c162]
- [c161]Noga Alon, Bo'az Klartag:
Optimal Compression of Approximate Inner Products and Dimension Reduction. FOCS 2017: 639-650 - [c160]Noga Alon, Omri Ben-Eliezer, Eldar Fischer:
Testing Hereditary Properties of Ordered Graphs and Matrices. FOCS 2017: 848-858 - [c159]Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski, Yishay Mansour, Shay Moran, Amir Yehudayoff:
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues. NIPS 2017: 1655-1664 - [c158]Noga Alon, Daniel Reichman, Igor Shinkar, Tal Wagner, Sebastian Musslick, Jonathan D. Cohen, Tom Griffiths, Biswadip Dey, Kayhan Özcimder:
A graph-theoretic approach to multitasking. NIPS 2017: 2097-2106 - [c157]Noga Alon, Rajko Nenadov:
Optimal induced universal graphs for bounded-degree graphs. SODA 2017: 1149-1157 - [i56]Noga Alon, Omri Ben-Eliezer, Eldar Fischer:
Testing hereditary properties of ordered graphs and matrices. CoRR abs/1704.02367 (2017) - [i55]Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski, Yishay Mansour, Shay Moran, Amir Yehudayoff:
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues. CoRR abs/1705.08430 (2017) - [i54]Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy:
Out-colourings of Digraphs. CoRR abs/1706.06441 (2017) - [i53]
- [i52]Noga Alon, Omri Ben-Eliezer, Eldar Fischer:
Testing hereditary properties of ordered graphs and matrices. Electronic Colloquium on Computational Complexity (ECCC) 24: 58 (2017) - 2016
- [j384]Noga Alon, Rani Hod, Amit Weinstein:
On Active and Passive Testing. Combinatorics, Probability & Computing 25(1): 1-20 (2016) - [j383]Noga Alon, Omri Ben-Eliezer:
Local and global colorability of graphs. Discrete Mathematics 339(2): 428-442 (2016) - [j382]Noga Alon, Clara Shikhelman:
Many T copies in H-free graphs. J. Comb. Theory, Ser. B 121: 146-172 (2016) - [j381]
- [j380]Ron Aharoni, Noga Alon, Eli Berger:
Eigenvalues of K1, k-Free Graphs and the Connectivity of Their Independence Complexes. Journal of Graph Theory 83(4): 384-391 (2016) - [j379]Noga Alon, Humberto Naves, Benny Sudakov:
On the Maximum Quartet Distance between Phylogenetic Trees. SIAM J. Discrete Math. 30(2): 718-735 (2016) - [j378]Emmanuel Abbe, Noga Alon, Afonso S. Bandeira, Colin Sandon:
Linear Boolean Classification, Coding and the Critical Problem. IEEE Trans. Information Theory 62(4): 1667-1673 (2016) - [c156]
- [c155]Noga Alon, Jehoshua Bruck, Farzad Farnoud, Siddharth Jain:
On the duplication distance of binary strings. ISIT 2016: 260-264 - [c154]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable Communication over Highly Connected Noisy Networks. PODC 2016: 165-173 - [c153]Noga Alon, Michal Feldman, Yishay Mansour, Sigal Oren, Moshe Tennenholtz:
Dynamics of Evolving Social Groups. EC 2016: 637-654 - [c152]Noga Alon, Humberto Naves, Benny Sudakov:
On the maximum quartet distance between phylogenetic trees. SODA 2016: 2095-2106 - [r2]
- [i51]Noga Alon, Michal Feldman, Yishay Mansour, Sigal Oren, Moshe Tennenholtz:
Dynamics of Evolving Social Groups. CoRR abs/1605.09548 (2016) - [i50]
- [i49]Noga Alon, Jehoshua Bruck, Farzad Farnoud, Siddharth Jain:
Duplication Distance to the Root for Binary Sequences. CoRR abs/1611.05537 (2016) - [i48]Noga Alon, Klim Efremenko, Benny Sudakov:
Testing Equality in Communication Graphs. Electronic Colloquium on Computational Complexity (ECCC) 23: 86 (2016) - 2015
- [j377]Noga Alon, Amit Weinstein:
Local Correction with Constant Error Rate. Algorithmica 71(2): 496-516 (2015) - [j376]Noga Alon, Gil Cohen:
On Rigid Matrices and U-Polynomials. Computational Complexity 24(4): 851-879 (2015) - [j375]Jonathan Berant, Noga Alon, Ido Dagan, Jacob Goldberger:
Efficient Global Learning of Entailment Graphs. Computational Linguistics 41(2): 249-291 (2015) - [j374]Noga Alon, Ohad N. Feldheim:
Drawing outerplanar graphs using three edge lengths. Comput. Geom. 48(3): 260-267 (2015) - [j373]Noga Alon, Jacob Fox:
Easily Testable Graph Properties. Combinatorics, Probability & Computing 24(4): 646-657 (2015) - [j372]Noga Alon, Clara Shikhelman:
Many T copies in H-free graphs. Electronic Notes in Discrete Mathematics 49: 683-689 (2015) - [j371]
- [j370]Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil:
Practically stabilizing SWMR atomic memory in message-passing systems. J. Comput. Syst. Sci. 81(4): 692-701 (2015) - [j369]
- [j368]Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov:
Comparable pairs in families of sets. J. Comb. Theory, Ser. B 115: 164-185 (2015) - [j367]Noga Alon, Abbas Mehrabian:
Chasing a Fast Robber on Planar Graphs and Random Graphs. Journal of Graph Theory 78(2): 81-96 (2015) - [j366]Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Bounded Degree Graphs. SIAM J. Discrete Math. 29(1): 59-64 (2015) - [j365]Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger:
How to Put Through Your Agenda in Collective Binary Decisions. ACM Trans. Economics and Comput. 4(1): 5:1-5:28 (2015) - [c151]Noga Alon, Nicolò Cesa-Bianchi, Ofer Dekel, Tomer Koren:
Online Learning with Feedback Graphs: Beyond Bandits. COLT 2015: 23-35 - [c150]Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein:
Welfare Maximization with Limited Interaction. FOCS 2015: 1499-1512 - [c149]Noga Alon, Michal Feldman, Omer Lev, Moshe Tennenholtz:
How Robust Is the Wisdom of the Crowds? IJCAI 2015: 2055-2061 - [c148]Slava Bronfman, Noga Alon, Avinatan Hassidim, Assaf Romm:
Redesigning the Israeli Medical Internship Match. EC 2015: 753-754 - [i47]Noga Alon, Nicolò Cesa-Bianchi, Ofer Dekel, Tomer Koren:
Online Learning with Feedback Graphs: Beyond Bandits. CoRR abs/1502.07617 (2015) - [i46]Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein:
Welfare Maximization with Limited Interaction. CoRR abs/1504.01780 (2015) - [i45]Noga Alon, Humberto Naves, Benny Sudakov:
On the maximum quartet distance between phylogenetic trees. CoRR abs/1505.04344 (2015) - [i44]Noga Alon, Elchanan Mossel, Robin Pemantle:
Corruption Detection on Networks. CoRR abs/1505.05637 (2015) - [i43]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable Communication over Highly Connected Noisy Networks. Electronic Colloquium on Computational Complexity (ECCC) 22: 14 (2015) - [i42]Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein:
Welfare Maximization with Limited Interaction. Electronic Colloquium on Computational Complexity (ECCC) 22: 54 (2015) - 2014
- [j364]Noga Alon, Pawel Pralat:
Chasing robbers on random geometric graphs - An alternative approach. Discrete Applied Mathematics 178: 149-152 (2014) - [j363]Noga Alon, Andrey Kupavskii:
Two notions of unit distance graphs. J. Comb. Theory, Ser. A 125: 1-17 (2014) - [j362]Noga Alon, Harout K. Aydinian, Hao Huang:
Maximizing the Number of Nonnegative Subsets. SIAM J. Discrete Math. 28(2): 811-816 (2014) - [j361]Noga Alon, Sagi Snir, Raphael Yuster:
On the Compatibility of Quartet Trees. SIAM J. Discrete Math. 28(3): 1493-1507 (2014) - [j360]Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Panagiotis Kanellopoulos, Tom Leighton:
Correction: Basic Network Creation Games. SIAM J. Discrete Math. 28(3): 1638-1640 (2014) - [c147]Noga Alon, Troy Lee, Adi Shraibman:
The Cover Number of a Matrix and its Algorithmic Applications. APPROX-RANDOM 2014: 34-47 - [c146]Emmanuel Abbe, Noga Alon, Afonso S. Bandeira:
Linear Boolean classification, coding and "the critical problem". ISIT 2014: 1231-1235 - [c145]
- [c144]Noga Alon, Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Broadcast Throughput in Radio Networks: Routing vs. Network Coding. SODA 2014: 1831-1843 - [i41]Emmanuel Abbe, Noga Alon, Afonso S. Bandeira:
Linear Boolean classification, coding and "the critical problem". CoRR abs/1401.6528 (2014) - [i40]Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation dimension of bounded degree graphs. CoRR abs/1407.5075 (2014) - [i39]Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Shie Mannor, Yishay Mansour, Ohad Shamir:
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback. CoRR abs/1409.8428 (2014) - [i38]Noga Alon, Shay Moran, Amir Yehudayoff:
Sign rank, VC dimension and spectral gaps. Electronic Colloquium on Computational Complexity (ECCC) 21: 135 (2014) - 2013
- [j359]Noga Alon, Amir Shpilka, Christopher Umans:
On sunflowers and matrix multiplication. Computational Complexity 22(2): 219-243 (2013) - [j358]Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Beeping a maximal independent set. Distributed Computing 26(4): 195-208 (2013) - [j357]
- [j356]Noga Alon, Raphael Yuster:
Matrix sparsification and nested dissection over arbitrary fields. J. ACM 60(4): 25:1-25:18 (2013) - [j355]Noga Alon, Raphael Yuster:
The Turán number of sparse spanning graphs. J. Comb. Theory, Ser. B 103(3): 337-343 (2013) - [j354]Noga Alon:
A Note on Degenerate and Spectrally Degenerate Graphs. Journal of Graph Theory 72(1): 1-6 (2013) - [j353]Noga Alon, Eric Blais, Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Nearly Tight Bounds for Testing Function Isomorphism. SIAM J. Comput. 42(2): 459-493 (2013) - [j352]Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Adversarial Leakage in Games. SIAM J. Discrete Math. 27(1): 363-385 (2013) - [j351]Noga Alon:
Minimizing the Number of Carries in Addition. SIAM J. Discrete Math. 27(1): 562-566 (2013) - [j350]Noga Alon, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Tom Leighton:
Basic Network Creation Games. SIAM J. Discrete Math. 27(2): 656-668 (2013) - [j349]Noga Alon, Shachar Lovett:
Almost k-Wise vs. k-Wise Independent Permutations, and Uniformity for General Group Actions. Theory of Computing 9: 559-577 (2013) - [c143]Noga Alon, Dvir Falik, Reshef Meir, Moshe Tennenholtz:
Bundling Attacks in Judgment Aggregation. AAAI 2013 - [c142]Noga Alon, Reshef Meir, Moshe Tennenholtz:
The Value of Ignorance about the Number of Players. AAAI (Late-Breaking Developments) 2013 - [c141]Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger:
How to Put through Your Agenda in Collective Binary Decisions. ADT 2013: 30-44 - [c140]Noga Alon, Gil Cohen:
On Rigid Matrices and U-polynomials. IEEE Conference on Computational Complexity 2013: 197-206 - [c139]Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour:
From Bandits to Experts: A Tale of Domination and Independence. NIPS 2013: 1610-1618 - [c138]Noga Alon, Yishay Mansour, Moshe Tennenholtz:
Differential pricing with inequity aversion in social networks. EC 2013: 9-24 - [c137]Noga Alon, Troy Lee, Adi Shraibman, Santosh Vempala:
The approximate rank of a matrix and its algorithmic applications: approximate rank. STOC 2013: 675-684 - [c136]Noga Alon, Michal Feldman, Iftah Gamzu, Moshe Tennenholtz:
The Asymmetric Matrix Partition Problem. WINE 2013: 1-14 - [p2]Noga Alon:
Neighborly Families of Boxes and Bipartite Coverings. The Mathematics of Paul Erdős II 2013: 15-20 - [i37]
- [i36]Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour:
From Bandits to Experts: A Tale of Domination and Independence. CoRR abs/1307.4564 (2013) - [i35]
- 2012
- [j348]Noga Alon, Keith E. Mellinger, Dhruv Mubayi, Jacques Verstraëte:
The de Bruijn-Erdős theorem for hypergraphs. Des. Codes Cryptography 65(3): 233-245 (2012) - [j347]Noga Alon:
A Non-linear Lower Bound for Planar Epsilon-nets. Discrete & Computational Geometry 47(2): 235-244 (2012) - [j346]Noga Alon, Alexandr V. Kostochka:
Dense uniform hypergraphs have high list chromatic number. Discrete Mathematics 312(14): 2119-2125 (2012) - [j345]
- [j344]Noga Alon, Hao Huang, Benny Sudakov:
Nonnegative k-sums, fractional covers, and probability of small deviations. J. Comb. Theory, Ser. B 102(3): 784-796 (2012) - [j343]Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov:
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. J. Comb. Theory, Ser. A 119(6): 1200-1215 (2012) - [j342]Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Bayesian ignorance. Theor. Comput. Sci. 452: 1-11 (2012) - [c135]Noga Alon, Shachar Lovett:
Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions. APPROX-RANDOM 2012: 350-361 - [c134]Noga Alon, Amir Shpilka, Christopher Umans:
On Sunflowers and Matrix Multiplication. IEEE Conference on Computational Complexity 2012: 214-223 - [c133]Noga Alon, Moshe Babaioff, Ron Karidi, Ron Lavi, Moshe Tennenholtz:
Sequential voting with externalities: herding in social networks. EC 2012: 36 - [c132]Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie:
Space-efficient local computation algorithms. SODA 2012: 1132-1139 - [c131]Noga Alon, Ankur Moitra, Benny Sudakov:
Nearly complete graphs decomposable into large induced matchings and their applications. STOC 2012: 1079-1090 - [c130]Noga Alon, Iftah Gamzu, Moshe Tennenholtz:
Optimizing budget allocation among channels and influencers. WWW 2012: 381-388 - [i34]Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Beeping a Maximal Independent Set. CoRR abs/1206.0150 (2012) - [i33]
- [i32]Noga Alon, Gil Cohen:
On Rigid Matrices and Subspace Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 19: 133 (2012) - [i31]Noga Alon, Santosh Vempala:
The Approximate Rank of a Matrix and its Algorithmic Applications. Electronic Colloquium on Computational Complexity (ECCC) 19: 169 (2012) - 2011
- [j341]Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica 61(3): 638-655 (2011) - [j340]Noga Alon, Simi Haber, Michael Krivelevich:
The Number of f-Matchings in Almost Every Tree is a Zero Residue. Electr. J. Comb. 18(1) (2011) - [j339]Noga Alon, Abbas Mehrabian:
On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game. Electr. J. Comb. 18(1) (2011) - [j338]Noga Alon, Pawel Pralat:
Modular Orientations of Random and Quasi-Random Regular Graphs. Combinatorics, Probability & Computing 20(3): 321-329 (2011) - [j337]Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle:
Many Random Walks Are Faster Than One. Combinatorics, Probability & Computing 20(4): 481-502 (2011) - [j336]Noga Alon, József Balogh, Béla Bollobás, Robert Morris:
The structure of almost all graphs in a hereditary property. J. Comb. Theory, Ser. B 101(2): 85-110 (2011) - [j335]Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster:
On graphs and algebraic graphs that do not contain cycles of length 4. Journal of Graph Theory 68(2): 91-102 (2011) - [j334]Noga Alon, Alexandr V. Kostochka:
Hypergraph list coloring and Euclidean Ramsey theory. Random Struct. Algorithms 39(3): 377-390 (2011) - [j333]Noga Alon, Dániel Marx:
Sparse Balanced Partitions and the Complexity of Subgraph Problems. SIAM J. Discrete Math. 25(2): 631-644 (2011) - [c129]