Eli Shamir

Available identifiers

zbMath Open shamir.eliDBLP48/4092WikidataQ10562274 ScholiaQ10562274MaRDI QIDQ685696

List of research outcomes

Publication	Date of Publication	Type
Near-perfect token distribution	2019-12-04	Paper
Two-Sided, Unbiased Version of Hall’s Marriage Theorem	2018-07-13	Paper
Reshaping the context-free model: linguistic and algorithmic aspects	2018-06-26	Paper
Almost optimal Boolean matrix multiplication [BMM]-by multi-encoding of rows and columns	2018-06-23	Paper
Completing Partial Latin Squares - Alternative Proof	2016-05-19	Paper
Branching-Depth Hierarchies	2013-04-26	Paper
Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars	2013-03-18	Paper
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses	2007-02-15	Paper
10.1162/jmlr.2003.3.4-5.747	2005-03-08	Paper
Sample-efficient strategies for learning in the presence of noise	2005-01-25	Paper
Query by committee, linear separation and random walks.	2002-07-15	Paper
Learning with queries corrupted by classification noise	1999-09-22	Paper
Selective sampling using the query by committee algorithm	1997-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q4697465	1995-07-20	Paper
Finding hidden hamiltonian cycles	1995-03-20	Paper
Near‐perfect token distribution	1994-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q3137187	1994-06-06	Paper
Connectivity and dynamics for random subgraphs of the directed cube	1993-12-07	Paper
A note on a counting problem arising in percolation theory	1993-10-24	Paper
Communication aspects of networks based on geometric incidence relations	1989-01-01	Paper
Component structure in the evolution of random hypergraphs	1985-01-01	Paper
Random hypergraph coloring algorithms and the weak chromatic number	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3217612	1985-01-01	Paper
Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3332260	1984-01-01	Paper
A threshold for perfect matchings in random d-pure hypergraphs	1983-01-01	Paper
How many random edges make a graph Hamiltonian?	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3664431	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3670591	1983-01-01	Paper
On the depth complexity of formulas	1980-01-01	Paper

Research outcomes over time

This page was built for person: Eli Shamir