Eli Shamir

  • Hebrew University of Jerusalem, Israel

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects.
Proceedings of the Language and Automata Theory and Applications, 2018

Two-Sided, Unbiased Version of Hall's Marriage Theorem.
Am. Math. Mon., 2017

Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars.
Proceedings of the Language and Automata Theory and Applications, 2013

Cross-partition clustering: revealing corresponding themes across related datasets.
J. Exp. Theor. Artif. Intell., 2011

Reader-based exploration of lexical cohesion.
Lang. Resour. Evaluation, 2006

Satisfiability Decay along Conjunctions of Pseudo-Random Clauses.
Log. J. IGPL, 2006

On Lexical Cohesive Behavior of Heads of Definite Descriptions: A Case Study.
Proceedings of the Natural Language Understanding and Cognitive Science, 2006

Lexical Cohesion: Some Implications of an Empirical Study.
Proceedings of the Natural Language Understanding and Cognitive Science, 2005

A Generalized Framework for Revealing Analogous Themes across Related Topics.
Proceedings of the HLT/EMNLP 2005, 2005

Identifying Structure across Pre-partitioned Data.
Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

Query by committee, linear separation and random walks.
Theor. Comput. Sci., 2002

Coupled Clustering: A Method for Detecting Structural Correspondence.
J. Mach. Learn. Res., 2002

Cross-dataset Clustering: Revealing Corresponding Themes across Multiple Corpora.
Proceedings of the 6th Conference on Natural Language Learning, 2002

Branching-Depth Hierarchies.
Proceedings of the 7th International Workshop on Expressiveness in Concurrency, 2000

Sample-Efficient Strategies for Learning in the Presence of Noise.
J. ACM, 1999

Learning with Queries Corrupted by Classification Noise.
Discret. Appl. Math., 1999

Detecting Sub-Topic Correspondence through Bipartite Term Clustering
CoRR, 1999

Selective Sampling Using the Query by Committee Algorithm.
Mach. Learn., 1997

Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

Learning by extended statistical queries and its relation to PAC learning.
Proceedings of the Computational Learning Theory, Second European Conference, 1995

Near-perfect Token Distribution.
Random Struct. Algorithms, 1994

Finding Hidden Hamiltonian Cycles.
Random Struct. Algorithms, 1994

A note on a counting problem arising in percolation theory.
Discret. Math., 1993

Information, Prediction, and Query by Committee.
Proceedings of the Advances in Neural Information Processing Systems 5, [NIPS Conference, Denver, Colorado, USA, November 30, 1992

Finding Hidden Hamiltonian Cycles (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Communication Aspects of Networks Based on Geometric Incidence Relations.
Theor. Comput. Sci., 1989

Chromatic Numbers of Random Hypergraphs and Associated Graphs.
Adv. Comput. Res., 1989

Asynchronous dynamics of random Boolean networks.
Proceedings of International Conference on Neural Networks (ICNN'88), 1988

A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems.
J. Parallel Distributed Comput., 1987

Sharp concentration of the chromatic number on random graphs G<sub>n, p</sub>.
Comb., 1987

On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

Random hypergraph coloring algorithms and the weak chromatic number.
J. Graph Theory, 1985

Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style.
J. Comput. Syst. Sci., 1985

Component structure in the evolution of random hypergraphs.
Comb., 1985

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

From Expanders to Better Superconcentrators without Cascading.
Proceedings of the STACS 84, 1984

Computation of Recursive Functionals Using Minimal Initial Segments.
Theor. Comput. Sci., 1983

A threshold for perfect matchings in random d-pure hypergraphs.
Discret. Math., 1983

How many random edges make a graph Hamiltonian?.
Comb., 1983

A Fast Construction oF Disjoint Paths in Communication Networks.
Proceedings of the Fundamentals of Computation Theory, 1983

One-factor in random graphs based on vertex choice.
Discret. Math., 1982

N-Processors Graph Distributively Achieve Perfect Matchings in O(log<sup>2</sup>N) Beats.
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

A Direct Dynamic Solution to Range Search and Related Problems for Product Regions
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

Roots of the hardest context free language and other constructs.
SIGACT News, 1980

On the Depth Complexity of Formulas.
Math. Syst. Theory, 1980

An Improved Program for Constructing Open Hash Tables.
Proceedings of the Automata, 1980

Commutation Relations of Slices Characterize Some Synchronization Primitives.
Inf. Process. Lett., 1978

On the Parallel Evaluation of Boolean Expressions.
SIAM J. Comput., 1976

Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

Some Inherently Ambiguous Context-Free Languages
Inf. Control., May, 1971

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

The Theory of Definite Automata.
IEEE Trans. Electron. Comput., 1963

A Remark on Discovery Algorithms for Grammars
Inf. Control., September, 1962