Yossi Azar

According to our database1, Yossi Azar authored at least 174 papers between 1986 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
The Price of Bounded Preemption.
ACM Trans. Parallel Comput., 2021

Flow time scheduling with uncertain processing time.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

The Min-Cost Matching with Concave Delays Problem.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Deterministic Min-Cost Matching with Delays.
Theory Comput. Syst., 2020

Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Set Cover with Delay - Clairvoyance Is Not Required.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Hierarchical Clustering: A 0.585 Revenue Approximation.
Proceedings of the Conference on Learning Theory, 2020

2019
Tight Bounds for Clairvoyant Dynamic Bin Packing.
ACM Trans. Parallel Comput., 2019

The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

General Framework for Metric Optimization Problems with Delay or with Deadlines.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Efficient Allocation of Free Stuff.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Tractable near-optimal policies for crawling.
Proc. Natl. Acad. Sci. USA, 2018

An improved algorithm for online machine minimization.
Oper. Res. Lett., 2018

2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines.
Inf. Process. Lett., 2018

Set Cover and Vertex Cover with Delay.
CoRR, 2018

Randomized Algorithms for Online Vector Load Balancing.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Prophet Secretary: Surpassing the 1-1/e Barrier.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Improved Online Algorithm for Weighted Flow Time.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Truthful mechanism design via correlated tree rounding.
Math. Program., 2017

Scheduling with Deadlines and Buffer Management with Processing Requirements.
Algorithmica, 2017

The Strategy of Experts for Repeated Predictions.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Online service with delay.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Online Lower Bounds via Duality.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Liquid Price of Anarchy.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Min-Cost Bipartite Perfect Matching with Delays.
Proceedings of the Approximation, 2017

2016
Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays.
CoRR, 2016

How to Allocate Goods in an Online Market?
Algorithmica, 2016

Dynamic Traveling Repair Problem with an Arbitrary Time Window.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Make-to-Order Integrated Scheduling and Distribution.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Packing Small Vectors.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

When Should an Expert Make a Prediction?
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Optimal Coordination Mechanisms for Unrelated Machine Scheduling.
Oper. Res., 2015

TSP with Time Windows and Service Time.
CoRR, 2015

Speed Scaling in the Non-clairvoyant Model.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Truthful Online Scheduling with Commitments.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Serving in the Dark should be done Non-Uniformly.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Buffer Management for Packets with Processing Times.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Co-Location-Resistant Clouds.
IACR Cryptol. ePrint Arch., 2014

Online Covering with Convex Objectives and Applications.
CoRR, 2014

Generalized Reordering Buffer Management.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Sequential decision making with vector outcomes.
Proceedings of the Innovations in Theoretical Computer Science, 2014

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

Colored Packets with Deadlines and Metric Space Transition Cost.
CoRR, 2013

Tight bounds for online vector bin packing.
Proceedings of the Symposium on Theory of Computing Conference, 2013

The loss of serving in the dark.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Cloud scheduling with setup cost.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Online Mixed Packing and Covering.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Online Load Balancing on Unrelated Machines with Startup Costs
CoRR, 2012

Asymptotically optimal algorithm for stochastic adwords.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Efficient Submodular Function Maximization under Linear Packing Constraints.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Mastering multi-player games.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
Maximum bipartite flow in networks with adaptive channel width.
Theor. Comput. Sci., 2011

Buffer Management for Colored Packets with Deadlines.
Theory Comput. Syst., 2011

Recommender systems with non-binary grades.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Ranking with Submodular Valuations.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Prompt Mechanism for Ad Placement over Time.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Submodular Max-SAT.
Proceedings of the Algorithms - ESA 2011, 2011

Optimal Discovery Strategies in White Space Networks.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Distributed error confinement.
ACM Trans. Algorithms, 2010

Truthful unsplittable flow for large capacity networks.
ACM Trans. Algorithms, 2010

Optimal whitespace synchronization strategies
CoRR, 2010

A Preemptive Algorithm for Maximizing Disjoint Paths on Trees.
Algorithmica, 2010

Monotonicity in Bargaining Networks.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Admission control to minimize rejections and online set cover with repetitions.
ACM Trans. Algorithms, 2009

The Online Set Cover Problem.
SIAM J. Comput., 2009

Tell Me Who I Am: An Interactive Recommendation System.
Theory Comput. Syst., 2009

Foreword.
Algorithmica, 2009

Multiple intents re-ranking.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

On Revenue Maximization in Second-Price Ad Auctions.
Proceedings of the Algorithms, 2009

2008
Collaborate with Strangers to Find Own Preferences.
Theory Comput. Syst., 2008

Thinking Twice about Second-Price Ad Auctions
CoRR, 2008

(Almost) optimal coordination mechanisms for unrelated machine scheduling.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Truthful Unification Framework for Packing Integer Programs with Choices.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Improved Approximation Algorithms for Budgeted Allocations.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines.
Theory Comput. Syst., 2007

Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching.
Algorithmica, 2007

2006
An improved algorithm for online coloring of intervals with bandwidth.
Theor. Comput. Sci., 2006

Load balancing of temporary tasks in the <i>l</i><sub><i>p</i></sub> norm.
Theor. Comput. Sci., 2006

Tradeoffs in worst-case equilibria.
Theor. Comput. Sci., 2006

An improved algorithm for CIOQ switches.
ACM Trans. Algorithms, 2006

A general approach to online network optimization problems.
ACM Trans. Algorithms, 2006

Combinatorial Algorithms for the Unsplittable Flow Problem.
Algorithmica, 2006

Maximizing Throughput in Multi-Queue Switches.
Algorithmica, 2006

Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers.
Proceedings of the Algorithm Theory, 2006

Optimal Node Routing.
Proceedings of the STACS 2006, 2006

2005
Combining Online Algorithms for Acceptance and Rejection.
Theory Comput., 2005

Management of Multi-Queue Switches in QoS Networks.
Algorithmica, 2005

The Hardness of Network Design for Unsplittable Flow with Selfish Users.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Convex programming for scheduling unrelated parallel machines.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

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

Packet Routing and Information Gathering in Lines, Rings and Trees.
Proceedings of the Algorithms, 2005

2004
On-line generalized Steiner problem.
Theor. Comput. Sci., 2004

On-Line Load Balancing of Temporary Tasks on Identical Machines.
SIAM J. Discret. Math., 2004

Optimal oblivious routing in polynomial time.
J. Comput. Syst. Sci., 2004

All-norm approximation algorithms.
J. Algorithms, 2004

Online Packet Switching.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

All-Norm Approximation for Scheduling on Identical Machines.
Proceedings of the Algorithm Theory, 2004

The zero-one principle for switching networks.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2003
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms.
J. Sched., 2003

On-line restricted assignment of temporary tasks with unknown durations.
Inf. Process. Lett., 2003

Temporary Tasks Assignment Resolved.
Algorithmica, 2003

Load Balancing of Temporary Tasks in the l<sub>p</sub> Norm.
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

Combining online algorithms for rejection and acceptance.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

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

2002
Off-line temporary tasks assignment.
Theor. Comput. Sci., 2002

Minimizing the Flow Time Without Migration.
SIAM J. Comput., 2002

On-line scheduling with precedence constraints.
Discret. Appl. Math., 2002

Fair versus Unrestricted Bin Packing.
Algorithmica, 2002

Temporary tasks assignment resolved.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
On-line bin-stretching.
Theor. Comput. Sci., 2001

Competitive Routing of Virtual Circuits with Unknown Duration.
J. Comput. Syst. Sci., 2001

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

Ancient and New Algorithms for Load Balancing in the <i>l</i><sub>p</sub> Norm.
Algorithmica, 2001

Spectral analysis of data.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

The Multicast Bandwidth Advantage in Serving a Web Site.
Proceedings of the Networked Group Communication, 2001

Strongly Polynomial Algorithms for the Unsplittable Flow Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000
Resource Augmentation in Load Balancing.
Proceedings of the Algorithm Theory, 2000

Fair versus Unrestricted Bin Packing.
Proceedings of the Algorithm Theory, 2000

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

1999
Balanced Allocations.
SIAM J. Comput., 1999

On Capital Investment.
Algorithmica, 1999

Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths.
Proceedings of the Randomization, 1999

Off-Line Temporary Tasks Assignment.
Proceedings of the Algorithms, 1999

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

Approximating Probability Distributions Using Small Sample Spaces.
Comb., 1998

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
Algorithmica, 1998

Ancient and New Algorithms for Load Balancing in the L<sub>p</sub> Norm.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Approximation Schemes for Covering and Scheduling on Related Machines.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997
On-Line Load Balancing of Temporary Tasks.
J. Algorithms, 1997

On Two Dimensional Packing.
J. Algorithms, 1997

On-line routing of virtual circuits with applications to load balancing and machine scheduling.
J. ACM, 1997

Approximation Schemes for Scheduling.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

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

On-Line Machine Covering.
Proceedings of the Algorithms, 1997

1996
Routing Strategies for Fast Networks.
IEEE Trans. Computers, 1996

Biased Random Walks.
Comb., 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

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

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

On-line Load Balancing.
Proceedings of the Online Algorithms, 1996

1995
Competitive multicast routing.
Wirel. Networks, 1995

The Competitiveness of On-Line Assignments.
J. Algorithms, 1995

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

Load Balancing in the L<sub>p</sub> Norm.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
On-Line Load Balancing.
Theor. Comput. Sci., 1994

On the Problem of Approximating the Number of Bases of a Matroid.
Inf. Process. Lett., 1994

Lower Bounds for Insertion Methods for TSP.
Comb. Probab. Comput., 1994

Balanced allocations (extended abstract).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 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
On-Line Steine Trees in the Euclidean Plane.
Discret. Comput. Geom., 1993

Online Load Balancing of Temporary Tasks.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

On-line load balancing with applications to machine scheduling and virtual circuit routing.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

On-line Choice of On-line Algorithms.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

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

1992
Lower Bounds for Threshold and Symmetric Functions in Parallel Computation.
SIAM J. Comput., 1992

Comparison-Sorting and Selecting in Totally Monotone Matrices.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

On-line Load Balancing (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

On-Line Steiner Trees in the Euclidean Plane.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Parallel Comparison Merging of Many-Ordered Lists.
Theor. Comput. Sci., 1991

Parallel comparison algorithms for approximation problems.
Comb., 1991

1990
Parallel selection.
Discret. Appl. Math., 1990

Universal sequences for complete graphs.
Discret. Appl. Math., 1990

1989
Finding an Approximate Maximum.
SIAM J. Comput., 1989

1988
Sorting, Approximate Sorting, and Searching in Rounds.
SIAM J. Discret. Math., 1988

The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms.
SIAM J. Comput., 1988

1987
Tight Comparison Bounds on the Complexity of Parallel Sorting.
SIAM J. Comput., 1987

1986
Tight Complexity Bounds for Parallel Comparison Sorting
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986


  Loading...