| Publication | Date of Publication | Type |
|---|
| Adversarially robust streaming algorithms via differential privacy | 2024-06-06 | Paper |
| Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds | 2023-12-08 | Paper |
| Optimal Broadcast with Partial Knowledge | 2023-12-01 | Paper |
| Differentially private learning of geometric concepts | 2022-07-22 | Paper |
| Bayesian exploration: incentivizing exploration in Bayesian games | 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 | 2021-01-08 | Paper |
| Optimal smoothing schedules for real-time streams | 2020-12-04 | Paper |
| Randomized interpolation and approximation of sparse polynomials stPreliminary version | 2019-12-04 | Paper |
| Fair leader election for rational agents in asynchronous rings and networks | 2019-09-19 | Paper |
| Regret minimization for reserve prices in second-price auctions | 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) | 2019-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4617612 | 2019-02-06 | Paper |
| Learning decision trees with stochastic linear classifiers | 2019-02-06 | Paper |
| The strategy of experts for repeated predictions | 2019-01-30 | Paper |
| Sublinear graph augmentation for fast query implementation | 2019-01-15 | Paper |
| Competitive buffer management for shared-memory switches | 2018-11-05 | Paper |
| Upward max-min fairness | 2018-08-02 | Paper |
| Making the Most of Your Samples | 2018-05-18 | Paper |
| Constant-time local computation algorithms | 2018-04-12 | Paper |
| Scheduling multipacket frames with frame deadlines | 2018-02-28 | Paper |
| Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback | 2017-12-08 | Paper |
| Repeated budgeted second price ad auction | 2017-11-07 | Paper |
| Robust probabilistic inference | 2017-10-05 | Paper |
| An Ω(D log(N/D)) lower bound for broadcast in radio networks | 2017-09-29 | Paper |
| Regret Minimization for Reserve Prices in Second-Price Auctions | 2017-04-28 | Paper |
| History-independent distributed multi-agent learning | 2016-09-29 | Paper |
| On the learnability of discrete distributions | 2016-09-01 | Paper |
| Weakly learning DNF and characterizing statistical query learning using Fourier analysis | 2016-09-01 | Paper |
| Trade-offs between communication throughput and parallel time | 2016-09-01 | Paper |
| On construction of \(k\)-wise independent random variables | 2016-09-01 | Paper |
| Learning conjunctions with noise under product distributions | 2016-06-09 | Paper |
| A tight bound for approximating the square root | 2016-05-26 | Paper |
| Lower bounds on individual sequence regret | 2016-05-19 | Paper |
| Robust option pricing: Hannan and Blackwell meet Black and Scholes | 2016-05-11 | Paper |
| Competitive dynamic bandwidth allocation | 2016-03-02 | Paper |
| Constant-Time Local Computation Algorithms | 2016-02-26 | Paper |
| Online allocation and pricing with economies of scale | 2016-01-08 | Paper |
| Scheduling multipacket frames with frame deadlines | 2016-01-08 | Paper |
| Robust inference and local algorithms | 2015-09-16 | Paper |
| Randomness in private computations | 2015-09-11 | Paper |
| Adapting to a reliable network path | 2015-09-04 | Paper |
| Adaptive AIMD congestion control | 2015-09-04 | Paper |
| Competitive on-line paging strategies for mobile users under delay constraints | 2015-08-03 | Paper |
| Greedy packet scheduling on shortest paths (preliminary version) | 2015-06-19 | Paper |
| Broadcast with partial knowledge (preliminary version) | 2015-06-19 | Paper |
| Time optimal self-stabilizing synchronization | 2015-05-07 | Paper |
| Lower bounds for randomized mutual exclusion | 2015-05-07 | Paper |
| Optimal smoothing schedules for real-time streams (extended abstract) | 2015-03-03 | Paper |
| Online set packing and competitive scheduling of multi-part tasks | 2015-03-02 | Paper |
| Buffer overflow management in QoS switches | 2015-02-27 | Paper |
| Robust domain adaptation | 2015-02-05 | Paper |
| On the convergence of regret minimization dynamics in concave games | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934596 | 2014-12-18 | Paper |
| Strong price of anarchy | 2014-12-18 | Paper |
| Online trading algorithms and robust option pricing | 2014-11-25 | Paper |
| Fast convergence of selfish rerouting | 2014-10-13 | Paper |
| Welfare and profit maximization with production costs | 2014-07-30 | Paper |
| On the equilibria of alternating move games | 2014-05-22 | Paper |
| Competitive router scheduling with structured data | 2014-03-27 | Paper |
| A Local Computation Approximation Scheme to Maximum Matching | 2013-10-04 | Paper |
| Scheduling Subset Tests: One-Time, Continuous, and How They Relate | 2013-10-04 | Paper |
| Converting online algorithms to local computation algorithms | 2013-08-12 | Paper |
| Strictly-black-box zero-knowledge and efficient validation of financial transactions | 2013-08-12 | Paper |
| Circumventing the price of anarchy: leading dynamics to good behavior | 2013-07-04 | Paper |
| Online set packing | 2012-11-29 | Paper |
| Lower bounds on individual sequence regret | 2012-10-16 | Paper |
| Reliable agnostic learning | 2012-08-17 | Paper |
| Competitive router scheduling with structured data | 2012-07-16 | Paper |
| The load-distance balancing problem | 2012-06-18 | Paper |
| Repeated budgeted second price ad auction | 2011-10-28 | Paper |
| Pricing exotic derivatives using regret minimization | 2011-10-28 | Paper |
| Regret minimization algorithms for pricing lookback options | 2011-10-19 | 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 |
| https://portal.mardi4nfdi.de/entity/Q3093180 | 2011-10-12 | Paper |
| Concentration bounds for unigram language models | 2011-10-12 | Paper |
| Combining online algorithms for acceptance and rejection | 2011-05-24 | Paper |
| Online Markov decision processes | 2011-04-27 | Paper |
| On nash equilibria for a network creation game | 2010-08-16 | Paper |
| Learning with attribute costs | 2010-08-16 | Paper |
| Convergence time to Nash equilibrium in load balancing | 2010-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579445 | 2010-08-06 | Paper |
| How long to equilibrium? The communication complexity of uncoupled equilibrium procedures | 2010-05-25 | Paper |
| Approximate equivalence of Markov decision processes. | 2010-03-23 | Paper |
| Buffer overflows of merging streams | 2010-03-03 | Paper |
| Improved competitive guarantees for QoS buffering | 2010-03-03 | Paper |
| Competitive management of non-preemptive queues with multiple values | 2010-02-23 | Paper |
| Strong equilibrium in cost sharing connection games | 2009-08-27 | Paper |
| Almost \(k\)-wise independence versus \(k\)-wise independence | 2009-07-09 | Paper |
| Efficient graph topologies in network routing games | 2009-06-08 | Paper |
| Active sampling for multiple output identification | 2009-03-31 | Paper |
| Regret to the best vs. regret to the average | 2009-03-31 | Paper |
| Strong price of anarchy | 2009-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549631 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302087 | 2009-01-05 | Paper |
| Agnostically Learning Halfspaces | 2008-12-22 | Paper |
| Reducing mechanism design to algorithm design via machine learning | 2008-12-12 | Paper |
| Learning, regret minimization, and equilibria | 2008-09-12 | Paper |
| Combining Multiple Heuristics | 2008-03-19 | Paper |
| Regret to the Best vs. Regret to the Average | 2008-01-03 | Paper |
| Improved second-order bounds for prediction with expert advice | 2007-09-20 | Paper |
| Active Sampling for Multiple Output Identification | 2007-09-14 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Improved competitive guarantees for QoS buffering | 2006-03-21 | Paper |
| Adaptive AIMD congestion control | 2006-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4680177 | 2005-10-07 | Paper |
| Computation in Noisy Radio Networks | 2005-09-16 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Competitive queue policies for differentiated services | 2005-06-30 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| Buffer Overflow Management in QoS Switches | 2005-02-21 | Paper |
| Harmonic buffer management policy for shared memory switches | 2004-11-23 | Paper |
| Generalization bounds for averaged classifiers | 2004-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046711 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471370 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449199 | 2004-02-08 | Paper |
| Centralized broadcast in multihop radio networks | 2003-08-13 | Paper |
| Loss-bounded analysis for differentiated services | 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. | 2003-05-25 | Paper |
| Simple Learning Algorithms for Decision Trees and Multivariate Polynomials | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148830 | 2002-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148823 | 2002-09-22 | Paper |
| A sparse sampling algorithm for near-optimal planning in large Markov decision processes | 2002-07-08 | Paper |
| Boosting using branching programs | 2002-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234111 | 2002-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234072 | 2001-08-27 | Paper |
| Implementation issues in the Fourier transform algorithm | 2001-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517680 | 2001-03-11 | Paper |
| Learning with maximum-entropy distributions | 2001-01-01 | Paper |
| On the boosting ability of top-down decision tree learning algorithms | 2000-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252718 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252715 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252724 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232879 | 2000-01-10 | Paper |
| Bandwidth Allocation with Preemption | 1999-10-28 | Paper |
| Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250187 | 1999-06-17 | Paper |
| Trade-offs between communication throughput and parallel time | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217805 | 1999-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228501 | 1999-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228458 | 1999-03-01 | Paper |
| Lower Bounds for Randomized Mutual Exclusion | 1998-09-21 | Paper |
| Optimal Broadcast with Partial Knowledge | 1998-09-21 | Paper |
| An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks | 1998-05-10 | Paper |
| Randomness in Private Computations | 1998-02-09 | Paper |
| On construction of \(k\)-wise independent random variables | 1998-01-05 | Paper |
| Online learning versus offline learning | 1997-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341730 | 1997-06-18 | Paper |
| Efficient On-Line Call Control Algorithms | 1997-04-27 | Paper |
| Slide—The Key to Polynomial End-to-End Communication | 1997-03-18 | Paper |
| \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials | 1997-02-28 | Paper |
| A construction of a cipher from a single pseudorandom permutation. | 1997-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886093 | 1996-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4839061 | 1996-09-15 | Paper |
| Randomized Interpolation and Approximation of Sparse Polynomials | 1995-11-02 | Paper |
| A parameterization scheme for classifying models of PAC learnability | 1995-10-29 | Paper |
| A lower bound for integer greatest common divisor computations | 1995-08-31 | Paper |
| An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution | 1995-08-15 | Paper |
| On Lotteries with Unique Winners | 1995-05-04 | Paper |
| Greedy Packet Scheduling | 1995-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314029 | 1994-11-30 | Paper |
| Learning Decision Trees Using the Fourier Spectrum | 1994-11-24 | Paper |
| The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels | 1994-08-21 | Paper |
| Constant depth circuits, Fourier transform, and learnability | 1993-12-09 | Paper |
| IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS | 1993-10-24 | Paper |
| Fast exponentiation using the truncation operation | 1993-06-29 | Paper |
| Greedy Packet Scheduling on Shortest Paths | 1993-06-29 | Paper |
| The computational complexity of universal hashing | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013546 | 1992-09-27 | Paper |
| Lower Bounds for Computations with the Floor Operation | 1991-01-01 | Paper |
| Results on learnability and the Vapnik-Chervonenkis dimension | 1991-01-01 | Paper |
| Sorting on a ring of processors | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732103 | 1989-01-01 | Paper |
| Bit complexity of order statistics on a distributed star network | 1989-01-01 | Paper |
| Finding the edge connectivity of directed graphs | 1989-01-01 | Paper |
| Language complexity on the synchronous anonymous ring | 1987-01-01 | Paper |
| On the bit complexity of distributed computations in a ring with a leader | 1987-01-01 | Paper |
