default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEli Shamir 0001
Person information
- affiliation: Hebrew University of Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j33]Eli Shamir, Benny Sudakov:
Two-Sided, Unbiased Version of Hall's Marriage Theorem. Am. Math. Mon. 124(1): 79-80 (2017)- 2011
- [j32]Zvika Marx, Ido Dagan, Eli Shamir:
Cross-partition clustering: revealing corresponding themes across related datasets. J. Exp. Theor. Artif. Intell. 23(2): 153-180 (2011) - 2007
- [j31]Beata Beigman Klebanov, Eli Shamir:
Reader-based exploration of lexical cohesion. Lang. Resour. Evaluation 41(1): 27-44 (2007) - 2006
- [j30]Eli Shamir:
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses. Log. J. IGPL 14(5): 815-825 (2006) - [j29]Beata Beigman Klebanov, Eli Shamir:
Reader-based exploration of lexical cohesion. Lang. Resour. Evaluation 40(2): 109-126 (2006) - 2002
- [j28]Zvika Marx, Ido Dagan, Joachim M. Buhmann, Eli Shamir:
Coupled Clustering: A Method for Detecting Structural Correspondence. J. Mach. Learn. Res. 3: 747-780 (2002) - [j27]Shai Fine, Ran Gilad-Bachrach
, Eli Shamir:
Query by committee, linear separation and random walks. Theor. Comput. Sci. 284(1): 25-51 (2002) - 1999
- [j26]Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman:
Learning with Queries Corrupted by Classification Noise. Discret. Appl. Math. 92(2-3): 157-175 (1999) - [j25]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): 684-719 (1999) - 1997
- [j24]Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby:
Selective Sampling Using the Query by Committee Algorithm. Mach. Learn. 28(2-3): 133-168 (1997) - 1994
- [j23]Andrei Z. Broder, Alan M. Frieze, Eli Shamir:
Finding Hidden Hamiltonian Cycles. Random Struct. Algorithms 5(3): 395-411 (1994) - [j22]Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal:
Near-perfect Token Distribution. Random Struct. Algorithms 5(4): 559-572 (1994) - 1993
- [j21]Rafi Levy, Eli Shamir:
A note on a counting problem arising in percolation theory. Discret. Math. 114(1-3): 361-365 (1993) - 1989
- [j20]Eli Shamir:
Chromatic Numbers of Random Hypergraphs and Associated Graphs. Adv. Comput. Res. 5: 127-142 (1989) - [j19]Eli Shamir, Assaf Schuster:
Communication Aspects of Networks Based on Geometric Incidence Relations. Theor. Comput. Sci. 64(1): 83-96 (1989) - 1987
- [j18]Eli Shamir, Joel Spencer:
Sharp concentration of the chromatic number on random graphs Gn, p. Comb. 7(1): 121-129 (1987) - [j17]Eli Shamir, Eli Upfal:
A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems. J. Parallel Distributed Comput. 4(5): 521-530 (1987) - 1985
- [j16]Jeanette P. Schmidt, Eli Shamir:
Component structure in the evolution of random hypergraphs. Comb. 5(1): 81-94 (1985) - [j15]Jakob Gonczarowski, Eliahu Shamir:
Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style. J. Comput. Syst. Sci. 30(3): 249-273 (1985) - [j14]Jeanette Schmidt-Pruzan, Eli Shamir, Eli Upfal:
Random hypergraph coloring algorithms and the weak chromatic number. J. Graph Theory 9(3): 347-362 (1985) - 1984
- [j13]Eli Shamir, Eli Upfal:
Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces. J. Algorithms 5(4): 488-501 (1984) - 1983
- [j12]Eli Shamir:
How many random edges make a graph Hamiltonian?. Comb. 3(1): 123-131 (1983) - [j11]Jeanette P. Schmidt, Eli Shamir:
A threshold for perfect matchings in random d-pure hypergraphs. Discret. Math. 45(2-3): 287-295 (1983) - [j10]Dan Gordon, Eliahu Shamir:
Computation of Recursive Functionals Using Minimal Initial Segments. Theor. Comput. Sci. 23: 305-315 (1983) - 1982
- [j9]Eli Shamir, Eli Upfal:
One-factor in random graphs based on vertex choice. Discret. Math. 41(3): 281-286 (1982) - 1980
- [j8]Eli Shamir, Marc Snir:
On the Depth Complexity of Formulas. Math. Syst. Theory 13: 301-322 (1980) - [j7]Haim Gaifman, Eli Shamir:
Roots of the hardest context free language and other constructs. SIGACT News 12(3): 45-51 (1980) - 1978
- [j6]Danny Dolev, Eliahu Shamir:
Commutation Relations of Slices Characterize Some Synchronization Primitives. Inf. Process. Lett. 7(1): 7-9 (1978) - 1976
- [j5]Amnon Barak, Eliahu Shamir:
On the Parallel Evaluation of Boolean Expressions. SIAM J. Comput. 5(4): 678-681 (1976) - 1971
- [j4]Eliahu Shamir:
Some Inherently Ambiguous Context-Free Languages. Inf. Control. 18(4): 355-363 (1971) - 1967
- [j3]Eliahu Shamir:
A Representation Theorem for Algebraic and Context-Free Power Series in Noncommuting Variables. Inf. Control. 11(1/2): 239-254 (1967) - 1963
- [j2]Micha A. Perles, Michael O. Rabin, Eliahu Shamir:
The Theory of Definite Automata. IEEE Trans. Electron. Comput. 12(3): 233-243 (1963) - 1962
- [j1]Eli Shamir:
A Remark on Discovery Algorithms for Grammars. Inf. Control. 5(3): 246-251 (1962)
Conference and Workshop Papers
- 2018
- [c23]Eli Shamir:
Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects. LATA 2018: 60-67 - 2013
- [c22]Eli Shamir:
Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars. LATA 2013: 516-522 - 2006
- [c21]Beata Beigman Klebanov, Eli Shamir:
On Lexical Cohesive Behavior of Heads of Definite Descriptions: A Case Study. NLUCS 2006: 109-119 - 2005
- [c20]Zvika Marx, Ido Dagan, Eli Shamir:
A Generalized Framework for Revealing Analogous Themes across Related Topics. HLT/EMNLP 2005: 979-986 - [c19]Beata Beigman Klebanov, Eli Shamir:
Lexical Cohesion: Some Implications of an Empirical Study. NLUCS 2005: 13-21 - 2003
- [c18]Zvika Marx, Ido Dagan, Eli Shamir:
Identifying Structure across Pre-partitioned Data. NIPS 2003: 489-496 - 2002
- [c17]Ido Dagan, Zvika Marx, Eli Shamir:
Cross-dataset Clustering: Revealing Corresponding Themes across Multiple Corpora. CoNLL 2002 - 2000
- [c16]Shoham Shamir, Orna Kupferman, Eli Shamir:
Branching-Depth Hierarchies. EXPRESS 2000: 65-78 - 1999
- [c15]Ran Bachrach, Shai Fine, Eli Shamir:
Query by Committee, Linear Separation and Random Walks. EuroCOLT 1999: 34-49 - 1997
- [c14]Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans Ulrich Simon:
Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. EuroCOLT 1997: 119-133 - [c13]Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman:
Learning with Queries Corrupted by Classification Noise. ISTCS 1997: 45-53 - 1995
- [c12]Eli Shamir, Clara Shwartzman:
Learning by extended statistical queries and its relation to PAC learning. EuroCOLT 1995: 357-366 - 1992
- [c11]Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal:
Near-perfect Token Distribution. ICALP 1992: 308-317 - [c10]Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby:
Information, Prediction, and Query by Committee. NIPS 1992: 483-490 - 1991
- [c9]Andrei Z. Broder, Alan M. Frieze, Eli Shamir:
Finding Hidden Hamiltonian Cycles (Extended Abstract). STOC 1991: 182-189 - 1988
- [c8]Craig Gotsman, Eli Shamir, Daniel Lehmann:
Asynchronous dynamics of random Boolean networks. ICNN 1988: 1-7 - 1987
- [c7]Andrei Z. Broder, Eli Shamir:
On the Second Eigenvalue of Random Regular Graphs (Preliminary Version). FOCS 1987: 286-294 - 1984
- [c6]Eli Shamir:
From Expanders to Better Superconcentrators without Cascading. STACS 1984: 121-128 - 1983
- [c5]Eli Shamir, Eli Upfal:
A Fast Construction oF Disjoint Paths in Communication Networks. FCT 1983: 428-438 - 1982
- [c4]Eli Shamir, Eli Upfal:
N-Processors Graph Distributively Achieve Perfect Matchings in O(log2N) Beats. PODC 1982: 238-241 - 1981
- [c3]Z. Aviad, Eli Shamir:
A Direct Dynamic Solution to Range Search and Related Problems for Product Regions. FOCS 1981: 123-126 - 1980
- [c2]Jeanette P. Schmidt, Eli Shamir:
An Improved Program for Constructing Open Hash Tables. ICALP 1980: 569-581 - 1974
- [c1]Eli Shamir, Catriel Beeri:
Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages. ICALP 1974: 27-33
Editorship
- 1994
- [e1]Serge Abiteboul, Eli Shamir:
Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings. Lecture Notes in Computer Science 820, Springer 1994, ISBN 3-540-58201-0 [contents]
Informal and Other Publications
- 1999
- [i1]Zvika Marx, Ido Dagan, Eli Shamir:
Detecting Sub-Topic Correspondence through Bipartite Term Clustering. CoRR cs.CL/9908001 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
