The following pages link to Yishay Mansour (Q222241):
Displaying 50 items.
- Robust option pricing: Hannan and Blackwell meet Black and Scholes (Q281366) (← links)
- Lower bounds on individual sequence regret (Q285930) (← links)
- A tight bound for approximating the square root (Q287183) (← links)
- Learning conjunctions with noise under product distributions (Q293443) (← links)
- Reliable agnostic learning (Q439993) (← links)
- \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials (Q672974) (← links)
- Results on learnability and the Vapnik-Chervonenkis dimension (Q751859) (← links)
- Improved competitive guarantees for QoS buffering (Q818829) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures (Q972131) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Active sampling for multiple output identification (Q1009223) (← links)
- Regret to the best vs. regret to the average (Q1009274) (← links)
- Efficient graph topologies in network routing games (Q1021587) (← links)
- Almost \(k\)-wise independence versus \(k\)-wise independence (Q1028993) (← links)
- (Q1098289) (redirect page) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Language complexity on the synchronous anonymous ring (Q1102125) (← links)
- Bit complexity of order statistics on a distributed star network (Q1116337) (← links)
- The computational complexity of universal hashing (Q1208411) (← links)
- On the boosting ability of top-down decision tree learning algorithms (Q1305926) (← links)
- A construction of a cipher from a single pseudorandom permutation. (Q1364898) (← links)
- Online learning versus offline learning (Q1373713) (← links)
- On construction of \(k\)-wise independent random variables (Q1375059) (← links)
- Implementation issues in the Fourier transform algorithm (Q1579626) (← links)
- Boosting using branching programs (Q1604220) (← links)
- A sparse sampling algorithm for near-optimal planning in large Markov decision processes (Q1604816) (← links)
- Repeated budgeted second price ad auction (Q1678769) (← links)
- Scheduling multipacket frames with frame deadlines (Q1702660) (← links)
- Beyond myopic best response (in Cournot competition) (Q1735732) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- Sublinear graph augmentation for fast query implementation (Q1757769) (← links)
- Diffusion without false rumors: On propagating updates in a Byzantine environment. (Q1874396) (← links)
- Generalization bounds for averaged classifiers (Q1879971) (← links)
- Harmonic buffer management policy for shared memory switches (Q1887082) (← links)
- An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution (Q1894459) (← links)
- A parameterization scheme for classifying models of PAC learnability (Q1898473) (← links)
- Separating adaptive streaming from oblivious streaming using the bounded storage model (Q2128990) (← links)
- Robust domain adaptation (Q2254608) (← links)
- Fast exponentiation using the truncation operation (Q2366170) (← links)
- Improved second-order bounds for prediction with expert advice (Q2384131) (← links)
- Competitive router scheduling with structured data (Q2440162) (← links)
- Loss-bounded analysis for differentiated services (Q2768353) (← links)
- Constant-Time Local Computation Algorithms (Q2788995) (← links)
- Competitive dynamic bandwidth allocation (Q2790099) (← links)
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis (Q2817616) (← links)
- On the learnability of discrete distributions (Q2817618) (← links)
- On construction of \(k\)-wise independent random variables (Q2817651) (← links)
- History-Independent Distributed Multi-agent Learning (Q2819449) (← links)
