175 citations
- Oranim Academic College of EducationIL23 papers
- Technion – Israel Institute of TechnologyIL13 papers
- Carmel (Israel)IL4 papers
- Nankai UniversityCN4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- Dalian Maritime UniversityCN3 papers
- Hebrew University of JerusalemIL3 papers
- Centrum Wiskunde & InformaticaNL2 papers
- Georgia Institute of TechnologyUS2 papers
- Royal Holloway University of LondonGB2 papers
- University of IcelandIS2 papers
- University of Notre DameUS2 papers
13 papers · 1 filter
Some characterizations of singular components of Springer fibers in the two-column case
Lucas Fresse, Anna Melnikov
Let be a nilpotent endomorphism of a finite dimensional -vector space. The set of -stable complete flags is a projective algebraic variety calle…
Sub-Gaussian tails for the number of triangles in G(n,p)
Guy Wolfovitz
Let X be the random variable that counts the number of triangles in the random graph G(n,p). We show that for some absolute constant c, the probability that X deviates from its exp…
Woodroofe's one-armed bandit problem revisited
Alexander Goldenshluger, Assaf Zeevi
We consider the one-armed bandit problem of Woodroofe [J. Amer. Statist. Assoc. 74 (1979) 799--806], which involves sequential sampling from two populations: one whose characterist…
Parametric packing of selfish items and the subset sum algorithm
Leah Epstein, Elena Kleiman, Julian Mestre
The subset sum algorithm is a natural heuristic for the classical Bin Packing problem: In each iteration, the algorithm finds among the unpacked items, a maximum size set of items…
On Linear Differential Equations Involving a Para-Grassmann Variable
Toufik Mansour, Matthias Schork
As a first step towards a theory of differential equations involving para-Grassmann variables the linear equations with constant coefficients are discussed and solutions for equati…
Bin packing with general cost structures
Leah Epstein, Asaf Levin
Following the work of Anily et al., we consider a variant of bin packing, called "bin packing with general cost structures" (GCBP) and design an asymptotic fully polynomial time ap…