Publication | Date of Publication | Type |
---|
Optimal Broadcast with Partial Knowledge | 2023-12-01 | Paper |
Low-diameter graph decomposition is in NC | 2022-12-09 | Paper |
Principles of Robust Medium Access and an Application to Leader Election | 2018-10-30 | Paper |
Memory-efficient and self-stabilizing network RESET (extended abstract) | 2017-09-29 | Paper |
Fast network decomposition | 2017-08-21 | Paper |
Minimizing the flow time without migration | 2016-09-29 | Paper |
Efficient asynchronous distributed symmetry breaking | 2016-09-01 | Paper |
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks | 2016-09-01 | Paper |
Optimal maintenance of a spanning tree | 2015-11-11 | Paper |
Peer-to-peer systems for prefix search | 2015-09-04 | Paper |
Adapting to a reliable network path | 2015-09-04 | Paper |
A general approach to online network optimization problems | 2015-09-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q5501273 | 2015-08-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5501312 | 2015-08-03 | Paper |
Broadcast with partial knowledge (preliminary version) | 2015-06-19 | Paper |
Efficient deadlock-free routing | 2015-06-19 | Paper |
Competitive distributed file allocation | 2015-05-07 | Paper |
Approximate load balancing on dynamic and asynchronous networks | 2015-05-07 | Paper |
Time optimal self-stabilizing synchronization | 2015-05-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q2934686 | 2014-12-18 | Paper |
A jamming-resistant MAC protocol for single-hop wireless networks | 2014-12-12 | Paper |
Stateless distributed algorithms for near optimal maximum multicommodity flows | 2014-12-12 | Paper |
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework | 2014-12-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q2921671 | 2014-10-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q2921791 | 2014-10-13 | Paper |
Greedy distributed optimization of multi-commodity flows | 2014-03-13 | Paper |
Distributed network monitoring and multicommodity flows | 2014-03-13 | Paper |
Minimizing the total cost of network measurements in a distributed manner | 2014-03-13 | Paper |
On cost sharing mechanisms in the network design game | 2014-03-13 | Paper |
Asynchronous recommendation systems | 2014-03-13 | Paper |
A denial-of-service resistant DHT | 2014-03-13 | Paper |
The Price of Routing Unsplittable Flow | 2013-07-04 | Paper |
Greedy distributed optimization of multi-commodity flows | 2013-06-28 | Paper |
The online set cover problem | 2010-08-16 | Paper |
Reducing truth-telling online mechanisms to online optimization | 2010-08-16 | Paper |
The Price of Routing Unsplittable Flow | 2010-08-16 | Paper |
Adaptive routing with end-to-end feedback | 2010-08-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q3579479 | 2010-08-06 | Paper |
The Online Set Cover Problem | 2010-04-29 | Paper |
Stateless Distributed Gradient Descent for Positive Linear Programs | 2010-01-06 | Paper |
Towards a scalable and robust DHT | 2009-10-19 | Paper |
Tell me who I am: An interactive recommendation system | 2009-10-19 | Paper |
Approximation and Online Algorithms | 2009-08-11 | Paper |
Robust random number generation for peer-to-peer systems | 2009-03-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q5302094 | 2009-01-05 | Paper |
Competitive collaborative learning | 2008-12-12 | Paper |
A Denial-of-Service Resistant DHT | 2008-09-02 | Paper |
Localized Client-Server Load Balancing without Global Information | 2008-08-14 | Paper |
Stateless Near Optimal Flow Control with Poly-logarithmic Convergence | 2008-04-15 | Paper |
Collaborate with strangers to find own preferences | 2008-02-18 | Paper |
Online linear optimization and adaptive routing | 2007-11-30 | Paper |
Tradeoffs in worst-case equilibria | 2006-09-14 | Paper |
Learning Theory | 2006-06-22 | Paper |
Automata, Languages and Programming | 2005-08-24 | Paper |
On-line generalized Steiner problem | 2004-11-23 | Paper |
Competitive distributed file allocation. | 2004-03-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4449248 | 2004-02-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4424141 | 2003-09-09 | Paper |
Piecemeal graph exploration by a mobile robot. | 2003-01-14 | Paper |
Minimizing the Flow Time Without Migration | 2002-09-29 | Paper |
Maximizing job benefits on-line | 2002-05-14 | Paper |
Competitive routing of virtual circuits with unknown duration | 2002-04-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q2753725 | 2001-11-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4527002 | 2001-02-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4228507 | 1999-10-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4234074 | 1999-09-15 | Paper |
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen | 1998-09-21 | Paper |
Near-Linear Time Construction of Sparse Neighborhood Covers | 1998-09-21 | Paper |
Optimal Broadcast with Partial Knowledge | 1998-09-21 | Paper |
Online tracking of mobile users | 1998-01-28 | Paper |
The maintenance of common data in a distributed system | 1998-01-22 | Paper |
Local management of a global resource in a communication network | 1998-01-19 | Paper |
Distributed Paging for General Networks | 1998-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3128890 | 1997-04-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q3128891 | 1997-04-23 | Paper |
Slide—The Key to Polynomial End-to-End Communication | 1997-03-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4876409 | 1996-10-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4875170 | 1996-04-28 | Paper |
Fast distributed network decompositions and covers | 1996-01-01 | Paper |
Routing with Polynomial Communication-Space Trade-Off | 1992-09-27 | Paper |
Improved routing strategies with succinct tables | 1990-01-01 | Paper |
A trade-off between information and communication in broadcast protocols | 1990-01-01 | Paper |
On the effects of feedback in dynamic network protocols | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4733694 | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3790654 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3796744 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3823129 | 1988-01-01 | Paper |
A new distributed algorithm to find breadth first search trees | 1987-01-01 | Paper |
A new distributed depth-first-search algorithm | 1985-01-01 | Paper |
Complexity of network synchronization | 1985-01-01 | Paper |
Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization | 1985-01-01 | Paper |