A Remark on Discovery Algorithms for Grammars - Eli Shamir 001 (Inf. Control., 1962)

The Theory of Definite Automata. - Micha A. Perles; Michael O. Rabin; Eliahu Shamir (IEEE Trans. Electron. Comput., 1963)

A Representation Theorem for Algebraic and Context-Free Power Series in Noncommuting Variables - Eliahu Shamir (Inf. Control., 1967)

Some Inherently Ambiguous Context-Free Languages - Eliahu Shamir (Inf. Control., 1971)

Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages. - Eli Shamir 001; Catriel Beeri (ICALP, 1974)

On the Parallel Evaluation of Boolean Expressions. - Amnon Barak; Eliahu Shamir (SIAM J. Comput., 1976)

Commutation Relations of Slices Characterize Some Synchronization Primitives. - Danny Dolev; Eliahu Shamir (Inf. Process. Lett., 1978)

An Improved Program for Constructing Open Hash Tables. - Jeanette P. Schmidt; Eli Shamir 001 (ICALP, 1980)

On the Depth Complexity of Formulas. - Eli Shamir 001; Marc Snir (Math. Syst. Theory, 1980)

Roots of the hardest context free language and other constructs. - Haim Gaifman; Eli Shamir 001 (SIGACT News, 1980)

A Direct Dynamic Solution to Range Search and Related Problems for Product Regions - Z. Aviad; Eli Shamir 001 (FOCS, 1981)

N-Processors Graph Distributively Achieve Perfect Matchings in O(log2N) Beats. - Eli Shamir 001; Eli Upfal (PODC, 1982)

One-factor in random graphs based on vertex choice. - Eli Shamir 001; Eli Upfal (Discret. Math., 1982)

A Fast Construction oF Disjoint Paths in Communication Networks. - Eli Shamir 001; Eli Upfal (FCT, 1983)

How many random edges make a graph Hamiltonian?. - Eli Shamir 001 (Comb., 1983)

A threshold for perfect matchings in random d-pure hypergraphs. - Jeanette P. Schmidt; Eli Shamir 001 (Discret. Math., 1983)

Computation of Recursive Functionals Using Minimal Initial Segments. - Dan Gordon 001; Eliahu Shamir (Theor. Comput. Sci., 1983)

From Expanders to Better Superconcentrators without Cascading. - Eli Shamir 001 (STACS, 1984)

Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces. - Eli Shamir 001; Eli Upfal (J. Algorithms, 1984)

Component structure in the evolution of random hypergraphs. - Jeanette P. Schmidt; Eli Shamir 001 (Comb., 1985)

Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style. - Jakob Gonczarowski; Eliahu Shamir (J. Comput. Syst. Sci., 1985)

Random hypergraph coloring algorithms and the weak chromatic number. - Jeanette Schmidt-Pruzan; Eli Shamir 001; Eli Upfal (J. Graph Theory, 1985)

On the Second Eigenvalue of Random Regular Graphs (Preliminary Version) - Andrei Z. Broder; Eli Shamir 001 (FOCS, 1987)

Sharp concentration of the chromatic number on random graphs Gn, p. - Eli Shamir 001; Joel Spencer (Comb., 1987)

A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems. - Eli Shamir 001; Eli Upfal (J. Parallel Distributed Comput., 1987)

Asynchronous dynamics of random Boolean networks. - Craig Gotsman; Eli Shamir 001; Daniel Lehmann 001 (ICNN, 1988)

Chromatic Numbers of Random Hypergraphs and Associated Graphs. - Eli Shamir 001 (Adv. Comput. Res., 1989)

Communication Aspects of Networks Based on Geometric Incidence Relations. - Eli Shamir 001; Assaf Schuster (Theor. Comput. Sci., 1989)

Finding Hidden Hamiltonian Cycles (Extended Abstract) - Andrei Z. Broder; Alan M. Frieze; Eli Shamir 001 (STOC, 1991)

Information, Prediction, and Query by Committee. - Yoav Freund; H. Sebastian Seung; Eli Shamir 001; Naftali Tishby (NIPS, 1992)

A note on a counting problem arising in percolation theory. - Rafi Levy; Eli Shamir 001 (Discret. Math., 1993)

Finding Hidden Hamiltonian Cycles. - Andrei Z. Broder; Alan M. Frieze; Eli Shamir 001 (Random Struct. Algorithms, 1994)

Near-perfect Token Distribution. - Andrei Z. Broder; Alan M. Frieze; Eli Shamir 001; Eli Upfal (Random Struct. Algorithms, 1994)

Learning by extended statistical queries and its relation to PAC learning. - Eli Shamir 001; Clara Shwartzman (EuroCOLT, 1995)

Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. - Nicolò Cesa-Bianchi; Paul Fischer; Eli Shamir 001; Hans Ulrich Simon (EuroCOLT, 1997)

Selective Sampling Using the Query by Committee Algorithm. - Yoav Freund; H. Sebastian Seung; Eli Shamir 001; Naftali Tishby (Mach. Learn., 1997)

Detecting Sub-Topic Correspondence through Bipartite Term Clustering - Zvika Marx; Ido Dagan; Eli Shamir 001 (CoRR, 1999)

Learning with Queries Corrupted by Classification Noise. - Jeffrey C. Jackson; Eli Shamir 001; Clara Shwartzman (Discret. Appl. Math., 1999)

Sample-Efficient Strategies for Learning in the Presence of Noise. - Nicolò Cesa-Bianchi; Eli Dichterman; Paul Fischer; Eli Shamir 001; Hans Ulrich Simon (J. ACM, 1999)

Branching-Depth Hierarchies. - Shoham Shamir; Orna Kupferman; Eli Shamir 001 (EXPRESS, 2000)

Cross-dataset Clustering: Revealing Corresponding Themes across Multiple Corpora. - Ido Dagan; Zvika Marx; Eli Shamir 001 (CoNLL, 2002)

Coupled Clustering: A Method for Detecting Structural Correspondence. - Zvika Marx; Ido Dagan; Joachim M. Buhmann; Eli Shamir 001 (J. Mach. Learn. Res., 2002)

Query by committee, linear separation and random walks. - Shai Fine; Ran Gilad-Bachrach; Eli Shamir 001 (Theor. Comput. Sci., 2002)

Identifying Structure across Pre-partitioned Data. - Zvika Marx; Ido Dagan; Eli Shamir 001 (NIPS, 2003)

A Generalized Framework for Revealing Analogous Themes across Related Topics. - Zvika Marx; Ido Dagan; Eli Shamir 001 (HLT/EMNLP, 2005)

Lexical Cohesion: Some Implications of an Empirical Study. - Beata Beigman Klebanov; Eli Shamir 001 (NLUCS, 2005)

On Lexical Cohesive Behavior of Heads of Definite Descriptions: A Case Study. - Beata Beigman Klebanov; Eli Shamir 001 (NLUCS, 2006)

Satisfiability Decay along Conjunctions of Pseudo-Random Clauses. - Eli Shamir 001 (Log. J. IGPL, 2006)

Reader-based exploration of lexical cohesion. - Beata Beigman Klebanov; Eli Shamir 001 (Lang. Resour. Evaluation, 2006)

Cross-partition clustering: revealing corresponding themes across related datasets. - Zvika Marx; Ido Dagan; Eli Shamir 001 (J. Exp. Theor. Artif. Intell., 2011)

Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars. - Eli Shamir 001 (LATA, 2013)

Two-Sided, Unbiased Version of Hall's Marriage Theorem. - Eli Shamir 001; Benny Sudakov (Am. Math. Mon., 2017)

Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects. - Eli Shamir 001 (LATA, 2018)