Eli Shamir | Academic Influence

Eli Shamir's AcademicInfluence.com Rankings

Eli Shamir

Computer Science

#1686

World Rank

#1747

Historical Rank

Database

#8536

World Rank

#8942

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Eli Shamir's Degrees

PhD Computer Science Tel Aviv University

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Eli Shamir Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Eliahu Shamir is an Israeli mathematician and computer scientist, the Jean and Helene Alfassa Professor Emeritus of Computer Science at the Hebrew University of Jerusalem. Biography Shamir earned his Ph.D. from the Hebrew University in 1963, under the supervision of Shmuel Agmon. After briefly holding faculty positions at the University of California, Berkeley and Northwestern University, he returned to the Hebrew University in 1966, and was promoted to full professor in 1972.

(See a Problem?)

Eli Shamir's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Selective Sampling Using the Query by Committee Algorithm (1997) (1184)
On the second eigenvalue of random regular graphs (1987) (267)
Sharp concentration of the chromatic number on random graphsGn, p (1987) (169)
The Theory of Definite Automata (1963) (132)
Regularization of mixed second-order elliptic problems (1968) (131)
On factors in random graphs (1981) (128)
Information, Prediction, and Query by Committee (1992) (117)
Component structure in the evolution of random hypergraphs (1985) (101)
Query by committee, linear separation and random walks (1999) (43)
Finding hidden Hamiltonian cycles (1991) (39)
Sample-efficient strategies for learning in the presence of noise (1999) (39)
Coupled Clustering: A Method for Detecting Structural Correspondence (2001) (39)
A Representation Theorem for Algebraic and Context-Free Power Series in Noncommuting Variables (1967) (37)
Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces (1984) (35)
Elliptic systems of singular integral operators. I. The half-space case (1967) (35)
Mixed boundary value problems for elliptic equations in the plane. The $L^p$ theory (1963) (34)
How many random edges make a graph hamiltonian? (1983) (30)
Reader-based exploration of lexical cohesion (2007) (28)
Random hypergraph coloring algorithms and the weak chromatic number (1985) (27)
On the depth complexity of formulas (1979) (27)
A threshold for perfect matchings in random d-pure hypergraphs (1983) (26)
One-factor in random graphs based on vertex choice (1982) (25)
A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems (1987) (24)
On formai properties oî simple phreise structure grammars (1961) (24)
Learning with queries corrupted by classification noise (1997) (24)
MEASURES OF SYNTACTIC COMPLEXITY (1963) (21)
Reduced Hilbert transforms and singular integral equations (1964) (20)
Near-perfect Token Distribution (1992) (17)
Large Regular Factors in Random Graphs (1984) (15)
Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages (1974) (15)
ON SEQUENTIAL LANGUAGES (1961) (15)
Some Inherently Ambiguous Context-Free Languages (1971) (14)
Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style (1985) (13)
Chromatic Numbers of Random Hypergraphs and Associated Graphs (1989) (13)
Calderon's reproducing formula and singular integral operators on a real line (1995) (12)
A remark on Mikhlin-Hörmander multipliers theorem (1966) (12)
N-processors graphs distributively achieve perfect matchings in O(log2N) beats (1982) (11)
Proceedings of the 21st International Colloquium on Automata, Languages and Programming (1994) (10)
Reader-based exploration of lexical cohesion (2006) (9)
A Remark on Discovery Algorithms for Grammars (1962) (8)
Cross-dataset Clustering: Revealing Corresponding Themes across Multiple Corpora (2002) (8)
Asynchronous dynamics of random Boolean networks (1988) (8)
From Expanders to Better Superconcentrators without Cascading (1984) (8)
Learning Using Query by Committee, Linear Separation and Random Walks (2002) (8)
Learning by extended statistical queries and its relation to PAC learning (1995) (7)
An Improved Program for Constructing Open Hash Tables (1980) (7)
A direct dynamic solution to range search and related problems for product regions (1981) (7)
ALGEBRAIC, RATIONAL AND CONTEXT-FREE POWER-SERIES IN NON-COMMUTING VARIABLES. (1967) (6)
Branching-Depth Hierarchies (2003) (6)
An algorithmic method for studying percolation clusters (1982) (6)
A Fast Construction oF Disjoint Paths in Communication Networks (1983) (6)
Two-Sided, Unbiased Version of Hall's Marriage Theorem (2017) (6)
Complexity of grammars by group theoretic methods (1968) (5)
Neuronal growth via hybrid system of self-growing and diffusion based grammar rules: I. (1995) (5)
Computation of Recursive Functionals Using Minimal Initial Segments (1983) (4)
Connectivity and dynamics for random subgraphs of the directed cube (1993) (4)
Detecting Sub-Topic Correspondence through Bipartite Term Clustering (1999) (4)
Mixed boundary value problems for elliptic equations in the plane (2018) (4)
On the Parallel Evaluation of Boolean Expressions (1976) (4)
A unified mathematical treatment of diffusion-controlled voltammetric processes (1969) (4)
Wiener-Hopf type problems for elliptic systems of singular integral equations (1966) (3)
NOISE TOLERANT LEARNING USING EARLY PREDICTORS (1999) (3)
Communication Aspects of Networks Based on Geometric Incidence Relations (1989) (3)
A fast parallel construction of disjoint paths in networks (1985) (3)
Identifying Structure across Pre-partitioned Data (2003) (3)
Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise (1997) (3)
On Sequential Languages and Two Classes of Regular Events (1965) (3)
Multipliers of Fourier transform in a half-space (1965) (3)
Roots of the hardest context free language and other constructs (1980) (2)
Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars (2013) (2)
Commutation Relations of Slices Characterize Some Synchronization Primitives (1978) (2)
Elliptic overdetermined differential systems in convex cones (1977) (2)
Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials (1983) (2)
Completing Partial Latin Squares - Alternative Proof (2016) (1)
Finding Hidden Hamiltonian Cycles (Extended Abstract) (1991) (1)
A Generalized Framework for Revealing Analogous Themes across Related Topics (2005) (1)
Review: G. H. Matthews, Discontinuity and Asymmetry in Phrase Structure Grammars; G. H. Matthews, A Note on Asymmetry in Phrase Structure Grammars (1970) (1)
Lexical Cohesion: Some Implications of an Empirical Study (2016) (1)
Cross-partition clustering: revealing corresponding themes across related datasets (2011) (1)
Investigations in Harmonic Analysis, Ergodic Theory and Related Topics in Analysis. (1971) (0)
A note on a counting problem arising in percolation theory (1993) (0)
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses (2006) (0)
Boundary Value Problems for Elliptic Convolutions Systems (2010) (0)
Automata, Languages and Programming: 21st International Colloquium, Icalp 94 Jerusalem, Israel, July 11-14, 1994 : Proceedings (1994) (0)
Neuronal growth via hybrid system of self-growing and diffusion based grammar rules: I (1995) (0)
On Lexical Cohesive Behavior of Heads of Definite Descriptions: A Case Study (2006) (0)
Review: Joachim Lambek, The Mathematics of Sentence Structure; Joachim Lambek, Contributions to a Mathematical Analysis of the English Verb-Phrase; Joachim Lambek, Structure of languages and its Mathematical Aspects (1968) (0)
Almost optimal Boolean matrix multiplication [BMM]-by multi-encoding of rows and columns (2018) (0)
Automata, Languages and Programming (1994) (0)
Elliptic solvability of augmented differential complexes on piecewise smooth manifolds (1982) (0)
Selected papers from the 21st international colloquium on Automata, languages and programming (1996) (0)
Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects (2018) (0)
8 Concluding Remarks and Further Work (2007) (0)
An Algorithmic IMethod for Studying Percolation Clusters bY Shucl (1998) (0)

This paper list is powered by the following services:

Other Resources About Eli Shamir

en.wikipedia.org

What Schools Are Affiliated With Eli Shamir?

Eli Shamir is affiliated with the following schools: