The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eli Shamir: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.031secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002