The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nathan Linial: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nathan Linial, Eran London, Yuri Rabinovich
    The geometry of graphs and some of its algorithmic applications [Citation Graph (1, 0)][DBLP]
    FOCS, 1994, pp:577-591 [Conf]
  2. Allan Borodin, Nathan Linial, Michael E. Saks
    An Optimal Online Algorithm for Metrical Task Systems [Citation Graph (1, 0)][DBLP]
    STOC, 1987, pp:373-382 [Conf]
  3. Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
    Efficient construction of a small hitting set for combinatorial rectangles in high dimension. [Citation Graph (1, 0)][DBLP]
    STOC, 1993, pp:258-267 [Conf]
  4. Nathan Linial, Ori Sasson
    Non-Expansive Hashing. [Citation Graph (1, 0)][DBLP]
    STOC, 1996, pp:509-518 [Conf]
  5. Nathan Linial, Yishay Mansour, Ronald L. Rivest
    Results on Learnability and the Vapnick-Chervonenkis Dimension. [Citation Graph (0, 0)][DBLP]
    COLT, 1988, pp:56-68 [Conf]
  6. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
    The one-round Voronoi game. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:97-101 [Conf]
  7. Nathan Linial
    Finite metric spaces: combinatorics, geometry and algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:63- [Conf]
  8. Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson
    Multi-Layer Grid Embeddings [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:186-196 [Conf]
  9. Michael Ben-Or, Nathan Linial
    Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:408-416 [Conf]
  10. Yonatan Bilu, Nathan Linial
    Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:404-412 [Conf]
  11. Oded Goldreich, Shafi Goldwasser, Nathan Linial
    Fault-tolerant Computation in the Full Information Model (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:447-457 [Conf]
  12. Jeff Kahn, Gil Kalai, Nathan Linial
    The Influence of Variables on Boolean Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:68-80 [Conf]
  13. Nathan Linial
    Legal Coloring of Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:470-472 [Conf]
  14. Nathan Linial
    Distributive Graph Algorithms-Global Solutions from Local Data [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:331-335 [Conf]
  15. Nathan Linial, László Lovász, Avi Wigderson
    A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:39-48 [Conf]
  16. Nathan Linial, Yishay Mansour, Noam Nisan
    Constant Depth Circuits, Fourier Transform, and Learnability [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:574-579 [Conf]
  17. Nathan Linial, Yishay Mansour, Ronald L. Rivest
    Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:120-129 [Conf]
  18. Nathan Linial, Michael E. Saks
    Information Bounds Are Good for Search Problems on Ordered Data Structures [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:473-475 [Conf]
  19. Nathan Linial, Umesh V. Vazirani
    Graph Products and Chromatic Numbers [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:124-128 [Conf]
  20. Ori Sasson, Nathan Linial, Michal Linial
    The metric space of proteins-comparative study of clustering algorithms. [Citation Graph (0, 0)][DBLP]
    ISMB, 2002, pp:14-21 [Conf]
  21. Golan Yona, Nathan Linial, Naftali Tishby, Michal Linial
    A Map of the Protein Space: An Automatic Hierarchical Classification of all Protein Sequences. [Citation Graph (0, 0)][DBLP]
    ISMB, 1998, pp:212-221 [Conf]
  22. Sanjeev Khanna, Nathan Linial, Shmuel Safra
    On the Hardness of Approximating the Chromatic Number. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:250-260 [Conf]
  23. Nathan Linial, David Peleg, Yuri Rabinovich, Michael E. Saks
    Sphere Packing and Local Majorities in Graphs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:141-149 [Conf]
  24. Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini
    Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2005, pp:83-100 [Conf]
  25. Alon Amit, Nathan Linial, Jirí Matousek, Eyal Rozenman
    Random lifts of graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:883-894 [Conf]
  26. Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
    Neighborhood Preserving Hashing and Approximate Queries. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:251-259 [Conf]
  27. Nathan Linial, Michael E. Saks
    Decomposing Graphs into Regions of Small Diameter. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:320-330 [Conf]
  28. 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]
  29. Ron Aharoni, Paul Erdös, Nathan Linial
    Dual Integer Linear Programs and the Relationship between their Optima [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:476-483 [Conf]
  30. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg
    Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:479-489 [Conf]
  31. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips
    Biased Random Walks [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:1-9 [Conf]
  32. Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor
    On metric ramsey-type phenomena. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:463-472 [Conf]
  33. Jason Cooper, Nathan Linial
    Fast perfection-information leader-election protocol with linear immunity. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:662-671 [Conf]
  34. Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
    The Linear-Array Conjecture in Communication Complexity is False. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:1-10 [Conf]
  35. David Lichtenstein, Nathan Linial, Michael E. Saks
    Imperfect Random Sources and Discrete Controlled Processes [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:169-177 [Conf]
  36. Nathan Linial, Avner Magen, Assaf Naor
    Girth and euclidean distortion. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:705-711 [Conf]
  37. Nathan Linial, Avner Magen, Michael E. Saks
    Trees and Euclidean Metrics. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:169-175 [Conf]
  38. Nathan Linial, Noam Nisan
    Approximate Inclusion-Exclusion [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:260-270 [Conf]
  39. Nathan Linial, Alex Samorodnitsky, Avi Wigderson
    A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:644-652 [Conf]
  40. Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson
    A Lower Bound on the Area of Permutation Layouts. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:2, pp:241-255 [Journal]
  41. Ran El-Yaniv, R. Kaniel, Nathan Linial
    Competitive Optimal On-Line Leasing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:1, pp:116-140 [Journal]
  42. Ron Aharoni, Paul Erdös, Nathan Linial
    Optima of dual integer linear programs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:13-20 [Journal]
  43. Miklós Ajtai, Nathan Linial
    The influence of large coalitions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:2, pp:129-145 [Journal]
  44. Alon Amit, Nathan Linial
    Random Graph Coverings I: General Theory and Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:1, pp:1-18 [Journal]
  45. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips
    Biased Random Walks. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:1, pp:1-18 [Journal]
  46. Jason Cooper, Nathan Linial
    Fast Perfect-Information Leader-Election Protocols with Linear Immunity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:319-332 [Journal]
  47. Craig Gotsman, Nathan Linial
    Spectral Properties of Threshold Functions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:1, pp:35-50 [Journal]
  48. Jeff Kahn, Nathan Linial
    Balancing extensions via Brunn-Minkowski. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:4, pp:363-368 [Journal]
  49. Jeff Kahn, Nathan Linial, Alex Samorodnitsky
    Inclusion-Exclusion: Exact and Approximate. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:4, pp:465-477 [Journal]
  50. Sanjeev Khanna, Nathan Linial, Shmuel Safra
    On the Hardness of Approximating the Chromatic Number. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:3, pp:393-415 [Journal]
  51. Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
    The Linear-Array Conjecture in Communication Complexity Is False. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:2, pp:241-254 [Journal]
  52. David Lichtenstein, Nathan Linial, Michael E. Saks
    Some extremal problems arising form discrete control processes. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:3, pp:269-287 [Journal]
  53. Nathan Linial
    Legal coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:49-54 [Journal]
  54. Nathan Linial, Eran London, Yuri Rabinovich
    The Geometry of Graphs and Some of its Algorithmic Applications. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:2, pp:215-245 [Journal]
  55. Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
    Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:2, pp:215-234 [Journal]
  56. Nathan Linial, László Lovász, Avi Wigderson
    Rubber bands, convex embeddings and graph connectivity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:91-102 [Journal]
  57. Nathan Linial, Roy Meshulam
    Homological Connectivity Of Random 2-Complexes. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:4, pp:475-487 [Journal]
  58. Nathan Linial, Noam Nisan
    Approximate inclusion-exclusion. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:4, pp:349-365 [Journal]
  59. Nathan Linial, Eyal Rozenman
    Random Lifts Of Graphs: Perfekt Matchings. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:4, pp:407-424 [Journal]
  60. Nathan Linial, Alex Samorodnitsky
    Linear Codes and Character Sums. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:4, pp:497-522 [Journal]
  61. Nathan Linial, Michael E. Saks
    Low diameter graph decompositions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:4, pp:441-454 [Journal]
  62. Nathan Linial, Ori Sasson
    Non-Expansive Hashing. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:1, pp:121-132 [Journal]
  63. Nathan Linial, Michael E. Saks, Vera T. Sós
    Largest digraphs contained in all n-tournaments. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:1, pp:101-104 [Journal]
  64. Nathan Linial, Alex Samorodnitsky, Avi Wigderson
    A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:545-568 [Journal]
  65. Yonatan Bilu, Nathan Linial
    Ramanujan Signing of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:37, n:6, pp:911-912 [Journal]
  66. Nathan Linial
    Local-Global Phenomena in Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:491-503 [Journal]
  67. Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor
    Some Low Distortion Metric Ramsey Problems. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:1, pp:27-41 [Journal]
  68. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
    The One-Round Voronoi Game. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:125-138 [Journal]
  69. Joel Friedman, Nathan Linial
    On Convex Body Chasing. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:293-321 [Journal]
  70. Shlomo Hoory, Nathan Linial
    Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem). [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:4, pp:467-479 [Journal]
  71. Robert Krauthgamer, Nathan Linial, Avner Magen
    Metric Embeddings--Beyond One-Dimensional Distortion. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:3, pp:339-356 [Journal]
  72. Nathan Linial, Michael E. Saks
    The Euclidean Distortion of Complete Binary Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:1, pp:19-21 [Journal]
  73. Nathan Linial, Isabella Novik
    How Neighborly Can a Centrally Symmetric Polytope Be? [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:2, pp:273-281 [Journal]
  74. Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor
    Low dimensional embeddings of ultrametrics. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:1, pp:87-92 [Journal]
  75. 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]
  76. Nathan Linial, Eyal Rozenman
    An Extremal Problem on Degree Sequences of Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:3, pp:573-582 [Journal]
  77. Nathan Linial, Yishay Mansour, Ronald L. Rivest
    Results on Learnability and the Vapnik-Chervonenkis Dimension [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:90, n:1, pp:33-49 [Journal]
  78. Allan Borodin, Nathan Linial, Michael E. Saks
    An Optimal On-Line Algorithm for Metrical Task System. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:745-763 [Journal]
  79. Nathan Linial, Yishay Mansour, Noam Nisan
    Constant Depth Circuits, Fourier Transform, and Learnability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:3, pp:607-620 [Journal]
  80. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg
    Improved Routing Strategies with Succinct Tables. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:3, pp:307-341 [Journal]
  81. 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]
  82. Nathan Linial, Michael E. Saks
    Searching Ordered Structures. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:1, pp:86-103 [Journal]
  83. 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]
  84. Amir Ben-Dor, Anna R. Karlin, Nathan Linial, Yuri Rabinovich
    A Note on the Influence of an epsilon-Biased Random Source. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:174-176 [Journal]
  85. 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]
  86. 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]
  87. Ron Aharoni, Nathan Linial
    Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:2, pp:196-204 [Journal]
  88. Alon Amit, Shlomo Hoory, Nathan Linial
    A Continuous Analogue of the Girth Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:2, pp:340-363 [Journal]
  89. Yonatan Bilu, Nathan Linial
    Monotone maps, sphericity and bounded second eigenvalue. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:2, pp:283-299 [Journal]
  90. Craig Gotsman, Nathan Linial
    The Equivalence of Two Problems on the Cube. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:61, n:1, pp:142-146 [Journal]
  91. Shlomo Hoory, Nathan Linial
    Colorings of the d-regular infinite tree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:2, pp:161-167 [Journal]
  92. Shlomo Hoory, Nathan Linial
    A counterexample to a conjecture of Björner and Lovász on the chi-coloring complex. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:2, pp:346-349 [Journal]
  93. François Jaeger, Nathan Linial, Charles Payan, Michael Tarsi
    Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:2, pp:165-182 [Journal]
  94. Eyal Kushilevitz, Nathan Linial, Yuri Rabinovich, Michael E. Saks
    Witness Sets for Families of Binary Vectors. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:73, n:2, pp:376-380 [Journal]
  95. Nathan Linial
    Extending the Greene-Kleitman Theorem to Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:30, n:3, pp:331-334 [Journal]
  96. Nathan Linial
    A New Derivation of the Counting Formula for Young Tableaux. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:33, n:3, pp:340-342 [Journal]
  97. Nathan Linial
    Graph decompositions without isolates. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:1, pp:16-25 [Journal]
  98. Nathan Linial
    Every Poset Has a Central Element. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:2, pp:195-210 [Journal]
  99. Nathan Linial, Avner Magen
    Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:79, n:2, pp:157-171 [Journal]
  100. Nathan Linial, Roy Meshulam, Michael Tarsi
    Matroidal bijections between graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:31-44 [Journal]
  101. Nathan Linial, Jaikumar Radhakrishnan
    Essential covers of the cube by hyperplanes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:109, n:2, pp:331-338 [Journal]
  102. Nathan Linial, Yuri Rabinovich
    Local and Global Clique Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:5-15 [Journal]
  103. Nathan Linial, Eran London
    On the expansion rate of Margulis expanders. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:436-442 [Journal]
  104. Ori Sasson, Avishay Vaaknin, Hillel Fleischer, Elon Portugaly, Yonatan Bilu, Nathan Linial, Michal Linial
    ProtoNet: hierarchical classification of the protein space. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2003, v:31, n:1, pp:348-352 [Journal]
  105. Golan Yona, Nathan Linial, Michal Linial
    ProtoMap: automatic classification of protein sequences and hierarchy of protein families. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2000, v:28, n:1, pp:49-55 [Journal]
  106. Noam Kaplan, Ori Sasson, Uri Inbar, Moriah Friedlich, Menachem Fromer, Hillel Fleischer, Elon Portugaly, Nathan Linial, Michal Linial
    ProtoNet 4.0: A hierarchical classification of one million protein sequences. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2005, v:33, n:Database-Issue, pp:216-218 [Journal]
  107. Elon Portugaly, Nathan Linial, Michal Linial
    EVEREST: a collection of evolutionary conserved protein domains. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2007, v:35, n:Database-Issue, pp:241-246 [Journal]
  108. Alon Amit, Nathan Linial, Jirí Matousek
    Random lifts of graphs: Independence and chromatic number. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:1, pp:1-22 [Journal]
  109. Yotam Drier, Nathan Linial
    Minors in lifts of graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:2, pp:208-225 [Journal]
  110. Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman
    Bounds on Universal Sequences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:268-277 [Journal]
  111. Oded Goldreich, Shafi Goldwasser, Nathan Linial
    Fault-Tolerant Computation in the Full Information Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:506-544 [Journal]
  112. Nathan Linial
    The Information-Theoretic Bound is Good for Merging. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:4, pp:795-801 [Journal]
  113. Nathan Linial
    Locality in Distributed Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:193-201 [Journal]
  114. Nathan Linial, Michael Tarsi
    The Counterfeit Coin Problem Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:409-415 [Journal]
  115. Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
    Neighborhood Preserving Hashing and Approximate Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:15, n:1, pp:73-85 [Journal]
  116. Nathan Linial, Michael Tarsi
    Deciding Hypergraph 2-Colourability by H-Resolution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:343-347 [Journal]
  117. Yitzhak Birk, Nathan Linial, Roy Meshulam
    On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:1, pp:186-0 [Journal]
  118. Gil Kalai, Nathan Linial
    On the distance distribution of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:5, pp:1467-1472 [Journal]
  119. Yael Dekel, James R. Lee, Nathan Linial
    Eigenvectors of Random Graphs: Nodal Domains. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:436-448 [Conf]
  120. Yonatan Bilu, Nathan Linial
    Lifts, Discrepancy and Nearly Optimal Spectral Gap*. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:5, pp:495-519 [Journal]
  121. Nathan Linial
    On Petersen's graph theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:1, pp:53-56 [Journal]
  122. Nathan Linial
    Graph coloring and monotone functions on posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:97-98 [Journal]
  123. Paul Erdös, Nathan Linial, Shlomo Moran
    Extremal problems on permutations under cyclic equivalence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:1, pp:1-11 [Journal]
  124. Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson
    Combinatorial characterization of read-once formulae. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:275-282 [Journal]

  125. Are Stable Instances Easy? [Citation Graph (, )][DBLP]


  126. EVEREST: automatic identification and classification of protein domains in all protein sequences. [Citation Graph (, )][DBLP]


  127. The Non-Crossing Graph. [Citation Graph (, )][DBLP]


  128. Are stable instances easy? [Citation Graph (, )][DBLP]


  129. Tight products and Expansion [Citation Graph (, )][DBLP]


  130. Random Lifts of Graphs: Edge Expansion. [Citation Graph (, )][DBLP]


  131. Graph Colouring with No Large Monochromatic Components. [Citation Graph (, )][DBLP]


  132. Learning Complexity vs Communication Complexity. [Citation Graph (, )][DBLP]


  133. Sum Complexes - a New Family of Hypertrees. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.016secs
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