Yossi Azar

Julian Shun

ACM Trans. Parallel Comput., December, 2023

Competitive Vertex Recoloring.

[BibT_eX]

[DOI]

Algorithmica, July, 2023

The loss of serving in the dark.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

List Update with Delays or Time Windows.

[BibT_eX]

[DOI]

Shahar Lewkowicz

CoRR, 2023

Discrete-Smoothness in Online Algorithms with Predictions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

An α-regret analysis of Adversarial Bilateral Trade.

[BibT_eX]

[DOI]

Federico Fusco

CoRR, 2022

Online Graph Algorithms with Predictions.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Distortion-Oblivious Algorithms for Minimizing Flow Time.

[BibT_eX]

[DOI]

Stefano Leonardi

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

An $\alpha$-regret analysis of Adversarial Bilateral Trade.

[BibT_eX]

[DOI]

Federico Fusco

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Distortion-Oblivious Algorithms for Scheduling on Multiple Machines.

[BibT_eX]

[DOI]

Eldad Peretz

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

The Price of Bounded Preemption.

[BibT_eX]

[DOI]

Mark Berlin

ACM Trans. Parallel Comput., 2021

Online Service with Delay.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Flow time scheduling with uncertain processing time.

[BibT_eX]

[DOI]

Stefano Leonardi

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

The Min-Cost Matching with Concave Delays Problem.

[BibT_eX]

[DOI]

Runtian Ren

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Deterministic Min-Cost Matching with Delays.

[BibT_eX]

[DOI]

Amit Jacob Fanani

Theory Comput. Syst., 2020

Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Set Cover with Delay - Clairvoyance Is Not Required.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Hierarchical Clustering: A 0.585 Revenue Approximation.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

2019

Tight Bounds for Clairvoyant Dynamic Bin Packing.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2019

The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Efficient Allocation of Free Stuff.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Tractable near-optimal policies for crawling.

[BibT_eX]

[DOI]

Proc. Natl. Acad. Sci. USA, 2018

An improved algorithm for online machine minimization.

[BibT_eX]

[DOI]

Sarel Cohen

Oper. Res. Lett., 2018

2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines.

[BibT_eX]

[DOI]

Jaya Prakash Champati

Ben Liang

Inf. Process. Lett., 2018

Set Cover and Vertex Cover with Delay.

[BibT_eX]

[DOI]

CoRR, 2018

Randomized Algorithms for Online Vector Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Prophet Secretary: Surpassing the 1-1/e Barrier.

[BibT_eX]

[DOI]

Ashish Chiplunkar

Haim Kaplan

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Improved Online Algorithm for Weighted Flow Time.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Truthful mechanism design via correlated tree rounding.

[BibT_eX]

[DOI]

Martin Hoefer

Idan Maor

Rebecca Reiffenhäuser

Berthold Vöcking

Math. Program., 2017

Scheduling with Deadlines and Buffer Management with Processing Requirements.

[BibT_eX]

[DOI]

Oren Gilon

Algorithmica, 2017

The Strategy of Experts for Repeated Predictions.

[BibT_eX]

[DOI]

Amir Ban

Yishay Mansour

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Online Lower Bounds via Duality.

[BibT_eX]

[DOI]

Alan Roytman

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.

[BibT_eX]

[DOI]

Ashish Chiplunkar

Haim Kaplan

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Liquid Price of Anarchy.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Min-Cost Bipartite Perfect Matching with Delays.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2017

2016

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

[BibT_eX]

[DOI]

Ashish Chiplunkar

Haim Kaplan

CoRR, 2016

How to Allocate Goods in an Online Market?

[BibT_eX]

[DOI]

Niv Buchbinder

Kamal Jain

Algorithmica, 2016

Dynamic Traveling Repair Problem with an Arbitrary Time Window.

[BibT_eX]

[DOI]

Adi Vardi

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Make-to-Order Integrated Scheduling and Distribution.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Packing Small Vectors.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

When Should an Expert Make a Prediction?

[BibT_eX]

[DOI]

Amir Ban

Yishay Mansour

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Optimal Coordination Mechanisms for Unrelated Machine Scheduling.

[BibT_eX]

[DOI]

Oper. Res., 2015

TSP with Time Windows and Service Time.

[BibT_eX]

[DOI]

Adi Vardi

CoRR, 2015

Speed Scaling in the Non-clairvoyant Model.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Truthful Online Scheduling with Commitments.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Serving in the Dark should be done Non-Uniformly.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Buffer Management for Packets with Processing Times.

[BibT_eX]

[DOI]

Oren Gilon

Proceedings of the Algorithms - ESA 2015, 2015

2014

Co-Location-Resistant Clouds.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Online Covering with Convex Objectives and Applications.

[BibT_eX]

[DOI]

CoRR, 2014

Generalized Reordering Buffer Management.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Sequential decision making with vector outcomes.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2014

2013

The Price of Routing Unsplittable Flow.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Colored Packets with Deadlines and Metric Space Transition Cost.

[BibT_eX]

[DOI]

Adi Vardi

CoRR, 2013

Tight bounds for online vector bin packing.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Cloud scheduling with setup cost.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Online Mixed Packing and Covering.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Online Load Balancing on Unrelated Machines with Startup Costs

[BibT_eX]

[DOI]

CoRR, 2012

Asymptotically optimal algorithm for stochastic adwords.

[BibT_eX]

[DOI]

Nikhil R. Devanur

Balasubramanian Sivan

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Efficient Submodular Function Maximization under Linear Packing Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Mastering multi-player games.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

Maximum bipartite flow in networks with adaptive channel width.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Buffer Management for Colored Packets with Deadlines.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Recommender systems with non-binary grades.

[BibT_eX]

[DOI]

Aviv Nisgav

Boaz Patt-Shamir

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Ranking with Submodular Valuations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Prompt Mechanism for Ad Placement over Time.

[BibT_eX]

[DOI]

Ety Khaitzin

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Submodular Max-SAT.

[BibT_eX]

[DOI]

Ran Roth

Proceedings of the Algorithms - ESA 2011, 2011

Optimal Discovery Strategies in White Space Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

Distributed error confinement.

[BibT_eX]

[DOI]

Shay Kutten

Boaz Patt-Shamir

ACM Trans. Algorithms, 2010

Truthful unsplittable flow for large capacity networks.

[BibT_eX]

[DOI]

Shai Gutner

ACM Trans. Algorithms, 2010

Optimal whitespace synchronization strategies

[BibT_eX]

[DOI]

CoRR, 2010

A Preemptive Algorithm for Maximizing Disjoint Paths on Trees.

[BibT_eX]

[DOI]

Uriel Feige

Daniel Glasner

Algorithmica, 2010

Monotonicity in Bargaining Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Shai Gutner

ACM Trans. Algorithms, 2009

The Online Set Cover Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Tell Me Who I Am: An Interactive Recommendation System.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Foreword.

[BibT_eX]

[DOI]

Thomas Erlebach

Algorithmica, 2009

Multiple intents re-ranking.

[BibT_eX]

[DOI]

Xiaoxin Yin

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

On Revenue Maximization in Second-Price Ad Auctions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

2008

Collaborate with Strangers to Find Own Preferences.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Thinking Twice about Second-Price Ad Auctions

[BibT_eX]

[DOI]

CoRR, 2008

(Almost) optimal coordination mechanisms for unrelated machine scheduling.

[BibT_eX]

[DOI]

Kamal Jain

Vahab S. Mirrokni

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Fast load balancing via bounded best response.

[BibT_eX]

[DOI]

Rohit Khandekar

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Fast convergence to nearly optimal solutions in potential games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Truthful Unification Framework for Packing Integer Programs with Choices.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Improved Approximation Algorithms for Budgeted Allocations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines.

[BibT_eX]

[DOI]

Nir Andelman

Motti Sorani

Theory Comput. Syst., 2007

Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching.

[BibT_eX]

[DOI]

Nir Avrahami

Algorithmica, 2007

2006

An improved algorithm for online coloring of intervals with bandwidth.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Load balancing of temporary tasks in the lp norm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Tradeoffs in worst-case equilibria.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

An improved algorithm for CIOQ switches.

[BibT_eX]

[DOI]

Yossi Richter

ACM Trans. Algorithms, 2006

A general approach to online network optimization problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Combinatorial Algorithms for the Unsplittable Flow Problem.

[BibT_eX]

[DOI]

Algorithmica, 2006

Maximizing Throughput in Multi-Queue Switches.

[BibT_eX]

[DOI]

Arik Litichevskey

Algorithmica, 2006

Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers.

[BibT_eX]

[DOI]

Nir Levy

Proceedings of the Algorithm Theory, 2006

Optimal Node Routing.

[BibT_eX]

[DOI]

Yoel Chaiutin

Proceedings of the STACS 2006, 2006

2005

Combining Online Algorithms for Acceptance and Rejection.

[BibT_eX]

[DOI]

Theory Comput., 2005

Management of Multi-Queue Switches in QoS Networks.

[BibT_eX]

[DOI]

Yossi Richter

Algorithmica, 2005

The Hardness of Network Design for Unsplittable Flow with Selfish Users.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Convex programming for scheduling unrelated parallel machines.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Packet Routing and Information Gathering in Lines, Rings and Trees.

[BibT_eX]

[DOI]

Rafi Zachut

Proceedings of the Algorithms, 2005

2004

On-line generalized Steiner problem.

[BibT_eX]

[DOI]

Yair Bartal

Theor. Comput. Sci., 2004

On-Line Load Balancing of Temporary Tasks on Identical Machines.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Optimal oblivious routing in polynomial time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

All-norm approximation algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 2004

Online Packet Switching.

[BibT_eX]

[DOI]

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

All-Norm Approximation for Scheduling on Identical Machines.

[BibT_eX]

[DOI]

Shai Taub

Proceedings of the Algorithm Theory, 2004

The zero-one principle for switching networks.

[BibT_eX]

[DOI]

Yossi Richter

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.

[BibT_eX]

[DOI]

Ran Adler

J. Sched., 2003

On-line restricted assignment of temporary tasks with unknown durations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Temporary Tasks Assignment Resolved.

[BibT_eX]

[DOI]

Amitai Armon

Algorithmica, 2003

Load Balancing of Temporary Tasks in the lp Norm.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Reducing truth-telling online mechanisms to online optimization.

[BibT_eX]

[DOI]

Adam Meyerson

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Combining online algorithms for rejection and acceptance.

[BibT_eX]

[DOI]

Avrim Blum

Yishay Mansour

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.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002

Off-line temporary tasks assignment.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Minimizing the Flow Time Without Migration.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

On-line scheduling with precedence constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Fair versus Unrestricted Bin Packing.

[BibT_eX]

[DOI]

Algorithmica, 2002

Temporary tasks assignment resolved.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

On-line bin-stretching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Competitive Routing of Virtual Circuits with Unknown Duration.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

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

[BibT_eX]

[DOI]

Algorithmica, 2001

Ancient and New Algorithms for Load Balancing in the lp Norm.

[BibT_eX]

[DOI]

Adi Avidor

Jirí Sgall

Algorithmica, 2001

Spectral analysis of data.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

The Multicast Bandwidth Advantage in Serving a Web Site.

[BibT_eX]

[DOI]

Proceedings of the Networked Group Communication, 2001

Strongly Polynomial Algorithms for the Unsplittable Flow Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000

Resource Augmentation in Load Balancing.

[BibT_eX]

[DOI]

Rob van Stee

Proceedings of the Algorithm Theory, 2000

Fair versus Unrestricted Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

Maximizing job benefits on-line.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

Balanced Allocations.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

On Capital Investment.

[BibT_eX]

[DOI]

Algorithmica, 1999

Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths.

[BibT_eX]

[DOI]

Uri Arad

Proceedings of the Randomization, 1999

Off-Line Temporary Tasks Assignment.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Approximating Probability Distributions Using Small Sample Spaces.

[BibT_eX]

[DOI]

Rajeev Motwani

Joseph Naor

Comb., 1998

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

[BibT_eX]

[DOI]

Sergey V. Sevastianov

Arjen P. A. Vestjens

Gerhard J. Woeginger

Algorithmica, 1998

Ancient and New Algorithms for Load Balancing in the Lp Norm.

[BibT_eX]

[DOI]

Adi Avidor

Jirí Sgall

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Approximation Schemes for Covering and Scheduling on Related Machines.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997

On-Line Load Balancing of Temporary Tasks.

[BibT_eX]

[DOI]

J. Algorithms, 1997

On Two Dimensional Packing.

[BibT_eX]

[DOI]

J. Algorithms, 1997

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

[BibT_eX]

[DOI]

J. ACM, 1997

Approximation Schemes for Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Buy-at-Bulk Network Design.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

On-Line Machine Covering.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

Routing Strategies for Fast Networks.

[BibT_eX]

[DOI]

Joseph Naor

Raphael Rom

IEEE Trans. Computers, 1996

Biased Random Walks.

[BibT_eX]

[DOI]

Comb., 1996

Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).

[BibT_eX]

[DOI]

Frank Thomson Leighton

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Packet Routing via Min-Cost Circuit Routing.

[BibT_eX]

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

On-line Competive Algorithms for Call Admission in Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1996

On-line Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Online Algorithms, 1996

1995

Competitive multicast routing.

[BibT_eX]

[DOI]

Wirel. Networks, 1995

The Competitiveness of On-Line Assignments.

[BibT_eX]

[DOI]

Joseph Naor

Raphael Rom

J. Algorithms, 1995

Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Load Balancing in the Lp Norm.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

On-Line Load Balancing.

[BibT_eX]

[DOI]

Anna R. Karlin

Theor. Comput. Sci., 1994

On the Problem of Approximating the Number of Bases of a Matroid.

[BibT_eX]

[DOI]

Alan M. Frieze

Inf. Process. Lett., 1994

Lower Bounds for Insertion Methods for TSP.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

Balanced allocations (extended abstract).

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

On-Line Steine Trees in the Euclidean Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1993

Online Load Balancing of Temporary Tasks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

On-line load balancing with applications to machine scheduling and virtual circuit routing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

On-line Choice of On-line Algorithms.

[BibT_eX]

[DOI]

Mark S. Manasse

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

Throughput-Competitive On-Line Routing

[BibT_eX]

[DOI]

Serge A. Plotkin

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Lower Bounds for Threshold and Symmetric Functions in Parallel Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Comparison-Sorting and Selecting in Totally Monotone Matrices.

[BibT_eX]

[DOI]

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

On-line Load Balancing (Extended Abstract)

[BibT_eX]

[DOI]

Anna R. Karlin

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

On-Line Steiner Trees in the Euclidean Plane.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Parallel Comparison Merging of Many-Ordered Lists.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Parallel comparison algorithms for approximation problems.

[BibT_eX]

[DOI]

Comb., 1991

1990

Parallel selection.

[BibT_eX]

[DOI]

Nicholas Pippenger

Discret. Appl. Math., 1990

Universal sequences for complete graphs.

[BibT_eX]

[DOI]

Yiftach Ravid

Discret. Appl. Math., 1990

1989

Finding an Approximate Maximum.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

1988

Parallel comparison sorting and searching

[BibT_eX]

[DOI]

PhD thesis, 1988

Sorting, Approximate Sorting, and Searching in Rounds.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

1987

Tight Comparison Bounds on the Complexity of Parallel Sorting.

[BibT_eX]

[DOI]

Uzi Vishkin

SIAM J. Comput., 1987

1986

Tight Complexity Bounds for Parallel Comparison Sorting

[BibT_eX]

[DOI]