Eli Shamir

Publication Activity (10 Years)

Years Active: 1962-2018
Publications (10 Years): 2

Top Topics

Algorithmic Aspects

Top Venues

Publications

Eli Shamir
Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects. LATA (2018)
Eli Shamir, Benny Sudakov
Two-Sided, Unbiased Version of Hall's Marriage Theorem. Am. Math. Mon. 124 (1) (2017)
Eli Shamir
Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars. LATA (2013)
Zvika Marx, Ido Dagan, Eli Shamir
Cross-partition clustering: revealing corresponding themes across related datasets. J. Exp. Theor. Artif. Intell. 23 (2) (2011)
Beata Beigman Klebanov, Eli Shamir
Reader-based exploration of lexical cohesion. Lang. Resour. Evaluation 41 (1) (2007)
Eli Shamir
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses. Log. J. IGPL 14 (5) (2006)
Beata Beigman Klebanov, Eli Shamir
On Lexical Cohesive Behavior of Heads of Definite Descriptions: A Case Study. NLUCS (2006)
Beata Beigman Klebanov, Eli Shamir
Reader-based exploration of lexical cohesion. Lang. Resour. Evaluation 40 (2) (2006)
Zvika Marx, Ido Dagan, Eli Shamir
A Generalized Framework for Revealing Analogous Themes across Related Topics. HLT/EMNLP (2005)
Beata Beigman Klebanov, Eli Shamir
Lexical Cohesion: Some Implications of an Empirical Study. NLUCS (2005)
Zvika Marx, Ido Dagan, Eli Shamir
Identifying Structure across Pre-partitioned Data. NIPS (2003)
Zvika Marx, Ido Dagan, Joachim M. Buhmann, Eli Shamir
Coupled Clustering: A Method for Detecting Structural Correspondence. J. Mach. Learn. Res. 3 (2002)
Ido Dagan, Zvika Marx, Eli Shamir
Cross-dataset Clustering: Revealing Corresponding Themes across Multiple Corpora. CoNLL (2002)
Shai Fine, Ran Gilad-Bachrach, Eli Shamir
Query by committee, linear separation and random walks. Theor. Comput. Sci. 284 (1) (2002)
Shoham Shamir, Orna Kupferman, Eli Shamir
Branching-Depth Hierarchies. EXPRESS (2000)
Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans Ulrich Simon
Sample-Efficient Strategies for Learning in the Presence of Noise. J. ACM 46 (5) (1999)
Zvika Marx, Ido Dagan, Eli Shamir
Detecting Sub-Topic Correspondence through Bipartite Term Clustering CoRR (1999)
Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman
Learning with Queries Corrupted by Classification Noise. Discret. Appl. Math. 92 (2-3) (1999)
Ran Bachrach, Shai Fine, Eli Shamir
Query by Committee, Linear Separation and Random Walks. EuroCOLT (1999)
Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman
Learning with Queries Corrupted by Classification Noise. ISTCS (1997)
Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby
Selective Sampling Using the Query by Committee Algorithm. Mach. Learn. 28 (2-3) (1997)
Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans Ulrich Simon
Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. EuroCOLT (1997)
Eli Shamir, Clara Shwartzman
Learning by extended statistical queries and its relation to PAC learning. EuroCOLT (1995)
Andrei Z. Broder, Alan M. Frieze, Eli Shamir
Finding Hidden Hamiltonian Cycles. Random Struct. Algorithms 5 (3) (1994)
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
Near-perfect Token Distribution. Random Struct. Algorithms 5 (4) (1994)
Rafi Levy, Eli Shamir
A note on a counting problem arising in percolation theory. Discret. Math. 114 (1-3) (1993)
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
Near-perfect Token Distribution. ICALP (1992)
Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby
Information, Prediction, and Query by Committee. NIPS (1992)
Andrei Z. Broder, Alan M. Frieze, Eli Shamir
Finding Hidden Hamiltonian Cycles (Extended Abstract) STOC (1991)
Eli Shamir, Assaf Schuster
Communication Aspects of Networks Based on Geometric Incidence Relations. Theor. Comput. Sci. 64 (1) (1989)
Eli Shamir
Chromatic Numbers of Random Hypergraphs and Associated Graphs. Adv. Comput. Res. 5 (1989)
Craig Gotsman, Eli Shamir, Daniel Lehmann
Asynchronous dynamics of random Boolean networks. ICNN (1988)
Eli Shamir, Eli Upfal
A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems. J. Parallel Distributed Comput. 4 (5) (1987)
Eli Shamir, Joel Spencer
. Comb. 7 (1) (1987)
Andrei Z. Broder, Eli Shamir
On the Second Eigenvalue of Random Regular Graphs (Preliminary Version) FOCS (1987)
Jeanette Schmidt-Pruzan, Eli Shamir, Eli Upfal
Random hypergraph coloring algorithms and the weak chromatic number. J. Graph Theory 9 (3) (1985)
Jeanette P. Schmidt, Eli Shamir
Component structure in the evolution of random hypergraphs. Comb. 5 (1) (1985)
Eli Shamir
From Expanders to Better Superconcentrators without Cascading. STACS (1984)
Eli Shamir, Eli Upfal
Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces. J. Algorithms 5 (4) (1984)
Jeanette P. Schmidt, Eli Shamir
A threshold for perfect matchings in random d-pure hypergraphs. Discret. Math. 45 (2-3) (1983)
Eli Shamir
How many random edges make a graph Hamiltonian?. Comb. 3 (1) (1983)
Eli Shamir, Eli Upfal
A Fast Construction oF Disjoint Paths in Communication Networks. FCT (1983)
Eli Shamir, Eli Upfal
N) Beats. PODC (1982)
Eli Shamir, Eli Upfal
One-factor in random graphs based on vertex choice. Discret. Math. 41 (3) (1982)
Z. Aviad, Eli Shamir
A Direct Dynamic Solution to Range Search and Related Problems for Product Regions FOCS (1981)
Eli Shamir, Marc Snir
On the Depth Complexity of Formulas. Math. Syst. Theory 13 (1980)
Jeanette P. Schmidt, Eli Shamir
An Improved Program for Constructing Open Hash Tables. ICALP (1980)
Haim Gaifman, Eli Shamir
Roots of the hardest context free language and other constructs. SIGACT News 12 (3) (1980)
Eli Shamir, Catriel Beeri
Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages. ICALP (1974)
Eli Shamir
A Remark on Discovery Algorithms for Grammars Inf. Control. 5 (3) (1962)