BibSLEIGH — Yishay

Travelled to:

1 × Austria
1 × China
1 × France
1 × Greece
1 × The Netherlands
1 × United Kingdom
14 × USA
2 × Canada
2 × Italy

Collaborated with:

M.J.Kearns E.Kushilevitz E.Even-Dar ∅ B.Patt-Shamir B.Schieber S.Mannor N.Nisan P.Tiwari A.Blum M.O.Rabin S.Hart A.Kesselman S.Kutten E.Hazan R.Livni A.Gopalan N.Balcan U.Nadav A.T.Kalai E.Verbin P.DeMarzo I.Kremer H.Kaplan T.G.Dietterich Y.Afek Z.Ostfeld U.Vishkin A.Rubinstein S.Vardi N.Xie S.Muthukrishnan M.Yung D.Zuckerman A.Bar-Noy R.Canetti B.Awerbuch G.Varghese Z.Lotker M.Sviridenko M.L.Furst J.C.Jackson S.Rudich D.Ron R.Rubinfeld R.E.Schapire L.Sellie D.Bernstein D.Q.Goldin M.C.Golumbic H.Krawczyk I.Nahshon R.Y.Pinter

Talks about:

learn (9) algorithm (6) complex (4) decis (4) tree (4) time (4) converg (3) comput (3) optim (3) onlin (3)

Person: Yishay Mansour

DBLP: Mansour:Yishay

Contributed to:

2015

2014

2013

2012

2009

2008

2007

2006

2005

2003

2001

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

Wrote 30 papers:

ICML-2015-HazanLM #classification #rank: Classification with Low Rank and Missing Data (EH, RL, YM), pp. 257–266.
ICML-c1-2014-GopalanMM #online #problem: Thompson Sampling for Complex Online Problems (AG, SM, YM), pp. 100–108.
ICML-c3-2013-BalcanBM #learning #ontology: Exploiting Ontology Structures and Unlabeled Data for Learning (NB, AB, YM), pp. 1112–1120.
ICALP-v1-2012-MansourRVX #algorithm #online: Converting Online Algorithms to Local Computation Algorithms (YM, AR, SV, NX), pp. 653–664.
ICALP-v1-2012-RabinMMY #performance #strict #transaction #validation: Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions (MOR, YM, SM, MY), pp. 738–749.
STOC-2009-Even-DarMN #convergence #game studies #on the: On the convergence of regret minimization dynamics in concave games (EED, YM, UN), pp. 523–532.
STOC-2008-KalaiMV #learning #on the: On agnostic boosting and parity learning (ATK, YM, EV), pp. 629–638.
STOC-2007-HartM #communication #complexity #equilibrium #nash: The communication complexity of uncoupled nash equilibrium procedures (SH, YM), pp. 345–353.
STOC-2006-DeMarzoKM #algorithm #online #robust: Online trading algorithms and robust option pricing (PD, IK, YM), pp. 477–486.
STOC-2005-KaplanKM #learning: Learning with attribute costs (HK, EK, YM), pp. 356–365.
ICALP-2003-Even-DarKM #convergence #nash: Convergence Time to Nash Equilibria (EED, AK, YM), pp. 502–513.
ICML-2003-Even-DarMM #learning: Action Elimination and Stopping Conditions for Reinforcement Learning (EED, SM, YM), pp. 162–169.
STOC-2001-KesselmanLMPSS: Buffer overflow management in QoS switches (AK, ZL, YM, BPS, BS, MS), pp. 520–529.
ICML-1998-KearnsM #algorithm #bottom-up #performance: A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization (MJK, YM), pp. 269–277.
ICML-1997-Mansour: Pessimistic decision tree pruning based Continuous-time (YM), pp. 202–210.
ICML-1996-DietterichKM #framework #learning: Applying the Waek Learning Framework to Understand and Improve C4.5 (TGD, MJK, YM), pp. 96–104.
STOC-1996-AfekMO #algorithm #complexity #convergence: Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (YA, YM, ZO), pp. 89–98.
STOC-1996-KearnsM #algorithm #learning #on the #top-down: On the Boosting Ability of Top-Down Decision Tree Learning Algorithms (MJK, YM), pp. 459–468.
STOC-1995-Bar-NoyCKMS: Bandwidth allocation with preemption (ABN, RC, SK, YM, BS), pp. 616–625.
STOC-1995-MansourP: Many-to-one packet routing on grids (YM, BPS), pp. 258–267.
STOC-1994-BlumFJKMR #analysis #fourier #learning #query #statistics #using: Weakly learning DNF and characterizing statistical query learning using Fourier analysis (AB, MLF, JCJ, MJK, YM, SR), pp. 253–262.
STOC-1994-KearnsMRRSS #on the: On the learnability of discrete distributions (MJK, YM, DR, RR, RES, LS), pp. 273–282.
STOC-1994-MansourNV #communication #parallel #throughput #trade-off: Trade-offs between communication throughput and parallel time (YM, NN, UV), pp. 372–381.
STOC-1993-AwerbuchKMPV #self: Time optimal self-stabilizing synchronization (BA, SK, YM, BPS, GV), pp. 652–661.
STOC-1993-KushilevitzMRZ #bound #random: Lower bounds for randomized mutual exclusion (EK, YM, MOR, DZ), pp. 154–163.
ICALP-1992-Mansour #approximate #random: Randomized Interpolation and Approximation of Sparse Polynomials (YM), pp. 261–272.
STOC-1991-KushilevitzM #fourier #learning #using: Learning Decision Trees Using the Fourier Sprectrum (EK, YM), pp. 455–464.
STOC-1990-MansourNT #complexity: The Computational Complexity of Universal Hashing (YM, NN, PT), pp. 235–243.
ICALP-1989-MansourST #bound: Lower Bounds for Computations with the Floor Operation (YM, BS, PT), pp. 559–573.
PLDI-1989-BernsteinGGKMNP #compilation #optimisation: Spill Code Minimization Techniques for Optimizing Compilers (DB, DQG, MCG, HK, YM, IN, RYP), pp. 258–263.