Baruch Awerbuch

From MaRDI portal
Person:202104

Available identifiers

zbMath Open awerbuch.baruchDBLPa/BaruchAwerbuchWikidataQ4865843 ScholiaQ4865843MaRDI QIDQ202104

List of research outcomes





PublicationDate of PublicationType
Optimal Broadcast with Partial Knowledge2023-12-01Paper
Low-diameter graph decomposition is in NC2022-12-09Paper
Principles of Robust Medium Access and an Application to Leader Election2018-10-30Paper
Memory-efficient and self-stabilizing network RESET (extended abstract)2017-09-29Paper
Fast network decomposition2017-08-21Paper
Minimizing the flow time without migration2016-09-29Paper
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks2016-09-01Paper
Efficient asynchronous distributed symmetry breaking2016-09-01Paper
Optimal maintenance of a spanning tree2015-11-11Paper
Peer-to-peer systems for prefix search2015-09-04Paper
Adapting to a reliable network path2015-09-04Paper
A general approach to online network optimization problems2015-09-02Paper
https://portal.mardi4nfdi.de/entity/Q55012732015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013122015-08-03Paper
Efficient deadlock-free routing2015-06-19Paper
Broadcast with partial knowledge (preliminary version)2015-06-19Paper
Time optimal self-stabilizing synchronization2015-05-07Paper
Approximate load balancing on dynamic and asynchronous networks2015-05-07Paper
Competitive distributed file allocation2015-05-07Paper
https://portal.mardi4nfdi.de/entity/Q29346862014-12-18Paper
A jamming-resistant MAC protocol for single-hop wireless networks2014-12-12Paper
Stateless distributed algorithms for near optimal maximum multicommodity flows2014-12-12Paper
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework2014-12-05Paper
Online client-server load balancing without global information2014-10-13Paper
Improved recommendation systems2014-10-13Paper
On cost sharing mechanisms in the network design game2014-03-13Paper
Greedy distributed optimization of multi-commodity flows2014-03-13Paper
Distributed network monitoring and multicommodity flows2014-03-13Paper
Asynchronous recommendation systems2014-03-13Paper
Minimizing the total cost of network measurements in a distributed manner2014-03-13Paper
A denial-of-service resistant DHT2014-03-13Paper
The price of routing unsplittable flow2013-07-04Paper
Greedy distributed optimization of multi-commodity flows2013-06-28Paper
The Price of Routing Unsplittable Flow2010-08-16Paper
The online set cover problem2010-08-16Paper
Reducing truth-telling online mechanisms to online optimization2010-08-16Paper
Adaptive routing with end-to-end feedback2010-08-15Paper
https://portal.mardi4nfdi.de/entity/Q35794792010-08-06Paper
The Online Set Cover Problem2010-04-29Paper
Stateless Distributed Gradient Descent for Positive Linear Programs2010-01-06Paper
Tell me who I am: An interactive recommendation system2009-10-19Paper
Towards a scalable and robust DHT2009-10-19Paper
Approximation and Online Algorithms2009-08-11Paper
Robust random number generation for peer-to-peer systems2009-03-02Paper
https://portal.mardi4nfdi.de/entity/Q53020942009-01-05Paper
Competitive collaborative learning2008-12-12Paper
A Denial-of-Service Resistant DHT2008-09-02Paper
Localized Client-Server Load Balancing without Global Information2008-08-14Paper
Stateless Near Optimal Flow Control with Poly-logarithmic Convergence2008-04-15Paper
Collaborate with strangers to find own preferences2008-02-18Paper
Online linear optimization and adaptive routing2007-11-30Paper
Tradeoffs in worst-case equilibria2006-09-14Paper
Learning Theory2006-06-22Paper
Automata, Languages and Programming2005-08-24Paper
On-line generalized Steiner problem2004-11-23Paper
Competitive distributed file allocation.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44492482004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44241412003-09-09Paper
Piecemeal graph exploration by a mobile robot.2003-01-14Paper
Minimizing the Flow Time Without Migration2002-09-29Paper
Maximizing job benefits on-line2002-05-14Paper
Competitive routing of virtual circuits with unknown duration2002-04-28Paper
https://portal.mardi4nfdi.de/entity/Q27537252001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45270022001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q42285071999-10-04Paper
https://portal.mardi4nfdi.de/entity/Q42340741999-09-15Paper
Near-Linear Time Construction of Sparse Neighborhood Covers1998-09-21Paper
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen1998-09-21Paper
Optimal Broadcast with Partial Knowledge1998-09-21Paper
Online tracking of mobile users1998-01-28Paper
The maintenance of common data in a distributed system1998-01-22Paper
Local management of a global resource in a communication network1998-01-19Paper
Distributed Paging for General Networks1998-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31288901997-04-23Paper
https://portal.mardi4nfdi.de/entity/Q31288911997-04-23Paper
Slide—The Key to Polynomial End-to-End Communication1997-03-18Paper
https://portal.mardi4nfdi.de/entity/Q48764091996-10-07Paper
https://portal.mardi4nfdi.de/entity/Q48751701996-04-28Paper
Fast distributed network decompositions and covers1996-01-01Paper
Routing with Polynomial Communication-Space Trade-Off1992-09-27Paper
A trade-off between information and communication in broadcast protocols1990-01-01Paper
Improved routing strategies with succinct tables1990-01-01Paper
On the effects of feedback in dynamic network protocols1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47336941989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38231291988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37967441988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37906541988-01-01Paper
A new distributed algorithm to find breadth first search trees1987-01-01Paper
Complexity of network synchronization1985-01-01Paper
A new distributed depth-first-search algorithm1985-01-01Paper
Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization1985-01-01Paper

Research outcomes over time

This page was built for person: Baruch Awerbuch