Eli Shamir

According to our database, Eli Shamir authored at least 53 papers between 1962 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2018

Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects.

Eli Shamir

Proceedings of the Language and Automata Theory and Applications, 2018

2017

Two-Sided, Unbiased Version of Hall's Marriage Theorem.

Eli Shamir, Benny Sudakov

Am. Math. Mon., 2017

2013

Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars.

Eli Shamir

Proceedings of the Language and Automata Theory and Applications, 2013

2011

Cross-partition clustering: revealing corresponding themes across related datasets.

Zvika Marx, Ido Dagan, Eli Shamir

J. Exp. Theor. Artif. Intell., 2011

2006

Reader-based exploration of lexical cohesion.

Beata Beigman Klebanov, Eli Shamir

Lang. Resour. Evaluation, 2006

Satisfiability Decay along Conjunctions of Pseudo-Random Clauses.

Eli Shamir

Log. J. IGPL, 2006

On Lexical Cohesive Behavior of Heads of Definite Descriptions: A Case Study.

Beata Beigman Klebanov, Eli Shamir

Proceedings of the Natural Language Understanding and Cognitive Science, 2006

2005

Lexical Cohesion: Some Implications of an Empirical Study.

Beata Beigman Klebanov, Eli Shamir

Proceedings of the Natural Language Understanding and Cognitive Science, 2005

A Generalized Framework for Revealing Analogous Themes across Related Topics.

Zvika Marx, Ido Dagan, Eli Shamir

Proceedings of the HLT/EMNLP 2005, 2005

2003

Identifying Structure across Pre-partitioned Data.

Zvika Marx, Ido Dagan, Eli Shamir

Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

2002

Query by committee, linear separation and random walks.

Shai Fine, Ran Gilad-Bachrach, Eli Shamir

Theor. Comput. Sci., 2002

Coupled Clustering: A Method for Detecting Structural Correspondence.

Zvika Marx, Ido Dagan, Joachim M. Buhmann, Eli Shamir

J. Mach. Learn. Res., 2002

Cross-dataset Clustering: Revealing Corresponding Themes across Multiple Corpora.

Ido Dagan, Zvika Marx, Eli Shamir

Proceedings of the 6th Conference on Natural Language Learning, 2002

2000

Branching-Depth Hierarchies.

Shoham Shamir, Orna Kupferman, Eli Shamir

Proceedings of the 7th International Workshop on Expressiveness in Concurrency, 2000

1999

Sample-Efficient Strategies for Learning in the Presence of Noise.

Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans Ulrich Simon

J. ACM, 1999

Learning with Queries Corrupted by Classification Noise.

Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman

Discret. Appl. Math., 1999

Detecting Sub-Topic Correspondence through Bipartite Term Clustering

Zvika Marx, Ido Dagan, Eli Shamir

CoRR, 1999

1997

Selective Sampling Using the Query by Committee Algorithm.

Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby

Mach. Learn., 1997

Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise.

Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans Ulrich Simon

Proceedings of the Computational Learning Theory, Third European Conference, 1997

1995

Learning by extended statistical queries and its relation to PAC learning.

Eli Shamir, Clara Shwartzman

Proceedings of the Computational Learning Theory, Second European Conference, 1995

1994

Near-perfect Token Distribution.

Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal

Random Struct. Algorithms, 1994

Finding Hidden Hamiltonian Cycles.

Andrei Z. Broder, Alan M. Frieze, Eli Shamir

Random Struct. Algorithms, 1994

1993

A note on a counting problem arising in percolation theory.

Rafi Levy, Eli Shamir

Discret. Math., 1993

1992

Information, Prediction, and Query by Committee.

Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby

Proceedings of the Advances in Neural Information Processing Systems 5, [NIPS Conference, Denver, Colorado, USA, November 30, 1992

1991

Finding Hidden Hamiltonian Cycles (Extended Abstract)

Andrei Z. Broder, Alan M. Frieze, Eli Shamir

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

1989

Communication Aspects of Networks Based on Geometric Incidence Relations.

Eli Shamir, Assaf Schuster

Theor. Comput. Sci., 1989

Chromatic Numbers of Random Hypergraphs and Associated Graphs.

Eli Shamir

Adv. Comput. Res., 1989

1988

Asynchronous dynamics of random Boolean networks.

Craig Gotsman, Eli Shamir, Daniel Lehmann

Proceedings of International Conference on Neural Networks (ICNN'88), 1988

1987

A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems.

Eli Shamir, Eli Upfal

J. Parallel Distributed Comput., 1987

Sharp concentration of the chromatic number on random graphs G_{n, p}.

Eli Shamir, Joel Spencer

Comb., 1987

On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)

Andrei Z. Broder, Eli Shamir

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

1985

Random hypergraph coloring algorithms and the weak chromatic number.

Jeanette Schmidt-Pruzan, Eli Shamir, Eli Upfal

J. Graph Theory, 1985

Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style.

Jakob Gonczarowski, Eliahu Shamir

J. Comput. Syst. Sci., 1985

Component structure in the evolution of random hypergraphs.

Jeanette P. Schmidt, Eli Shamir

Comb., 1985

1984

Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces.

Eli Shamir, Eli Upfal

J. Algorithms, 1984

From Expanders to Better Superconcentrators without Cascading.

Eli Shamir

Proceedings of the STACS 84, 1984

1983

Computation of Recursive Functionals Using Minimal Initial Segments.

Dan Gordon, Eliahu Shamir

Theor. Comput. Sci., 1983

A threshold for perfect matchings in random d-pure hypergraphs.

Jeanette P. Schmidt, Eli Shamir

Discret. Math., 1983

How many random edges make a graph Hamiltonian?.

Eli Shamir

Comb., 1983

A Fast Construction oF Disjoint Paths in Communication Networks.

Eli Shamir, Eli Upfal

Proceedings of the Fundamentals of Computation Theory, 1983

1982

One-factor in random graphs based on vertex choice.

Eli Shamir, Eli Upfal

Discret. Math., 1982

N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) Beats.

Eli Shamir, Eli Upfal

Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

1981

A Direct Dynamic Solution to Range Search and Related Problems for Product Regions

Z. Aviad, Eli Shamir

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

Roots of the hardest context free language and other constructs.

Haim Gaifman, Eli Shamir

SIGACT News, 1980

On the Depth Complexity of Formulas.

Eli Shamir, Marc Snir

Math. Syst. Theory, 1980

An Improved Program for Constructing Open Hash Tables.

Jeanette P. Schmidt, Eli Shamir

Proceedings of the Automata, 1980

1978

Commutation Relations of Slices Characterize Some Synchronization Primitives.

Danny Dolev, Eliahu Shamir

Inf. Process. Lett., 1978

1976

On the Parallel Evaluation of Boolean Expressions.

Amnon Barak, Eliahu Shamir

SIAM J. Comput., 1976

1974

Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages.

Eli Shamir, Catriel Beeri

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1971

Some Inherently Ambiguous Context-Free Languages

Eliahu Shamir

Inf. Control., May, 1971

1967

A Representation Theorem for Algebraic and Context-Free Power Series in Noncommuting Variables

Eliahu Shamir

Inf. Control., 1967

1963

The Theory of Definite Automata.

Micha A. Perles, Michael O. Rabin, Eliahu Shamir

IEEE Trans. Electron. Comput., 1963

1962

A Remark on Discovery Algorithms for Grammars

Eli Shamir

Inf. Control., September, 1962