Kirk Pruhs

Oper. Res. Lett., 2008

Speed Scaling of Tasks with Precedence Constraints.

[BibT_eX]

[DOI]

Rob van Stee

Patchrawat Uthaisombut

Theory Comput. Syst., 2008

The Price of Stochastic Anarchy.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

The Online Transportation Problem: On the Exponential Boost of One Extra Server.

[BibT_eX]

[DOI]

Christine Chung

Patchrawat Uthaisombut

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Scalable data dissemination using hybrid methods.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

Poster session: ASETS: A self-managing transaction scheduler.

[BibT_eX]

[DOI]

Mohamed A. Sharaf

Shenoda Guirguis

Proceedings of the 24th International Conference on Data Engineering Workshops, 2008

08071 Abstracts Collection -- Scheduling.

[BibT_eX]

[DOI]

Jane W.-S. Liu

Rolf H. Möhring

Proceedings of the Scheduling, 10.02. - 15.02.2008, 2008

08071 Executive Summary -- Scheduling.

[BibT_eX]

[DOI]

Jane W.-S. Liu

Rolf H. Möhring

Proceedings of the Scheduling, 10.02. - 15.02.2008, 2008

Confidently Cutting a Cake into Approximately Fair Pieces.

[BibT_eX]

[DOI]

Jaisingh Solanki

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Approximation schemes for a class of subset selection problems.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Theor. Comput. Sci., 2007

Competitive online scheduling for server systems.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2007

Speed scaling to manage energy and temperature.

[BibT_eX]

[DOI]

Tracy Kimbrel

J. ACM, 2007

Non-Preemptive Min-Sum Scheduling with Resource Augmentation.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

07261 Abstracts Collection -- Fair Division.

[BibT_eX]

[DOI]

Steven J. Brams

Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

07261 Summary -- Fair Division.

[BibT_eX]

[DOI]

Steven J. Brams

Alberto Marchetti-Spaccamela

Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

2006

Online weighted flow time and deadline scheduling.

[BibT_eX]

[DOI]

Luca Becchetti

Stefano Leonardi

J. Discrete Algorithms, 2006

Network awareness and application adaptability.

[BibT_eX]

[DOI]

Inf. Syst. E Bus. Manag., 2006

Efficient Scheduling of Heterogeneous Continuous Queries.

[BibT_eX]

[DOI]

Mohamed A. Sharaf

Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

Decomposing Data-Centric Storage Query Hot-Spots in Sensor Networks.

[BibT_eX]

[DOI]

Mohamed Aly

Proceedings of the 3rd Annual International ICST Conference on Mobile and Ubiquitous Systems: Computing, 2006

To Broadcast Push or Not and What?.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Mobile Data Management (MDM 2006), 2006

Balanced Allocations of Cake.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Secure-CITI Critical Information-Technology Infrastructure.

[BibT_eX]

[DOI]

Daniel Mossé

Louise K. Comfort

Ahmed Amer

José Carlos Brustoloni

Milos Hauskrecht

Rami G. Melhem

Proceedings of the 7th Annual International Conference on Digital Government Research, 2006

KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks.

[BibT_eX]

[DOI]

Mohamed Aly

Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

2005

A maiden analysis of longest wait first.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2005

Algorithmic problems in power management.

[BibT_eX]

[DOI]

Sandy Irani

SIGACT News, 2005

Fault-Tolerant Scheduling.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

A Comparison of Multicast Pull Models.

[BibT_eX]

[DOI]

Patchrawat Uthaisombut

Algorithmica, 2005

Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web.

[BibT_eX]

Mohamed A. Sharaf

Proceedings of the Eight International Workshop on the Web & Databases (WebDB 2005), 2005

Speed Scaling to Manage Temperature.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Zone sharing: a hot-spots decomposition scheme for data-centric storage in sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 2nd Workshop on Data Management for Sensor Networks, 2005

2004

Online Scheduling.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Jirí Sgall

Eric Torng

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Semi-clairvoyant scheduling.

[BibT_eX]

[DOI]

Luca Becchetti

Stefano Leonardi

Theor. Comput. Sci., 2004

Scalable Dissemination: What's Hot and What's Not.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Workshop on the Web and Databases, 2004

A Constant Approximation Algorithm for Sorting Buffers.

[BibT_eX]

[DOI]

Jens S. Kohrt

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Server Scheduling in the Weighted l<sub>p</sub> Norm.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Dynamic Speed Scaling to Manage Energy and Temperature.

[BibT_eX]

[DOI]

Tracy Kimbrel

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Editorial: Special Issue on On-Line Scheduling.

[BibT_eX]

[DOI]

J. Sched., 2003

Dedication.

[BibT_eX]

[DOI]

J. Sched., 2003

Foreword.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Maximizing job completions online.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Minimizing flow time nonclairvoyantly.

[BibT_eX]

[DOI]

J. ACM, 2003

Multicast Pull Scheduling: When Fairness Is Fine.

[BibT_eX]

[DOI]

Algorithmica, 2003

Middleware Support for Multicast-based Data Dissemination: A Working Reality.

[BibT_eX]

[DOI]

Vincenzo Liberatore

Proceedings of the 8th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2003), 2003

Server scheduling in the L<sub>p</sub> norm: a rising tide lifts all boat.

[BibT_eX]

[DOI]

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

An Optimized Multicast-based Data Dissemination Middleware.

[BibT_eX]

[DOI]

Siddhartha Roychowdhury

Proceedings of the 19th International Conference on Data Engineering, 2003

2002

Caching for Web Searching.

[BibT_eX]

[DOI]

Algorithmica, 2002

Broadcast scheduling: when fairness is fine.

[BibT_eX]

[DOI]

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

Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation.

[BibT_eX]

[DOI]

Eric Wiewiora

Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001

Eliminating Migration in Multi-processor Scheduling.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Better client OFF time prediction to improve performance in web information systems.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Web Information and Data Management (WIDM 2001), 2001

2000

An optimal deterministic algorithm for online b-matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

The Online Transportation Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

Speed is as powerful as clairvoyance.

[BibT_eX]

[DOI]

J. ACM, 2000

Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks.

[BibT_eX]

[DOI]

Eric Torng

Algorithmica, 2000

Fault-Tolerant Real-Time Scheduling.

[BibT_eX]

[DOI]

Algorithmica, 2000

Dynamic Spectrum Allocation: The Impotency of Duration Notification.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

Scheduling Broadcasts in Wireless Networks.

[BibT_eX]

[DOI]

Mahendran Velauthapillai

Proceedings of the Algorithms, 2000

1998

How to design dynamic programming algorithms sans recursion.

[BibT_eX]

[DOI]

SIGACT News, 1998

1997

On-Line Load Balancing of Temporary Tasks.

[BibT_eX]

[DOI]

J. Algorithms, 1997

1996

On-line Network Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Online Algorithms, 1996

1995

Using Local Adaptations to Reconfigure a Spanning Tree of a Network.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

Constructing Competitive Tours from Local Information.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane.

[BibT_eX]

[DOI]

Vineet Bafna

Theor. Comput. Sci., 1994

Average-Case Scalable On-Line Algorithms for Fault Replacement.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

1993

The SPIN-OUT puzzle.

[BibT_eX]

[DOI]

ACM SIGCSE Bull., 1993

Online Weighted Matching.

[BibT_eX]

[DOI]

J. Algorithms, 1993

A Competitive Analysis of Algorithms for Searching Unknown Scenes.

[BibT_eX]

[DOI]

Comput. Geom., 1993

Online Load Balancing of Temporary Tasks.

[BibT_eX]

[DOI]

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

1992

A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the STACS 92, 1992

1991

The Complexity of Controlled Selection

[BibT_eX]

[DOI]

Udi Manber

Inf. Comput., March, 1991

On-Line Weighted Matching.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Visual Searching and Mapping.

[BibT_eX]

[DOI]