Nathan Linial - RankMe

167 papers A* 32A 4B 3Journal 121Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Bounds on unique-neighbor codes. Comb. Theory Nathan Linial, Edan Orzech
2023	J	`jnl`	In Search of Hyperpaths. Discret. Comput. Geom. Amir Dahari, Nathan Linial
2020	J	`jnl`	Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition. Graphs Comb. Nathan Linial, Sria Louis
2020	—	`conf`	Functional Evolutionary Modeling Exposes Overlooked Protein-Coding Genes Involved in Cancer. ISBRA Nadav Brandes, Nathan Linial, Michal Linial
2020	B	`conf`	PWAS: Proteome-Wide Association Study. RECOMB Nadav Brandes, Nathan Linial, Michal Linial
2019	J	`jnl`	A cell-based probabilistic approach unveils the concerted action of miRNAs. PLoS Comput. Biol. Shelly Mahlab-Aviv, Nathan Linial, Michal Linial
2018	J	`jnl`	Monotone Subsequences in High-Dimensional Permutations. Comb. Probab. Comput. Nathan Linial, Michael Simkin
2016	J	`jnl`	The threshold for d-collapsibility in random complexes. Random Struct. Algorithms Lior Aronshtam, Nathan Linial
2015	J	`jnl`	When does the top homology of a random simplicial complex vanish? Random Struct. Algorithms Lior Aronshtam, Nathan Linial
2014	J	`jnl`	An upper bound on the number of high-dimensional permutations. Comb. Nathan Linial, Zur Luria
2014	J	`jnl`	Entropy-driven partitioning of the hierarchical protein space. Bioinform. Nadav Rappoport, Amos Stern, Nathan Linial, Michal Linial
2014	J	`jnl`	On Regular Hypergraphs of High Girth. Electron. J. Comb. David Ellis, Nathan Linial
2014	J	`jnl`	On the Vertices of the d-Dimensional Birkhoff Polytope. Discret. Comput. Geom. Nathan Linial, Zur Luria
2013	J	`jnl`	An upper bound on the number of Steiner triple systems. Random Struct. Algorithms Nathan Linial, Zur Luria
2013	J	`jnl`	Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes. Discret. Comput. Geom. Lior Aronshtam, Nathan Linial, Tomasz Luczak, Roy Meshulam
2012	J	`jnl`	Are Stable Instances Easy? Comb. Probab. Comput. Yonatan Bilu, Nathan Linial
2012	A	`conf`	No justified complaints: on fair sharing of multiple resources. ITCS Danny Dolev, Dror G. Feitelson, Joseph Y. Halpern, Raz Kupferman, Nathan Linial
2012	J	`jnl`	On the Lipschitz constant of the RSK correspondence. J. Comb. Theory A Nayantara Bhatnagar, Nathan Linial
2012	J	`jnl`	ProtoNet 6.0: organizing 10 million protein sequences in a compact hierarchical family tree. Nucleic Acids Res. Nadav Rappoport, Solange Karsenty, Amos Stern, Nathan Linial, Michal Linial
2012	J	`jnl`	Tight products and graph expansion. J. Graph Theory Amit Daniely, Nathan Linial
2011	J	`jnl`	Eigenvectors of random graphs: Nodal Domains. Random Struct. Algorithms Yael Dekel, James R. Lee, Nathan Linial
2011	J	`jnl`	Generative probabilistic models for protein-protein interaction networks - the biclique perspective. Bioinform. Regev Schweiger, Michal Linial, Nathan Linial
2011	B	`conf`	Geometric Interpretation of Gene Expression by Sparse Reconstruction of Transcript Profiles. RECOMB Yosef Prat, Menachem Fromer, Michal Linial, Nathan Linial
2011	J	`jnl`	Recovering key biological constituents through sparse representation of gene expression. Bioinform. Yosef Prat, Menachem Fromer, Nathan Linial, Michal Linial
2011	J	`jnl`	The Expected Genus of a Random Chord Diagram. Discret. Comput. Geom. Nathan Linial, Tahl Nowik
2010	A	`conf`	Are Stable Instances Easy? ICS Yonatan Bilu, Nathan Linial
2010	J	`jnl`	Sum Complexes - a New Family of Hypertrees. Discret. Comput. Geom. Nathan Linial, Roy Meshulam, M. Rosenthal
2010	J	`jnl`	Tight products and Expansion CoRR Amit Daniely, Nathan Linial
2009	J	`jnl`	Are stable instances easy? CoRR Yonatan Bilu, Nathan Linial
2009	J	`jnl`	Are stable instances easy? Electron. Colloquium Comput. Complex. Yonatan Bilu, Nathan Linial
2009	J	`jnl`	Learning Complexity vs Communication Complexity. Comb. Probab. Comput. Nathan Linial, Adi Shraibman
2008	J	`jnl`	Graph Colouring with No Large Monochromatic Components. Comb. Probab. Comput. Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos
2007	J	`jnl`	EVEREST: a collection of evolutionary conserved protein domains. Nucleic Acids Res. Elon Portugaly, Nathan Linial, Michal Linial
2007	—	`conf`	Eigenvectors of Random Graphs: Nodal Domains. APPROX-RANDOM Yael Dekel, James R. Lee, Nathan Linial
2007	J	`jnl`	Graph coloring with no large monochromatic components. Electron. Notes Discret. Math. Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos
2006	J	`jnl`	EVEREST: automatic identification and classification of protein domains in all protein sequences. BMC Bioinform. Elon Portugaly, Amir Harel, Nathan Linial, Michal Linial
2006	J	`jnl`	Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. J. Comput. Biol. Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini
2006	J	`jnl`	Homological Connectivity Of Random 2-Complexes. Comb. Nathan Linial, Roy Meshulam
2006	J	`jnl`	How Neighborly Can a Centrally Symmetric Polytope Be? Discret. Comput. Geom. Nathan Linial, Isabella Novik
2006	J	`jnl`	Lifts, Discrepancy and Nearly Optimal Spectral Gap*. Comb. Yonatan Bilu, Nathan Linial
2006	J	`jnl`	Minors in lifts of graphs. Random Struct. Algorithms Yotam Drier, Nathan Linial
2006	J	`jnl`	On the expansion rate of Margulis expanders. J. Comb. Theory B Nathan Linial, Eran London
2006	J	`jnl`	Random Lifts of Graphs: Edge Expansion. Comb. Probab. Comput. Alon Amit, Nathan Linial
2006	J	`jnl`	The Non-Crossing Graph. Electron. J. Comb. Nathan Linial, Michael E. Saks, David Statter
2005	J	`jnl`	A counterexample to a conjecture of Björner and Lovász on the J. Comb. Theory B Shlomo Hoory, Nathan Linial
2005	B	`conf`	Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. RECOMB Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini
2005	J	`jnl`	Essential covers of the cube by hyperplanes. J. Comb. Theory A Nathan Linial, Jaikumar Radhakrishnan
2005	J	`jnl`	Monotone maps, sphericity and bounded second eigenvalue. J. Comb. Theory B Yonatan Bilu, Nathan Linial
2005	J	`jnl`	ProtoNet 4.0: A hierarchical classification of one million protein sequences. Nucleic Acids Res. Noam Kaplan, Ori Sasson, Uri Inbar, Moriah Friedlich, Menachem Fromer, Hillel Fleischer, Elon Portugaly, Nathan Linial, Michal Linial
2005	J	`jnl`	Random Lifts Of Graphs: Perfekt Matchings. Comb. Nathan Linial, Eyal Rozenman
2005	J	`jnl`	Some Low Distortion Metric Ramsey Problems. Discret. Comput. Geom. Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor
2004	J	`jnl`	Colorings of the d-regular infinite tree. J. Comb. Theory B Shlomo Hoory, Nathan Linial
2004	A*	`conf`	Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap. FOCS Yonatan Bilu, Nathan Linial
2004	J	`jnl`	Low dimensional embeddings of ultrametrics. Eur. J. Comb. Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor
2004	J	`jnl`	Metric Embeddings--Beyond One-Dimensional Distortion. Discret. Comput. Geom. Robert Krauthgamer, Nathan Linial, Avner Magen
2004	J	`jnl`	Ramanujan Signing of Regular Graphs. Comb. Probab. Comput. Yonatan Bilu, Nathan Linial
2004	J	`jnl`	The One-Round Voronoi Game. Discret. Comput. Geom. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
2003	A*	`conf`	On metric ramsey-type phenomena. STOC Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor
2003	J	`jnl`	ProtoNet: hierarchical classification of the protein space. Nucleic Acids Res. Ori Sasson, Avishay Vaaknin, Hillel Fleischer, Elon Portugaly, Yonatan Bilu, Nathan Linial, Michal Linial
2003	J	`jnl`	The Euclidean Distortion of Complete Binary Trees. Discret. Comput. Geom. Nathan Linial, Michael E. Saks
2002	J	`jnl`	A Continuous Analogue of the Girth Problem. J. Comb. Theory B Alon Amit, Shlomo Hoory, Nathan Linial
2002	J	`jnl`	An Extremal Problem on Degree Sequences of Graphs. Graphs Comb. Nathan Linial, Eyal Rozenman
2002	—	`conf`	Finite metric spaces: combinatorics, geometry and algorithms. SCG Nathan Linial
2002	A*	`conf`	Girth and euclidean distortion. STOC Nathan Linial, Avner Magen, Assaf Naor
2002	J	`jnl`	Linear Codes and Character Sums. Comb. Nathan Linial, Alex Samorodnitsky
2002	J	`jnl`	Random Graph Coverings I: General Theory and Graph Connectivity. Comb. Alon Amit, Nathan Linial
2002	J	`jnl`	Random lifts of graphs: Independence and chromatic number. Random Struct. Algorithms Alon Amit, Nathan Linial, Jirí Matousek
2002	J	`jnl`	The Moore Bound for Irregular Graphs. Graphs Comb. Noga Alon, Shlomo Hoory, Nathan Linial
2002	A	`conf`	The metric space of proteins-comparative study of clustering algorithms. ISMB Ori Sasson, Nathan Linial, Michal Linial
2002	—	`conf`	The one-round Voronoi game. SCG Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
2001	J	`jnl`	Neighborhood Preserving Hashing and Approximate Queries. SIAM J. Discret. Math. Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
2001	A*	`conf`	Random lifts of graphs. SODA Alon Amit, Nathan Linial, Jirí Matousek, Eyal Rozenman
2000	J	`jnl`	A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. Comb. Nathan Linial, Alex Samorodnitsky, Avi Wigderson
2000	J	`jnl`	Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders. J. Comb. Theory B Nathan Linial, Avner Magen
2000	J	`jnl`	On the Hardness of Approximating the Chromatic Number. Comb. Sanjeev Khanna, Nathan Linial, Shmuel Safra
2000	J	`jnl`	ProtoMap: automatic classification of protein sequences and hierarchy of protein families. Nucleic Acids Res. Golan Yona, Nathan Linial, Michal Linial
1999	J	`jnl`	A Note on the Influence of an epsilon-Biased Random Source. J. Comput. Syst. Sci. Amir Ben-Dor, Anna R. Karlin, Nathan Linial, Yuri Rabinovich
1999	J	`jnl`	Competitive Optimal On-Line Leasing. Algorithmica Ran El-Yaniv, Ron Kaniel, Nathan Linial
1999	J	`jnl`	The Linear-Array Conjecture in Communication Complexity Is False. Comb. Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
1998	A*	`conf`	A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. STOC Nathan Linial, Alex Samorodnitsky, Avi Wigderson
1998	A	`conf`	A Map of the Protein Space: An Automatic Hierarchical Classification of all Protein Sequences. ISMB Golan Yona, Nathan Linial, Naftali Tishby, Michal Linial
1998	J	`jnl`	Fault-Tolerant Computation in the Full Information Model. SIAM J. Comput. Oded Goldreich, Shafi Goldwasser, Nathan Linial
1998	J	`jnl`	Non-Expansive Hashing. Comb. Nathan Linial, Ori Sasson
1998	A*	`conf`	Trees and Euclidean Metrics. STOC Nathan Linial, Avner Magen, Michael E. Saks
1997	J	`jnl`	Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. Comb. Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
1996	J	`jnl`	Biased Random Walks. Comb. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven J. Phillips
1996	J	`jnl`	Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem). Discret. Comput. Geom. Shlomo Hoory, Nathan Linial
1996	J	`jnl`	Inclusion-Exclusion: Exact and Approximate. Comb. Jeff Kahn, Nathan Linial, Alex Samorodnitsky
1996	A*	`conf`	Non-Expansive Hashing. STOC Nathan Linial, Ori Sasson
1996	A*	`conf`	The Linear-Array Conjecture in Communication Complexity is False. STOC Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
1996	J	`jnl`	Witness Sets for Families of Binary Vectors. J. Comb. Theory A Eyal Kushilevitz, Nathan Linial, Yuri Rabinovich, Michael E. Saks
1995	J	`jnl`	Fast Perfect-Information Leader-Election Protocols with Linear Immunity. Comb. Jason Cooper, Nathan Linial
1995	J	`jnl`	On the distance distribution of codes. IEEE Trans. Inf. Theory Gil Kalai, Nathan Linial
1995	J	`jnl`	The Geometry of Graphs and Some of its Algorithmic Applications. Comb. Nathan Linial, Eran London, Yuri Rabinovich
1994	J	`jnl`	Local and Global Clique Numbers. J. Comb. Theory B Nathan Linial, Yuri Rabinovich
1994	A*	`conf`	Neighborhood Preserving Hashing and Approximate Queries. SODA Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
1994	J	`jnl`	Spectral Properties of Threshold Functions. Comb. Craig Gotsman, Nathan Linial
1994	A*	`conf`	The geometry of graphs and some of its algorithmic applications FOCS Nathan Linial, Eran London, Yuri Rabinovich
1993	J	`jnl`	Combinatorial characterization of read-once formulae. Discret. Math. Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson
1993	J	`jnl`	Constant Depth Circuits, Fourier Transform, and Learnability. J. ACM Nathan Linial, Yishay Mansour, Noam Nisan
1993	A*	`conf`	Efficient construction of a small hitting set for combinatorial rectangles in high dimension. STOC Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
1993	A*	`conf`	Fast perfection-information leader-election protocol with linear immunity. STOC Jason Cooper, Nathan Linial
1993	J	`jnl`	Local-Global Phenomena in Graphs. Comb. Probab. Comput. Nathan Linial
1993	J	`jnl`	Low diameter graph decompositions. Comb. Nathan Linial, Michael E. Saks
1993	J	`jnl`	On Convex Body Chasing. Discret. Comput. Geom. Joel Friedman, Nathan Linial
1993	—	`conf`	On the Hardness of Approximating the Chromatic Number. ISTCS Sanjeev Khanna, Nathan Linial, Shmuel Safra
1993	J	`jnl`	On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels. IEEE Trans. Inf. Theory Yitzhak Birk, Nathan Linial, Roy Meshulam
1993	—	`conf`	Sphere Packing and Local Majorities in Graphs. ISTCS Nathan Linial, David Peleg, Yuri Rabinovich, Michael E. Saks
1993	J	`jnl`	The influence of large coalitions. Comb. Miklós Ajtai, Nathan Linial
1992	J	`jnl`	An Optimal On-Line Algorithm for Metrical Task System. J. ACM Allan Borodin, Nathan Linial, Michael E. Saks
1992	A*	`conf`	Biased Random Walks STOC Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven J. Phillips
1992	J	`jnl`	Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties. J. Comb. Theory B François Jaeger, Nathan Linial, Charles Payan, Michael Tarsi
1992	J	`jnl`	Locality in Distributed Graph Algorithms. SIAM J. Comput. Nathan Linial
1992	J	`jnl`	Single Round Simulation on Radio Networks. J. Algorithms Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
1992	J	`jnl`	The Equivalence of Two Problems on the Cube. J. Comb. Theory A Craig Gotsman, Nathan Linial
1991	J	`jnl`	A Lower Bound for Radio Broadcast. J. Comput. Syst. Sci. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
1991	J	`jnl`	A Lower Bound on the Area of Permutation Layouts. Algorithmica Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson
1991	J	`jnl`	Additive bases of vector spaces over prime fields. J. Comb. Theory A Noga Alon, Nathan Linial, Roy Meshulam
1991	J	`jnl`	Balancing extensions via Brunn-Minkowski. Comb. Jeff Kahn, Nathan Linial
1991	A*	`conf`	Decomposing Graphs into Regions of Small Diameter. SODA Nathan Linial, Michael E. Saks
1991	A*	`conf`	Fault-tolerant Computation in the Full Information Model (Extended Abstract) FOCS Oded Goldreich, Shafi Goldwasser, Nathan Linial
1991	J	`jnl`	Results on Learnability and the Vapnik-Chervonenkis Dimension Inf. Comput. Nathan Linial, Yishay Mansour, Ronald L. Rivest
1990	A*	`conf`	Approximate Inclusion-Exclusion STOC Nathan Linial, Noam Nisan
1990	J	`jnl`	Approximate inclusion-exclusion. Comb. Nathan Linial, Noam Nisan
1990	J	`jnl`	Improved Routing Strategies with Succinct Tables. J. Algorithms Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg
1989	J	`jnl`	Bounds on Universal Sequences. SIAM J. Comput. Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman
1989	J	`jnl`	Collective Coin Flipping. Adv. Comput. Res. Michael Ben-Or, Nathan Linial
1989	A*	`conf`	Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) STOC Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg
1989	A*	`conf`	Constant Depth Circuits, Fourier Transform, and Learnability FOCS Nathan Linial, Yishay Mansour, Noam Nisan
1989	J	`jnl`	Cycles of length 0 modulo J. Comb. Theory B Noga Alon, Nathan Linial
1989	A*	`conf`	Graph Products and Chromatic Numbers FOCS Nathan Linial, Umesh V. Vazirani
1989	J	`jnl`	Interpolation Between Bases and the Shuffle Exchange Network. Eur. J. Comb. Nathan Linial, Michael Tarsi
1989	A*	`conf`	On the Complexity of Radio Communication (Extended Abstract) STOC Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
1989	J	`jnl`	Some extremal problems arising form discrete control processes. Comb. David Lichtenstein, Nathan Linial, Michael E. Saks
1988	J	`jnl`	Matroidal bijections between graphs. J. Comb. Theory B Nathan Linial, Roy Meshulam, Michael Tarsi
1988	J	`jnl`	Optima of dual integer linear programs. Comb. Ron Aharoni, Paul Erdös, Nathan Linial
1988	A*	`conf`	Results on Learnability and the Vapnick-Chervonenkis Dimension. COLT Nathan Linial, Yishay Mansour, Ronald L. Rivest
1988	A*	`conf`	Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract) FOCS Nathan Linial, Yishay Mansour, Ronald L. Rivest
1988	J	`jnl`	Rubber bands, convex embeddings and graph connectivity. Comb. Nathan Linial, László Lovász, Avi Wigderson
1988	J	`jnl`	Some Bounds for the Banzhaf Index and Other Semivalues. Math. Oper. Res. Ron Holzman, Ehud Lehrer, Nathan Linial
1988	A*	`conf`	The Influence of Variables on Boolean Functions (Extended Abstract) FOCS Jeff Kahn, Gil Kalai, Nathan Linial
1987	A*	`conf`	An Optimal Online Algorithm for Metrical Task Systems STOC Allan Borodin, Nathan Linial, Michael E. Saks
1987	A*	`conf`	Distributive Graph Algorithms-Global Solutions from Local Data FOCS Nathan Linial
1987	J	`jnl`	Extremal problems on permutations under cyclic equivalence. Discret. Math. Paul Erdös, Nathan Linial, Shlomo Moran
1987	A*	`conf`	Imperfect Random Sources and Discrete Controlled Processes STOC David Lichtenstein, Nathan Linial, Michael E. Saks
1986	A*	`conf`	A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications FOCS Nathan Linial, László Lovász, Avi Wigderson
1986	J	`jnl`	Graph coloring and monotone functions on posets. Discret. Math. Nathan Linial
1986	J	`jnl`	Legal coloring of graphs. Comb. Nathan Linial
1986	J	`jnl`	Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Comb. Theory A Ron Aharoni, Nathan Linial
1985	A*	`conf`	Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values FOCS Michael Ben-Or, Nathan Linial
1985	J	`jnl`	Deciding Hypergraph 2-Colourability by H-Resolution. Theor. Comput. Sci. Nathan Linial, Michael Tarsi
1985	A*	`conf`	Dual Integer Linear Programs and the Relationship between their Optima STOC Ron Aharoni, Paul Erdös, Nathan Linial
1985	J	`jnl`	Every Poset Has a Central Element. J. Comb. Theory A Nathan Linial, Michael E. Saks
1985	A*	`conf`	Multi-Layer Grid Embeddings FOCS Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson
1985	J	`jnl`	Searching Ordered Structures. J. Algorithms Nathan Linial, Michael E. Saks
1984	J	`jnl`	Graph decompositions without isolates. J. Comb. Theory B Nathan Linial
1984	J	`jnl`	The Information-Theoretic Bound is Good for Merging. SIAM J. Comput. Nathan Linial
1983	A*	`conf`	Information Bounds Are Good for Search Problems on Ordered Data Structures FOCS Nathan Linial, Michael E. Saks
1983	J	`jnl`	Largest digraphs contained in all n-tournaments. Comb. Nathan Linial, Michael E. Saks, Vera T. Sós
1983	A*	`conf`	Legal Coloring of Graphs FOCS Nathan Linial
1982	J	`jnl`	A New Derivation of the Counting Formula for Young Tableaux. J. Comb. Theory A Nathan Linial
1982	J	`jnl`	The Counterfeit Coin Problem Revisited. SIAM J. Comput. Nathan Linial, Michael Tarsi
1981	J	`jnl`	Extending the Greene-Kleitman Theorem to Directed Graphs. J. Comb. Theory A Nathan Linial
1981	J	`jnl`	On Petersen's graph theorem. Discret. Math. Nathan Linial
1978	J	`jnl`	Covering digraphs by paths. Discret. Math. Nathan Linial
1978	—	`—`	בעיות פירוק וכיסוי בתורת הגרפים (Decomposition and covering problems in graph theory.). Nathan Linial
1976	J	`jnl`	A lower bound for the circumference of a graph. Discret. Math. Nathan Linial