| Publication | Date of Publication | Type |
|---|
Adversarially robust streaming algorithms via differential privacy
Journal of the ACM | 2024-06-06 | Paper |
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Optimal Broadcast with Partial Knowledge
Distributed Algorithms | 2023-12-01 | Paper |
Differentially private learning of geometric concepts
SIAM Journal on Computing | 2022-07-22 | Paper |
Bayesian exploration: incentivizing exploration in Bayesian games
Operations Research | 2022-05-31 | Paper |
Separating adaptive streaming from oblivious streaming using the bounded storage model
| 2022-04-22 | Paper |
On price versus quality
| 2021-06-15 | Paper |
Competing bandits: learning under competition
| 2021-06-15 | Paper |
Bayesian Incentive-Compatible Bandit Exploration
Operations Research | 2021-01-08 | Paper |
Optimal smoothing schedules for real-time streams
Distributed Computing | 2020-12-04 | Paper |
Randomized interpolation and approximation of sparse polynomials stPreliminary version
Automata, Languages and Programming | 2019-12-04 | Paper |
Fair leader election for rational agents in asynchronous rings and networks
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Regret minimization for reserve prices in second-price auctions
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Beyond myopic best response (in Cournot competition)
| 2019-05-10 | Paper |
Improved equilibria via public service advertising
| 2019-05-06 | Paper |
Delay and cooperation in nonstochastic bandits
| 2019-05-02 | Paper |
Beyond myopic best response (in Cournot competition)
Games and Economic Behavior | 2019-03-29 | Paper |
scientific article; zbMATH DE number 7014202 (Why is no real title available?)
| 2019-02-06 | Paper |
Learning decision trees with stochastic linear classifiers
| 2019-02-06 | Paper |
The strategy of experts for repeated predictions
Web and Internet Economics | 2019-01-30 | Paper |
Sublinear graph augmentation for fast query implementation
| 2019-01-15 | Paper |
Competitive buffer management for shared-memory switches
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Upward max-min fairness
Journal of the ACM | 2018-08-02 | Paper |
Making the Most of Your Samples
SIAM Journal on Computing | 2018-05-18 | Paper |
Constant-time local computation algorithms
Theory of Computing Systems | 2018-04-12 | Paper |
Scheduling multipacket frames with frame deadlines
Journal of Scheduling | 2018-02-28 | Paper |
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
SIAM Journal on Computing | 2017-12-08 | Paper |
Repeated budgeted second price ad auction
Theory of Computing Systems | 2017-11-07 | Paper |
Robust probabilistic inference
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
An Ω(D log(N/D)) lower bound for broadcast in radio networks
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
Regret Minimization for Reserve Prices in Second-Price Auctions
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
History-independent distributed multi-agent learning
Algorithmic Game Theory | 2016-09-29 | Paper |
On the learnability of discrete distributions
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Trade-offs between communication throughput and parallel time
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
On construction of \(k\)-wise independent random variables
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Learning conjunctions with noise under product distributions
Information Processing Letters | 2016-06-09 | Paper |
A tight bound for approximating the square root
Information Processing Letters | 2016-05-26 | Paper |
Lower bounds on individual sequence regret
Machine Learning | 2016-05-19 | Paper |
Robust option pricing: Hannan and Blackwell meet Black and Scholes
Journal of Economic Theory | 2016-05-11 | Paper |
Competitive dynamic bandwidth allocation
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
Constant-Time Local Computation Algorithms
Approximation and Online Algorithms | 2016-02-26 | Paper |
Online allocation and pricing with economies of scale
Web and Internet Economics | 2016-01-08 | Paper |
Scheduling multipacket frames with frame deadlines
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Robust inference and local algorithms
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Randomness in private computations
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
Adapting to a reliable network path
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Adaptive AIMD congestion control
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Competitive on-line paging strategies for mobile users under delay constraints
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Greedy packet scheduling on shortest paths (preliminary version)
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Broadcast with partial knowledge (preliminary version)
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Lower bounds for randomized mutual exclusion
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Time optimal self-stabilizing synchronization
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Optimal smoothing schedules for real-time streams (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Buffer overflow management in QoS switches
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Robust domain adaptation
Annals of Mathematics and Artificial Intelligence | 2015-02-05 | Paper |
On the convergence of regret minimization dynamics in concave games
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
scientific article; zbMATH DE number 6381644 (Why is no real title available?)
| 2014-12-18 | Paper |
Strong price of anarchy
| 2014-12-18 | Paper |
Online trading algorithms and robust option pricing
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Fast convergence of selfish rerouting
| 2014-10-13 | Paper |
Welfare and profit maximization with production costs
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
On the equilibria of alternating move games
| 2014-05-22 | Paper |
Competitive router scheduling with structured data
Theoretical Computer Science | 2014-03-27 | Paper |
Scheduling Subset Tests: One-Time, Continuous, and How They Relate
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
A Local Computation Approximation Scheme to Maximum Matching
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Strictly-black-box zero-knowledge and efficient validation of financial transactions
Automata, Languages, and Programming | 2013-08-12 | Paper |
Converting online algorithms to local computation algorithms
Automata, Languages, and Programming | 2013-08-12 | Paper |
Circumventing the price of anarchy: leading dynamics to good behavior
SIAM Journal on Computing | 2013-07-04 | Paper |
Online set packing
SIAM Journal on Computing | 2012-11-29 | Paper |
Lower bounds on individual sequence regret
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Reliable agnostic learning
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Competitive router scheduling with structured data
Approximation and Online Algorithms | 2012-07-16 | Paper |
The load-distance balancing problem
Networks | 2012-06-18 | Paper |
Pricing exotic derivatives using regret minimization
Algorithmic Game Theory | 2011-10-28 | Paper |
Repeated budgeted second price ad auction
Algorithmic Game Theory | 2011-10-28 | Paper |
Regret minimization algorithms for pricing lookback options
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Concentration bounds for unigram language models
| 2011-10-12 | Paper |
Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems
| 2011-10-12 | Paper |
From external to internal regret
| 2011-10-12 | Paper |
scientific article; zbMATH DE number 5957196 (Why is no real title available?)
| 2011-10-12 | Paper |
Combining online algorithms for acceptance and rejection
Theory of Computing | 2011-05-24 | Paper |
Online Markov decision processes
Mathematics of Operations Research | 2011-04-27 | Paper |
On nash equilibria for a network creation game
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Learning with attribute costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms | 2010-08-14 | Paper |
scientific article; zbMATH DE number 5764852 (Why is no real title available?)
| 2010-08-06 | Paper |
How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
Games and Economic Behavior | 2010-05-25 | Paper |
Approximate equivalence of Markov decision processes.
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Buffer overflows of merging streams
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Improved competitive guarantees for QoS buffering
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Competitive management of non-preemptive queues with multiple values
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Strong equilibrium in cost sharing connection games
Games and Economic Behavior | 2009-08-27 | Paper |
Almost \(k\)-wise independence versus \(k\)-wise independence
Information Processing Letters | 2009-07-09 | Paper |
Efficient graph topologies in network routing games
Games and Economic Behavior | 2009-06-08 | Paper |
Active sampling for multiple output identification
Machine Learning | 2009-03-31 | Paper |
Regret to the best vs. regret to the average
Machine Learning | 2009-03-31 | Paper |
Strong price of anarchy
Games and Economic Behavior | 2009-03-24 | Paper |
scientific article; zbMATH DE number 5485576 (Why is no real title available?)
| 2009-01-05 | Paper |
scientific article; zbMATH DE number 5485469 (Why is no real title available?)
| 2009-01-05 | Paper |
Agnostically Learning Halfspaces
SIAM Journal on Computing | 2008-12-22 | Paper |
Reducing mechanism design to algorithm design via machine learning
Journal of Computer and System Sciences | 2008-12-12 | Paper |
Learning, regret minimization, and equilibria
| 2008-09-12 | Paper |
Combining Multiple Heuristics
STACS 2006 | 2008-03-19 | Paper |
Regret to the Best vs. Regret to the Average
Learning Theory | 2008-01-03 | Paper |
Improved second-order bounds for prediction with expert advice
Machine Learning | 2007-09-20 | Paper |
Active Sampling for Multiple Output Identification
Learning Theory | 2007-09-14 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Adaptive AIMD congestion control
Algorithmica | 2006-03-21 | Paper |
Improved competitive guarantees for QoS buffering
Algorithmica | 2006-03-21 | Paper |
scientific article; zbMATH DE number 2172789 (Why is no real title available?)
| 2005-10-07 | Paper |
Computation in Noisy Radio Networks
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Competitive queue policies for differentiated services
Journal of Algorithms | 2005-06-30 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing | 2005-02-21 | Paper |
Harmonic buffer management policy for shared memory switches
Theoretical Computer Science | 2004-11-23 | Paper |
Generalization bounds for averaged classifiers
The Annals of Statistics | 2004-09-15 | Paper |
scientific article; zbMATH DE number 2089367 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2079410 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 2038734 (Why is no real title available?)
| 2004-02-08 | Paper |
Centralized broadcast in multihop radio networks
Journal of Algorithms | 2003-08-13 | Paper |
Loss-bounded analysis for differentiated services
Journal of Algorithms | 2003-08-13 | Paper |
Loss-bounded analysis for differentiated services
| 2003-07-29 | Paper |
Diffusion without false rumors: On propagating updates in a Byzantine environment.
Theoretical Computer Science | 2003-05-25 | Paper |
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
SIAM Journal on Computing | 2003-01-05 | Paper |
scientific article; zbMATH DE number 1804121 (Why is no real title available?)
| 2002-09-22 | Paper |
scientific article; zbMATH DE number 1804127 (Why is no real title available?)
| 2002-09-22 | Paper |
A sparse sampling algorithm for near-optimal planning in large Markov decision processes
Machine Learning | 2002-07-08 | Paper |
Boosting using branching programs
Journal of Computer and System Sciences | 2002-07-04 | Paper |
scientific article; zbMATH DE number 1263238 (Why is no real title available?)
| 2002-02-03 | Paper |
scientific article; zbMATH DE number 1263201 (Why is no real title available?)
| 2001-08-27 | Paper |
Implementation issues in the Fourier transform algorithm
Machine Learning | 2001-04-26 | Paper |
scientific article; zbMATH DE number 1532274 (Why is no real title available?)
| 2001-03-11 | Paper |
Learning with maximum-entropy distributions
Machine Learning | 2001-01-01 | Paper |
On the boosting ability of top-down decision tree learning algorithms
Journal of Computer and System Sciences | 2000-06-05 | Paper |
scientific article; zbMATH DE number 1306863 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1306872 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1306866 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1263988 (Why is no real title available?)
| 2000-01-10 | Paper |
Bandwidth Allocation with Preemption
SIAM Journal on Computing | 1999-10-28 | Paper |
Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms
Journal of Algorithms | 1999-06-21 | Paper |
scientific article; zbMATH DE number 1303562 (Why is no real title available?)
| 1999-06-17 | Paper |
Trade-offs between communication throughput and parallel time
Journal of Complexity | 1999-05-11 | Paper |
scientific article; zbMATH DE number 1222296 (Why is no real title available?)
| 1999-04-27 | Paper |
scientific article; zbMATH DE number 1256723 (Why is no real title available?)
| 1999-03-01 | Paper |
scientific article; zbMATH DE number 1256765 (Why is no real title available?)
| 1999-03-01 | Paper |
Optimal Broadcast with Partial Knowledge
SIAM Journal on Computing | 1998-09-21 | Paper |
Lower Bounds for Randomized Mutual Exclusion
SIAM Journal on Computing | 1998-09-21 | Paper |
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing | 1998-05-10 | Paper |
Randomness in Private Computations
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
On construction of \(k\)-wise independent random variables
Combinatorica | 1998-01-05 | Paper |
Online learning versus offline learning
Machine Learning | 1997-12-17 | Paper |
scientific article; zbMATH DE number 1024042 (Why is no real title available?)
| 1997-06-18 | Paper |
Efficient On-Line Call Control Algorithms
Journal of Algorithms | 1997-04-27 | Paper |
Slide—The Key to Polynomial End-to-End Communication
Journal of Algorithms | 1997-03-18 | Paper |
\(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials
Information Processing Letters | 1997-02-28 | Paper |
A construction of a cipher from a single pseudorandom permutation.
Journal of Cryptology | 1997-01-01 | Paper |
scientific article; zbMATH DE number 910916 (Why is no real title available?)
| 1996-11-10 | Paper |
scientific article; zbMATH DE number 774007 (Why is no real title available?)
| 1996-09-15 | Paper |
Randomized Interpolation and Approximation of Sparse Polynomials
SIAM Journal on Computing | 1995-11-02 | Paper |
A parameterization scheme for classifying models of PAC learnability
Information and Computation | 1995-10-29 | Paper |
A lower bound for integer greatest common divisor computations
Journal of the ACM | 1995-08-31 | Paper |
An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution
Journal of Computer and System Sciences | 1995-08-15 | Paper |
On Lotteries with Unique Winners
SIAM Journal on Discrete Mathematics | 1995-05-04 | Paper |
Greedy Packet Scheduling
SIAM Journal on Computing | 1995-03-27 | Paper |
scientific article; zbMATH DE number 697813 (Why is no real title available?)
| 1994-11-30 | Paper |
Learning Decision Trees Using the Fourier Spectrum
SIAM Journal on Computing | 1994-11-24 | Paper |
The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels
Journal of the ACM | 1994-08-21 | Paper |
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM | 1993-12-09 | Paper |
IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS
International Journal of Computational Geometry & Applications | 1993-10-24 | Paper |
Greedy Packet Scheduling on Shortest Paths
Journal of Algorithms | 1993-06-29 | Paper |
Fast exponentiation using the truncation operation
Computational Complexity | 1993-06-29 | Paper |
The computational complexity of universal hashing
Theoretical Computer Science | 1993-05-16 | Paper |
scientific article; zbMATH DE number 67626 (Why is no real title available?)
| 1992-09-27 | Paper |
Lower Bounds for Computations with the Floor Operation
SIAM Journal on Computing | 1991-01-01 | Paper |
Results on learnability and the Vapnik-Chervonenkis dimension
Information and Computation | 1991-01-01 | Paper |
Sorting on a ring of processors
Journal of Algorithms | 1990-01-01 | Paper |
Bit complexity of order statistics on a distributed star network
Information Processing Letters | 1989-01-01 | Paper |
Finding the edge connectivity of directed graphs
Journal of Algorithms | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4117838 (Why is no real title available?)
| 1989-01-01 | Paper |
On the bit complexity of distributed computations in a ring with a leader
Information and Computation | 1987-01-01 | Paper |
Language complexity on the synchronous anonymous ring
Theoretical Computer Science | 1987-01-01 | Paper |
