Noga Alon

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
443A Non-linear Lower Bound for Planar Epsilon-nets. Noga Alon. Discrete & Computational Geometry (47): 235-244 (2012). Web SearchBibTeXDownload
442Local correction of juntas. Noga Alon, Amit Weinstein. Inf. Process. Lett. (112): 223-226 (2012). Web SearchBibTeXDownload
441Space-efficient local computation algorithms. Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie. SODA 2012, 1132-1139. Web SearchBibTeXDownload
2011
440Solving MAX-r-SAT Above a Tight Lower Bound. Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo. Algorithmica (61): 638-655 (2011). Web SearchBibTeXDownload
439Modular Orientations of Random and Quasi-Random Regular Graphs. Noga Alon, Pawel Pralat. Combinatorics, Probability & Computing (20): 321-329 (2011). Web SearchBibTeXDownload
438Many Random Walks Are Faster Than One. Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle. Combinatorics, Probability & Computing (20): 481-502 (2011). Web SearchBibTeXDownload
437Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications. Noga Alon, Ankur Moitra, Benny Sudakov. CoRR (abs/1111.0253) (2011). Web SearchBibTeXDownload
436MIS on the fly. Yehuda Afek, Noga Alon, Ziv Bar-Joseph. CoRR (abs/1106.2126) (2011). Web SearchBibTeXDownload
435Local Correction of Boolean Functions. Noga Alon, Amit Weinstein. CoRR (abs/1109.3639) (2011). Web SearchBibTeXDownload
434Space-efficient Local Computation Algorithms. Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie. CoRR (abs/1109.6178) (2011). Web SearchBibTeXDownload
433Testing perfection is hard. Noga Alon, Jacob Fox. CoRR (abs/1110.2828) (2011). Web SearchBibTeXDownload
432Beeping a Maximal Independent Set. Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn. DISC 2011, 32-50. Web SearchBibTeXDownload
431On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game. Noga Alon, Abbas Mehrabian. Electr. J. Comb. (18) (2011). Web SearchBibTeXDownload
430The Number of f-Matchings in Almost Every Tree is a Zero Residue. Noga Alon, Simi Haber, Michael Krivelevich. Electr. J. Comb. (18) (2011). Web SearchBibTeXDownload
429On Sunflowers and Matrix Multiplication. Noga Alon, Amir Shpilka, Chris Umans. Electronic Colloquium on Computational Complexity (ECCC) (18): 67 (2011). Web SearchBibTeXDownload
428Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions. Noga Alon, Shachar Lovett. Electronic Colloquium on Computational Complexity (ECCC) (18): 49 (2011). Web SearchBibTeXDownload
427Economical Graph Discovery. Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz. ICS 2011, 476-486. Web SearchBibTeXDownload
426The structure of almost all graphs in a hereditary property. Noga Alon, József Balogh, Béla Bollobás, Robert Morris. J. Comb. Theory, Ser. B (101): 85-110 (2011). Web SearchBibTeXDownload
425On graphs and algebraic graphs that do not contain cycles of length 4. Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster. Journal of Graph Theory (68): 91-102 (2011). Web SearchBibTeXDownload
424Hypergraph list coloring and Euclidean Ramsey theory. Noga Alon, Alexandr V. Kostochka. Random Struct. Algorithms (39): 377-390 (2011). Web SearchBibTeXDownload
423Sparse Balanced Partitions and the Complexity of Subgraph Problems. Noga Alon, Dániel Marx. SIAM J. Discrete Math. (25): 631-644 (2011). Web SearchBibTeXDownload
422Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems. Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil. SSS 2011, 19-31. Web SearchBibTeXDownload
421Sum of us: strategyproof selection from the selectors. Noga Alon, Felix A. Fischer, Ariel D. Procaccia, Moshe Tennenholtz. TARK 2011, 101-110. Web SearchBibTeXDownload
2010
420Balanced families of perfect hash functions and their applications. Noga Alon, Shai Gutner. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload
419Testing Boolean Function Isomorphism. Noga Alon, Eric Blais. APPROX-RANDOM 2010, 394-405. Web SearchBibTeXDownload
418Voting Paradoxes. Noga Alon. COLT 2010, 27. Web SearchBibTeX
417Playing to Retain the Advantage. Noga Alon, Dan Hefetz, Michael Krivelevich. Combinatorics, Probability & Computing (19): 481-491 (2010). Web SearchBibTeXDownload
416Practically Stabilizing Atomic Memory. Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil. CoRR (abs/1007.1802) (2010). Web SearchBibTeXDownload
415Brief Announcement: Sharing Memory in a Self-stabilizing Manner. Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil. DISC 2010, 525-527. Web SearchBibTeXDownload
414Walking in circles. Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz. Discrete Mathematics (310): 3432-3435 (2010). Web SearchBibTeXDownload
413Another Abstraction of the Erdös-Szekeres Happy End Theorem. Noga Alon, Ehsan Chiniforooshan, Vasek Chvátal, François Genest. Electr. J. Comb. (17) (2010). Web SearchBibTeXDownload
412A Non-linear Lower Bound for Planar Epsilon-Nets. Noga Alon. FOCS 2010, 341-346. Web SearchBibTeXDownload
411Solving Linear Systems through Nested Dissection. Noga Alon, Raphael Yuster. FOCS 2010, 225-234. Web SearchBibTeXDownload
410Adversarial Leakage in Games. Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz. ICS 2010, 111-119. Web SearchBibTeXDownload
409Approximate Maximum Parsimony and Ancestral Maximum Likelihood. Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport. IEEE/ACM Trans. Comput. Biology Bioinform. (7): 183-187 (2010). Web SearchBibTeXDownload
408Typical peak sidelobe level of binary sequences. Noga Alon, Simon Litsyn, Alexander Shpunt. IEEE Transactions on Information Theory (56): 545-554 (2010). Web SearchBibTeXDownload
407A note on competitive diffusion through social networks. Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz. Inf. Process. Lett. (110): 221-225 (2010). Web SearchBibTeXDownload
406A note on regular Ramsey graphs. Noga Alon, Sonny Ben-Shimon, Michael Krivelevich. Journal of Graph Theory (64): 244-249 (2010). Web SearchBibTeXDownload
405Strategyproof Approximation of the Minimax on Networks. Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz. Math. Oper. Res. (35): 513-526 (2010). Web SearchBibTeXDownload
404Bayesian ignorance. Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz. PODC 2010, 384-391. Web SearchBibTeXDownload
403On Constant Time Approximation of Parameters of Bounded Degree Graphs. Noga Alon. Property Testing 2010, 234-239. Web SearchBibTeXDownload
402Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. Noga Alon, Amin Coja-Oghlan, Hięp Hŕn, Mihyun Kang, Vojtech Rödl, Mathias Schacht. SIAM J. Comput. (39): 2336-2362 (2010). Web SearchBibTeXDownload
401The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus. Noga Alon, Ohad N. Feldheim. SIAM J. Discrete Math. (24): 892-894 (2010). Web SearchBibTeXDownload
400Solving MAX-r-SAT Above a Tight Lower Bound. Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo. SODA 2010, 511-517. Web SearchBibTeXDownload
399Basic network creation games. Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton. SPAA 2010, 106-113. Web SearchBibTeXDownload
2009
398Admission control to minimize rejections and online set cover with repetitions. Noga Alon, Yossi Azar, Shai Gutner. ACM Transactions on Algorithms (6) (2009). Web SearchBibTeXDownload
397Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Noga Alon, Shai Gutner. Algorithmica (54): 544-556 (2009). Web SearchBibTeXDownload
396Deterministic Approximation Algorithms for the Nearest Codeword Problem. Noga Alon, Rina Panigrahy, Sergey Yekhanin. APPROX-RANDOM 2009, 339-351. Web SearchBibTeXDownload
395Uniformly cross intersecting families. Noga Alon, Eyal Lubetzky. Combinatorica (29): 389-431 (2009). Web SearchBibTeXDownload
394Sizes of Induced Subgraphs of Ramsey Graphs. Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij. Combinatorics, Probability & Computing (18): 459-476 (2009). Web SearchBibTeXDownload
393Perturbed Identity Matrices Have High Rank: Proof and Applications. Noga Alon. Combinatorics, Probability & Computing (18): 3-15 (2009). Web SearchBibTeXDownload
392Economical Elimination of Cycles in the Torus. Noga Alon. Combinatorics, Probability & Computing (18): 619-627 (2009). Web SearchBibTeXDownload
391Strategyproof Approximation Mechanisms for Location on Networks. Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz. CoRR (abs/0907.2049) (2009). Web SearchBibTeXDownload
390Sum of Us: Strategyproof Selection from the Selectors. Noga Alon, Felix A. Fischer, Ariel D. Procaccia, Moshe Tennenholtz. CoRR (abs/0910.4699) (2009). Web SearchBibTeXDownload
389Polychromatic Colorings of Plane Graphs. Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein. Discrete & Computational Geometry (42): 421-442 (2009). Web SearchBibTeXDownload
388Playing to retain the advantage. Dan Hefetz, Noga Alon, Michael Krivelevich. Electronic Notes in Discrete Mathematics (34): 423-427 (2009). Web SearchBibTeXDownload
387Choice-Memory Tradeoff in Allocations. Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich. FOCS 2009, 230-238. Web SearchBibTeXDownload
386Fast FAST. Noga Alon, Daniel Lokshtanov, Saket Saurabh. ICALP (1) 2009, 49-58. Web SearchBibTeXDownload
385Optimal Monotone Encodings. Noga Alon, Rani Hod. IEEE Transactions on Information Theory (55): 1343-1353 (2009). Web SearchBibTeXDownload
384Balanced Hashing, Color Coding and Approximate Counting. Noga Alon, Shai Gutner. IWPEC 2009, 1-16. Web SearchBibTeXDownload
383Stability-type results for hereditary properties. Noga Alon, Uri Stav. Journal of Graph Theory (62): 65-83 (2009). Web SearchBibTeXDownload
382Induced subgraphs with distinct sizes. Noga Alon, Alexandr V. Kostochka. Random Struct. Algorithms (34): 45-53 (2009). Web SearchBibTeXDownload
381The Online Set Cover Problem. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor. SIAM J. Comput. (39): 361-370 (2009). Web SearchBibTeXDownload
380A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira. SIAM J. Comput. (39): 143-167 (2009). Web SearchBibTeXDownload
379Can a Graph Have Distinct Regular Partitions?. Noga Alon, Asaf Shapira, Uri Stav. SIAM J. Discrete Math. (23): 278-287 (2009). Web SearchBibTeXDownload
378Spanning Directed Trees with Many Leaves. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh. SIAM J. Discrete Math. (23): 466-476 (2009). Web SearchBibTeXDownload
377On the power of two, three and four probes. Noga Alon, Uriel Feige. SODA 2009, 346-354. Web SearchBibTeXDownload
376Hardness of edge-modification problems. Noga Alon, Uri Stav. Theor. Comput. Sci. (410): 4920-4927 (2009). Web SearchBibTeXDownload
375Tell Me Who I Am: An Interactive Recommendation System. Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir. Theory Comput. Syst. (45): 261-279 (2009). Web SearchBibTeXDownload
2008
374Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload
373Small Sample Spaces Cannot Fool Low Degree Polynomials. Noga Alon, Ido Ben-Eliezer, Michael Krivelevich. APPROX-RANDOM 2008, 266-275. Web SearchBibTeXDownload
372A separation theorem in property testing. Noga Alon, Asaf Shapira. Combinatorica (28): 261-281 (2008). Web SearchBibTeXDownload
371An Elementary Construction of Constant-Degree Expanders. Noga Alon, Oded Schwartz, Asaf Shapira. Combinatorics, Probability & Computing (17): 319-327 (2008). Web SearchBibTeXDownload
370Admission Control to Minimize Rejections and Online Set Cover with Repetitions. Noga Alon, Yossi Azar, Shai Gutner. CoRR (abs/0803.2842) (2008). Web SearchBibTeXDownload
369A note on regular Ramsey graphs. Noga Alon, Sonny Ben-Shimon, Michael Krivelevich. CoRR (abs/0812.2386) (2008). Web SearchBibTeXDownload
368Broadcasting with side information. Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein. CoRR (abs/0806.3246) (2008). Web SearchBibTeXDownload
367Balanced Families of Perfect Hash Functions and Their Applications. Noga Alon, Shai Gutner. CoRR (abs/0805.4300) (2008). Web SearchBibTeXDownload
366Spanning directed trees with many leaves. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh. CoRR (abs/0803.0701) (2008). Web SearchBibTeXDownload
365Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Noga Alon, Shai Gutner. CoRR (abs/0806.4735) (2008). Web SearchBibTeXDownload
364Problems and results in extremal combinatorics - II. Noga Alon. Discrete Mathematics (308): 4460-4472 (2008). Web SearchBibTeXDownload
363An isoperimetric inequality in the universal cover of the punctured plane. Noga Alon, Adi Pinchasi, Rom Pinchasi. Discrete Mathematics (308): 5691-5701 (2008). Web SearchBibTeXDownload
362Breaking the rhythm on graphs. Noga Alon, Jaroslaw Grytczuk. Discrete Mathematics (308): 1375-1380 (2008). Web SearchBibTeXDownload
361The Grothendieck constant of random and pseudo-random graphs. Noga Alon, Eli Berger. Discrete Optimization (5): 323-327 (2008). Web SearchBibTeXDownload
360The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence. Noga Alon, Shmuel Friedland. Electr. J. Comb. (15) (2008). Web SearchBibTeXDownload
359Deterministic Approximation Algorithms for the Nearest Codeword Problem. Noga Alon, Rina Panigrahy, Sergey Yekhanin. Electronic Colloquium on Computational Complexity (ECCC) (15) (2008). Web SearchBibTeXDownload
358Kernels for the Dominating Set Problem on Graphs with an Excluded Minor. Noga Alon, Shai Gutner. Electronic Colloquium on Computational Complexity (ECCC) (15) (2008). Web SearchBibTeXDownload
357Color Coding. Noga Alon, Raphael Yuster, Uri Zwick. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
356k-Wise Independent Random Graphs. Noga Alon, Asaf Nussboim. FOCS 2008, 813-822. Web SearchBibTeXDownload
355Broadcasting with Side Information. Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim. FOCS 2008, 823-832. Web SearchBibTeXDownload
354Optimal Monotone Encodings. Noga Alon, Rani Hod. ICALP (1) 2008, 258-270. Web SearchBibTeXDownload
353Conflict-Free colorings of Shallow Discs. Noga Alon, Shakhar Smorodinsky. Int. J. Comput. Geometry Appl. (18): 599-604 (2008). Web SearchBibTeXDownload
352Biomolecular network motif counting and discovery by color coding. Noga Alon, Phuong Dao, Iman Hajirasouliha, Fereydoun Hormozdiari, Süleyman Cenk Sahinalp. ISMB 2008, 241-249. Web SearchBibTeXDownload
351Weak &epsis;-nets and interval chains. Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky. J. ACM (55) (2008). Web SearchBibTeXDownload
350The maximum edit distance from hereditary graph properties. Noga Alon, Uri Stav. J. Comb. Theory, Ser. B (98): 672-697 (2008). Web SearchBibTeXDownload
349What is the furthest graph from a hereditary property?. Noga Alon, Uri Stav. Random Struct. Algorithms (33): 87-104 (2008). Web SearchBibTeXDownload
348Every Monotone Graph Property Is Testable. Noga Alon, Asaf Shapira. SIAM J. Comput. (38): 505-522 (2008). Web SearchBibTeXDownload
347A Characterization of the (Natural) Graph Properties Testable with One-Sided Error. Noga Alon, Asaf Shapira. SIAM J. Comput. (37): 1703-1727 (2008). Web SearchBibTeXDownload
346Cleaning Regular Graphs with Brushes. Noga Alon, Pawel Pralat, Nicholas C. Wormald. SIAM J. Discrete Math. (23): 233-250 (2008). Web SearchBibTeXDownload
345Large Nearly Regular Induced Subgraphs. Noga Alon, Michael Krivelevich, Benny Sudakov. SIAM J. Discrete Math. (22): 1325-1337 (2008). Web SearchBibTeXDownload
344Testing Triangle-Freeness in General Graphs. Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron. SIAM J. Discrete Math. (22): 786-819 (2008). Web SearchBibTeXDownload
343Weak ε-nets and interval chains. Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky. SODA 2008, 1194-1203. Web SearchBibTeXDownload
342Optimal universal graphs with deterministic embedding. Noga Alon, Michael R. Capalbo. SODA 2008, 373-378. Web SearchBibTeXDownload
341Many random walks are faster than one. Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle. SPAA 2008, 119-128. Web SearchBibTeXDownload
340The complexity of the outer face in arrangements of random segments. Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir. Symposium on Computational Geometry 2008, 69-78. Web SearchBibTeXDownload
339Polychromatic colorings of plane graphs. Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein. Symposium on Computational Geometry 2008, 338-345. Web SearchBibTeXDownload
2007
338Guessing secrets efficiently via list decoding. Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
337Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Noga Alon, Shai Gutner. COCOON 2007, 394-405. Web SearchBibTeXDownload
336Can a Graph Have Distinct Regular Partitions?. Noga Alon, Asaf Shapira, Uri Stav. COCOON 2007, 428-438. Web SearchBibTeXDownload
335Embedding nearly-spanning bounded degree trees. Noga Alon, Michael Krivelevich, Benny Sudakov. Combinatorica (27): 629-644 (2007). Web SearchBibTeXDownload
334Privileged users in zero-error transmission over a noisy channel. Noga Alon, Eyal Lubetzky. Combinatorica (27): 737-743 (2007). Web SearchBibTeXDownload
333Codes And Xor Graph Products. Noga Alon, Eyal Lubetzky. Combinatorica (27): 13-33 (2007). Web SearchBibTeXDownload
332Edge Colouring with Delays. Noga Alon, Vera Asodi. Combinatorics, Probability & Computing (16): 173-191 (2007). Web SearchBibTeXDownload
331Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. Noga Alon, Raphael Yuster. ESA 2007, 175-186. Web SearchBibTeXDownload
330Partitioning multi-dimensional sets in a small number of "uniform" parts. Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin. Eur. J. Comb. (28): 134-144 (2007). Web SearchBibTeXDownload
329Finding Disjoint Paths in Expanders Deterministically and Online. Noga Alon, Michael R. Capalbo. FOCS 2007, 518-524. Web SearchBibTeXDownload
328Better Algorithms and Bounds for Directed Maximum Leaf Problems. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh. FSTTCS 2007, 316-327. Web SearchBibTeXDownload
327Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. Noga Alon, Amin Coja-Oghlan, Hięp Hŕn, Mihyun Kang, Vojtech Rödl, Mathias Schacht. ICALP 2007, 789-800. Web SearchBibTeXDownload
326Balanced Families of Perfect Hash Functions and Their Applications. Noga Alon, Shai Gutner. ICALP 2007, 435-446. Web SearchBibTeXDownload
325Parameterized Algorithms for Directed Maximum Leaf Problems. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh. ICALP 2007, 352-362. Web SearchBibTeXDownload
324Tracing Many Users With Almost No Rate Penalty. Noga Alon, Vera Asodi. IEEE Transactions on Information Theory (53): 437-439 (2007). Web SearchBibTeXDownload
323Hardness of fully dense problems. Nir Ailon, Noga Alon. Inf. Comput. (205): 1117-1129 (2007). Web SearchBibTeXDownload
322Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern. Inf. Comput. (205): 1114-1116 (2007). Web SearchBibTeXDownload
321Independent sets in tensor graph powers. Noga Alon, Eyal Lubetzky. Journal of Graph Theory (54): 73-87 (2007). Web SearchBibTeXDownload
320Maximum directed cuts in acyclic digraphs. Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott. Journal of Graph Theory (55): 1-13 (2007). Web SearchBibTeXDownload
319On graphs with subgraphs having large independence numbers. Noga Alon, Benny Sudakov. Journal of Graph Theory (56): 149-157 (2007). Web SearchBibTeXDownload
318On (epsilon, k)-min-wise independent permutations. Noga Alon, Toshiya Itoh, Tatsuya Nagatani. Random Struct. Algorithms (31): 384-389 (2007). Web SearchBibTeXDownload
317Sparse universal graphs for bounded-degree graphs. Noga Alon, Michael R. Capalbo. Random Struct. Algorithms (31): 123-133 (2007). Web SearchBibTeXDownload
316Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. Noga Alon, Eldar Fischer, Ilan Newman. SIAM J. Comput. (37): 959-976 (2007). Web SearchBibTeXDownload
315Tur[a-acute]n's Theorem in the Hypercube. Noga Alon, Anja Krech, Tibor Szabó. SIAM J. Discrete Math. (21): 66-72 (2007). Web SearchBibTeXDownload
314Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon. Noga Alon, Eyal Lubetzky. SIAM J. Discrete Math. (21): 329-348 (2007). Web SearchBibTeXDownload
313An elementary construction of constant-degree expanders. Noga Alon, Oded Schwartz, Asaf Shapira. SODA 2007, 454-458. Web SearchBibTeXDownload
312Improved approximation for directed cut problems. Amit Agarwal, Noga Alon, Moses Charikar. STOC 2007, 671-680. Web SearchBibTeXDownload
311Testing k-wise and almost k-wise independence. Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie. STOC 2007, 496-505. Web SearchBibTeXDownload
310Approximating the maximum clique minor and some subgraph homeomorphism problems. Noga Alon, Andrzej Lingas, Martin Wahlen. Theor. Comput. Sci. (374): 149-158 (2007). Web SearchBibTeXDownload
2006
309A general approach to online network optimization problems. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor. ACM Transactions on Algorithms (2): 640-660 (2006). Web SearchBibTeXDownload
308Algorithmic construction of sets for k-restrictions. Noga Alon, Dana Moshkovitz, Shmuel Safra. ACM Transactions on Algorithms (2): 153-177 (2006). Web SearchBibTeXDownload
307On An Extremal Hypergraph Problem Of Brown, Erdös And Sós. Noga Alon, Asaf Shapira. Combinatorica (26): 627-645 (2006). Web SearchBibTeXDownload
306The Number Of Orientations Having No Fixed Tournament. Noga Alon, Raphael Yuster. Combinatorica (26): 1-16 (2006). Web SearchBibTeXDownload
305Feasible Schedules for Rotating Transmissions. Noga Alon. Combinatorics, Probability & Computing (15): 783-787 (2006). Web SearchBibTeXDownload
304A Characterization of Easily Testable Induced Subgraphs. Noga Alon, Asaf Shapira. Combinatorics, Probability & Computing (15): 791-805 (2006). Web SearchBibTeXDownload
303Measures of Pseudorandomness for Finite Sequences: Minimal Values. Noga Alon, Yoshiharu Kohayakawa, Christian Mauduit, Carlos Gustavo T. de A. Moreira, Vojtech Rödl. Combinatorics, Probability & Computing (15): 1-29 (2006). Web SearchBibTeXDownload
302Splitting digraphs. Noga Alon. Combinatorics, Probability & Computing (15): 933-937 (2006). Web SearchBibTeXDownload
301The Shannon capacity of a graph and the independence numbers of its powers. Noga Alon, Eyal Lubetzky. CoRR (abs/cs/0608021): 2172-2176 (2006). Web SearchBibTeXDownload
300Explicit construction of linear sized tolerant networks. Noga Alon, Fan R. K. Chung. Discrete Mathematics (306): 1068-1071 (2006). Web SearchBibTeXDownload
299H-Free Graphs of Large Minimum Degree. Noga Alon, Benny Sudakov. Electr. J. Comb. (13) (2006). Web SearchBibTeXDownload
298An Elementary Construction of Constant-Degree Expanders. Noga Alon, Oded Schwartz, Asaf Shapira. Electronic Colloquium on Computational Complexity (ECCC) (13) (2006). Web SearchBibTeXDownload
297Tracing a single user. Noga Alon, Vera Asodi. Eur. J. Comb. (27): 1227-1234 (2006). Web SearchBibTeXDownload
296Additive Approximation for Edge-Deletion Problems (Abstract). Noga Alon, Asaf Shapira, Benny Sudakov. ICALP (1) 2006, 1-2. Web SearchBibTeXDownload
295Dominating sets in k-majority tournaments. Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler. J. Comb. Theory, Ser. B (96): 374-387 (2006). Web SearchBibTeXDownload
294Multi-Node Graphs: A Framework for Multiplexed Biological Assays. Noga Alon, Vera Asodi, Charles Cantor, Simon Kasif, John Rachlin. Journal of Computational Biology (13): 1659-1672 (2006). Web SearchBibTeXDownload
293A Ramsey-type result for the hypercube. Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák. Journal of Graph Theory (53): 196-208 (2006). Web SearchBibTeXDownload
292Regular graphs whose subgraphs tend to be acyclic. Noga Alon, Eitan Bachmat. Random Struct. Algorithms (29): 324-337 (2006). Web SearchBibTeXDownload
291Approximating the Cut-Norm via Grothendieck's Inequality. Noga Alon, Assaf Naor. SIAM J. Comput. (35): 787-803 (2006). Web SearchBibTeXDownload
290Ranking Tournaments. Noga Alon. SIAM J. Discrete Math. (20): 137-142 (2006). Web SearchBibTeXDownload
289Testing triangle-freeness in general graphs. Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron. SODA 2006, 279-288. Web SearchBibTeXDownload
288Tell me who I am: an interactive recommendation system. Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir. SPAA 2006, 1-10. Cited by 13Web SearchBibTeXDownload
287A combinatorial characterization of the testable graph properties: it's all about regularity. Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira. STOC 2006, 251-260. Web SearchBibTeXDownload
286Conflict-free colorings of shallow discs. Noga Alon, Shakhar Smorodinsky. Symposium on Computational Geometry 2006, 41-43. Web SearchBibTeXDownload
2005
285Sharp Bounds For Some Multicolor Ramsey Numbers. Noga Alon, Vojtech Rödl. Combinatorica (25): 125-141 (2005). Web SearchBibTeXDownload
284Tight bounds for shared memory systems accessed by Byzantine processes. Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright. Distributed Computing (18): 99-109 (2005). Web SearchBibTeXDownload
283Discrepancy Games. Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó. Electr. J. Comb. (12) (2005). Web SearchBibTeXDownload
282Partitioning multi-dimensional sets in a small number of ``uniform'' parts. Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload
281Homomorphisms in Graph Property Testing - A Survey. Asaf Shapira, Noga Alon. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload
280Nonrepetitive colorings of graphs. Sebastian Czerwinski, Jaroslaw Grytczuk, Mariusz Haluszczak, Oliver Riordan. Electronic Notes in Discrete Mathematics (22): 353-355 (2005). Web SearchBibTeXDownload
279Additive Approximation for Edge-Deletion Problems. Noga Alon, Asaf Shapira, Benny Sudakov. FOCS 2005, 419-428. Web SearchBibTeXDownload
278A Characterization of the (natural) Graph Properties Testable with One-Sided Error. Noga Alon, Asaf Shapira. FOCS 2005, 429-438. Web SearchBibTeXDownload
277On a Hypergraph Matching Problem. Noga Alon, Raphael Yuster. Graphs and Combinatorics (21): 377-384 (2005). Web SearchBibTeXDownload
276Testing Reed-Muller codes. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron. IEEE Transactions on Information Theory (51): 4032-4039 (2005). Web SearchBibTeXDownload
275Crossing patterns of semi-algebraic sets. Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir. J. Comb. Theory, Ser. A (111): 310-326 (2005). Web SearchBibTeXDownload
274Estimating arbitrary subset sums with few probes. Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup. PODS 2005, 317-325. Cited by 20Web SearchBibTeXDownload
273Learning a Hidden Subgraph. Noga Alon, Vera Asodi. SIAM J. Discrete Math. (18): 697-712 (2005). Web SearchBibTeXDownload
272Linear equations, arithmetic progressions and hypergraph property testing. Noga Alon, Asaf Shapira. SODA 2005, 708-717. Web SearchBibTeXDownload
271Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos. SODA 2005, 650-659. Web SearchBibTeXDownload
270Admission control to minimize rejections and online set cover with repetitions. Noga Alon, Yossi Azar, Shai Gutner. SPAA 2005, 238-244. Web SearchBibTeXDownload
269Every monotone graph property is testable. Noga Alon, Asaf Shapira. STOC 2005, 128-137. Web SearchBibTeXDownload
268Quadratic forms on graphs. Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor. STOC 2005, 486-493. Web SearchBibTeXDownload
267Linear Equations, Arithmetic Progressions and Hypergraph Property Testing. Noga Alon, Asaf Shapira. Theory of Computing (1): 177-216 (2005). Web SearchBibTeXDownload
2004
266Edge Coloring with Delays. Noga Alon, Vera Asodi. APPROX-RANDOM 2004, 237-248. Web SearchBibTeXDownload
265New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. Noga Alon, Uri Stav. Combinatorics, Probability & Computing (13): 795-807 (2004). Web SearchBibTeXDownload
264Learning a Hidden Subgraph. Noga Alon, Vera Asodi. ICALP 2004, 110-121. Web SearchBibTeXDownload
263Algorithms with large domination ratio. Noga Alon, Gregory Gutin, Michael Krivelevich. J. Algorithms (50): 118-131 (2004). Web SearchBibTeXDownload
262Testing subgraphs in directed graphs. Noga Alon, Asaf Shapira. J. Comput. Syst. Sci. (69): 354-382 (2004). Web SearchBibTeXDownload
261Dense graphs are antimagic. Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster. Journal of Graph Theory (47): 297-309 (2004). Web SearchBibTeXDownload
260Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices. Nathan Srebro, Noga Alon, Tommi Jaakkola. NIPS 2004. Web SearchBibTeXDownload
259Learning a Hidden Matching. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov. SIAM J. Comput. (33): 487-501 (2004). Web SearchBibTeXDownload
258A general approach to online network optimization problems. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor. SODA 2004, 577-586. Web SearchBibTeXDownload
257A characterization of easily testable induced subgraphs. Noga Alon, Asaf Shapira. SODA 2004, 942-951. Web SearchBibTeXDownload
256Approximating the cut-norm via Grothendieck's inequality. Noga Alon, Assaf Naor. STOC 2004, 72-80. Web SearchBibTeXDownload
2003
255Typechecking XML views of relational databases. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu. ACM Trans. Comput. Log. (4): 315-354 (2003). Cited by 48Web SearchBibTeXDownload
254Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. Noga Alon, Michael Krivelevich, Benny Sudakov. Combinatorics, Probability & Computing (12): 477-494 (2003). Web SearchBibTeXDownload
253Problems and results in extremal combinatorics--I. Noga Alon. Discrete Mathematics (273): 31-53 (2003). Web SearchBibTeXDownload
252Factor d-domatic colorings of graphs. Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho. Discrete Mathematics (262): 17-25 (2003). Web SearchBibTeXDownload
251A Coding Theory Bound and Zero-Sum Square Matrices. Noga Alon, Simon Litsyn, Raphael Yuster. Graphs and Combinatorics (19): 449-457 (2003). Web SearchBibTeXDownload
250Almost k-wise independence versus k-wise independence. Noga Alon, Oded Goldreich, Yishay Mansour. Inf. Process. Lett. (88): 107-110 (2003). Web SearchBibTeXDownload
249A simple algorithm for edge-coloring bipartite multigraphs. Noga Alon. Inf. Process. Lett. (85): 301-302 (2003). Web SearchBibTeXDownload
248Smaller Explicit Superconcentrators. Noga Alon, Michael R. Capalbo. Internet Mathematics (1) (2003). Web SearchBibTeX
247Testing satisfiability. Noga Alon, Asaf Shapira. J. Algorithms (47): 87-103 (2003). Web SearchBibTeXDownload
246Generalized hashing and parent-identifying codes. Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn. J. Comb. Theory, Ser. A (104): 207-215 (2003). Web SearchBibTeXDownload
245Maximum cuts and judicious partitions in graphs without short cycles. Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov. J. Comb. Theory, Ser. B (88): 329-346 (2003). Web SearchBibTeXDownload
244Partitioning into graphs with only small components. Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan. J. Comb. Theory, Ser. B (87): 231-243 (2003). Web SearchBibTeXDownload
243XML with data values: typechecking revisited. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu. J. Comput. Syst. Sci. (66): 688-727 (2003). Web SearchBibTeXDownload
242Random sampling and approximation of MAX-CSPs. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski. J. Comput. Syst. Sci. (67): 212-243 (2003). Web SearchBibTeXDownload
241Testing Low-Degree Polynomials over GF(2(. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron. RANDOM-APPROX 2003, 188-199. Web SearchBibTeXDownload
240Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin. Random Struct. Algorithms (23): 409-433 (2003). Web SearchBibTeXDownload
239Testing of Clustering. Noga Alon, Seannie Dar, Michal Parnas, Dana Ron. SIAM J. Discrete Math. (16): 393-417 (2003). Web SearchBibTeXDownload
238Smaller explicit superconcentrators. Noga Alon, Michael R. Capalbo. SODA 2003, 340-346. Web SearchBibTeXDownload
237Testing subgraphs in directed graphs. Noga Alon, Asaf Shapira. STOC 2003, 700-709. Web SearchBibTeXDownload
236The online set cover problem. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor. STOC 2003, 100-105. Web SearchBibTeXDownload
2002
235Algorithmic Aspects of Acyclic Edge Colorings. Noga Alon, Ayal Zaks. Algorithmica (32): 611-614 (2002). Web SearchBibTeXDownload
234The Chromatic Number Of Graph Powers. Noga Alon, Bojan Mohar. Combinatorics, Probability & Computing (11): 1-10 (2002). Web SearchBibTeXDownload
233Covering a hypergraph of subgraphs. Noga Alon. Discrete Mathematics (257): 249-254 (2002). Web SearchBibTeXDownload
232Game domination number. Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó. Discrete Mathematics (256): 23-33 (2002). Web SearchBibTeXDownload
231On partitions of discrete boxes. Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman. Discrete Mathematics (257): 255-258 (2002). Cited by 4Web SearchBibTeXDownload
230Almost k-wise independence versus k-wise independence. Noga Alon, Oded Goldreich, Yishay Mansour. Electronic Colloquium on Computational Complexity (ECCC) 2002. Web SearchBibTeXDownload
229Explicit Unique-Neighbor Expanders. Noga Alon, Michael R. Capalbo. FOCS 2002, 73. Web SearchBibTeXDownload
228Learning a Hidden Matching. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov. FOCS 2002, 197. Web SearchBibTeXDownload
227The Moore Bound for Irregular Graphs. Noga Alon, Shlomo Hoory, Nathan Linial. Graphs and Combinatorics (18): 53-57 (2002). Web SearchBibTeXDownload
226Scalable Secure Storage When Half the System Is Faulty. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern. Inf. Comput. (174): 203-213 (2002). Web SearchBibTeXDownload
225Tracking Join and Self-Join Sizes in Limited Storage. Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario Szegedy. J. Comput. Syst. Sci. (64): 719-747 (2002). Cited by 145Web SearchBibTeXDownload
224Testing subgraphs in large graphs. Noga Alon. Random Struct. Algorithms (21): 359-370 (2002). Web SearchBibTeXDownload
223Nonrepetitive colorings of graphs. Sebastian Czerwinski, Jaroslaw Grytczuk, Mariusz Haluszczak, Oliver Riordan. Random Struct. Algorithms (21): 336-346 (2002). Web SearchBibTeXDownload
222On the discrepancy of combinatorial rectangles. Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen. Random Struct. Algorithms (21): 205-215 (2002). Web SearchBibTeXDownload
221Testing k-colorability. Noga Alon, Michael Krivelevich. SIAM J. Discrete Math. (15): 211-227 (2002). Web SearchBibTeXDownload
220Testing satisfiability. Noga Alon, Asaf Shapira. SODA 2002, 645-654. Web SearchBibTeXDownload
219Guessing secrets efficiently via list decoding. Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan. SODA 2002, 254-262. Web SearchBibTeXDownload
218Random sampling and approximation of MAX-CSP problems. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski. STOC 2002, 232-239. Web SearchBibTeXDownload
2001
217Ramsey-type Theorems with Forbidden Subgraphs. Noga Alon, János Pach, József Solymosi. Combinatorica (21): 155-170 (2001). Web SearchBibTeXDownload
216On the Complexity of Arrangements of Circles in the Plane. Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir. Discrete & Computational Geometry (26): 465-492 (2001). Web SearchBibTeXDownload
215Random Sampling and Approximation of MAX-CSP Problems. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski. Electronic Colloquium on Computational Complexity (ECCC) 2001. Web SearchBibTeXDownload
214Testing Subgraphs in Large Graphs. Noga Alon. FOCS 2001, 434-441. Web SearchBibTeXDownload
213Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications. Noga Alon, Alexander Lubotzky, Avi Wigderson. FOCS 2001, 630-637. Web SearchBibTeXDownload
212Linear Arboricity and Linear k-Arboricity of Regular Graphs. Noga Alon, Vanessa Teague, Nicholas C. Wormald. Graphs and Combinatorics (17): 11-16 (2001). Web SearchBibTeXDownload
211Lower Bounds for Approximations by Low Degree Polynomials Over Zm. Noga Alon, Richard Beigel. IEEE Conference on Computational Complexity 2001, 184-187. Web SearchBibTeXDownload
210Unextendible Product Bases. Noga Alon, László Lovász. J. Comb. Theory, Ser. A (95): 169-179 (2001). Web SearchBibTeXDownload
209Parent-Identifying Codes. Noga Alon, Eldar Fischer, Mario Szegedy. J. Comb. Theory, Ser. A (95): 349-359 (2001). Web SearchBibTeXDownload
208Typechecking XML Views of Relational Databases. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu. LICS 2001, 421-430. Web SearchBibTeXDownload
207XML with Data Values: Typechecking Revisited. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu. PODS 2001. Cited by 96Web SearchBibTeXDownload
206Near-optimum Universal Graphs for Graphs with Bounded Degrees. Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi. RANDOM-APPROX 2001, 170-180. Web SearchBibTeXDownload
205On the maximum number of Hamiltonian paths in tournaments. Ilan Adler, Noga Alon, Sheldon M. Ross. Random Struct. Algorithms (18): 291-296 (2001). Web SearchBibTeX
204An optimal procedure for gap closing in whole genome shotgun sequencing. Richard Beigel, Noga Alon, Simon Kasif, Mehmet Serkan Apaydin, Lance Fortnow. RECOMB 2001, 22-30. Web SearchBibTeXDownload
203Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. Noga Alon, Benny Sudakov, Uri Zwick. SIAM J. Discrete Math. (15): 58-72 (2001). Web SearchBibTeXDownload
202Equireplicate Balanced Binary Codes for Oligo Arrays. Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa. SIAM J. Discrete Math. (14): 481-497 (2001). Web SearchBibTeXDownload
201Constructing worst case instances for semidefinite programming based approximation algorithms. Noga Alon, Benny Sudakov, Uri Zwick. SODA 2001, 92-100. Web SearchBibTeXDownload
2000
200Efficient Testing of Large Graphs. Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy. Combinatorica (20): 451-476 (2000). Web SearchBibTeXDownload
199String Quartets In Binary. Noga Alon, János Körner, Angelo Monti. Combinatorics, Probability & Computing (9): 381-390 (2000). Web SearchBibTeXDownload
198Locally Thin Set Families. Noga Alon, Emanuela Fachini, János Körner. Combinatorics, Probability & Computing (9): 481-488 (2000). Web SearchBibTeXDownload
197Bipartite Subgraphs And The Smallest Eigenvalue. Noga Alon, Benny Sudakov. Combinatorics, Probability & Computing (9): 1-12 (2000). Web SearchBibTeXDownload
196Packing Ferrers Shapes. Noga Alon, Miklós Bóna, Joel Spencer. Combinatorics, Probability & Computing (9): 205-211 (2000). Web SearchBibTeXDownload
195EveryH-decomposition ofKnhas a Nearly Resolvable Alternative. Noga Alon, Raphael Yuster. Eur. J. Comb. (21): 839-845 (2000). Web SearchBibTeXDownload
194Testing of Clustering. Noga Alon, Seannie Dar, Michal Parnas, Dana Ron. FOCS 2000, 240-250. Web SearchBibTeXDownload
193Universality and Tolerance. Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi. FOCS 2000, 14-21. Web SearchBibTeXDownload
192Scalable Secure Storage when Half the System Is Faulty. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern. ICALP 2000, 576-587. Web SearchBibTeXDownload
191On the Number of Permutations Avoiding a Given Pattern. Noga Alon, Ehud Friedgut. J. Comb. Theory, Ser. A (89): 133-140 (2000). Web SearchBibTeXDownload
190On a Problem in Shuffling. Noga Alon, Kenneth A. Berman, Daniel J. Kleitman. J. Comb. Theory, Ser. A (91): 5-14 (2000). Cited by 1Web SearchBibTeXDownload
189Degrees and choice numbers. Noga Alon. Random Struct. Algorithms (16): 364-368 (2000). Web SearchBibTeX
188Regular Languages are Testable with a Constant Number of Queries. Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy. SIAM J. Comput. (30): 1842-1862 (2000). Web SearchBibTeXDownload
1999
187Refining the Graph Density Condition for the Existence of Almost K-factors. Noga Alon, Eldar Fischer. Ars Comb. (52) (1999). Web SearchBibTeX
186List Coloring of Random and Pseudo-Random Graphs. Noga Alon, Michael Krivelevich, Benny Sudakov. Combinatorica (19): 453-472 (1999). Web SearchBibTeXDownload
185Separable Partitions. Noga Alon, Shmuel Onn. Discrete Applied Mathematics (91): 39-51 (1999). Web SearchBibTeXDownload
184Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs. Noga Alon, Peter Hamburger, Alexandr V. Kostochka. Eur. J. Comb. (20): 469-481 (1999). Web SearchBibTeXDownload
183Efficient Testing of Large Graphs. Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy. FOCS 1999, 656-666. Web SearchBibTeXDownload
182Regular Languages Are Testable with a Constant Number of Queries. Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy. FOCS 1999, 645-655. Web SearchBibTeXDownload
181Linear Hash Functions. Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos. J. ACM (46): 667-683 (1999). Web SearchBibTeXDownload
180On Two Segmentation Problems. Noga Alon, Benny Sudakov. J. Algorithms (33): 173-184 (1999). Web SearchBibTeXDownload
179Non-averaging Subsets and Non-vanishing Transversals. Noga Alon, Imre Z. Ruzsa. J. Comb. Theory, Ser. A (86): 1-13 (1999). Web SearchBibTeXDownload
178Norm-Graphs: Variations and Applications. Noga Alon, Lajos Rónyai, Tibor Szabó. J. Comb. Theory, Ser. B (76): 280-290 (1999). Web SearchBibTeXDownload
177Coloring Graphs with Sparse Neighborhoods. Noga Alon, Michael Krivelevich, Benny Sudakov. J. Comb. Theory, Ser. B (77): 73-82 (1999). Web SearchBibTeXDownload
176The Space Complexity of Approximating the Frequency Moments. Noga Alon, Yossi Matias, Mario Szegedy. J. Comput. Syst. Sci. (58): 137-147 (1999). Cited by 716Web SearchBibTeXDownload
175Tracking Join and Self-Join Sizes in Limited Storage. Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario Szegedy. PODS 1999, 10-20. Cited by 145Web SearchBibTeX
174Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. Noga Alon, Uri Arad, Yossi Azar. RANDOM-APPROX 1999, 16-27. Web SearchBibTeX
1998
173On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger. Algorithmica (21): 104-118 (1998). Web SearchBibTeXDownload
172The Shannon Capacity of a Union. Noga Alon. Combinatorica (18): 301-310 (1998). Web SearchBibTeXDownload
171Piercing d -Intervals. Noga Alon. Discrete & Computational Geometry (19): 333-334 (1998). Web SearchBibTeXDownload
170T-choosability in Graphs. Noga Alon, Ayal Zaks. Discrete Applied Mathematics (82): 1-13 (1998). Web SearchBibTeXDownload
169Bipartite subgraphs of integer weighted graphs. Noga Alon, Eran Halperin. Discrete Mathematics (181): 19-29 (1998). Web SearchBibTeXDownload
168Perfect Matchings in $\\epsilon$-regular Graphs. Noga Alon, Vojtech Rödl, Andrzej Rucinski. Electr. J. Comb. (5) (1998). Web SearchBibTeXDownload
167On the Capacity of Digraphs. Noga Alon. Eur. J. Comb. (19): 1-5 (1998). Web SearchBibTeXDownload
166Progressions in Sequences of Nearly Consecutive Integers. Noga Alon, Ayal Zaks. J. Comb. Theory, Ser. A (84): 99-109 (1998). Web SearchBibTeXDownload
165Spectral Techniques in Graph Algorithms. Noga Alon. LATIN 1998, 206-215. Web SearchBibTeXDownload
164Approximating the independence number via the theta-function. Noga Alon, Nabil Kahale. Math. Program. (80): 253-264 (1998). Web SearchBibTeXDownload
163Finding a large hidden clique in a random graph. Noga Alon, Michael Krivelevich, Benny Sudakov. Random Struct. Algorithms (13): 457-466 (1998). Web SearchBibTeX
162Finding a Large Hidden Clique in a Random Graph. Noga Alon, Michael Krivelevich, Benny Sudakov. SODA 1998, 594-598. Web SearchBibTeXDownload
1997
161Finding and Counting Given Length Cycles. Noga Alon, Raphael Yuster, Uri Zwick. Algorithmica (17): 209-223 (1997). Web SearchBibTeXDownload
160Improved Parallel Approximation of a Class of Integer Programming Problems. Noga Alon, Aravind Srinivasan. Algorithmica (17): 449-462 (1997). Web SearchBibTeXDownload
159The Concentration of the Chromatic Number of Random Graphs. Noga Alon, Michael Krivelevich. Combinatorica (17): 303-313 (1997). Web SearchBibTeXDownload
158On the Edge-Expansion of Graphs. Noga Alon. Combinatorics, Probability & Computing (6): 145-152 (1997). Web SearchBibTeXDownload
157Intersecting Systems. Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely. Combinatorics, Probability & Computing (6): 127-137 (1997). Web SearchBibTeXDownload
156Packings with large minimum kissing numbers. Noga Alon. Discrete Mathematics (175): 249-251 (1997). Web SearchBibTeXDownload
155Choosability and fractional chromatic numbers. Noga Alon, Zsolt Tuza, Margit Voigt. Discrete Mathematics (165-166): 31-38 (1997). Web SearchBibTeXDownload
154A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture. Noga Alon, Daniel J. Kleitman. Electr. J. Comb. (4) (1997). Cited by 4Web SearchBibTeXDownload
153Short Certificates for Tournaments. Noga Alon, Miklós Ruszinkó. Electr. J. Comb. (4) (1997). Web SearchBibTeXDownload
152Scale-sensitive dimensions, uniform convergence, and learnability. Noga Alon, Shai Ben-David, Nicolň Cesa-Bianchi, David Haussler. J. ACM (44): 615-631 (1997). Web SearchBibTeXDownload
151Coins with Arbitrary Weights. Noga Alon, Dmitry N. Kozlov. J. Algorithms (25): 162-176 (1997). Web SearchBibTeXDownload
150On the Degree, Size, and Chromatic Index of a Uniform Hypergraph. Noga Alon, Jeong Han Kim. J. Comb. Theory, Ser. A (77): 165-170 (1997). Web SearchBibTeXDownload
149Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs. Noga Alon, Van H. Vu. J. Comb. Theory, Ser. A (79): 133-160 (1997). Web SearchBibTeXDownload
148Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap. Noga Alon, Yair Caro, Raphael Yuster. J. Comb. Theory, Ser. B (71): 144-161 (1997). Web SearchBibTeXDownload
147A Note on Graph Colorings and Graph Polynomials. Noga Alon, Michael Tarsi. J. Comb. Theory, Ser. B (70): 197-201 (1997). Web SearchBibTeXDownload
146On the Exponent of the All Pairs Shortest Path Problem. Noga Alon, Zvi Galil, Oded Margalit. J. Comput. Syst. Sci. (54): 255-262 (1997). Web SearchBibTeXDownload
145Properly colored Hamilton cycles in edge-colored complete graphs. Noga Alon, Gregory Gutin. Random Struct. Algorithms (11): 179-186 (1997). Web SearchBibTeX
144A Spectral Technique for Coloring Random 3-Colorable Graphs. Noga Alon, Nabil Kahale. SIAM J. Comput. (26): 1733-1748 (1997). Web SearchBibTeXDownload
143Approximation Schemes for Scheduling. Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid. SODA 1997, 493-500. Web SearchBibTeXDownload
142Is Linear Hashing Good?. Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos. STOC 1997, 465-474. Web SearchBibTeXDownload
1996
141Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions. Noga Alon, Moni Naor. Algorithmica (16): 434-449 (1996). Web SearchBibTeXDownload
140Bipartite Subgraphs. Noga Alon. Combinatorica (16): 301-311 (1996). Web SearchBibTeXDownload
1392-factors in dense graphs. Noga Alon, Eldar Fischer. Discrete Mathematics (152): 13-23 (1996). Web SearchBibTeXDownload
138On-line and Off-line Approximation Algorithms for Vector Covering Problems. Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger. ESA 1996, 406-418. Web SearchBibTeXDownload
137The Geometry of Coin-Weighing Problems. Noga Alon, Dmitry N. Kozlov, Van H. Vu. FOCS 1996, 524-532. Web SearchBibTeXDownload
136Improved Parallel Approximation of a Class of Integer Programming Programming Problems. Noga Alon, Aravind Srinivasan. ICALP 1996, 562-573. Web SearchBibTeXDownload
135A linear time erasure-resilient code with nearly optimal recovery. Noga Alon, Michael Luby. IEEE Transactions on Information Theory (42): 1732-1736 (1996). Web SearchBibTeXDownload
134Source coding and graph entropies. Noga Alon, Alon Orlitsky. IEEE Transactions on Information Theory (42): 1329-1339 (1996). Web SearchBibTeXDownload
133Matching Nuts and Bolts Faster. Noga Alon, Phillip G. Bradford, Rudolf Fleischer. Inf. Process. Lett. (59): 123-127 (1996). Web SearchBibTeXDownload
132Disjoint Directed Cycles. Noga Alon. J. Comb. Theory, Ser. B (68): 167-178 (1996). Web SearchBibTeXDownload
131H-Factors in Dense Graphs. Noga Alon, Raphael Yuster. J. Comb. Theory, Ser. B (66): 269-282 (1996). Web SearchBibTeXDownload
130Approximate Hypergraph Coloring. Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan. Nord. J. Comput. (3): 425-439 (1996). Web SearchBibTeX
129Independence numbers of locally sparse graphs and a Ramsey type problem. Noga Alon. Random Struct. Algorithms (9): 271-278 (1996). Web SearchBibTeX
128The Space Complexity of Approximating the Frequency Moments. Noga Alon, Yossi Matias, Mario Szegedy. STOC 1996, 20-29. Cited by 716Web SearchBibTeXDownload
127Derandomization Via Small Sample Spaces (Abstract). Noga Alon. SWAT 1996, 1-3. Web SearchBibTeXDownload
1995
126A Lattice Point Problem and Additive Number Theory. Noga Alon, Moshe Dubiner. Combinatorica (15): 301-309 (1995). Web SearchBibTeXDownload
125Derandomized Graph Products. Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman. Computational Complexity (5): 60-75 (1995). Web SearchBibTeXDownload
124Bounding the Piercing Number. Noga Alon, Gil Kalai. Discrete & Computational Geometry (13): 245-256 (1995). Web SearchBibTeXDownload
123Covering with Latin Transversals. Noga Alon, Joel Spencer, Prasad Tetali. Discrete Applied Mathematics (57): 1-10 (1995). Web SearchBibTeXDownload
122Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. Noga Alon, Zvi Galil, Moti Yung. ESA 1995, 523-537. Web SearchBibTeXDownload
121Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). Noga Alon, Jeff Edmonds, Michael Luby. FOCS 1995, 512-519. Web SearchBibTeXDownload
120Long Non-Crossing Configurations in the Plane. Noga Alon, Sridhar Rajagopalan, Subhash Suri. Fundam. Inform. (22): 385-394 (1995). Web SearchBibTeXDownload
119Repeated communication and Ramsey graphs. Noga Alon, Alon Orlitsky. IEEE Transactions on Information Theory (41): 1276-1289 (1995). Web SearchBibTeXDownload
118epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials. Noga Alon, Yishay Mansour. Inf. Process. Lett. (54): 337-342 (1995). Web SearchBibTeXDownload
117The 123 Theorem and Its Extensions. Noga Alon, Raphael Yuster. J. Comb. Theory, Ser. A (72): 322-331 (1995). Web SearchBibTeX
116The Acyclic Orientation Game on Random Graphs. Noga Alon, Zsolt Tuza. Random Struct. Algorithms (6): 261-268 (1995). Web SearchBibTeX
115Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Noga Alon, Alan M. Frieze, Dominic Welsh. Random Struct. Algorithms (6): 459-478 (1995). Web SearchBibTeX
114Disjoint Systems. Noga Alon, Benny Sudakov. Random Struct. Algorithms (6): 13-20 (1995). Web SearchBibTeX
113A Graph-Theoretic Game and Its Application to the k-Server Problem. Noga Alon, Richard M. Karp, David Peleg, Douglas B. West. SIAM J. Comput. (24): 78-100 (1995). Web SearchBibTeXDownload
1994
112Can Visibility Graphs Be Represented Compactly?. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri. Discrete & Computational Geometry (12): 347-365 (1994). Web SearchBibTeXDownload
111Probabilistic methods in coloring and decomposition problems. Noga Alon. Discrete Mathematics (127): 31-46 (1994). Web SearchBibTeXDownload
110Explicit Ramsey graphs and orthonormal labelings. Noga Alon. Electr. J. Comb. (1) (1994). Web SearchBibTeXDownload
109Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Noga Alon, Alan M. Frieze, Dominic Welsh. Electronic Colloquium on Computational Complexity (ECCC) (1) (1994). Web SearchBibTeXDownload
108Finding and Counting Given Length Cycles (Extended Abstract). Noga Alon, Raphael Yuster, Uri Zwick. ESA 1994, 354-364. Web SearchBibTeXDownload
107Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs. Noga Alon, Alan M. Frieze, Dominic Welsh. FOCS 1994, 24-35. Web SearchBibTeXDownload
106A lower bound on the expected length of one-to-one codes. Noga Alon, Alon Orlitsky. IEEE Transactions on Information Theory (40): 1670-1672 (1994). Web SearchBibTeXDownload
105Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. Noga Alon, Nimrod Megiddo. J. ACM (41): 422-434 (1994). Web SearchBibTeXDownload
104The Algorithmic Aspects of the Regularity Lemma. Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster. J. Algorithms (16): 80-109 (1994). Web SearchBibTeXDownload
103Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely). Noga Alon, Pavel Pudlák. J. Comput. Syst. Sci. (48): 194-202 (1994). Web SearchBibTeXDownload
102Random Cayley Graphs and Expanders. Noga Alon, Yuval Roichman. Random Struct. Algorithms (5): 271-285 (1994). Web SearchBibTeX
101Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition. Noga Alon, Jehoshua Bruck. SIAM J. Discrete Math. (7): 1-8 (1994). Web SearchBibTeXDownload
100Routing Permutations on Graphs Via Matchings. Noga Alon, Fan R. K. Chung, Ronald L. Graham. SIAM J. Discrete Math. (7): 513-530 (1994). Web SearchBibTeXDownload
99Planar Separators. Noga Alon, Paul D. Seymour, Robin Thomas. SIAM J. Discrete Math. (7): 184-193 (1994). Web SearchBibTeXDownload
98Matching Nuts and Bolts. Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky. SODA 1994, 690-696. Web SearchBibTeXDownload
97A spectral technique for coloring random 3-colorable graphs (preliminary version). Noga Alon, Nabil Kahale. STOC 1994, 346-355. Web SearchBibTeXDownload
96Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. Noga Alon, Raphael Yuster, Uri Zwick. STOC 1994, 326-335. Web SearchBibTeXDownload
95Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer. Theor. Comput. Sci. (130): 175-201 (1994). Web SearchBibTeXDownload
1993
94Disjoint Systems (Extended Abstract). Noga Alon, Benny Sudakov. Algebraic Coding 1993, 159-163. Web SearchBibTeXDownload
93Threshold Functions for H-factors. Noga Alon, Raphael Yuster. Combinatorics, Probability & Computing (2): 137-144 (1993). Web SearchBibTeXDownload
92On-Line Steine Trees in the Euclidean Plane. Noga Alon, Yossi Azar. Discrete & Computational Geometry (10): 113-121 (1993). Web SearchBibTeXDownload
91Bisection of trees and sequences. Noga Alon, Yair Caro, Ilia Krasikov. Discrete Mathematics (114): 3-7 (1993). Web SearchBibTeXDownload
90Covering the Cube by Affine Hyperplanes. Noga Alon, Zoltán Füredi. Eur. J. Comb. (14): 79-83 (1993). Web SearchBibTeXDownload
89Scale-sensitive Dimensions, Uniform Convergence, and Learnability. Noga Alon, Shai Ben-David, Nicolň Cesa-Bianchi, David Haussler. FOCS 1993, 292-301. Web SearchBibTeXDownload
88Addendum to "Simple Construction of Almost k-wise Independent Random Variables". Noga Alon, Oded Goldreich, Johan Hĺstad, René Peralta. Random Struct. Algorithms (4): 119-120 (1993). Web SearchBibTeX
87Coin-Flipping Games Immune Against Linear-Sized Coalitions. Noga Alon, Moni Naor. SIAM J. Comput. (22): 403-417 (1993). Web SearchBibTeXDownload
86Routing permutations on graphs via matchings. Noga Alon, Fan R. K. Chung, Ronald L. Graham. STOC 1993, 583-591. Web SearchBibTeXDownload
85Long Non-Crossing Configurations in the Plane. Noga Alon, Sridhar Rajagopalan, Subhash Suri. Symposium on Computational Geometry 1993, 257-263. Web SearchBibTeXDownload
84Can Visibility Graphs be Represented Compactly?. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri. Symposium on Computational Geometry 1993, 338-347. Web SearchBibTeXDownload
1992
83Colorings and orientations of graphs. Noga Alon, Michael Tarsi. Combinatorica (12): 125-134 (1992). Web SearchBibTeXDownload
82Star arboricity. Noga Alon, Colin McDiarmid, Bruce A. Reed. Combinatorica (12): 375-380 (1992). Web SearchBibTeXDownload
81Point Selections and Weak e-Nets for Convex Hulls. Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman. Combinatorics, Probability & Computing (1): 189-200 (1992). Cited by 70Web SearchBibTeXDownload
80Choice Numbers of Graphs: a Probabilistic Approach. Noga Alon. Combinatorics, Probability & Computing (1): 107-114 (1992). Web SearchBibTeXDownload
79Transmitting in the n-Dimensional Cube. Noga Alon. Discrete Applied Mathematics (37/38): 9-11 (1992). Web SearchBibTeXDownload
78Partitioning a rectangle into small perimeter rectangles. Noga Alon, Daniel J. Kleitman. Discrete Mathematics (103): 111-119 (1992). Cited by 1Web SearchBibTeXDownload
77Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths. Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi. FOCS 1992, 693-702. Cited by 16Web SearchBibTeXDownload
76Witnesses for Boolean Matrix Multiplication and for Shortest Paths. Noga Alon, Zvi Galil, Oded Margalit, Moni Naor. FOCS 1992, 417-426. Web SearchBibTeXDownload
75The Algorithmic Aspects of the Regularity Lemma (Extended Abstract). Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster. FOCS 1992, 473-481. Web SearchBibTeXDownload
74Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract). Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer. FOCS 1992, 334-343. Web SearchBibTeXDownload
73Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth. IEEE Transactions on Information Theory (38): 509-516 (1992). Web SearchBibTeXDownload
72Single Round Simulation on Radio Networks. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg. J. Algorithms (13): 188-210 (1992). Web SearchBibTeXDownload
71Simple Construction of Almost k-wise Independent Random Variables. Noga Alon, Oded Goldreich, Johan Hĺstad, René Peralta. Random Struct. Algorithms (3): 289-304 (1992). Web SearchBibTeX
70The String Chromatic Number of a Graph. Noga Alon. Random Struct. Algorithms (3): 1-8 (1992). Web SearchBibTeX
69Comparison-Sorting and Selecting in Totally Monotone Matrices. Noga Alon, Yossi Azar. SODA 1992, 403-408. Web SearchBibTeXDownload
68On-Line Steiner Trees in the Euclidean Plane. Noga Alon, Yossi Azar. Symposium on Computational Geometry 1992, 337-343. Web SearchBibTeXDownload
67Piercing Convex Sets. Noga Alon, Daniel J. Kleitman. Symposium on Computational Geometry 1992, 157-160. Cited by 4Web SearchBibTeXDownload
1991
66Parallel comparison algorithms for approximation problems. Noga Alon, Yossi Azar. Combinatorica (11): 97-122 (1991). Web SearchBibTeXDownload
65A parallel algorithmic version of the Local Lemma. Noga Alon. FOCS 1991, 586-593. Web SearchBibTeXDownload
64On the Exponent of the All Pairs Shortest Path Problem. Noga Alon, Zvi Galil, Oded Margalit. FOCS 1991, 569-575. Web SearchBibTeX
63Efficient Simulation of Finite Automata by Neural Nets. Noga Alon, A. K. Dewdney, Teunis J. Ott. J. ACM (38): 495-514 (1991). Cited by 83Web SearchBibTeXDownload
62Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems. Noga Alon, László Babai, H. Suzuki. J. Comb. Theory, Ser. A (58): 165-180 (1991). Web SearchBibTeXDownload
61Additive bases of vector spaces over prime fields. Noga Alon, Nathan Linial, Roy Meshulam. J. Comb. Theory, Ser. A (57): 203-210 (1991). Web SearchBibTeXDownload
60Multicolored forests in bipartite decompositions of graphs. Noga Alon, Richard A. Brualdi, Bryan L. Shader. J. Comb. Theory, Ser. B (53): 143-148 (1991). Web SearchBibTeXDownload
59A Lower Bound for Radio Broadcast. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg. J. Comput. Syst. Sci. (43): 290-298 (1991). Web SearchBibTeXDownload
58Acyclic Coloring of Graphs. Noga Alon, Colin McDiarmid, Bruce A. Reed. Random Struct. Algorithms (2): 277-288 (1991). Web SearchBibTeX
57A Parallel Algorithmic Version of the Local Lemma. Noga Alon. Random Struct. Algorithms (2): 367-378 (1991). Web SearchBibTeX
1990
56The maximum number of Hamiltonian paths in tournaments. Noga Alon. Combinatorica (10): 319-324 (1990). Web SearchBibTeXDownload
55Universal sequences for complete graphs. Noga Alon, Yossi Azar, Yiftach Ravid. Discrete Applied Mathematics (27): 25-28 (1990). Web SearchBibTeXDownload
54Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract). Noga Alon, Moni Naor. FOCS 1990, 46-54. Web SearchBibTeXDownload
53Simple Constructions of Almost k-Wise Independent Random Variables. Noga Alon, Oded Goldreich, Johan Hĺstad, René Peralta. FOCS 1990, 544-553. Web SearchBibTeXDownload
52Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. Noga Alon, Nimrod Megiddo. FOCS 1990, 574-582. Web SearchBibTeXDownload
51Generating Pseudo-Random Permutations and Maximum Flow Algorithms. Noga Alon. Inf. Process. Lett. (35): 201-204 (1990). Web SearchBibTeXDownload
50The Number of Spanning Trees in Regular Graphs. Noga Alon. Random Struct. Algorithms (1): 175-182 (1990). Web SearchBibTeX
49Linear Circuits over GF(2). Noga Alon, Mauricio Karchmer, Avi Wigderson. SIAM J. Comput. (19): 1064-1067 (1990). Web SearchBibTeXDownload
48A Separator Theorem for Graphs with an Excluded Minor and its Applications. Noga Alon, Paul D. Seymour, Robin Thomas. STOC 1990, 293-299. Web SearchBibTeXDownload
1989
47A nowhere-zero point in liner mappings. Noga Alon, Michael Tarsi. Combinatorica (9): 393-396 (1989). Web SearchBibTeXDownload
46The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. Noga Alon, Meir Katchalski, William R. Pulleyblank. Discrete & Computational Geometry (4): 245-251 (1989). Web SearchBibTeXDownload
45Disjoint Edges in Geometric Graphs. Noga Alon, Paul Erdös. Discrete & Computational Geometry (4): 287-290 (1989). Web SearchBibTeXDownload
44Cutting Disjoint Disks by Straight Lines. Noga Alon, Meir Katchalski, William R. Pulleyblank. Discrete & Computational Geometry (4): 239-243 (1989). Web SearchBibTeXDownload
43The star arboricity of graphs. I. Algor, Noga Alon. Discrete Mathematics (75): 11-22 (1989). Web SearchBibTeXDownload
42Graphs with a small number of distinct induced subgraphs. Noga Alon, Béla Bollobás. Discrete Mathematics (75): 23-30 (1989). Web SearchBibTeXDownload
41Ascending waves. Noga Alon, Joel H. Spencer. J. Comb. Theory, Ser. A (52): 275-287 (1989). Web SearchBibTeXDownload
40Combinatorial reconstruction problems. Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty. J. Comb. Theory, Ser. B (47): 153-161 (1989). Web SearchBibTeXDownload
39Cycles of length 0 modulo k in directed graphs. Noga Alon, Nathan Linial. J. Comb. Theory, Ser. B (47): 114-119 (1989). Web SearchBibTeXDownload
38Finding an Approximate Maximum. Noga Alon, Yossi Azar. SIAM J. Comput. (18): 258-267 (1989). Web SearchBibTeXDownload
37On the Complexity of Radio Communication (Extended Abstract). Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg. STOC 1989, 274-285. Web SearchBibTeXDownload
36On Neciporuk's Theorem for Branching Programs. Noga Alon, Uri Zwick. Theor. Comput. Sci. (64): 331-342 (1989). Web SearchBibTeXDownload
1988
35On sums of subsets of a set of integers. Noga Alon, Gregory Freiman. Combinatorica (8): 297-306 (1988). Web SearchBibTeXDownload
34Sums of subsequences modulo prime powers. Noga Alon. Discrete Mathematics (71): 87-88 (1988). Web SearchBibTeXDownload
33Explicit construction of linear sized tolerant networks. Noga Alon, Fan R. K. Chung. Discrete Mathematics (72): 15-19 (1988). Web SearchBibTeXDownload
32Parallel Comparison Algorithms for Approximation Problems. Noga Alon, Yossi Azar. FOCS 1988, 194-203. Web SearchBibTeXDownload
31Balancing sets of vectors. Noga Alon, E. E. Bergmann, Don Coppersmith, Andrew M. Odlyzko. IEEE Transactions on Information Theory (34): 128-130 (1988). Web SearchBibTeXDownload
30Meanders and Their Applications in Lower Bounds Arguments. Noga Alon, Wolfgang Maass. J. Comput. Syst. Sci. (37): 118-129 (1988). Web SearchBibTeXDownload
29The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. Noga Alon, Yossi Azar. SIAM J. Comput. (17): 1178-1192 (1988). Web SearchBibTeXDownload
28Sorting, Approximate Sorting, and Searching in Rounds. Noga Alon, Yossi Azar. SIAM J. Discrete Math. (1): 269-280 (1988). Web SearchBibTeXDownload
1987
27The smallets n-uniform hypergraph with positive discrepancy. Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour. Combinatorica (7): 151-160 (1987). Cited by 4Web SearchBibTeXDownload
26The monotone circuit complexity of Boolean functions. Noga Alon, Ravi B. Boppana. Combinatorica (7): 1-22 (1987). Web SearchBibTeXDownload
25The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms. Noga Alon, Yossi Azar. FOCS 1987, 489-498. Web SearchBibTeXDownload
24On Disseminating Information Reliably without Broadcasting. Noga Alon, Amnon Barak, Udi Manber. ICDCS 1987, 74-81. Web SearchBibTeX
23Better Expanders and Superconcentrators. Noga Alon, Zvi Galil, V. D. Milman. J. Algorithms (8): 337-347 (1987). Web SearchBibTeXDownload
22Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. Noga Alon, David Haussler, Emo Welzl. Symposium on Computational Geometry 1987, 331-340. Web SearchBibTeXDownload
1986
21Covering graphs by the minimum number of equivalence relations. Noga Alon. Combinatorica (6): 201-206 (1986). Web SearchBibTeXDownload
20Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory. Noga Alon. Combinatorica (6): 207-219 (1986). Web SearchBibTeXDownload
19Eigenvalues and expanders. Noga Alon. Combinatorica (6): 83-96 (1986). Web SearchBibTeXDownload
18Covering a Square by Small Perimeter Rectangles. Noga Alon, Daniel J. Kleitman. Discrete & Computational Geometry (1): 1-7 (1986). Cited by 8Web SearchBibTeXDownload
17Explicit construction of exponential sized families of k-independent sets. Noga Alon. Discrete Mathematics (58): 191-193 (1986). Web SearchBibTeXDownload
16On the intersection of edges of a geometric graph by straight lines. Noga Alon, Micha A. Perles. Discrete Mathematics (60): 75-90 (1986). Web SearchBibTeXDownload
15Meanders, Ramsey Theory and Lower Bounds for Branching Programs. Noga Alon, Wolfgang Maass. FOCS 1986, 410-417. Web SearchBibTeXDownload
14Tight Complexity Bounds for Parallel Comparison Sorting. Noga Alon, Yossi Azar, Uzi Vishkin. FOCS 1986, 502-510. Web SearchBibTeXDownload
13A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. Noga Alon, László Babai, Alon Itai. J. Algorithms (7): 567-583 (1986). Web SearchBibTeXDownload
12Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory. Noga Alon, Kenneth A. Berman. J. Comb. Theory, Ser. A (43): 91-97 (1986). Web SearchBibTeXDownload
11The number of small semispaces of a finite set of points in the plane. Noga Alon, Ervin Györi. J. Comb. Theory, Ser. A (41): 154-157 (1986). Web SearchBibTeXDownload
1985
10Geometrical Realization of Set Systems and Probabilistic Communication Complexity. Noga Alon, Peter Frankl, Vojtech Rödl. FOCS 1985, 277-280. Web SearchBibTeXDownload
9An Extremal Problem for Sets with Applications to Graph Theory. Noga Alon. J. Comb. Theory, Ser. A (40): 82-89 (1985). Web SearchBibTeXDownload
8Even edge colorings of a graph. Noga Alon, Yoshimi Egawa. J. Comb. Theory, Ser. B (38): 93-94 (1985). Web SearchBibTeXDownload
7lambda1, Isoperimetric inequalities for graphs, and superconcentrators. Noga Alon, V. D. Milman. J. Comb. Theory, Ser. B (38): 73-88 (1985). Web SearchBibTeXDownload
6Expanders, Sorting in Rounds and Superconcentrators of Limited Depth. Noga Alon. STOC 1985, 98-102. Web SearchBibTeXDownload
1984
5A note on subdigraphs of digraphs with large outdegrees. Noga Alon. Discrete Mathematics (49): 321-322 (1984). Web SearchBibTeXDownload
4Eigenvalues, Expanders and Superconcentrators (Extended Abstract). Noga Alon, V. D. Milman. FOCS 1984, 320-322. Web SearchBibTeXDownload
3Regular subgraphs of almost regular graphs. Noga Alon, S. Friedland, Gil Kalai. J. Comb. Theory, Ser. B (37): 79-91 (1984). Web SearchBibTeXDownload
2Every 4-regular graph plus an edge contains a 3-regular subgraph. Noga Alon, Shmuel Friedland, Gil Kalai. J. Comb. Theory, Ser. B (37): 92-93 (1984). Web SearchBibTeXDownload
1983
1On the density of sets of vectors. Noga Alon. Discrete Mathematics (46): 199-202 (1983). Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ Computer Science Colloquium - Retrieved 2011-04-23 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research