The following pages link to Eli Shamir (Q685696):
Displaying 16 items.
- A note on a counting problem arising in percolation theory (Q685697) (← links)
- Connectivity and dynamics for random subgraphs of the directed cube (Q690072) (← links)
- How many random edges make a graph Hamiltonian? (Q1055442) (← links)
- Component structure in the evolution of random hypergraphs (Q1063043) (← links)
- Communication aspects of networks based on geometric incidence relations (Q1119610) (← links)
- Learning with queries corrupted by classification noise (Q1304475) (← links)
- Selective sampling using the query by committee algorithm (Q1369065) (← links)
- Query by committee, linear separation and random walks. (Q1603591) (← links)
- Reshaping the context-free model: linguistic and algorithmic aspects (Q1647675) (← links)
- A threshold for perfect matchings in random d-pure hypergraphs (Q1839262) (← links)
- (Q3137187) (← links)
- Sample-efficient strategies for learning in the presence of noise (Q3158555) (← links)
- (Q3217612) (← links)
- (Q3332260) (← links)
- Satisfiability Decay along Conjunctions of Pseudo-Random Clauses (Q3424123) (← links)
- 10.1162/jmlr.2003.3.4-5.747 (Q4656009) (← links)
