Linial, Nathan "Nati" - School of Computer Science and Engineering, Hebrew University of Jerusalem

• Introduction to Fourier Analysis Jan 7, 2005
• Random Graph Coverings I: General Theory and Graph Connectivity
• Essential covers of the cube by hyperplanes Nathan Linial
• Algorithmica (1999) 25: 116140 Algorithmica
• ISRAEL JOURNAL OF MATHEMATICS106 (1998), 339-348 LOW DISTORTION EUCLIDEAN EMBEDDINGS OF TREES
• Combinatorics, Probability and Computing (2009) 18, 227245. c 2009 Cambridge University Press doi:10.1017/S0963548308009656 Printed in the United Kingdom
• Random Simplicial Complexes and the Construction of Linear Error Correcting Codes
• The non-crossing graph Nathan Linial , Michael Saks y , David Statter z
• ProtoNet: Automatic Classification of Protein Families Version 1.3 (July 2002)
• An Extremal Problem on Degree Sequences of Graphs Nathan Linial1
• Collective Coin Flipping Michael BenOr
• DiscreteComput Geom 9:293-321 (1993) G " i try 1993Springer-Verlag New York Inc,
• Games Computers Play: GameTheoretic Aspects of Computing
• Randomized Algorithms, Lecture No. 4 Russell Impagliazzo
• Girth and Euclidean Distortion Nathan Linial Avner Magen y Assaf Naor z
• No Justified Complaints: On Fair Sharing of Multiple Resources
• The One-Round Voronoi Game Otfried Cheong
• Discrete Mathematics 33 (1981) 53-56. @ North-Holland Publishing Company
• Limitations to Fr echet's Metric Embedding Method Yair Bartal Nathan Linial y Manor Mendel z Assaf Naor
• The Moore bound for irregular graphs Noga Alon Shlomo Hoory y Nathan Linial z
• A counterexample to a conjecture of Bjorner and Lovasz on the #coloring complex
• On the Lipschitz constant of the RSK correspondence
• On the expansion rate of Margulis expanders Nathan Linial
• Low Dimensional Embeddings of Ultrametrics Yair Bartal a,1 Nathan Linial a,1 Manor Mendel a,2,# Assaf Naor b
• Global self organization of all known protein sequences reveals inherent biological signatures
• On the Hardness of Approximating the Chromatic Number Sanjeev Khanna y
• LIFTS OF GRAPHS NATI LINIAL
• Applications of Harmonic Analysis February 4, 2005
• Identifying and Classifying Recurrent Evolutionary Conserved Units in Proteins
• No Justified Complaints: A Bottleneck-Based
• Inclusion-exclusion: exact and approximate Je Kahn Nathan Linial y Alex Samorodnitsky z
• Random Lifts of Graphs 4: Perfect Matchings Nathan Linial Eyal Rozenman y
• ForPeerReview Bioinformatics
• Colorings of the d-regular in nite tree Shlomo Hoory Nathan Linial yz
• A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
• COMBINATORICA Akad~miai Kiad6 M Springer-Verlag
• COMBINATORICA Bolyai Society -Springer-Verlag
• On the Design and Analysis of Protein Folding Potentials Dror Tobi,1
• Lower Bounds in Communication Complexity Based on Factorization Norms
• A Continuous Analogue of the Girth Problem Alon Amit Shlomo Hoory y Nathan Linial zx
• On graphs of high girth Thesis submitted for the degree
• An Optimal On-Line Algorithm for Metrical Task System
• On spectral properties of graphs, and their application to clustering
• Tight products and Graph Expansion Amit Daniely
• IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 41. NO 5, SEPTEMBER 1995 1461 On the Distance Distribution of Codes
• Linear Codes and Character Sums Nathan Linial
• Sum Complexes -a New Family of Hypertrees R. Meshulam
• COMBINATORICA Akad~miai Kiad6 ~ Springer-Verlag
• FAULT-TOLERANT COMPUTATION IN THE FULL INFORMATION ODED GOLDREICH, SHAFI GOLDWASSER, AND NATHAN LINIAL
• Monotone Maps, Sphericity and Bounded Second Yonatan Bilu # Nati Linial +
• On the trace of incompatible vectors Ron Aharoni
• On the Euclidean distortion of complete binary trees Nathan Linial y Michael Saks z
• The Linear-Array Conjecture in Communication Complexity is False
• Random Lifts of Graphs III: Independence and Chromatic Number
• Some Low Distortion Metric Ramsey Problems Yair Bartal Nathan Linial y Manor Mendel z Assaf Naor
• A Probabilistic Approach to the Design of Structural Selectivity of Proteins
• What are high-dimensional permutation?
• Going up in dimensions: Combinatorial and probabilistic
• Random Lifts of Graphs Nati Linial
• Open U., March '08 RAMANUJAN GRAPHS, LIFTS and WORD MAPS
• Eigenvectors of random graphs: Nodal domains Yael Dekel
• SOME PROBLEMS AND RESULTS IN THE GEOMETRY OF GRAPHS
• Strategy and Dynamics in Reputation Systems Center for the Study of Rationality, Hebrew University, Jerusalem, Israel
• Graph coloring with no large monochromatic components Nathan Linial
• EVEREST: A collection of evolutionary conserved protein domains Elon Portugaly 1
• COMBINATORICA Bolyai Society Springer-Verlag
• HOW NEIGHBORLY CAN A CENTRALLY SYMMETRIC POLYTOPE BE?
• Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis
• Lifts, discrepancy and nearly optimal spectral Yonatan Bilu and Nathan Linial
• ProtoNet 4.0: A hierarchical classification of one million protein sequences
• Annals of Mathematics, 162 (2005), 643709 On metric Ramsey-type phenomena
• Journal of Computer and System Sciences 58, 174 176 (1999) A Note on the Influence of an =-Biased Random Source
• COMBINATORICA Bolyai Society Springer-Verlag
• Biased Random Walks Andrei Z. Broder
• 186 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 39, NO. 1, JANUARY 1993 On the Uniform-Traffic Capacity
• JOURNAL OF ALGORITHMS 13, 188-210 (1992) Single Round Simulation on Radio Networks*
• Constant Depth Circuits, Fourier Transform, and Learnability
• COMBINATORICA Akad~miai Kiadd -Springer-Verlag
• Approximate Inclusion-Exclusion Nathan Linial Noam Nisan y
• COMBINATORICA Akad~miaiKiad6--Springer-Verlag
• Discrete Mathematics 58 (1986) 97-98 North-Holland
• Theoretical Computer Science 38 (1985) 343-347 North-Holland
• JOURNAL OF COMBINATORIAL THEORY, Series A 40, 195-210 (1985) Every Poset Has a Central Element
• Lecture 1: Introduction to Fourier Analysis p.2, line 16: 'we now at a new' instead of 'we now look at an new'
• Introduction to Fourier Analysis Jan 7, 2005
• Introduction to Some Convergence theorems Friday 14, 2005
• Harmonic Analysis on the Cube and Parseval's Jan 28, 2005
• MRRW Bound and Isoperimetric Problems Feb 18, 2005
• The Brunn-Minkowski Theorem and Influences of Boolean Variables
• More on the influence of variables on boolean March 4, 2005
• Threshold Phenomena March 7, 2005
• The smallest networks on which the Ford-Fulkerson maximum ow procedure may fail to terminate
• THE PROTEIN METRIC SPACE: A STUDY IN CLUSTERING
• Diskrete Mathematik April '06 EXPANDER GRAPHS -ARE THERE ANY
• DiscreteComputGeom 15:467-479 (1996) G iii i try~) 1996Springer-Verlag New York Inc.
• COMBINATORICA Bolyai Society Springer-Verlag
• The Influence of Variables on Boolean Functions (extended abstract)
• What is high-dimensional combinatorics?
• JOURNAL OF COMBINATORIAL THEORY, Series B 45, 3144 (1988) Matroidal Bijections between Graphs
• An upper bound on the number of high-dimensional permutations
• TECHNICAL COMMENTS The Evolution of Molecular Computation SolutionStructure Number
• LEGAL COLORING OF Received 17 January 1984
• Random Lifts of Graphs: Edge Expansion
• COMBINATORICA Akad~miai Kiad6 -Springer-Verlag
• Isoperimetric Problems Feb 11, 2005
• Oxford University Press 2005 1 Protein Interactions & Molecular Networks
• Collapsibility and vanishing of top homology in random simplicial complexes
• LEAPFROG IN POSETS Abstract. We consider the following solitaire game whose rules
• Upper bounds on the number of Steiner triple systems and 1-factorizations
• Discrete Mathematics 64 (1987) 1-11 North-Holland
• OURNAL OF COMBINATORIAL THEORY, Series B 36, 16-25 (1984) Graph Decompositions without Isolates
• SIAM J. COMPUT. Vol. 11, No. 3, August 1982
• SIAM J. COMPUT. Vol. 13, No. 4, November 1984
• ForPeerReview Nucleic Acids Research
• JOURNAL OF COMBINATORIAL THEORY, Series A 43, 196-204 (1986) Minimal Non-Two-Colorable Hypergraphs and
• INFORMATION AND COMPUTATION 90, 3349 (1991) Results on Learnability and the
• Journal of Theoretical Probability, Vol. 2, No. 1, 1989 9On the Cover Time of Random Walks on Graphs
• JOURNALOF COMBINATORIALTHEORY, Series A 33, 340-342 (1982) A New Derivation of the Counting Formula for
• JOURNAL OF COMBINATORIAL THEORY, Series A 30, 331-334 (1981) Extending the Greene-Kleitman Theorem
• Discrete Mathematics 114 (1993) 275-282 North-Holland
• SIAM J. ALG. DISC. METH. Vol. 7, No. 2, April 1986
• atics 15 (1976) 297-300. Pubkhing Company
• SIAM J. ALG. DISC. METH. Vol. 2, No. 3, September 1981
• COMBINATORICA3 (1) (1983) 101--104 LARGEST DIGRAPHS CONTAINED IN ALL
• E+ere l%Mmwit!s 23 (1978) 257-272. @ ~-Sfolhnd Publishing Company
• On graphs of high girth Thesis submitted for the degree
• Order 2 (1985), 265-268. 0167~8094/85.15 0 1985 by D. Reidei Pubhshing Company,
• SIAM J. COMPUT Vol. 18, No. 2, pp. 268-277, April 1989
• Collective Coin Flipping Michael Ben-Or
• Sum Complexes -a New Family of Hypertrees
• Some Bounds for the Banzhaf Index and Other Semivalues Author(s): Ron Holzman, Ehud Lehrer, Nathan Linial
• IOURNAL OF ALGORITHMS 6, 86-103 (1985) Searching Ordered Structures
• Algorithmica (1991) 6:241-255 Algorithmica9 1991Springer-VerlagNewYorkInc.