Publication | Date of Publication | Type |
---|
Distributed computing with the Cloud | 2024-04-09 | Paper |
Non-linear ski rental | 2023-10-30 | Paper |
Competitive vertex recoloring. (Online disengagement) | 2023-06-28 | Paper |
Proof-Labeling Schemes: Broadcast, Unicast and in Between | 2022-11-04 | Paper |
Proof-labeling schemes: broadcast, unicast and in between | 2022-06-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q5002725 | 2021-07-28 | Paper |
High entropy random selection protocols | 2021-03-26 | Paper |
With Great Speed Come Small Buffers | 2021-01-20 | Paper |
Optimal smoothing schedules for real-time streams | 2020-12-04 | Paper |
Nearly optimal perfectly periodic schedules | 2020-12-03 | Paper |
On-line path computation and function placement in SDNs | 2019-11-22 | Paper |
Randomized proof-labeling schemes | 2019-07-11 | Paper |
Stable secretaries | 2019-06-27 | Paper |
On-line path computation and function placement in SDNs | 2019-06-21 | Paper |
Distributed distance computation and routing with small messages | 2019-06-20 | Paper |
Near-Optimal Distributed Maximum Flow | 2018-12-05 | Paper |
Buffer size for routing limited-rate adversarial traffic | 2018-08-16 | Paper |
Improved Distributed Approximate Matching | 2018-08-02 | Paper |
Constant-time local computation algorithms | 2018-04-12 | Paper |
Distributed backup placement in networks | 2018-04-11 | Paper |
Scheduling multipacket frames with frame deadlines | 2018-02-28 | Paper |
Clique Here: On the Distributed Complexity in Fully-Connected Networks | 2017-12-15 | Paper |
The Space Requirement of Local Forwarding on Acyclic Networks | 2017-10-11 | Paper |
Time-adaptive self stabilization | 2017-09-29 | Paper |
A theory of clock synchronization (extended abstract) | 2016-09-01 | Paper |
Shrinking maxima, decreasing costs: new online packing and covering problems | 2016-05-31 | Paper |
Comparison-based interactive collaborative filtering | 2016-04-13 | Paper |
Near-Optimal Distributed Maximum Flow | 2016-03-23 | Paper |
Fast Partial Distance Estimation and Applications | 2016-03-23 | Paper |
Randomized Proof-Labeling Schemes | 2016-03-23 | Paper |
Nearly optimal perfectly-periodic schedules | 2016-03-04 | Paper |
Distributed MST for constant diameter graphs | 2016-03-04 | Paper |
Constant-Time Local Computation Algorithms | 2016-02-26 | Paper |
Scheduling Multipacket Frames with Frame Deadlines | 2016-01-08 | Paper |
Comparison-Based Interactive Collaborative Filtering | 2016-01-08 | Paper |
Optimal and efficient clock synchronization under drifting clocks | 2015-09-11 | Paper |
The round complexity of distributed sorting | 2015-09-11 | Paper |
Distributed error confinement | 2015-09-04 | Paper |
Improved distributed steiner forest construction | 2015-09-03 | Paper |
A note on efficient aggregate queries in sensor networks | 2015-08-03 | Paper |
Greedy packet scheduling on shortest paths (preliminary version) | 2015-06-19 | Paper |
Non-additive two-option ski rental | 2015-05-22 | Paper |
Time optimal self-stabilizing synchronization | 2015-05-07 | Paper |
Optimal smoothing schedules for real-time streams (extended abstract) | 2015-03-03 | Paper |
Average-case analysis of greedy packet scheduling (extended astract) | 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 |
Distributed error confinement | 2014-11-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q2921791 | 2014-10-13 | Paper |
Fast routing table construction using small messages | 2014-08-07 | Paper |
Nearly optimal FIFO buffer management for DiffServ | 2014-07-25 | Paper |
General perfectly periodic scheduling | 2014-07-25 | Paper |
Competitive router scheduling with structured data | 2014-03-27 | Paper |
Distributed approximate matching | 2014-03-13 | Paper |
Asynchronous recommendation systems | 2014-03-13 | Paper |
Competitive buffer management with packet dependencies | 2013-12-19 | Paper |
Non-Additive Two-Option Ski Rental | 2013-12-17 | Paper |
Online scheduling with interval conflicts | 2013-10-21 | Paper |
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems | 2013-10-04 | Paper |
Approximate distributed top-\(k\) queries | 2013-06-28 | Paper |
Distributed MST for constant diameter graphs | 2013-06-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4910746 | 2013-03-19 | Paper |
Finding similar users in social networks | 2012-12-10 | Paper |
Online Set Packing | 2012-11-29 | Paper |
Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental | 2012-09-12 | Paper |
Competitive Router Scheduling with Structured Data | 2012-07-16 | Paper |
Distributed approximation of cellular coverage | 2012-07-13 | Paper |
Vector bin packing with multiple-choice | 2012-06-18 | Paper |
Sparse reliable graph backbones | 2012-05-24 | Paper |
On the complexity of distributed stable matching with small messages | 2012-02-06 | Paper |
Distributed discovery of large near-cliques | 2012-02-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q3113712 | 2012-01-23 | Paper |
Improved Collaborative Filtering | 2011-12-16 | Paper |
Video distribution under multiple constraints | 2011-07-14 | Paper |
Sparse Reliable Graph Backbones | 2010-09-07 | Paper |
Vector Bin Packing with Multiple-Choice | 2010-06-22 | Paper |
Ski rental with two general options | 2010-06-09 | Paper |
Distributed Approximate Matching | 2010-04-29 | Paper |
Algorithms - ESA 2003 | 2010-03-03 | Paper |
Distributed Discovery of Large Near-Cliques | 2009-11-19 | Paper |
Tell me who I am: An interactive recommendation system | 2009-10-19 | Paper |
Approximate Top-k Queries in Sensor Networks | 2009-03-12 | Paper |
High Entropy Random Selection Protocols | 2009-02-17 | Paper |
A game of timing and visibility | 2008-05-08 | Paper |
Collaborate with strangers to find own preferences | 2008-02-18 | Paper |
A note on efficient aggregate queries in sensor networks | 2007-02-26 | Paper |
Distributed Computing | 2006-11-01 | Paper |
General perfectly periodic scheduling | 2006-08-11 | Paper |
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds | 2005-10-28 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
New Stability Results for Adversarial Queuing | 2005-02-21 | Paper |
Buffer Overflow Management in QoS Switches | 2005-02-21 | Paper |
Efficient algorithms for periodic scheduling | 2004-11-18 | Paper |
Dispatching in perfectly-periodic schedules | 2004-03-14 | Paper |
Nearly optimal FIFO buffer management for two packet classes. | 2003-08-07 | Paper |
Average-case analysis of greedy packet scheduling | 2003-05-04 | Paper |
A note on randomized mutual search. | 2002-07-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4234072 | 2001-08-27 | Paper |
The Las-Vegas Processor Identity Problem (How and When to Be Unique) | 2001-07-16 | Paper |
Exact Analysis of Exact Change: Thek-Payment Problem | 2001-03-19 | Paper |
Stabilizing time-adaptive protocols | 1999-06-21 | Paper |
A new approach to compiling adaptive programs | 1997-01-01 | Paper |
Time-space tradeoffs for set operations | 1993-08-30 | Paper |
Greedy Packet Scheduling on Shortest Paths | 1993-06-29 | Paper |