@incollection{Kenyon/04,
AUTHOR = {Kenyon, Claire},
TITLE = {Approximation schemes for metric clustering problems},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {1-3},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Gradel/04,
AUTHOR = {Gr{\"a}del, Erich},
TITLE = {Positional determinacy of infinite games},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {4-18},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Buhrman-Klauck-Vereshchagin-Vitanyi/04,
AUTHOR = {Buhrman, Harry and Klauck, Hartmut and Vereshchagin, Nikolai and Vit{\'a}nyi, Paul},
TITLE = {Individual communication complexity},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {19-30},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Schwarz/04,
AUTHOR = {Schwarz, Bernhard},
TITLE = {The complexity of satisfiability problems over finite lattices},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {31-43},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=31},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Arnsfelt_Hansen/04,
AUTHOR = {Arnsfelt Hansen, Kristoffer},
TITLE = {Constant width planar computation characterizes ACC$^0$},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {44-55},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=44},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Fomin-Thilikos/04,
AUTHOR = {Fomin, Fedor V. and Thilikos, Dimtirios M.},
TITLE = {A simple and fast approach for solving problems on planar graphs},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {56-67},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=56},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Kovacs/04,
AUTHOR = {Kov{\'a}cs, Annam{\'a}ria},
TITLE = {Sum-Multicoloring on paths},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {68-80},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=68},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Bast-Mehlhorn-Schafer-Tamaki/04,
AUTHOR = {Bast, Holger and Mehlhorn, Kurt and Sch{\"a}fer, Guido and Tamaki, Hisao},
TITLE = {Matching algorithms are fast in sparse random graphs},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {81-92},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=81},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Ambainis-Beaudry-Golovkins-Kikusts-Mercer-Therien/04,
AUTHOR = {Ambainis, Andris and Beaudry, Martin and Golovkins, Marats and {\c{K}}ikusts, Arnolds and Mercer, Mark and Th{\'e}rien, Denis},
TITLE = {Algebraic results on quantum automata},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {93-104},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=93},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Ambainis-Iwama-Kawachi-Masuda-Putra-Yamashita/04,
AUTHOR = {Ambainis, Andris and Iwama, Kazuo and Kawachi, Akinori and Masuda, Hiroyuki and Putra, Raymond H. and Yamashita, Shigeru},
TITLE = {Quantum identification of Boolean oracles},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {105-116},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=105},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Bertoni-Choffrut-Goldwurm-Lonati/04,
AUTHOR = {Bertoni, Alberto and Choffrut, Christian and Goldwurm, Massimiliano and Lonati, Violetta},
TITLE = {Local limit distributions in pattern statistics: Beyond the Markovian models},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {117-128},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
KEYWORDS = {automata and formal languages, pattern statistics, local limit theorems, perron-frobenius theory},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=117},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Reidenbach/04,
AUTHOR = {Reidenbach, Daniel},
TITLE = {A discontinuity in pattern inference},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {129-140},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=129},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Dantsin-Hirsch-Wolpert/04,
AUTHOR = {Dantsin, Evgeny and Hirsch, Edward A. and Wolpert, Alexander},
TITLE = {Algorithms for SAT based on search in Hamming balls},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {141-151},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=141},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Cohen-Cooper-Jeavons-Krokhin/04,
AUTHOR = {Cohen, David and Cooper, Martin and Jeavons, Peter and Krokhin, Andrei},
TITLE = {Identifying efficiently solvable cases of Max CSP},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {152-163},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=152},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Bohler-Hemaspaandra-Reith-Vollmer/04,
AUTHOR = {B{\"o}hler, Elmar and Hemaspaandra, Edith and Reith, Steffen and Vollmer, Heribert},
TITLE = {The complexity of Boolean constraint isomorphism},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {164-175},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=164},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Kolliopoulos-Steiner/04,
AUTHOR = {Kolliopoulos, Stavros G. and Steiner, George},
TITLE = {On minimizing the total weighted tardiness on a single machine},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {176-186},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=176},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Bartal-Chin-Chrobak-Fung-Jawor-Lavi-Sgall-Tichy/04,
AUTHOR = {Bartal, Yair and Chin, Francis Y.L. and Chrobak, Marek and Fung, Stanley P.Y. and Jawor, Wojciech and Lavi, Ron and Sgall, Ji{\v{r}}{\'{\i}} and Tich{\'y}, Tom{\'a}{\v{s}}},
TITLE = {Online competitive algorithms for maximizing weighted throughput of unit jobs},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {187-198},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=187},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Ebenlendr-Sgall/04,
AUTHOR = {Ebenlendr, Tom{\'a}{\v{s}} and Sgall, Ji{\v{r}}{\'{\i}}},
TITLE = {Optimal and online preemptive scheduling on uniformly related machines},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {199-210},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=199},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Ambuhl-Weber/04,
AUTHOR = {Amb{\"u}hl, Christoph and Weber, Birgitta},
TITLE = {Parallel prefetching and caching is hard},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {211-221},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=211},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Kavitha-Mehlhorn-Michail-Paluch/04,
AUTHOR = {Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios and Paluch, Katarzyna},
TITLE = {Strongly stable matchings in time $O(nm)$ and extension to the hospitals-residents problem},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {222-233},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=222},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Dhamdhere-Gupta-Ravi/04,
AUTHOR = {Dhamdhere, Kedar and Gupta, Anupam and Ravi, R.},
TITLE = {Approximation algorithms for minimizing average distortion},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {234-245},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=234},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Fraigniaud-Ilcinkas/04,
AUTHOR = {Fraigniaud, Pierre and Ilcinkas, David},
TITLE = {Digraphs exploration with little memory},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {246-257},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=246},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Caragiannis-Kaklamanis/04,
AUTHOR = {Caragiannis, Ioannis and Kaklamanis, Christos},
TITLE = {Approximate path coloring with applications to wavelength assignment in WDM optical networks},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {258-269},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=258},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Erlebach-Jacob-Mihalak-Nunkesser-Szabo-Widmayer/04,
AUTHOR = {Erlebach, Thomas and Jacob, Riko and Miha{\v{l}}{\'a}k, Mat{\'u}{\v{s}} and Nunkesser, Marc and Szab{\'o}, G{\'a}bor and Widmayer, Peter},
TITLE = {An algorithmic view on OVSF code assignment},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {270-281},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=270},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Beal-Fiorenzi-Perrin/04,
AUTHOR = {B{\'e}al, Marie-Pierre and Fiorenzi, Francesca and Perrin, Dominique},
TITLE = {The syntactic graph of a sofic shift},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {282-293},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
KEYWORDS = {automata and formal languages, symbolic dynamics},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=282},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Harju-Nowotka/04b,
AUTHOR = {Harju, Tero and Nowotka, Dirk},
TITLE = {Periodicity and unbordered words: A proof of Duval's conjecture},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {294-304},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=294},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Kirsten/04,
AUTHOR = {Kirsten, Daniel},
TITLE = {Desert automata and the finite substitution problem},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {305-316},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=305},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Johannsen/04,
AUTHOR = {Johannsen, Jan},
TITLE = {Satisfiability problems complete for deterministic logarithmic space},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {317-325},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=317},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Tantau/04,
AUTHOR = {Tantau, Till},
TITLE = {A logspace approximation scheme for the shortest path problem for graphs with bounded independence number},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {326-337},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=326},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Barbanchon-Grandjean/04,
AUTHOR = {Barbanchon, R{\'e}gis and Grandjean, Etienne},
TITLE = {The minimal logically-defined $NP$-complete problem},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {338-349},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
KEYWORDS = {computational complexity, descriptive complexity, finite model theory, second-order logic, $NP$-completeness, parsimony},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=338},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Tholey/04,
AUTHOR = {Tholey, Torsten},
TITLE = {Solving the 2-disjoint paths problem in nearly linear time},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {350-361},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=350},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Hagerup/04,
AUTHOR = {Hagerup, Torben},
TITLE = {Simpler computation of single-source shortest paths in linear average time},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {362-369},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=362},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Trolin/04,
AUTHOR = {Trolin, M{\aa}rten},
TITLE = {Lattices with many cycles are dense},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {370-381},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
KEYWORDS = {lattices, shortest vector problem, closest vector problem},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=370},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Kusters-Wilke/04,
AUTHOR = {K{\"u}sters, Ralf and Wilke, Thomas},
TITLE = {Automata-based analysis of recursive cryptographic protocols},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {382-393},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=382},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Ganapathy-Lodha/04,
AUTHOR = {Ganapathy, Murali K. and Lodha, Sachin P.},
TITLE = {On minimum circular arrangement},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {394-405},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
KEYWORDS = {computational complexity, hardness of approximation, polynomial time approximation scheme, scheduling, multicast},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=394},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Jarry/04,
AUTHOR = {Jarry, Aubin},
TITLE = {Integral symmetric 2-commodity flows},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {406-417},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=406},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Ambuhl-Clementi-di_Ianni-Lev-Tov-Monti-Peleg-Rossi-Silvestri/04,
AUTHOR = {Amb{\"u}hl, Christoph and Clementi, Andrea E.F. and di Ianni, Miriam and Lev-Tov, Nissan and Monti, Angelo and Peleg, David and Rossi, Gianluca and Silvestri, Riccardo},
TITLE = {Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {418-427},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=418},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Colcombet-Loding/04,
AUTHOR = {Colcombet, Thomas and L{\"o}ding, Christof},
TITLE = {On the expressiveness of deterministic transducers over infinite trees},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {428-439},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=428},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Khoussainov-Rubin-Stephan/04,
AUTHOR = {Khoussainov, Bakhadyr and Rubin, Sasha and Stephan, Frank},
TITLE = {Definability and regularity in automatic structures},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {440-451},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=440},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Muscholl-Schwentick-Segoufin/04,
AUTHOR = {Muscholl, Anca and Schwentick, Thomas and Segoufin, Luc},
TITLE = {Active context-free games},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {452-464},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=452},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Palbom/04,
AUTHOR = {Palbom, Anna},
TITLE = {Worst case performance of an approximation algorithm for asymmetric TSP},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {465-476},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=465},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Zhang-He/04,
AUTHOR = {Zhang, Huaming and He, Xin},
TITLE = {On visibility representation of plane graphs},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {477-488},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=477},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Schafer-Sivadasan/04,
AUTHOR = {Sch{\"a}fer, Guido and Sivadasan, Naveen},
TITLE = {Topology matters: Smoothed competitiveness of metrical task systems},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {489-500},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=489},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Laber/04,
AUTHOR = {Laber, Eduardo Sany},
TITLE = {A randomized competitive algorithm for evaluating priced AND/OR trees},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {501-512},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=501},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Aigner-de_Marco-Montangero/04,
AUTHOR = {Aigner, Martin and de Marco, Gianluca and Montangero, Manuela},
TITLE = {The plurality problem with three colors},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {513-521},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=513},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Bustan-Kupferman-Vardi/04,
AUTHOR = {Bustan, Doron and Kupferman, Orna and Vardi, Moshe Y.},
TITLE = {A measured collapse of the modal $mu$-calculus alternation hierarchy},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {522-533},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=522},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Brito-Gafni-Vaya/04,
AUTHOR = {Brito, Carlos and Gafni, Eli and Vaya, Shailesh},
TITLE = {An information theoretic lower bound for broadcasting in radio networks},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {534-546},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=534},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Lucking-Mavronicolas-Monien-Rode/04,
AUTHOR = {L{\"u}cking, Thomas and Mavronicolas, Marios and Monien, Burkhard and Rode, Manuel},
TITLE = {A new model for selfish routing},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {547-558},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=547},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Duchon-Hanusse-Saheb-Zemmari/04,
AUTHOR = {Duchon, Philippe and Hanusse, Nicolas and Saheb, Nasser and Zemmari, Akka},
TITLE = {Broadcast in the rendezvous model},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {559-570},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
KEYWORDS = {algorithms and data structures, distributed algorithms, graph, broadcast, rendezvous model},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=559},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Cai-Chakaravarthy-van_Melkebeek/04,
AUTHOR = {Cai, Jin-Yi and Chakaravarthy, Venkatesan T. and van Melkebeek, Dieter},
TITLE = {Time-space tradeoff in derandomizing probabilistic logspace},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {571-583},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=571},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Allender-Buhrman-Koucky/04,
AUTHOR = {Allender, Eric and Buhrman, Harry and Kouck{\'y}, Michal},
TITLE = {What can be efficiently reduced to the $K$-random strings?},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {584-595},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=584},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Bala/04,
AUTHOR = {Bala, Sebastian},
TITLE = {Regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {596-607},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=596},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Auletta-de_Prisco-Penna-Persiano/04,
AUTHOR = {Auletta, Vincenzo and de Prisco, Roberto and Penna, Paolo and Persiano, Giuseppe},
TITLE = {Deterministic truthful approximation mechanisms for scheduling related machines},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {608-619},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=608},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Souza-Steger/04,
AUTHOR = {Souza, Alexander and Steger, Angelika},
TITLE = {The expected competitive ratio for weighted completion time scheduling},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {620-631},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=620},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Athreya-Hitchcock-Lutz-Mayordomo/04,
AUTHOR = {Athreya, Krishna B. and Hitchcock, John M. and Lutz, Jack H. and Mayordomo, Elvira},
TITLE = {Effective strong dimension in algorithmic information and computational complexity},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {632-643},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=632},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Goldberg-Hartline-Karlin-Saks/04,
AUTHOR = {Goldberg, Andrew V. and Hartline, Jason D. and Karlin, Anna R. and Saks, Michael},
TITLE = {A lower bound on the competitive ratio of truthful auctions},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {644-655},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=644},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Chrobak-Sgall/04,
AUTHOR = {Chrobak, Marek and Sgall, Ji{\v{r}}{\'{\i}}},
TITLE = {Erratum to ''Analysis of the harmonic algorithm for three servers''},
BOOKTITLE = {Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS'2004 (Montpellier, France, March 25-27, 2004)},
SERIES = {LNCS},
VOLUME = {2996},
PAGES = {656-656},
YEAR = {2004},
EDITOR = {Diekert, Volker and Habib, Michel},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=656},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
NOTE = {Originally in Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2003, 2003, 247-259},
}