Nathan Linial

J. Graph Theory, 2012

On the Lipschitz constant of the RSK correspondence.

[BibT_eX]

[DOI]

Nayantara Bhatnagar

J. Comb. Theory A, 2012

Strong convergence in posets.

[BibT_eX]

[DOI]

Amir Ban

J. Comb. Theory A, 2012

The error rate of learning halfspaces using Kernel-SVMs

[BibT_eX]

[DOI]

Shai Shalev-Shwartz

CoRR, 2012

Clustering is difficult only when it does not matter

[BibT_eX]

[DOI]

CoRR, 2012

No justified complaints: on fair sharing of multiple resources.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011

The Expected Genus of a Random Chord Diagram.

[BibT_eX]

[DOI]

Tahl Nowik

Discret. Comput. Geom., 2011

Generative probabilistic models for protein-protein interaction networks - the biclique perspective.

[BibT_eX]

[DOI]

Regev Schweiger

Bioinform., 2011

Recovering key biological constituents through sparse representation of gene expression.

[BibT_eX]

[DOI]

Bioinform., 2011

Oblivious Collaboration.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

The dynamics of reputation systems.

[BibT_eX]

[DOI]

Amir Ban

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Geometric Interpretation of Gene Expression by Sparse Reconstruction of Transcript Profiles.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2011

2010

Word maps and spectra of random graph lifts.

[BibT_eX]

[DOI]

Doron Puder

Random Struct. Algorithms, 2010

Sum Complexes - a New Family of Hypertrees.

[BibT_eX]

[DOI]

M. Rosenthal

Discret. Comput. Geom., 2010

Tight products and Expansion

[BibT_eX]

[DOI]

CoRR, 2010

Are Stable Instances Easy?

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2010

2008

Graph Colouring with No Large Monochromatic Components.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

Learning Complexity vs. Communication Complexity.

[BibT_eX]

[DOI]

Adi Shraibman

Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2007

EVEREST: a collection of evolutionary conserved protein domains.

[BibT_eX]

[DOI]

Elon Portugaly

Nucleic Acids Res., 2007

Graph coloring with no large monochromatic components.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Complexity measures of sign matrices.

[BibT_eX]

[DOI]

Comb., 2007

Lower bounds in communication complexity based on factorization norms.

[BibT_eX]

[DOI]

Adi Shraibman

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Eigenvectors of Random Graphs: Nodal Domains.

[BibT_eX]

[DOI]

Yael Dekel

James R. Lee

Proceedings of the Approximation, 2007

2006

Minors in lifts of graphs.

[BibT_eX]

[DOI]

Yotam Drier

Random Struct. Algorithms, 2006

On the expansion rate of Margulis expanders.

[BibT_eX]

[DOI]

Eran London

J. Comb. Theory B, 2006

How Neighborly Can a Centrally Symmetric Polytope Be?

[BibT_eX]

[DOI]

Isabella Novik

Discret. Comput. Geom., 2006

Random Lifts of Graphs: Edge Expansion.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

The Non-Crossing Graph.

[BibT_eX]

[DOI]

David Statter

Electron. J. Comb., 2006

Homological Connectivity Of Random 2-Complexes.

[BibT_eX]

[DOI]

Comb., 2006

Lifts, Discrepancy and Nearly Optimal Spectral Gap*.

[BibT_eX]

[DOI]

Comb., 2006

EVEREST: automatic identification and classification of protein domains in all protein sequences.

[BibT_eX]

[DOI]

BMC Bioinform., 2006

2005

ProtoNet 4.0: A hierarchical classification of one million protein sequences.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2005

Essential covers of the cube by hyperplanes.

[BibT_eX]

[DOI]

Jaikumar Radhakrishnan

J. Comb. Theory A, 2005

A counterexample to a conjecture of Björner and Lovász on the <i>chi</i>-coloring complex.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Monotone maps, sphericity and bounded second eigenvalue.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Some Low Distortion Metric Ramsey Problems.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Random Lifts Of Graphs: Perfekt Matchings.

[BibT_eX]

[DOI]

Eyal Rozenman

Comb., 2005

Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2005

2004

Colorings of the d-regular infinite tree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Low dimensional embeddings of ultrametrics.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

Metric Embeddings--Beyond One-Dimensional Distortion.

[BibT_eX]

[DOI]

Robert Krauthgamer

Discret. Comput. Geom., 2004

Ramanujan Signing of Regular Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap.

[BibT_eX]

[DOI]

Proceedings of the 45th Symposium on Foundations of Computer Science, 2004

2003

ProtoNet: hierarchical classification of the protein space.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2003

The Euclidean Distortion of Complete Binary Trees.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

On metric ramsey-type phenomena.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

Random lifts of graphs: Independence and chromatic number.

[BibT_eX]

[DOI]

Jirí Matousek

Random Struct. Algorithms, 2002

A Continuous Analogue of the Girth Problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

An Extremal Problem on Degree Sequences of Graphs.

[BibT_eX]

[DOI]

Eyal Rozenman

Graphs Comb., 2002

The Moore Bound for Irregular Graphs.

[BibT_eX]

[DOI]

Noga Alon

Graphs Comb., 2002

Linear Codes and Character Sums.

[BibT_eX]

[DOI]

Alex Samorodnitsky

Comb., 2002

Random Graph Coverings I: General Theory and Graph Connectivity.

[BibT_eX]

[DOI]

Comb., 2002

Girth and euclidean distortion.

[BibT_eX]

[DOI]

Assaf Naor

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

The metric space of proteins-comparative study of clustering algorithms.

[BibT_eX]

Ori Sasson

Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology, 2002

Finite metric spaces: combinatorics, geometry and algorithms.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

The one-round Voronoi game.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

Random lifts of graphs.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

ProtoMap: automatic classification of protein sequences and hierarchy of protein families.

[BibT_eX]

[DOI]

Golan Yona

Nucleic Acids Res., 2000

Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

1999

A Note on the Influence of an epsilon-Biased Random Source.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

Competitive Optimal On-Line Leasing.

[BibT_eX]

[DOI]

Ran El-Yaniv

Ron Kaniel

Algorithmica, 1999

1998

Fault-Tolerant Computation in the Full Information Model.

[BibT_eX]

[DOI]

Oded Goldreich

Shafi Goldwasser

SIAM J. Comput., 1998

A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents.

[BibT_eX]

[DOI]

Alex Samorodnitsky

Avi Wigderson

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Trees and Euclidean Metrics.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

A Map of the Protein Space: An Automatic Hierarchical Classification of all Protein Sequences.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB-98), Montréal, Québec, Canada, June 28, 1998

1996

Witness Sets for Families of Binary Vectors.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem).

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1996

Inclusion-Exclusion: Exact and Approximate.

[BibT_eX]

[DOI]

Jeff Kahn

Alex Samorodnitsky

Comb., 1996

Non-Expansive Hashing.

[BibT_eX]

[DOI]

Ori Sasson

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

The Linear-Array Conjecture in Communication Complexity is False.

[BibT_eX]

[DOI]

Eyal Kushilevitz

Rafail Ostrovsky

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

On the distance distribution of codes.

[BibT_eX]

[DOI]

Gil Kalai

IEEE Trans. Inf. Theory, 1995

Fast Perfect-Information Leader-Election Protocols with Linear Immunity.

[BibT_eX]

[DOI]

Jason Cooper

Comb., 1995

1994

Local and Global Clique Numbers.

[BibT_eX]

[DOI]

Yuri Rabinovich

J. Comb. Theory B, 1994

Spectral Properties of Threshold Functions.

[BibT_eX]

[DOI]

Craig Gotsman

Comb., 1994

Neighborhood Preserving Hashing and Approximate Queries.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

The geometry of graphs and some of its algorithmic applications

[BibT_eX]

[DOI]

Eran London

Yuri Rabinovich

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels.

[BibT_eX]

[DOI]

Yitzhak Birk

IEEE Trans. Inf. Theory, 1993

Combinatorial characterization of read-once formulae.

[BibT_eX]

[DOI]

Discret. Math., 1993

On Convex Body Chasing.

[BibT_eX]

[DOI]

Joel Friedman

Discret. Comput. Geom., 1993

Local-Global Phenomena in Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1993

Low diameter graph decompositions.

[BibT_eX]

[DOI]

Comb., 1993

The influence of large coalitions.

[BibT_eX]

[DOI]

Miklós Ajtai

Comb., 1993

Efficient construction of a small hitting set for combinatorial rectangles in high dimension.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Fast perfection-information leader-election protocol with linear immunity.

[BibT_eX]

[DOI]

Jason Cooper

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Sphere Packing and Local Majorities in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

On the Hardness of Approximating the Chromatic Number.

[BibT_eX]

[DOI]

Sanjeev Khanna

Shmuel Safra

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

1992

Locality in Distributed Graph Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

The Equivalence of Two Problems on the Cube.

[BibT_eX]

Craig Gotsman

J. Comb. Theory A, 1992

Single Round Simulation on Radio Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1992

An Optimal On-Line Algorithm for Metrical Task System.

[BibT_eX]

[DOI]

Allan Borodin

J. ACM, 1992

Biased Random Walks

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

Results on Learnability and the Vapnik-Chervonenkis Dimension

[BibT_eX]

[DOI]

Ronald L. Rivest

Inf. Comput., January, 1991

Additive bases of vector spaces over prime fields.

[BibT_eX]

[DOI]

Noga Alon

J. Comb. Theory A, 1991

A Lower Bound for Radio Broadcast.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1991

Balancing extensions via Brunn-Minkowski.

[BibT_eX]

[DOI]

Jeff Kahn

Comb., 1991

A Lower Bound on the Area of Permutation Layouts.

[BibT_eX]

[DOI]

Algorithmica, 1991

Decomposing Graphs into Regions of Small Diameter.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Fault-tolerant Computation in the Full Information Model (Extended Abstract)

[BibT_eX]

[DOI]

Oded Goldreich

Shafi Goldwasser

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Improved Routing Strategies with Succinct Tables.

[BibT_eX]

[DOI]

J. Algorithms, 1990

Approximate Inclusion-Exclusion

[BibT_eX]

[DOI]

Noam Nisan

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989

Bounds on Universal Sequences.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Cycles of length 0 modulo <i>k</i> in directed graphs.

[BibT_eX]

[DOI]

Noga Alon

J. Comb. Theory B, 1989

Interpolation Between Bases and the Shuffle Exchange Network.

[BibT_eX]

[DOI]

Eur. J. Comb., 1989

Some extremal problems arising form discrete control processes.

[BibT_eX]

[DOI]

David Lichtenstein

Comb., 1989

Collective Coin Flipping.

[BibT_eX]

Michael Ben-Or

Adv. Comput. Res., 1989

Compact Distributed Data Structures for Adaptive Routing (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

On the Complexity of Radio Communication (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Graph Products and Chromatic Numbers

[BibT_eX]

[DOI]

Umesh V. Vazirani

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Constant Depth Circuits, Fourier Transform, and Learnability

[BibT_eX]

[DOI]

Noam Nisan

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Some Bounds for the Banzhaf Index and Other Semivalues.

[BibT_eX]

[DOI]

Ron Holzman

Ehud Lehrer

Math. Oper. Res., 1988

Matroidal bijections between graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1988

Rubber bands, convex embeddings and graph connectivity.

[BibT_eX]

[DOI]

László Lovász

Avi Wigderson

Comb., 1988

Optima of dual integer linear programs.

[BibT_eX]

[DOI]

Ron Aharoni

Paul Erdös

Comb., 1988

Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract)

[BibT_eX]

[DOI]

Ronald L. Rivest

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

The Influence of Variables on Boolean Functions (Extended Abstract)

[BibT_eX]

[DOI]

Jeff Kahn

Gil Kalai

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Results on Learnability and the Vapnick-Chervonenkis Dimension.

[BibT_eX]

[DOI]

Ronald L. Rivest

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987

Extremal problems on permutations under cyclic equivalence.

[BibT_eX]

[DOI]

Paul Erdös

Shlomo Moran

Discret. Math., 1987

Imperfect Random Sources and Discrete Controlled Processes

[BibT_eX]

[DOI]

David Lichtenstein

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

An Optimal Online Algorithm for Metrical Task Systems

[BibT_eX]

[DOI]

Allan Borodin

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Distributive Graph Algorithms-Global Solutions from Local Data

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas.

[BibT_eX]

[DOI]

Ron Aharoni

J. Comb. Theory A, 1986

Graph coloring and monotone functions on posets.

[BibT_eX]

[DOI]

Discret. Math., 1986

A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications

[BibT_eX]

[DOI]

László Lovász

Avi Wigderson

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Deciding Hypergraph 2-Colourability by H-Resolution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Every Poset Has a Central Element.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

Searching Ordered Structures.

[BibT_eX]

[DOI]

J. Algorithms, 1985

Dual Integer Linear Programs and the Relationship between their Optima

[BibT_eX]

[DOI]

Ron Aharoni

Paul Erdös

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values

[BibT_eX]

[DOI]

Michael Ben-Or

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Multi-Layer Grid Embeddings

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

The Information-Theoretic Bound is Good for Merging.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

Graph decompositions without isolates.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1984

1983

Largest digraphs contained in all n-tournaments.

[BibT_eX]

[DOI]

Vera T. Sós

Comb., 1983

Information Bounds Are Good for Search Problems on Ordered Data Structures

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Legal Coloring of Graphs

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

The Counterfeit Coin Problem Revisited.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

A New Derivation of the Counting Formula for Young Tableaux.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1982

1981

Extending the Greene-Kleitman Theorem to Directed Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1981

On Petersen's graph theorem.

[BibT_eX]

[DOI]

Discret. Math., 1981

1978

בעיות פירוק וכיסוי בתורת הגרפים (Decomposition and covering problems in graph theory.).

[BibT_eX]

[DOI]

PhD thesis, 1978

Covering digraphs by paths.

[BibT_eX]

[DOI]

Discret. Math., 1978

1976

A lower bound for the circumference of a graph.

[BibT_eX]

[DOI]