| 2006 |
|---|
| 37 | | Beata Beigman Klebanov,
Eli Shamir:
On Lexical Cohesive Behavior of Heads of Definite Descriptions: A Case Study.
NLUCS 2006: 109-119 |
| 36 | EE | Eli Shamir:
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses.
Logic Journal of the IGPL 14(5): 815-825 (2006) |
| 2005 |
|---|
| 35 | EE | Zvika Marx,
Ido Dagan,
Eli Shamir:
A Generalized Framework for Revealing Analogous Themes across Related Topics.
HLT/EMNLP 2005 |
| 34 | | Beata Beigman Klebanov,
Eli Shamir:
Lexical Cohesion: Some Implications of an Empirical Study.
NLUCS 2005: 13-21 |
| 2003 |
|---|
| 33 | EE | Zvika Marx,
Ido Dagan,
Eli Shamir:
Identifying Structure across Pre-partitioned Data.
NIPS 2003 |
| 2002 |
|---|
| 32 | EE | Zvika Marx,
Ido Dagan,
Joachim M. Buhmann,
Eli Shamir:
Coupled Clustering: A Method for Detecting Structural Correspondence.
Journal of Machine Learning Research 3: 747-780 (2002) |
| 31 | EE | Shai Fine,
Ran Gilad-Bachrach,
Eli Shamir:
Query by committee, linear separation and random walks.
Theor. Comput. Sci. 284(1): 25-51 (2002) |
| 2000 |
|---|
| 30 | EE | Shoham Shamir,
Orna Kupferman,
Eli Shamir:
Branching-Depth Hierarchies.
Electr. Notes Theor. Comput. Sci. 39(1): (2000) |
| 1999 |
|---|
| 29 | EE | Ran Bachrach,
Shai Fine,
Eli Shamir:
Query by Committee, Linear Separation and Random Walks.
EuroCOLT 1999: 34-49 |
| 28 | EE | Zvika Marx,
Ido Dagan,
Eli Shamir:
Detecting Sub-Topic Correspondence through Bipartite Term Clustering
CoRR cs.CL/9908001: (1999) |
| 27 | EE | Jeffrey C. Jackson,
Eli Shamir,
Clara Shwartzman:
Learning with Queries Corrupted by Classification Noise.
Discrete Applied Mathematics 92(2-3): 157-175 (1999) |
| 26 | EE | 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 |
|---|
| 25 | | Nicolò Cesa-Bianchi,
Paul Fischer,
Eli Shamir,
Hans-Ulrich Simon:
Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise.
EuroCOLT 1997: 119-133 |
| 24 | EE | Jeffrey C. Jackson,
Eli Shamir,
Clara Shwartzman:
Learning with Queries Corrupted by Classification Noise.
ISTCS 1997: 45-53 |
| 23 | | Yoav Freund,
H. Sebastian Seung,
Eli Shamir,
Naftali Tishby:
Selective Sampling Using the Query by Committee Algorithm.
Machine Learning 28(2-3): 133-168 (1997) |
| 1995 |
|---|
| 22 | | Eli Shamir,
Clara Shwartzman:
Learning by extended statistical queries and its relation to PAC learning.
EuroCOLT 1995: 357-366 |
| 1994 |
|---|
| 21 | | Serge Abiteboul,
Eli Shamir:
Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings
Springer 1994 |
| 20 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Shamir:
Finding Hidden Hamiltonian Cycles.
Random Struct. Algorithms 5(3): 395-411 (1994) |
| 19 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Shamir,
Eli Upfal:
Near-perfect Token Distribution.
Random Struct. Algorithms 5(4): 559-572 (1994) |
| 1993 |
|---|
| 18 | EE | Rafi Levy,
Eli Shamir:
A note on a counting problem arising in percolation theory.
Discrete Mathematics 114(1-3): 361-365 (1993) |
| 1992 |
|---|
| 17 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Shamir,
Eli Upfal:
Near-perfect Token Distribution.
ICALP 1992: 308-317 |
| 16 | EE | Yoav Freund,
H. Sebastian Seung,
Eli Shamir,
Naftali Tishby:
Information, Prediction, and Query by Committee.
NIPS 1992: 483-490 |
| 1991 |
|---|
| 15 | | Andrei Z. Broder,
Alan M. Frieze,
Eli Shamir:
Finding Hidden Hamiltonian Cycles (Extended Abstract)
STOC 1991: 182-189 |
| 1989 |
|---|
| 14 | | Eli Shamir,
Assaf Schuster:
Communication Aspects of Networks Based on Geometric Incidence Relations.
Theor. Comput. Sci. 64(1): 83-96 (1989) |
| 1987 |
|---|
| 13 | | Andrei Z. Broder,
Eli Shamir:
On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)
FOCS 1987: 286-294 |
| 12 | | Eli Shamir,
Joel Spencer:
Sharp concentration of the chromatic number on random graphs Gn, p.
Combinatorica 7(1): 121-129 (1987) |
| 11 | | Eli Shamir,
Eli Upfal:
A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems.
J. Parallel Distrib. Comput. 4(5): 521-530 (1987) |
| 1985 |
|---|
| 10 | | Jeanette P. Schmidt,
Eli Shamir:
Component structure in the evolution of random hypergraphs.
Combinatorica 5(1): 81-94 (1985) |
| 1984 |
|---|
| 9 | | Eli Shamir:
From Expanders to Better Superconcentrators without Cascading.
STACS 1984: 121-128 |
| 8 | | 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 |
|---|
| 7 | | Eli Shamir,
Eli Upfal:
A Fast Construction oF Disjoint Paths in Communication Networks.
FCT 1983: 428-438 |
| 6 | | Eli Shamir:
How many random edges make a graph Hamiltonian?.
Combinatorica 3(1): 123-131 (1983) |
| 5 | EE | Jeanette P. Schmidt,
Eli Shamir:
A threshold for perfect matchings in random d-pure hypergraphs.
Discrete Mathematics 45(2-3): 287-295 (1983) |
| 1982 |
|---|
| 4 | | Eli Shamir,
Eli Upfal:
N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) Beats.
PODC 1982: 238-241 |
| 3 | EE | Eli Shamir,
Eli Upfal:
One-factor in random graphs based on vertex choice.
Discrete Mathematics 41(3): 281-286 (1982) |
| 1980 |
|---|
| 2 | | Jeanette P. Schmidt,
Eli Shamir:
An Improved Program for Constructing Open Hash Tables.
ICALP 1980: 569-581 |
| 1 | | Eli Shamir,
Marc Snir:
On the Depth Complexity of Formulas.
Mathematical Systems Theory 13: 301-322 (1980) |
