Competitive Analysis

Journals and Magazines

1. Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng. Optimal On-Line Scheduling of Parallel Jobs with Dependencies. Journal of Combinatorial Optimization, 1(4):393-411, 1998.
2. Anja Feldmann, Jiri Sgall, Shang-Hua Teng. Dynamic scheduling on parallel machines. Theoretical Computer Science, 130(1):49-72, 1994.

Conferences and Workshops

1. Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng. Optimal online scheduling of parallel jobs with dependencies. In STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, (Location: San Diego, California, United States), Pages 642-651, ACM Press, New York, NY, USA, 1993.
2. Anja Feldmann, Jiri Sgall, Shang-Hua Teng. Dynamic scheduling on parallel machines. In Proceedings of the 32nd annual symposium on Foundations of computer science, (Location: San Juan, Puerto Rico), Pages 111-120, IEEE Computer Society Press, Los Alamitos, CA, USA, 1991.

Research Reports

1. Anja Feldmann, Bruce Maggs, Jiri Sgall, Daniel Sleator, Andrew Tomkins. Competitive analysis of call admission algorithms that allow delay. Research Report Carnegie Mellon University, No. CMU-CS-95-102, 1995.
2. Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng. Optimal online scheduling of parallel jobs with dependencies. Research Report Carnegie Mellon University, No. CMU-CS-92-189, 1992.

Thesis

1. Anja Feldmann. On-line call admission for high-speed networks. PhD Thesis, Pittsburgh, PA, USA, 1995.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

It has been automatically generated using the bib2html program.