The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Noga Alon: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Noga Alon, Yossi Matias, Mario Szegedy
    The Space Complexity of Approximating the Frequency Moments. [Citation Graph (4, 0)][DBLP]
    STOC, 1996, pp:20-29 [Conf]
  2. Noga Alon, Raphael Yuster, Uri Zwick
    Color-Coding. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1995, v:42, n:4, pp:844-856 [Journal]
  3. Noga Alon, Vera Asodi
    Edge Coloring with Delays. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:237-248 [Conf]
  4. Noga Alon, Richard Beigel
    Lower Bounds for Approximations by Low Degree Polynomials Over Zm. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:184-187 [Conf]
  5. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
    Can Visibility Graphs be Represented Compactly? [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:338-347 [Conf]
  6. Noga Alon, Yossi Azar
    On-Line Steiner Trees in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:337-343 [Conf]
  7. Noga Alon, David Haussler, Emo Welzl
    Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:331-340 [Conf]
  8. Noga Alon, Daniel J. Kleitman
    Piercing Convex Sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:157-160 [Conf]
  9. Noga Alon, Sridhar Rajagopalan, Subhash Suri
    Long Non-Crossing Configurations in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:257-263 [Conf]
  10. Noga Alon, Shakhar Smorodinsky
    Conflict-free colorings of shallow discs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:41-43 [Conf]
  11. Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
    On-line and Off-line Approximation Algorithms for Vector Covering Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:406-418 [Conf]
  12. Noga Alon, Zvi Galil, Moti Yung
    Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:523-537 [Conf]
  13. Noga Alon, Raphael Yuster, Uri Zwick
    Finding and Counting Given Length Cycles (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:354-364 [Conf]
  14. Noga Alon, Benny Sudakov
    Disjoint Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:159-163 [Conf]
  15. Noga Alon, Nimrod Megiddo
    Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:574-582 [Conf]
  16. Noga Alon, Moni Naor
    Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:46-54 [Conf]
  17. Noga Alon, Asaf Shapira
    A Characterization of the (natural) Graph Properties Testable with One-Sided Error. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:429-438 [Conf]
  18. Noga Alon, Asaf Shapira, Benny Sudakov
    Additive Approximation for Edge-Deletion Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:419-428 [Conf]
  19. Noga Alon
    Testing Subgraphs in Large Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:434-441 [Conf]
  20. Noga Alon
    A parallel algorithmic version of the Local Lemma [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:586-593 [Conf]
  21. Noga Alon, Yossi Azar
    The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:489-498 [Conf]
  22. Noga Alon, Yossi Azar
    Parallel Comparison Algorithms for Approximation Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:194-203 [Conf]
  23. Noga Alon, Yossi Azar, Uzi Vishkin
    Tight Complexity Bounds for Parallel Comparison Sorting [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:502-510 [Conf]
  24. Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler
    Scale-sensitive Dimensions, Uniform Convergence, and Learnability [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:292-301 [Conf]
  25. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
    Learning a Hidden Matching. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:197-0 [Conf]
  26. Noga Alon, Michael R. Capalbo
    Explicit Unique-Neighbor Expanders. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:73-0 [Conf]
  27. Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi
    Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:693-702 [Conf]
  28. Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Universality and Tolerance. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:14-21 [Conf]
  29. Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
    The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:473-481 [Conf]
  30. Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
    Testing of Clustering. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:240-250 [Conf]
  31. Noga Alon, Jeff Edmonds, Michael Luby
    Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:512-519 [Conf]
  32. Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
    Efficient Testing of Large Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:656-666 [Conf]
  33. Noga Alon, Peter Frankl, Vojtech Rödl
    Geometrical Realization of Set Systems and Probabilistic Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:277-280 [Conf]
  34. Noga Alon, Alan M. Frieze, Dominic Welsh
    Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:24-35 [Conf]
  35. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
    Simple Constructions of Almost k-Wise Independent Random Variables [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:544-553 [Conf]
  36. Noga Alon, Zvi Galil, Oded Margalit
    On the Exponent of the All Pairs Shortest Path Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:569-575 [Conf]
  37. Noga Alon, Zvi Galil, Oded Margalit, Moni Naor
    Witnesses for Boolean Matrix Multiplication and for Shortest Paths [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:417-426 [Conf]
  38. Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
    Regular Languages Are Testable with a Constant Number of Queries. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:645-655 [Conf]
  39. Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
    Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:334-343 [Conf]
  40. Noga Alon, Dmitry N. Kozlov, Van H. Vu
    The Geometry of Coin-Weighing Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:524-532 [Conf]
  41. Noga Alon, Alexander Lubotzky, Avi Wigderson
    Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:630-637 [Conf]
  42. Noga Alon, V. D. Milman
    Eigenvalues, Expanders and Superconcentrators (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:320-322 [Conf]
  43. Noga Alon, Wolfgang Maass
    Meanders, Ramsey Theory and Lower Bounds for Branching Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:410-417 [Conf]
  44. Noga Alon, Vera Asodi
    Learning a Hidden Subgraph. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:110-121 [Conf]
  45. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
    Scalable Secure Storage when Half the System Is Faulty. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:576-587 [Conf]
  46. Noga Alon, Aravind Srinivasan
    Improved Parallel Approximation of a Class of Integer Programming Programming Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:562-573 [Conf]
  47. Noga Alon, Asaf Shapira, Benny Sudakov
    Additive Approximation for Edge-Deletion Problems (Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:1-2 [Conf]
  48. Noga Alon, Amnon Barak, Udi Manber
    On Disseminating Information Reliably without Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1987, pp:74-81 [Conf]
  49. Noga Alon
    Spectral Techniques in Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:206-215 [Conf]
  50. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
    Typechecking XML Views of Relational Databases. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:421-430 [Conf]
  51. Nathan Srebro, Noga Alon, Tommi Jaakkola
    Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  52. Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup
    Estimating arbitrary subset sums with few probes. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:317-325 [Conf]
  53. Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario Szegedy
    Tracking Join and Self-Join Sizes in Limited Storage. [Citation Graph (0, 17)][DBLP]
    PODS, 1999, pp:10-20 [Conf]
  54. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
    XML with Data Values: Typechecking Revisited. [Citation Graph (0, 0)][DBLP]
    PODS, 2001, pp:- [Conf]
  55. Noga Alon, Uri Arad, Yossi Azar
    Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:16-27 [Conf]
  56. Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Near-optimum Universal Graphs for Graphs with Bounded Degrees. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:170-180 [Conf]
  57. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
    Testing Low-Degree Polynomials over GF(2(. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:188-199 [Conf]
  58. Richard Beigel, Noga Alon, Simon Kasif, Mehmet Serkan Apaydin, Lance Fortnow
    An optimal procedure for gap closing in whole genome shotgun sequencing. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2001, pp:22-30 [Conf]
  59. Noga Alon, Yossi Azar
    Comparison-Sorting and Selecting in Totally Monotone Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:403-408 [Conf]
  60. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
    A general approach to online network optimization problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:577-586 [Conf]
  61. Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid
    Approximation Schemes for Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:493-500 [Conf]
  62. Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos
    Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:650-659 [Conf]
  63. Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
    Matching Nuts and Bolts. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:690-696 [Conf]
  64. Noga Alon, Michael R. Capalbo
    Smaller explicit superconcentrators. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:340-346 [Conf]
  65. Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan
    Guessing secrets efficiently via list decoding. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:254-262 [Conf]
  66. Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron
    Testing triangle-freeness in general graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:279-288 [Conf]
  67. Noga Alon, Michael Krivelevich, Benny Sudakov
    Finding a Large Hidden Clique in a Random Graph. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:594-598 [Conf]
  68. Noga Alon, Asaf Shapira
    Testing satisfiability. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:645-654 [Conf]
  69. Noga Alon, Asaf Shapira
    A characterization of easily testable induced subgraphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:942-951 [Conf]
  70. Noga Alon, Asaf Shapira
    Linear equations, arithmetic progressions and hypergraph property testing. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:708-717 [Conf]
  71. Noga Alon, Benny Sudakov, Uri Zwick
    Constructing worst case instances for semidefinite programming based approximation algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:92-100 [Conf]
  72. Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir
    Tell me who I am: an interactive recommendation system. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:1-10 [Conf]
  73. Noga Alon, Yossi Azar, Shai Gutner
    Admission control to minimize rejections and online set cover with repetitions. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:238-244 [Conf]
  74. Noga Alon
    Expanders, Sorting in Rounds and Superconcentrators of Limited Depth [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:98-102 [Conf]
  75. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
    The online set cover problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:100-105 [Conf]
  76. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
    On the Complexity of Radio Communication (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:274-285 [Conf]
  77. Noga Alon, Fan R. K. Chung, Ronald L. Graham
    Routing permutations on graphs via matchings. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:583-591 [Conf]
  78. Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
    Is Linear Hashing Good? [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:465-474 [Conf]
  79. Noga Alon, Nabil Kahale
    A spectral technique for coloring random 3-colorable graphs (preliminary version). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:346-355 [Conf]
  80. Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor
    Quadratic forms on graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:486-493 [Conf]
  81. Noga Alon, Assaf Naor
    Approximating the cut-norm via Grothendieck's inequality. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:72-80 [Conf]
  82. Noga Alon, Asaf Shapira
    Testing subgraphs in directed graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:700-709 [Conf]
  83. Noga Alon, Asaf Shapira
    Every monotone graph property is testable. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:128-137 [Conf]
  84. Noga Alon, Paul D. Seymour, Robin Thomas
    A Separator Theorem for Graphs with an Excluded Minor and its Applications [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:293-299 [Conf]
  85. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
    Random sampling and approximation of MAX-CSP problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:232-239 [Conf]
  86. Noga Alon, Raphael Yuster, Uri Zwick
    Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:326-335 [Conf]
  87. Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira
    A combinatorial characterization of the testable graph properties: it's all about regularity. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:251-260 [Conf]
  88. Noga Alon
    Derandomization Via Small Sample Spaces (Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:1-3 [Conf]
  89. Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
    On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:1, pp:104-118 [Journal]
  90. Noga Alon, Moni Naor
    Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:434-449 [Journal]
  91. Noga Alon, Aravind Srinivasan
    Improved Parallel Approximation of a Class of Integer Programming Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:449-462 [Journal]
  92. Noga Alon, Raphael Yuster, Uri Zwick
    Finding and Counting Given Length Cycles. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:3, pp:209-223 [Journal]
  93. Noga Alon, Ayal Zaks
    Algorithmic Aspects of Acyclic Edge Colorings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:4, pp:611-614 [Journal]
  94. Noga Alon, Eldar Fischer
    Refining the Graph Density Condition for the Existence of Almost K-factors. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:52, n:, pp:- [Journal]
  95. Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman
    Derandomized Graph Products. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:1, pp:60-75 [Journal]
  96. Noga Alon
    Eigenvalues and expanders. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:2, pp:83-96 [Journal]
  97. Noga Alon
    Covering graphs by the minimum number of equivalence relations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:3, pp:201-206 [Journal]
  98. Noga Alon
    Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:3, pp:207-219 [Journal]
  99. Noga Alon
    The maximum number of Hamiltonian paths in tournaments. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:4, pp:319-324 [Journal]
  100. Noga Alon
    Bipartite Subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:3, pp:301-311 [Journal]
  101. Noga Alon
    The Shannon Capacity of a Union. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:3, pp:301-310 [Journal]
  102. Noga Alon, Yossi Azar
    Parallel comparison algorithms for approximation problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:2, pp:97-122 [Journal]
  103. Noga Alon, Ravi B. Boppana
    The monotone circuit complexity of Boolean functions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:1-22 [Journal]
  104. Noga Alon, Moshe Dubiner
    A Lattice Point Problem and Additive Number Theory. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:301-309 [Journal]
  105. Noga Alon, Gregory Freiman
    On sums of subsets of a set of integers. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:4, pp:297-306 [Journal]
  106. Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
    Efficient Testing of Large Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:451-476 [Journal]
  107. Noga Alon, Michael Krivelevich
    The Concentration of the Chromatic Number of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:3, pp:303-313 [Journal]
  108. Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour
    The smallets n-uniform hypergraph with positive discrepancy. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:2, pp:151-160 [Journal]
  109. Noga Alon, Michael Krivelevich, Benny Sudakov
    List Coloring of Random and Pseudo-Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:4, pp:453-472 [Journal]
  110. Noga Alon, Colin McDiarmid, Bruce A. Reed
    Star arboricity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:4, pp:375-380 [Journal]
  111. Noga Alon, János Pach, József Solymosi
    Ramsey-type Theorems with Forbidden Subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:155-170 [Journal]
  112. Noga Alon, Vojtech Rödl
    Sharp Bounds For Some Multicolor Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:2, pp:125-141 [Journal]
  113. Noga Alon, Michael Tarsi
    A nowhere-zero point in liner mappings. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:393-396 [Journal]
  114. Noga Alon, Michael Tarsi
    Colorings and orientations of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:2, pp:125-134 [Journal]
  115. Noga Alon, Raphael Yuster
    The Number Of Orientations Having No Fixed Tournament. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:1, pp:1-16 [Journal]
  116. Noga Alon
    Explicit Ramsey graphs and orthonormal labelings. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1994, v:1, n:, pp:- [Journal]
  117. Noga Alon, Daniel J. Kleitman
    A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  118. Noga Alon, Miklós Ruszinkó
    Short Certificates for Tournaments. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  119. Noga Alon, Vojtech Rödl, Andrzej Rucinski
    Perfect Matchings in $\epsilon$-regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  120. Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
    Intersecting Systems. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:2, pp:127-137 [Journal]
  121. Noga Alon
    Choice Numbers of Graphs: a Probabilistic Approach. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:107-114 [Journal]
  122. Noga Alon
    On the Edge-Expansion of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:2, pp:145-152 [Journal]
  123. Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman
    Point Selections and Weak e-Nets for Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:189-200 [Journal]
  124. Noga Alon, Miklós Bóna, Joel Spencer
    Packing Ferrers Shapes. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:3, pp:- [Journal]
  125. Noga Alon, Emanuela Fachini, János Körner
    Locally Thin Set Families. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:6, pp:- [Journal]
  126. Noga Alon, János Körner, Angelo Monti
    String Quartets In Binary. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:5, pp:- [Journal]
  127. Noga Alon, Michael Krivelevich, Benny Sudakov
    Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:477-494 [Journal]
  128. Noga Alon, Bojan Mohar
    The Chromatic Number Of Graph Powers. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:1, pp:- [Journal]
  129. Noga Alon, Benny Sudakov
    Bipartite Subgraphs And The Smallest Eigenvalue. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:1, pp:- [Journal]
  130. Noga Alon, Uri Stav
    New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:37, n:6, pp:795-807 [Journal]
  131. Noga Alon, Raphael Yuster
    Threshold Functions for H-factors. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:137-144 [Journal]
  132. Noga Alon, Shmuel Onn
    Separable Partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:39-51 [Journal]
  133. Noga Alon, Joel Spencer, Prasad Tetali
    Covering with Latin Transversals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:57, n:1, pp:1-10 [Journal]
  134. Noga Alon, Ayal Zaks
    T-choosability in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:1-13 [Journal]
  135. Noga Alon
    Transmitting in the n-Dimensional Cube. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:9-11 [Journal]
  136. Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
    Tight bounds for shared memory systems accessed by Byzantine processes. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2005, v:18, n:2, pp:99-109 [Journal]
  137. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
    Can Visibility Graphs Be Represented Compactly?. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:347-365 [Journal]
  138. Noga Alon
    Piercing d -Intervals. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:333-334 [Journal]
  139. Noga Alon, Yossi Azar
    On-Line Steine Trees in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:113-121 [Journal]
  140. Noga Alon, Paul Erdös
    Disjoint Edges in Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:287-290 [Journal]
  141. Noga Alon, Daniel J. Kleitman
    Covering a Square by Small Perimeter Rectangles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:1-7 [Journal]
  142. Noga Alon, Gil Kalai
    Bounding the Piercing Number. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:245-256 [Journal]
  143. Noga Alon, Meir Katchalski, William R. Pulleyblank
    Cutting Disjoint Disks by Straight Lines. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:239-243 [Journal]
  144. Noga Alon, Meir Katchalski, William R. Pulleyblank
    The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:245-251 [Journal]
  145. Noga Alon, H. Last, Rom Pinchasi, Micha Sharir
    On the Complexity of Arrangements of Circles in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:4, pp:465-492 [Journal]
  146. Noga Alon
    Covering a hypergraph of subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:249-254 [Journal]
  147. Noga Alon
    Problems and results in extremal combinatorics--I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:31-53 [Journal]
  148. Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó
    Game domination number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:23-33 [Journal]
  149. Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman
    On partitions of discrete boxes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:255-258 [Journal]
  150. Noga Alon, Fan R. K. Chung
    Explicit construction of linear sized tolerant networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1068-1071 [Journal]
  151. Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
    Factor d-domatic colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:17-25 [Journal]
  152. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
    Random Sampling and Approximation of MAX-CSP Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:100, pp:- [Journal]
  153. Noga Alon, Oded Goldreich, Yishay Mansour
    Almost k-wise independence versus k-wise independence [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:048, pp:- [Journal]
  154. Asaf Shapira, Noga Alon
    Homomorphisms in Graph Property Testing - A Survey [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:085, pp:- [Journal]
  155. Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin
    Partitioning multi-dimensional sets in a small number of ``uniform'' parts [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:095, pp:- [Journal]
  156. Noga Alon, Alan M. Frieze, Dominic Welsh
    Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:5, pp:- [Journal]
  157. Noga Alon, Raphael Yuster, Uri Zwick
    Color-Coding [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:9, pp:- [Journal]
  158. Noga Alon
    On the Capacity of Digraphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:1, pp:1-5 [Journal]
  159. Noga Alon, Zoltán Füredi
    Covering the Cube by Affine Hyperplanes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:2, pp:79-83 [Journal]
  160. Noga Alon, Peter Hamburger, Alexandr V. Kostochka
    Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:6, pp:469-481 [Journal]
  161. Noga Alon, Raphael Yuster
    EveryH-decomposition ofKnhas a Nearly Resolvable Alternative. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:7, pp:839-845 [Journal]
  162. Noga Alon, Vera Asodi
    Tracing a single user. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:8, pp:1227-1234 [Journal]
  163. Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin
    Partitioning multi-dimensional sets in a small number of "uniform" parts. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:1, pp:134-144 [Journal]
  164. Noga Alon, Sridhar Rajagopalan, Subhash Suri
    Long Non-Crossing Configurations in the Plane. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:22, n:4, pp:385-394 [Journal]
  165. Noga Alon, Shlomo Hoory, Nathan Linial
    The Moore Bound for Irregular Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:1, pp:53-57 [Journal]
  166. Noga Alon, Simon Litsyn, Raphael Yuster
    A Coding Theory Bound and Zero-Sum Square Matrices. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:4, pp:449-457 [Journal]
  167. Noga Alon, Vanessa Teague, Nicholas C. Wormald
    Linear Arboricity and Linear k-Arboricity of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:1, pp:11-16 [Journal]
  168. Noga Alon, Raphael Yuster
    On a Hypergraph Matching Problem. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:377-384 [Journal]
  169. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
    Scalable Secure Storage When Half the System Is Faulty. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:174, n:2, pp:203-213 [Journal]
  170. Noga Alon
    A simple algorithm for edge-coloring bipartite multigraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:6, pp:301-302 [Journal]
  171. Noga Alon
    Generating Pseudo-Random Permutations and Maximum Flow Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:4, pp:201-204 [Journal]
  172. Noga Alon, Phillip G. Bradford, Rudolf Fleischer
    Matching Nuts and Bolts Faster. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:3, pp:123-127 [Journal]
  173. Noga Alon, Oded Goldreich, Yishay Mansour
    Almost k-wise independence versus k-wise independence. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:3, pp:107-110 [Journal]
  174. Noga Alon, Yishay Mansour
    epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:6, pp:337-342 [Journal]
  175. Noga Alon, Nimrod Megiddo
    Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:2, pp:422-434 [Journal]
  176. Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler
    Scale-sensitive dimensions, uniform convergence, and learnability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:4, pp:615-631 [Journal]
  177. Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
    Linear Hash Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:5, pp:667-683 [Journal]
  178. Noga Alon, A. K. Dewdney, Teunis J. Ott
    Efficient Simulation of Finite Automata by Neural Nets. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:2, pp:495-514 [Journal]
  179. Noga Alon, László Babai, Alon Itai
    A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:4, pp:567-583 [Journal]
  180. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
    Single Round Simulation on Radio Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:2, pp:188-210 [Journal]
  181. Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
    The Algorithmic Aspects of the Regularity Lemma. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:1, pp:80-109 [Journal]
  182. Noga Alon, Gregory Gutin, Michael Krivelevich
    Algorithms with large domination ratio. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:1, pp:118-131 [Journal]
  183. Noga Alon, Zvi Galil, V. D. Milman
    Better Expanders and Superconcentrators. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:3, pp:337-347 [Journal]
  184. Noga Alon, Dmitry N. Kozlov
    Coins with Arbitrary Weights. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:1, pp:162-176 [Journal]
  185. Noga Alon, Asaf Shapira
    Testing satisfiability. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:47, n:2, pp:87-103 [Journal]
  186. Noga Alon, Benny Sudakov
    On Two Segmentation Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:1, pp:173-184 [Journal]
  187. Noga Alon, Zvi Galil, Oded Margalit
    On the Exponent of the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:255-262 [Journal]
  188. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
    A Lower Bound for Radio Broadcast. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:2, pp:290-298 [Journal]
  189. Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario Szegedy
    Tracking Join and Self-Join Sizes in Limited Storage. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:3, pp:719-747 [Journal]
  190. Noga Alon, Wolfgang Maass
    Meanders and Their Applications in Lower Bounds Arguments. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:2, pp:118-129 [Journal]
  191. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
    XML with data values: typechecking revisited. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:4, pp:688-727 [Journal]
  192. Noga Alon, Yossi Matias, Mario Szegedy
    The Space Complexity of Approximating the Frequency Moments. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:137-147 [Journal]
  193. Noga Alon, Pavel Pudlák
    Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely). [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:1, pp:194-202 [Journal]
  194. Noga Alon, Asaf Shapira
    Testing subgraphs in directed graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:354-382 [Journal]
  195. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
    Random sampling and approximation of MAX-CSPs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:212-243 [Journal]
  196. Noga Alon
    An Extremal Problem for Sets with Applications to Graph Theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:1, pp:82-89 [Journal]
  197. Noga Alon
    Disjoint Directed Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:2, pp:167-178 [Journal]
  198. Noga Alon, Kenneth A. Berman
    Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:1, pp:91-97 [Journal]
  199. Noga Alon, Kenneth A. Berman, Daniel J. Kleitman
    On a Problem in Shuffling. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:91, n:1-2, pp:5-14 [Journal]
  200. Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov
    Maximum cuts and judicious partitions in graphs without short cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:329-346 [Journal]
  201. Noga Alon, László Babai, H. Suzuki
    Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:58, n:2, pp:165-180 [Journal]
  202. Noga Alon, Richard A. Brualdi, Bryan L. Shader
    Multicolored forests in bipartite decompositions of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:53, n:1, pp:143-148 [Journal]
  203. Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
    Generalized hashing and parent-identifying codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:104, n:1, pp:207-215 [Journal]
  204. Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty
    Combinatorial reconstruction problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:153-161 [Journal]
  205. Noga Alon, Yair Caro, Raphael Yuster
    Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:144-161 [Journal]
  206. Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan
    Partitioning into graphs with only small components. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:231-243 [Journal]
  207. Noga Alon, Yoshimi Egawa
    Even edge colorings of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:1, pp:93-94 [Journal]
  208. Noga Alon, Ehud Friedgut
    On the Number of Permutations Avoiding a Given Pattern. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:1, pp:133-140 [Journal]
  209. Noga Alon, S. Friedland, Gil Kalai
    Regular subgraphs of almost regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:1, pp:79-91 [Journal]
  210. Noga Alon, S. Friedland, Gil Kalai
    Every 4-regular graph plus an edge contains a 3-regular subgraph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:1, pp:92-93 [Journal]
  211. Noga Alon, Eldar Fischer, Mario Szegedy
    Parent-Identifying Codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:95, n:2, pp:349-359 [Journal]
  212. Noga Alon, Ervin Györi
    The number of small semispaces of a finite set of points in the plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:1, pp:154-157 [Journal]
  213. Noga Alon, Jeong Han Kim
    On the Degree, Size, and Chromatic Index of a Uniform Hypergraph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:77, n:1, pp:165-170 [Journal]
  214. Noga Alon, Michael Krivelevich, Benny Sudakov
    Coloring Graphs with Sparse Neighborhoods. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:73-82 [Journal]
  215. Noga Alon, László Lovász
    Unextendible Product Bases. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:95, n:1, pp:169-179 [Journal]
  216. Noga Alon, Nathan Linial
    Cycles of length 0 modulo k in directed graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:1, pp:114-119 [Journal]
  217. Noga Alon, Nathan Linial, Roy Meshulam
    Additive bases of vector spaces over prime fields. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:57, n:2, pp:203-210 [Journal]
  218. Noga Alon, V. D. Milman
    lambda1, Isoperimetric inequalities for graphs, and superconcentrators. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:1, pp:73-88 [Journal]
  219. Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir
    Crossing patterns of semi-algebraic sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:111, n:2, pp:310-326 [Journal]
  220. Noga Alon, Imre Z. Ruzsa
    Non-averaging Subsets and Non-vanishing Transversals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:86, n:1, pp:1-13 [Journal]
  221. Noga Alon, Lajos Rónyai, Tibor Szabó
    Norm-Graphs: Variations and Applications. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:76, n:2, pp:280-290 [Journal]
  222. Noga Alon, Joel H. Spencer
    Ascending waves. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:52, n:2, pp:275-287 [Journal]
  223. Noga Alon, Michael Tarsi
    A Note on Graph Colorings and Graph Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:70, n:1, pp:197-201 [Journal]
  224. Noga Alon, Van H. Vu
    Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:79, n:1, pp:133-160 [Journal]
  225. Noga Alon, Raphael Yuster
    The 123 Theorem and Its Extensions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:72, n:2, pp:322-331 [Journal]
  226. Noga Alon, Raphael Yuster
    H-Factors in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:269-282 [Journal]
  227. Noga Alon, Ayal Zaks
    Progressions in Sequences of Nearly Consecutive Integers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:84, n:1, pp:99-109 [Journal]
  228. Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler
    Dominating sets in k-majority tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:374-387 [Journal]
  229. Noga Alon, Nabil Kahale
    Approximating the independence number via the theta-function. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:80, n:, pp:253-264 [Journal]
  230. Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
    Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:4, pp:425-439 [Journal]
  231. Ilan Adler, Noga Alon, Sheldon M. Ross
    On the maximum number of Hamiltonian paths in tournaments. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:3, pp:291-296 [Journal]
  232. Noga Alon
    The String Chromatic Number of a Graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:1, pp:1-8 [Journal]
  233. Noga Alon
    Degrees and choice numbers. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:4, pp:364-368 [Journal]
  234. Noga Alon
    Testing subgraphs in large graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:3-4, pp:359-370 [Journal]
  235. Noga Alon
    The Number of Spanning Trees in Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:2, pp:175-182 [Journal]
  236. Noga Alon
    A Parallel Algorithmic Version of the Local Lemma. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:4, pp:367-378 [Journal]
  237. Noga Alon
    Independence numbers of locally sparse graphs and a Ramsey type problem. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:3, pp:271-278 [Journal]
  238. Noga Alon, Eitan Bachmat
    Regular graphs whose subgraphs tend to be acyclic. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:3, pp:324-337 [Journal]
  239. Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen
    On the discrepancy of combinatorial rectangles. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:3-4, pp:205-215 [Journal]
  240. Noga Alon, Alan M. Frieze, Dominic Welsh
    Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:4, pp:459-478 [Journal]
  241. Noga Alon, Gregory Gutin
    Properly colored Hamilton cycles in edge-colored complete graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:2, pp:179-186 [Journal]
  242. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
    Simple Construction of Almost k-wise Independent Random Variables. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:3, pp:289-304 [Journal]
  243. Noga Alon, Oded Goldreich, Johan Håstad, Rene Paralta
    Addendum to "Simple Construction of Almost k-wise Independent Random Variables". [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:1, pp:119-120 [Journal]
  244. Noga Alon, Jaroslaw Grytczuk, Mariusz Haluszczak, Oliver Riordan
    Nonrepetitive colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:3-4, pp:336-346 [Journal]
  245. Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin
    Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:4, pp:409-433 [Journal]
  246. Noga Alon, Michael Krivelevich, Benny Sudakov
    Finding a large hidden clique in a random graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:457-466 [Journal]
  247. Noga Alon, Colin McDiarmid, Bruce A. Reed
    Acyclic Coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:3, pp:277-288 [Journal]
  248. Noga Alon, Yuval Roichman
    Random Cayley Graphs and Expanders. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:2, pp:271-285 [Journal]
  249. Noga Alon, Benny Sudakov
    Disjoint Systems. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:1, pp:13-20 [Journal]
  250. Noga Alon, Zsolt Tuza
    The Acyclic Orientation Game on Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:261-268 [Journal]
  251. Noga Alon, Richard M. Karp, David Peleg, Douglas B. West
    A Graph-Theoretic Game and Its Application to the k-Server Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:1, pp:78-100 [Journal]
  252. Noga Alon, Mauricio Karchmer, Avi Wigderson
    Linear Circuits over GF(2). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:6, pp:1064-1067 [Journal]
  253. Noga Alon, Assaf Naor
    Approximating the Cut-Norm via Grothendieck's Inequality. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:4, pp:787-803 [Journal]
  254. Noga Alon, Moni Naor
    Coin-Flipping Games Immune Against Linear-Sized Coalitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:403-417 [Journal]
  255. Noga Alon, Yossi Azar
    Finding an Approximate Maximum. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:258-267 [Journal]
  256. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
    Learning a Hidden Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:487-501 [Journal]
  257. Noga Alon, Nabil Kahale
    A Spectral Technique for Coloring Random 3-Colorable Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1733-1748 [Journal]
  258. Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
    Regular Languages are Testable with a Constant Number of Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1842-1862 [Journal]
  259. Noga Alon, Yossi Azar
    The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1178-1192 [Journal]
  260. Noga Alon
    Ranking Tournaments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:137-142 [Journal]
  261. Noga Alon, Vera Asodi
    Learning a Hidden Subgraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:18, n:4, pp:697-712 [Journal]
  262. Noga Alon, Yossi Azar
    Sorting, Approximate Sorting, and Searching in Rounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:269-280 [Journal]
  263. Noga Alon, Jehoshua Bruck
    Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:1-8 [Journal]
  264. Noga Alon, Fan R. K. Chung, Ronald L. Graham
    Routing Permutations on Graphs Via Matchings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:513-530 [Journal]
  265. Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa
    Equireplicate Balanced Binary Codes for Oligo Arrays. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:4, pp:481-497 [Journal]
  266. Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
    Testing of Clustering. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:3, pp:393-417 [Journal]
  267. Noga Alon, Michael Krivelevich
    Testing k-colorability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:211-227 [Journal]
  268. Noga Alon, Paul D. Seymour, Robin Thomas
    Planar Separators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:2, pp:184-193 [Journal]
  269. Noga Alon, Benny Sudakov, Uri Zwick
    Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:15, n:1, pp:58-72 [Journal]
  270. Noga Alon, Dana Moshkovitz, Shmuel Safra
    Algorithmic construction of sets for k-restrictions. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:2, pp:153-177 [Journal]
  271. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
    A general approach to online network optimization problems. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:640-660 [Journal]
  272. Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
    Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:175-201 [Journal]
  273. Noga Alon, Uri Zwick
    On Neciporuk's Theorem for Branching Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:3, pp:331-342 [Journal]
  274. Noga Alon, Andrzej Lingas, Martin Wahlen
    Approximating the maximum clique minor and some subgraph homeomorphism problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:149-158 [Journal]
  275. Noga Alon, E. E. Bergmann, Don Coppersmith, Andrew M. Odlyzko
    Balancing sets of vectors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:1, pp:128-0 [Journal]
  276. Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth
    Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:509-0 [Journal]
  277. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
    Testing Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4032-4039 [Journal]
  278. Noga Alon, Eyal Lubetzky
    The Shannon capacity of a graph and the independence numbers of its powers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:5, pp:2172-2176 [Journal]
  279. Noga Alon, Michael Luby
    A linear time erasure-resilient code with nearly optimal recovery. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1732-1736 [Journal]
  280. Noga Alon, Alon Orlitsky
    A lower bound on the expected length of one-to-one codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:5, pp:1670-0 [Journal]
  281. Noga Alon, Alon Orlitsky
    Repeated communication and Ramsey graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:5, pp:1276-1289 [Journal]
  282. Noga Alon, Alon Orlitsky
    Source coding and graph entropies. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1329-1339 [Journal]
  283. Noga Alon, Vera Asodi
    Tracing Many Users With Almost No Rate Penalty. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:1, pp:437-439 [Journal]
  284. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
    Typechecking XML views of relational databases. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2003, v:4, n:3, pp:315-354 [Journal]
  285. Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák
    A Ramsey-type result for the hypercube. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:3, pp:196-208 [Journal]
  286. Noga Alon, Eyal Lubetzky
    Independent sets in tensor graph powers. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:1, pp:73-87 [Journal]
  287. Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster
    Dense graphs are antimagic. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:4, pp:297-309 [Journal]
  288. Noga Alon, Shai Gutner
    Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:394-405 [Conf]
  289. Noga Alon, Asaf Shapira, Uri Stav
    Can a Graph Have Distinct Regular Partitions? [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:428-438 [Conf]
  290. Noga Alon, Raphael Yuster
    Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:175-186 [Conf]
  291. Noga Alon, Shai Gutner
    Balanced Families of Perfect Hash Functions and Their Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:435-446 [Conf]
  292. Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
    Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:789-800 [Conf]
  293. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:352-362 [Conf]
  294. Noga Alon, Oded Schwartz, Asaf Shapira
    An elementary construction of constant-degree expanders. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:454-458 [Conf]
  295. Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie
    Testing k-wise and almost k-wise independence. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:496-505 [Conf]
  296. Amit Agarwal, Noga Alon, Moses Charikar
    Improved approximation for directed cut problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:671-680 [Conf]
  297. Noga Alon, Asaf Shapira
    On An Extremal Hypergraph Problem Of Brown, Erdös And Sós. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:6, pp:627-645 [Journal]
  298. Noga Alon, Eyal Lubetzky
    Codes And Xor Graph Products. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:1, pp:13-33 [Journal]
  299. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  300. Noga Alon, Eyal Lubetzky
    The Shannon capacity of a graph and the independence numbers of its powers [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  301. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Better Algorithms and Bounds for Directed Maximum Leaf Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  302. Noga Alon
    Explicit construction of exponential sized families of k-independent sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:2, pp:191-193 [Journal]
  303. Noga Alon, Micha A. Perles
    On the intersection of edges of a geometric graph by straight lines. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:75-90 [Journal]
  304. Noga Alon
    On the density of sets of vectors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:2, pp:199-202 [Journal]
  305. Noga Alon
    A note on subdigraphs of digraphs with large outdegrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:3, pp:321-322 [Journal]
  306. Noga Alon
    Sums of subsequences modulo prime powers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:71, n:1, pp:87-88 [Journal]
  307. Noga Alon, Fan R. K. Chung
    Explicit construction of linear sized tolerant networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:15-19 [Journal]
  308. Noga Alon, Béla Bollobás
    Graphs with a small number of distinct induced subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:23-30 [Journal]
  309. I. Algor, Noga Alon
    The star arboricity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:11-22 [Journal]
  310. Noga Alon, Eran Halperin
    Bipartite subgraphs of integer weighted graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:181, n:1-3, pp:19-29 [Journal]
  311. Noga Alon
    Packings with large minimum kissing numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:175, n:1-3, pp:249-251 [Journal]
  312. Noga Alon, Zsolt Tuza, Margit Voigt
    Choosability and fractional chromatic numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:31-38 [Journal]
  313. Noga Alon, Daniel J. Kleitman
    Partitioning a rectangle into small perimeter rectangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:2, pp:111-119 [Journal]
  314. Noga Alon, Yair Caro, Ilia Krasikov
    Bisection of trees and sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:3-7 [Journal]
  315. Noga Alon, Eldar Fischer
    2-factors in dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:13-23 [Journal]
  316. Noga Alon
    Probabilistic methods in coloring and decomposition problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:31-46 [Journal]
  317. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
    Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:7, pp:1114-1116 [Journal]
  318. Nir Ailon, Noga Alon
    Hardness of fully dense problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:8, pp:1117-1129 [Journal]
  319. Noga Alon, Eldar Fischer, Ilan Newman
    Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:959-976 [Journal]

  320. Small Sample Spaces Cannot Fool Low Degree Polynomials. [Citation Graph (, )][DBLP]


  321. Deterministic Approximation Algorithms for the Nearest Codeword Problem. [Citation Graph (, )][DBLP]


  322. Testing Boolean Function Isomorphism. [Citation Graph (, )][DBLP]


  323. Polychromatic colorings of plane graphs. [Citation Graph (, )][DBLP]


  324. The complexity of the outer face in arrangements of random segments. [Citation Graph (, )][DBLP]


  325. Finding Disjoint Paths in Expanders Deterministically and Online. [Citation Graph (, )][DBLP]


  326. Broadcasting with Side Information. [Citation Graph (, )][DBLP]


  327. k-Wise Independent Random Graphs. [Citation Graph (, )][DBLP]


  328. Choice-Memory Tradeoff in Allocations. [Citation Graph (, )][DBLP]


  329. Better Algorithms and Bounds for Directed Maximum Leaf Problems. [Citation Graph (, )][DBLP]


  330. Optimal Monotone Encodings. [Citation Graph (, )][DBLP]


  331. Fast FAST. [Citation Graph (, )][DBLP]


  332. Biomolecular network motif counting and discovery by color coding. [Citation Graph (, )][DBLP]


  333. Balanced Hashing, Color Coding and Approximate Counting. [Citation Graph (, )][DBLP]


  334. Bayesian ignorance. [Citation Graph (, )][DBLP]


  335. Optimal universal graphs with deterministic embedding. [Citation Graph (, )][DBLP]


  336. Weak ε-nets and interval chains. [Citation Graph (, )][DBLP]


  337. On the power of two, three and four probes. [Citation Graph (, )][DBLP]


  338. Solving MAX-r-SAT Above a Tight Lower Bound. [Citation Graph (, )][DBLP]


  339. Many random walks are faster than one. [Citation Graph (, )][DBLP]


  340. Basic network creation games. [Citation Graph (, )][DBLP]


  341. Brief Announcement: Sharing Memory in a Self-stabilizing Manner. [Citation Graph (, )][DBLP]


  342. Adversarial Leakage in Games. [Citation Graph (, )][DBLP]


  343. Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. [Citation Graph (, )][DBLP]


  344. A separation theorem in property testing. [Citation Graph (, )][DBLP]


  345. Privileged users in zero-error transmission over a noisy channel. [Citation Graph (, )][DBLP]


  346. Embedding nearly-spanning bounded degree trees. [Citation Graph (, )][DBLP]


  347. Discrepancy Games. [Citation Graph (, )][DBLP]


  348. H-Free Graphs of Large Minimum Degree. [Citation Graph (, )][DBLP]


  349. Spanning directed trees with many leaves [Citation Graph (, )][DBLP]


  350. Admission Control to Minimize Rejections and Online Set Cover with Repetitions [Citation Graph (, )][DBLP]


  351. Balanced Families of Perfect Hash Functions and Their Applications [Citation Graph (, )][DBLP]


  352. Broadcasting with side information [Citation Graph (, )][DBLP]


  353. Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs [Citation Graph (, )][DBLP]


  354. A note on regular Ramsey graphs [Citation Graph (, )][DBLP]


  355. Strategyproof Approximation Mechanisms for Location on Networks [Citation Graph (, )][DBLP]


  356. Sum of Us: Strategyproof Selection from the Selectors [Citation Graph (, )][DBLP]


  357. Practically Stabilizing Atomic Memory [Citation Graph (, )][DBLP]


  358. Feasible Schedules for Rotating Transmissions. [Citation Graph (, )][DBLP]


  359. Splitting digraphs. [Citation Graph (, )][DBLP]


  360. A Characterization of Easily Testable Induced Subgraphs. [Citation Graph (, )][DBLP]


  361. Measures of Pseudorandomness for Finite Sequences: Minimal Values. [Citation Graph (, )][DBLP]


  362. Edge Colouring with Delays. [Citation Graph (, )][DBLP]


  363. An Elementary Construction of Constant-Degree Expanders. [Citation Graph (, )][DBLP]


  364. Perturbed Identity Matrices Have High Rank: Proof and Applications. [Citation Graph (, )][DBLP]


  365. Introduction. [Citation Graph (, )][DBLP]


  366. Sizes of Induced Subgraphs of Ramsey Graphs. [Citation Graph (, )][DBLP]


  367. Economical Elimination of Cycles in the Torus. [Citation Graph (, )][DBLP]


  368. Universal sequences for complete graphs. [Citation Graph (, )][DBLP]


  369. Polychromatic Colorings of Plane Graphs. [Citation Graph (, )][DBLP]


  370. Breaking the rhythm on graphs. [Citation Graph (, )][DBLP]


  371. Problems and results in extremal combinatorics - II. [Citation Graph (, )][DBLP]


  372. An isoperimetric inequality in the universal cover of the punctured plane. [Citation Graph (, )][DBLP]


  373. Deterministic Approximation Algorithms for the Nearest Codeword Problem. [Citation Graph (, )][DBLP]


  374. Kernels for the Dominating Set Problem on Graphs with an Excluded Minor. [Citation Graph (, )][DBLP]


  375. An Elementary Construction of Constant-Degree Expanders. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.036secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002