Baruch Awerbuch

According to our database1, Baruch Awerbuch authored at least 172 papers between 1983 and 2014.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2014
Principles of Robust Medium Access and an Application to Leader Election.
ACM Trans. Algorithms, 2014

2013
The Price of Routing Unsplittable Flow.
SIAM J. Comput., 2013

A Distributed Algorithm for Large-Scale Generalized Matching.
PVLDB, 2013

2009
Brief announcement: Stateless distributed algorithms for generalized packing linear programs.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks.
ACM Trans. Inf. Syst. Secur., 2008

Online linear optimization and adaptive routing.
J. Comput. Syst. Sci., 2008

Optimal maintenance of a spanning tree.
J. ACM, 2008

Stateless distributed gradient descent for positive linear programs.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Cost sharing mechanisms for near-optimal traffic aggregation and network design.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Fast load balancing via bounded best response.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Fast convergence to nearly optimal solutions in potential games.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

A jamming-resistant MAC protocol for single-hop wireless networks.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Stateless distributed algorithms for near optimal maximum multicommodity flows.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Greedy distributed optimization of unsplittable multicommodity flows.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Stateless Near Optimal Flow Control with Poly-logarithmic Convergence.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock.
IEEE Trans. Dependable Sec. Comput., 2007

Localized Client-Server Load Balancing without Global Information.
SIAM J. Comput., 2007

A Denial-of-Service Resistant DHT.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Online collaborative filtering with nearly optimal dynamic regret.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

A denial-of-service resistant DHT.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Asynchronous recommendation systems.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

On cost sharing mechanisms in the network design game.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Distributed network monitoring and multicommodity flows: a primal-dual approach.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Greedy distributed optimization of multi-commodity flows.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Asynchronous Active Recommendation Systems.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Towards Scalable and Robust Overlay Networks.
Proceedings of the 6th International workshop on Peer-To-Peer Systems, 2007

2006
The Medium Time Metric: High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks.
MONET, 2006

Towards a scalable and robust DHT.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Tell me who I am: an interactive recommendation system.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Robust Random Number Generation for Peer-to-Peer Systems.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Dynamics of Learning Algorithms for the On-Demand Secure Byzantine Routing Protocol.
Proceedings of the Security and Privacy in Ad-Hoc and Sensor Networks, 2006

2005
A cost-benefit flow control for reliable multicast and unicast in overlay networks.
IEEE/ACM Trans. Netw., 2005

The Pulse Protocol: Mobile Ad hoc Network Performance Evaluation.
Proceedings of the 2nd International Conference on Wireless on Demand Network Systems and Service (WONS 2005), 2005

Large the price of routing unsplittable flow.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Collaborate with strangers to find own preferences.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Improved recommendation systems.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Online client-server load balancing without global information.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

On the Survivability of Routing Protocols in Ad Hoc Wireless Networks.
Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks, 2005

Provably competitive adaptive routing.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Adaptive Collaboration in Peer-to-Peer Systems.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Competitive Collaborative Learning.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Consistent and compact data management in distributed storage systems.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

The hyperring: a low-congestion deterministic data structure for distributed environments.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A general approach to online network optimization problems.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Collaboration of untrusting peers with changing interests.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Robust Distributed Name Service.
Proceedings of the Peer-to-Peer Systems III, Third International Workshop, 2004

The Pulse Protocol: Energy Efficient Infrastructure Access.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks.
Proceedings of the Wireless On-Demand Network Systems, First IFIP TC6 Working Conference, 2004

Group Spreading: A Protocol for Provably Secure Distributed Name Service.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Tradeoffs in Worst-Case Equilibria.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Reducing truth-telling online mechanisms to online optimization.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

The online set cover problem.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Peer-to-peer systems for prefix search.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Adapting to a reliable network path.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Scalable Decentralized Control for Sensor Networks via Distributed Lattices.
Proceedings of the Information Processing in Sensor Networks, 2003

A Generic Scheme for Building Overlay Networks in Adversarial Scenarios.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Anycasting in Adversarial Systems: Routing and Admission Control.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
An Online Algorithm for the Dynamic Maximal Dense Tree Problem.
Algorithmica, 2002

An on-demand secure routing protocol resilient to byzantine failures.
Proceedings of the 2002 ACM Workshop on Wireless Security, 2002

2001
Topology aggregation for directed graphs.
IEEE/ACM Trans. Netw., 2001

Universal-stability results and performance bounds for greedy contention-resolution protocols.
J. ACM, 2001

On-Line Competitive Algorithms for Call Admission in Optical Networks.
Algorithmica, 2001

Simple Routing Strategies for Adversarial Systems.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster.
IEEE Trans. Parallel Distrib. Syst., 2000

A Cost-Benefit framework for online management of a metacomputing system.
Decision Support Systems, 2000

Maximizing job benefits on-line.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Piecemeal Graph Exploration by a Mobile Robot.
Inf. Comput., 1999

Minimizing the Flow Time Without Migration.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998
Optimal Broadcast with Partial Knowledge.
SIAM J. Comput., 1998

Near-Linear Time Construction of Sparse Neighborhood Covers.
SIAM J. Comput., 1998

New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen.
SIAM J. Comput., 1998

Topology aggregation for directed graph.
Proceedings of the Third IEEE Symposium on Computers and Communications (ISCC 1998), June 30, 1998

Routing through networks with hierarchical topology aggregation.
Proceedings of the Third IEEE Symposium on Computers and Communications (ISCC 1998), June 30, 1998

Converging to Approximated Max-Min Flow Fairness in Logarithmic Time.
Proceedings of the Proceedings IEEE INFOCOM '98, The Conference on Computer Communications, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, Gateway to the 21st Century, San Francisco, CA, USA, March 29, 1998

The Effect of Network Hierarchy Structure on Performance of ATM PNNI Hierarchical Routing.
Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1998), 1998

Polylogarithmic-Overhead Piecemeal Graph Exploration.
Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

1997
Slide-The Key to Polynomial End-to-End Communication.
J. Algorithms, 1997

The maintenance of common data in a distributed system.
J. ACM, 1997

Globalizing Business, Education, Culture Through the Internet.
Commun. ACM, 1997

Online Algorithms for Selective Multicast and Maximal Dense Trees.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Buy-at-Bulk Network Design.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996
Fast Distributed Network Decompositions and Covers.
J. Parallel Distrib. Comput., 1996

Self-stabilizing end-to-end communication.
J. High Speed Networks, 1996

Local Management of a Global Resource in a Communication Network.
J. ACM, 1996

Maximizing Gross Network Product (GNP): Resource Management on the GII.
ACM Comput. Surv., 1996

Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Distributed Paging for General Networks.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

On-line Generalized Steiner Problem.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Packet Routing via Min-Cost Circuit Routing.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

Universal Stability Results for Greedy Contention-Resolution Protocols.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

On-line Competive Algorithms for Call Admission in Optical Networks.
Proceedings of the Algorithms, 1996

1995
Competitive multicast routing.
Wireless Networks, 1995

Online Tracking of Mobile Users.
J. ACM, 1995

Optimal Broadcast with Partial Knowledge (Extended Abstract).
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Load Balancing in the Lp Norm.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract).
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994
Self-Stabilization by Local Checking and Global Reset (Extended Abstract).
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Efficient asynchronous distributed symmetry breaking.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Competitive Non-Preemptive Call Control.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Competitive Routing of Virtual Circuits with Unknown Duration.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Bounding the Unbounded.
Proceedings of the Proceedings IEEE INFOCOM '94, 1994

On-line Admission Control and Circuit Routing for High Performance Computing and Communication
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Time optimal self-stabilizing synchronization.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Competitive distributed file allocation.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Approximate load balancing on dynamic and asynchronous networks.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Multicommodity Flows: A Survey of Recent Research.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

A Simple Local-Control Approximation Algorithm for Multicommodity Flow
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Heat & Dump: Competitive Distributed Paging
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Throughput-Competitive On-Line Routing
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Routing with Polynomial Communication-Space Trade-Off.
SIAM J. Discrete Math., 1992

An Efficient Topology Update Protocol for Dynamic Networks.
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Low-Diameter Graph Decomposition is in NC.
Proceedings of the Algorithm Theory, 1992

Adapting to Asynchronous Dynamic Networks (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Competitive Distributed Job Scheduling (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Fast Network Decomposition (Extended Abstract).
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991
Concurrent Online Tracking of Mobile Users.
Proceedings of the SIGCOMM '91, 1991

Efficient Deadlock-Free Routing.
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Broadcast with Partial Knowledge (Preliminary Version).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

On Buffer-Economical Store-and-Forward Deadlock Prevention.
Proceedings of the Proceedings IEEE INFOCOM '91, 1991

Approximate Distributed Bellman-Ford Algorithms.
Proceedings of the Proceedings IEEE INFOCOM '91, 1991

Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

The Maintenance of Common Data in a Distributed System
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Self-Stabilization By Local Checking and Correction (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
A Trade-Off between Information and Communication in Broadcast Protocols
J. ACM, April, 1990

Improved Routing Strategies with Succinct Tables.
J. Algorithms, 1990

On the Effects of Feedback in Dynamic Network Protocols.
J. Algorithms, 1990

Shortest Paths and Loop-Free Routing in Dynamic Networks.
Proceedings of the SIGCOMM '90, 1990

A Quantitative Approach to Dynamic Networks.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

Cost-Sensitive Analysis of Communication Protocols.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

Distributed Control for PARIS.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

A Dining Philosophers Algorithm with Polynomial Response Time
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Network Synchronization with Polylogarithmic Overhead
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Sparse Partitions (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Communication-Optimal Maintenance of Replicated Information
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Compact Distributed Data Structures for Adaptive Routing (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Distributed Shortest Paths Algorithms (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Polynomial End-To-End Communication (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Network Decomposition and Locality in Distributed Computation
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
A Proof Technique for Register Automicity.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

Dynamic Networks Are as Fast as Static Networks (Preliminary Version)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

On the Effects of Feedback in Dynamic Network Protocols (Preliminary Version)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

A Tradeoff between Information and Communication in Broadcast Protocols.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
A new distributed algorithm to find breadth first search trees.
IEEE Trans. Information Theory, 1987

New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM.
IEEE Trans. Computers, 1987

Local Fail-safe Network Reset Procedure.
Proceedings of the Distributed Algorithms, 1987

Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary)
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Errata to "Atomic Shared Register Access by Asynchronous Hardware"
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

Local Management of a Global Resource in a Communication Network
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

Applying Static Network Protocols to Dynamic Networks
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
Reliable broadcast protocols in unreliable networks.
Networks, 1986

Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Dynamic deadlock resolution protocols (Extended Abstract)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985
Complexity of Network Synchronization
J. ACM, October, 1985

Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization.
Networks, 1985

A New Distributed Depth-First-Search Algorithm.
Inf. Process. Lett., 1985

Communication-Time Trade-Offs in Network Synchronization.
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Distributed BFS Algorithms
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
Finding Euler Circuits in Logarithmic Parallel Time
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

An Efficient Network Synchronization Protocol
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

1983
A Reliable Broadcast Protocol.
Proceedings of the Proceedings IEEE INFOCOM 83, San Diego, CA, USA, April 18-21, 1983, 1983

Distributed Broadcast Algorithm in Multihop Aloha Networks.
Proceedings of the Proceedings IEEE INFOCOM 83, San Diego, CA, USA, April 18-21, 1983, 1983

New Connectivity and MSF Algorithms for Ultracomputer and PRAM.
Proceedings of the International Conference on Parallel Processing, 1983


  Loading...