| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Noga Alon 117 Noga Alon, Ayal Zaks : Algorithmic Aspects of Acyclic Edge Colorings. Algorithmica 32 (4): 611-614 (2002) 116 Noga Alon, Haim Kaplan , Michael Krivelevich , Dahlia Malkhi , Julien P. Stern : Scalable Secure Storage When Half the System Is Faulty. Information and Computation 174 (2): 203-213 (2002) 115 Noga Alon, Phillip B. Gibbons , Yossi Matias , Mario Szegedy : Tracking Join and Self-Join Sizes in Limited Storage. JCSS 64 (3): 719-747 (2002) 114 Noga Alon: Testing Subgraphs in Large Graphs. FOCS 2001 : 434-441 113 Noga Alon, Alexander Lubotzky , Avi Wigderson : Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications. FOCS 2001 : 630-637 112 Noga Alon, Richard Beigel : Lower Bounds for Approximations by Low Degree Polynomials Over Z m . IEEE Conference on Computational Complexity 2001 : 184-187 111 Noga Alon, Tova Milo , Frank Neven , Dan Suciu , Victor Vianu : Typechecking XML Views of Relational Databases. LICS 2001 : 421-430 110 Noga Alon, Tova Milo , Frank Neven , Dan Suciu , Victor Vianu : XML with Data Values: Typechecking Revisited. PODS 2001 109 Noga Alon, Michael Capalbo , Yoshiharu Kohayakawa , Vojtech Rödl , Andrzej Rucinski , Endre Szemerédi : Near-optimum Universal Graphs for Graphs with Bounded Degrees. RANDOM-APPROX 2001 : 170-180 108 Richard Beigel , Noga Alon, Simon Kasif , Mehmet Serkan Apaydin , Lance Fortnow : An optimal procedure for gap closing in whole genome shotgun sequencing. RECOMB 2001 : 22-30 107 Noga Alon, Benny Sudakov , Uri Zwick : Constructing worst case instances for semidefinite programming based approximation algorithms. SODA 2001 : 92-100 106 Noga Alon, H. Last , Rom Pinchasi , Micha Sharir : On the Complexity of Arrangements of Circles in the Plane. Discrete & Computational Geometry 26 (4): 465-492 (2001) 105 Noga Alon, Wenceslas Fernandez de la Vega , Ravi Kannan , Marek Karpinski : Random Sampling and Approximation of MAX-CSP Problems. Electronic Colloquium on Computational Complexity (ECCC) (100): (2001) 104 Ilan Adler , Noga Alon, Sheldon M. Ross : On the maximum number of Hamiltonian paths in tournaments. Random Structures and Algorithms 18 (3): 291-296 (2001) 103 Noga Alon, Michael Capalbo , Yoshiharu Kohayakawa , Vojtech Rödl , Andrzej Rucinski , Endre Szemerédi : Universality and Tolerance. FOCS 2000 : 14-21 102 Noga Alon, Seannie Dar , Michal Parnas , Dana Ron : Testing of Clustering. FOCS 2000 : 240-250 101 Noga Alon, Haim Kaplan , Michael Krivelevich , Dahlia Malkhi , Julien P. Stern : Scalable Secure Storage when Half the System Is Faulty. ICALP 2000 : 576-587 100 Noga Alon, Eldar Fischer , Michael Krivelevich , Mario Szegedy : Efficient Testing of Large Graphs. Combinatorica 20 (4): 451-476 (2000) 99 Noga Alon: Degrees and choice numbers. Random Structures and Algorithms 16 (4): 364-368 (2000) 98 Noga Alon, Michael Krivelevich , Ilan Newman , Mario Szegedy : Regular Languages are Testable with a Constant Number of Queries. SIAM J. Comput. 30 (6): 1842-1862 (2000) 97 Noga Alon, Michael Krivelevich , Ilan Newman , Mario Szegedy : Regular Languages Are Testable with a Constant Number of Queries. FOCS 1999 : 645-655 96 Noga Alon, Eldar Fischer , Michael Krivelevich , Mario Szegedy : Efficient Testing of Large Graphs. FOCS 1999 : 656-666 95 Noga Alon, Phillip B. Gibbons , Yossi Matias , Mario Szegedy : Tracking Join and Self-Join Sizes in Limited Storage. PODS 1999 : 10-20 94 Noga Alon, Uri Arad , Yossi Azar : Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. RANDOM-APPROX 1999 : 16-27 93 Noga Alon, Michael Krivelevich , Benny Sudakov : List Coloring of Random and Pseudo-Random Graphs. Combinatorica 19 (4): 453-472 (1999) 92 Noga Alon, Benny Sudakov : On Two Segmentation Problems. J. Algorithms 33 (1): 173-184 (1999) 91 Noga Alon, Martin Dietzfelbinger , Peter Bro Miltersen , Erez Petrank , Gábor Tardos : Linear Hash Functions. JACM 46 (5): 667-683 (1999) 90 Noga Alon, Yossi Matias , Mario Szegedy : The Space Complexity of Approximating the Frequency Moments. JCSS 58 (1): 137-147 (1999) 89 Noga Alon: Spectral Techniques in Graph Algorithms. LATIN 1998 : 206-215 88 Noga Alon, Michael Krivelevich , Benny Sudakov : Finding a Large Hidden Clique in a Random Graph. SODA 1998 : 594-598 87 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. Algorithmica 21 (1): 104-118 (1998) 86 Noga Alon: The Shannon Capacity of a Union. Combinatorica 18 (3): 301-310 (1998) 85 Noga Alon, Michael Krivelevich , Benny Sudakov : Finding a large hidden clique in a random graph. Random Structures and Algorithms 13 (3-4): 457-466 (1998) 84 Noga Alon, Yossi Azar , Gerhard J. Woeginger , Tal Yadid : Approximation Schemes for Scheduling. SODA 1997 : 493-500 83 Noga Alon, Martin Dietzfelbinger , Peter Bro Miltersen , Erez Petrank , Gábor Tardos : Is Linear Hashing Good? STOC 1997 : 465-474 82 Noga Alon, Raphy Yuster , Uri Zwick : Finding and Counting Given Length Cycles. Algorithmica 17 (3): 209-223 (1997) 81 Noga Alon, Aravind Srinivasan : Improved Parallel Approximation of a Class of Integer Programming Problems. Algorithmica 17 (4): 449-462 (1997) 80 Noga Alon, Michael Krivelevich : The Concentration of the Chromatic Number of Random Graphs. Combinatorica 17 (3): 303-313 (1997) 79 Noga Alon, Dmitry N. Kozlov : Coins with Arbitrary Weights. J. Algorithms 25 (1): 162-176 (1997) 78 Noga Alon, Shai Ben-David , Nicolò Cesa-Bianchi , David Haussler : Scale-sensitive dimensions, uniform convergence, and learnability. JACM 44 (4): 615-631 (1997) 77 Noga Alon, Zvi Galil , Oded Margalit : On the Exponent of the All Pairs Shortest Path Problem. JCSS 54 (2): 255-262 (1997) 76 Noga Alon, Gregory Gutin : Properly colored Hamilton cycles in edge-colored complete graphs. Random Structures and Algorithms 11 (2): 179-186 (1997) 75 Noga Alon, Nabil Kahale : A Spectral Technique for Coloring Random 3-Colorable Graphs. SIAM J. Comput. 26 (6): 1733-1748 (1997) 74 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. ESA 1996 : 406-418 73 Noga Alon, Dmitry N. Kozlov , Van H. Vu : The Geometry of Coin-Weighing Problems. FOCS 1996 : 524-532 72 Noga Alon, Aravind Srinivasan : Improved Parallel Approximation of a Class of Integer Programming Programming Problems. ICALP 1996 : 562-573 71 Noga Alon, Yossi Matias , Mario Szegedy : The Space Complexity of Approximating the Frequency Moments. STOC 1996 : 20-29 70 Noga Alon: Derandomization Via Small Sample Spaces (Abstract). SWAT 1996 : 1-3 69 Noga Alon, Moni Naor : Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions. Algorithmica 16 (4/5): 434-449 (1996) 68 Noga Alon: Bipartite Subgraphs. Combinatorica 16 (3): 301-311 (1996) 67 Noga Alon, Phillip G. Bradford , Rudolf Fleischer : Matching Nuts and Bolts Faster. Information Processing Letters 59 (3): 123-127 (1996) 66 Noga Alon: Independence numbers of locally sparse graphs and a Ramsey type problem. Random Structures and Algorithms 9 (3): 271-278 (1996) 65 Noga Alon, Zvi Galil , Moti Yung : Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. ESA 1995 : 523-537 64 Noga Alon, Jeff Edmonds , Michael Luby : Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). FOCS 1995 : 512-519 63 Noga Alon, Moshe Dubiner : A Lattice Point Problem and Additive Number Theory. Combinatorica 15 (3): 301-309 (1995) 62 Noga Alon, Uriel Feige , Avi Wigderson , David Zuckerman : Derandomized Graph Products. Computational Complexity 5 (1): 60-75 (1995) 61 Noga Alon, Sridhar Rajagopalan , Subhash Suri : Long Non-Crossing Configurations in the Plane. Fundamenta Informaticae 22 (4): 385-394 (1995) 60 Noga Alon, Yishay Mansour : varepsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials. Information Processing Letters 54 (6): 337-342 (1995) 59 Noga Alon, Raphy Yuster , Uri Zwick : Color-Coding. JACM 42 (4): 844-856 (1995) 58 Noga Alon, Richard M. Karp , David Peleg , Douglas West : A Graph-Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput. 24 (1): 78-100 (1995) 57 Noga Alon, Raphy Yuster , Uri Zwick : Finding and Counting Given Length Cycles (Extended Abstract). ESA 1994 : 354-364 56 Noga Alon, Alan M. Frieze , Dominic Welsh : Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs. FOCS 1994 : 24-35 55 Noga Alon, Manuel Blum , Amos Fiat , Sampath Kannan , Moni Naor , Rafail Ostrovsky : Matching Nuts and Bolts. SODA 1994 : 690-696 54 Noga Alon, Raphy Yuster , Uri Zwick : Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (Extended Abstract). STOC 1994 : 326-335 53 Noga Alon, Nabil Kahale : A spectral technique for coloring random 3-colorable graphs (Preliminary Version). STOC 1994 : 346-355 52 Noga Alon, Alan M. Frieze , Dominic Welsh : Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Electronic Colloquium on Computational Complexity (ECCC) 1 (5): (1994) 51 Noga Alon, Raphy Yuster , Uri Zwick : Color-Coding. Electronic Colloquium on Computational Complexity (ECCC) 1 (9): (1994) 50 Noga Alon, Richard A. Duke , Hanno Lefmann , Vojtech Rödl , Raphy Yuster : The Algorithmic Aspects of the Regularity Lemma. J. Algorithms 16 (1): 80-109 (1994) 49 Noga Alon, Nimrod Megiddo : Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. JACM 41 (2): 422-434 (1994) 48 Noga Alon, Pavel Pudlák : Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely). JCSS 48 (1): 194-202 (1994) 47 Noga Alon, Jehoshua Bruck : Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition. SIAM Journal on Discrete Mathematics 7 (1): 1-8 (1994) 46 Noga Alon, Paul Seymour , Robin Thomas : Planar Separators. SIAM Journal on Discrete Mathematics 7 (2): 184-193 (1994) 45 Noga Alon, Fan R. K. Chung , R. L. Graham : Routing Permutations on Graphs Via Matchings. SIAM Journal on Discrete Mathematics 7 (3): 513-530 (1994) 44 Noga Alon, Gil Kalai , Moty Ricklin , Larry J. Stockmeyer : Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. TCS 130 (1): 175-201 (1994) 43 Noga Alon, Benny Sudakov : Disjoint Systems (Extended Abstract). Algebraic Coding 1993 : 159-163 42 Noga Alon, Shai Ben-David , Nicolò Cesa-Bianchi , David Haussler : Scale-sensitive Dimensions, Uniform Convergence, and Learnability. FOCS 1993 : 292-301 41 Noga Alon, Fan R. K. Chung , R. L. Graham : Routing Permutations on Graphs via Matchings (Extended Abstract). STOC 1993 : 583-591 40 Noga Alon, Sridhar Rajagopalan , Subhash Suri : Long Non-Crossing Configurations in the Plane. Symposium on Computational Geometry 1993 : 257-263 39 Pankaj K. Agarwal , Noga Alon, Boris Aronov , Subhash Suri : Can Visibility Graphs be Represented Compactly? Symposium on Computational Geometry 1993 : 338-347 38 Noga Alon, Moni Naor : Coin-Flipping Games Immune Against Linear-Sized Coalitions. SIAM J. Comput. 22 (2): 403-417 (1993) 37 Noga Alon, Joel Spencer : The Probabilistic Method. John Wiley 1992 36 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). FOCS 1992 : 334-343 35 Noga Alon, Zvi Galil , Oded Margalit , Moni Naor : Witnesses for Boolean Matrix Multiplication and for Shortest Paths. FOCS 1992 : 417-426 34 Noga Alon, Richard A. Duke , Hanno Lefmann , Vojtech Rödl , Raphy Yuster : The Algorithmic Aspects of the Regularity Lemma (Extended Abstract). FOCS 1992 : 473-481 33 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. FOCS 1992 : 693-702 32 Noga Alon, Yossi Azar : Comparison-Sorting and Selecting in Totally Monotone Matrices. SODA 1992 : 403-408 31 Noga Alon, Daniel J. Kleitman : Piercing Convex Sets. Symposium on Computational Geometry 1992 : 157-160 30 Noga Alon, Yossi Azar : On-Line Steiner Trees in the Euclidean Plane. Symposium on Computational Geometry 1992 : 337-343 29 Noga Alon: Transmitting in the n -Dimensional Cube. Discrete Applied Mathematics 37/38 : 9-11 (1992) 28 Noga Alon, Amotz Bar-Noy , Nathan Linial , David Peleg : Single Round Simulation on Radio Networks. J. Algorithms 13 (2): 188-210 (1992) 27 Noga Alon, Zvi Galil , Oded Margalit : On the Exponent of the All Pairs Shortest Path Problem. FOCS 1991 : 569-575 26 Noga Alon: A parallel algorithmic version of the Local Lemma. FOCS 1991 : 586-593 25 Noga Alon, A. K. Dewdney , Teunis J. Ott : Efficient Simulation of Finite Automata by Neural Nets. JACM 38 (2): 495-514 (1991) 24 Noga Alon, Amotz Bar-Noy , Nathan Linial , David Peleg : A Lower Bound for Radio Broadcast. JCSS 43 (2): 290-298 (1991) 23 Noga Alon, Moni Naor : Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract). FOCS 1990 : 46-54 22 Noga Alon, Oded Goldreich , Johan Håstad , René Peralta : Simple Constructions of Almost k-Wise Independent Random Variables. FOCS 1990 : 544-553 21 Noga Alon, Nimrod Megiddo : Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. FOCS 1990 : 574-582 20 Noga Alon, Paul Seymour , Robin Thomas : A Separator Theorem for Graphs with an Excluded Minor and its Applications. STOC 1990 : 293-299 19 Noga Alon: Generating Pseudo-Random Permutations and Maximum Flow Algorithms. Information Processing Letters 35 (4): 201-204 (1990) 18 Noga Alon, Mauricio Karchmer , Avi Wigderson : Linear Circuits over GF(2). SIAM J. Comput. 19 (6): 1064-1067 (1990) 17 Noga Alon, Amotz Bar-Noy , Nathan Linial , David Peleg : On the Complexity of Radio Communication (Extended Abstract). STOC 1989 : 274-285 16 Noga Alon, Yossi Azar : Finding an Approximate Maximum. SIAM J. Comput. 18 (2): 258-267 (1989) 15 Noga Alon, Uri Zwick : On Neciporuk's Theorem for Branching Programs. TCS 64 (3): 331-342 (1989) 14 Noga Alon, Yossi Azar : Parallel Comparison Algorithms for Approximation Problems. FOCS 1988 : 194-203 13 Noga Alon, Wolfgang Maass : Meanders and Their Applications in Lower Bounds Arguments. JCSS 37 (2): 118-129 (1988) 12 Noga Alon, Yossi Azar : The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. SIAM J. Comput. 17 (6): 1178-1192 (1988) 11 Noga Alon, Yossi Azar : Sorting, Approximate Sorting, and Searching in Rounds. SIAM Journal on Discrete Mathematics 1 (3): 269-280 (1988) 10 Noga Alon, Yossi Azar : The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms. FOCS 1987 : 489-498 9 Noga Alon, Amnon Barak , Udi Manber : On Disseminating Information Reliably without Broadcasting. ICDCS 1987 : 74-81 8 Noga Alon, David Haussler , Emo Welzl : Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. Symposium on Computational Geometry 1987 : 331-340 7 Noga Alon, Zvi Galil , V. D. Milman : Better Expanders and Superconcentrators. J. Algorithms 8 (3): 337-347 (1987) 6 Noga Alon, Wolfgang Maass : Meanders, Ramsey Theory and Lower Bounds for Branching Programs. FOCS 1986 : 410-417 5 Noga Alon, Yossi Azar , Uzi Vishkin : Tight Complexity Bounds for Parallel Comparison Sorting. FOCS 1986 : 502-510 4 Noga Alon, László Babai , Alon Itai : A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms 7 (4): 567-583 (1986) 3 Noga Alon, P. Frankl , Vojtech Rödl : Geometrical Realization of Set Systems and Probabilistic Communication Complexity. FOCS 1985 : 277-280 2 Noga Alon: Expanders, Sorting in Rounds and Superconcentrators of Limited Depth. STOC 1985 : 98-102 1 Noga Alon, V. D. Milman : Eigenvalues, Expanders and Superconcentrators (Extended Abstract). FOCS 1984 : 320-322  DiSC'02 © 2003 Association for Computing Machinery |
