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