44. FOCS 2003:
Cambridge,
MA,
USA
44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings.
IEEE Computer Society 2003, ISBN 0-7695-2040-5 BibTeX
@proceedings{DBLP:conf/focs/2003,
title = {44th Symposium on Foundations of Computer Science (FOCS 2003),
11-14 October 2003, Cambridge, MA, USA, Proceedings},
booktitle = {FOCS},
publisher = {IEEE Computer Society},
year = {2003},
isbn = {0-7695-2040-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Tutorial 1
Tutorial 2
Tutorial 3
Session 1
- Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic:
A Polynomial Algorithm for Recognizing Perfect Graphs.
20-27
Electronic Edition (link) BibTeX
- Milena Mihail, Christos H. Papadimitriou, Amin Saberi:
On Certain Connectivity Properties of the Internet Topology.
28-35
Electronic Edition (link) BibTeX
- Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar:
Paths, Trees, and Minimum Latency Tours.
36-45
Electronic Edition (link) BibTeX
- Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff:
Approximation Algorithms for Orienteering and Discounted-Reward TSP.
46-55
Electronic Edition (link) BibTeX
- Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko:
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.
56-
Electronic Edition (link) BibTeX
Session 2
Session 3
Session 4
Session 5
Session 6
- Gianni Franceschini, Viliam Geffert:
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves.
242-250
Electronic Edition (link) BibTeX
- Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung:
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices.
251-260
Electronic Edition (link) BibTeX
- Lars Arge, Norbert Zeh:
I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.
261-270
Electronic Edition (link) BibTeX
- Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz:
The Cost of Cache-Oblivious Searching.
271-282
Electronic Edition (link) BibTeX
- Piotr Indyk, David P. Woodruff:
Tight Lower Bounds for the Distinct Elements Problem.
283-
Electronic Edition (link) BibTeX
Session 7
Session 8
Session 9
Session 10
Session 11
- Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.
462-471
Electronic Edition (link) BibTeX
- Aris Anagnostopoulos, Adam Kirsch, Eli Upfal:
Stability and Efficiency of a Random Local Load Balancing Protocol.
472-481
Electronic Edition (link) BibTeX
- David Kempe, Alin Dobra, Johannes Gehrke:
Gossip-Based Computation of Aggregate Information.
482-491
Electronic Edition (link) BibTeX
- Artur Czumaj, Wojciech Rytter:
Broadcasting Algorithms in Radio Networks with Unknown Topology.
492-501
Electronic Edition (link) BibTeX
- Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An Zhu:
Switch Scheduling via Randomized Edge Coloring.
502-
Electronic Edition (link) BibTeX
Session 12
Session 13
Session 14
Session 15
Copyright © Sat May 16 23:12:27 2009
by Michael Ley (ley@uni-trier.de)
