@incollection{Abiteboul/07,
AUTHOR = {Abiteboul, Serge},
TITLE = {A calculus and algebra for distributed data management},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {1-11},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Vardi/07,
AUTHOR = {Vardi, Moshe},
TITLE = {The B{\"u}chi complementation saga},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {12-22},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Wagner-Willhalm/07,
AUTHOR = {Wagner, Dorothea and Willhalm, Thomas},
TITLE = {Speed-up techniques for shortest-path computations},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {23-36},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Courcelle-Twigg/07,
AUTHOR = {Courcelle, Bruno and Twigg, Andrew},
TITLE = {Compact forbidden-set routing},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {37-48},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kunde/07,
AUTHOR = {Kunde, Manfred},
TITLE = {A new bound for pure greedy hot potato routing},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {49-60},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Caragiannis/07,
AUTHOR = {Caragiannis, Ioannis},
TITLE = {Wavelength management in WDM rings to maximize the number of connections},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {61-72},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Berstel-Boasson-Carton-Fagnot/07,
AUTHOR = {Berstel, Jean and Boasson, Luc and Carton, Olivier and Fagnot, Isabelle},
TITLE = {A first investigation of Sturmian trees},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {73-84},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lombardy/07,
AUTHOR = {Lombardy, Sylvain},
TITLE = {On the size of the universal automaton of a regular language},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {85-96},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Blanchet-Sadri-Gafni-Wilson/07,
AUTHOR = {Blanchet-Sadri, Francine and Gafni, Joshua D. and Wilson, Kevin H.},
TITLE = {Correlations of partial words},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {97-108},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fischer-Yahalom/07,
AUTHOR = {Fischer, Eldar and Yahalom, Orly},
TITLE = {Testing convexity properties of tree colorings},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {109-120},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_10},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Coja-Oghlan-Krivelevich-Vilenchik/07,
AUTHOR = {Coja-Oghlan, Amin and Krivelevich, Michael and Vilenchik, Dan},
TITLE = {Why almost all $k$-colorable graphs are easy},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {121-132},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_11},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Burgisser/07,
AUTHOR = {B{\"u}rgisser, Peter},
TITLE = {On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {133-144},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_12},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lee/07,
AUTHOR = {Lee, Troy},
TITLE = {A new rank technique for formula size lower bounds},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {145-156},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_13},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Newman-Rabinovich/07,
AUTHOR = {Newman, Ilan and Rabinovich, Yuri},
TITLE = {Hard metrics from Cayley graphs of Abelian groups},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {157-162},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_14},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Elsasser-Sauerwald/07,
AUTHOR = {Els{\"a}sser, Robert and Sauerwald, Thomas},
TITLE = {Broadcasting vs. mixing and information dissemination on Cayley graphs},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {163-174},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_15},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dumitrescu-Toth/07,
AUTHOR = {Dumitrescu, Adrian and T{\'o}th, Csaba D.},
TITLE = {Light orthogonal networks with constant geometric dilation},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {175-187},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_16},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Berwanger/07,
AUTHOR = {Berwanger, Dietmar},
TITLE = {Admissibility in infinite games},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {188-199},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_17},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gimbert/07,
AUTHOR = {Gimbert, Hugo},
TITLE = {Pure stationary optimal strategies in Markov decision processes},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {200-211},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_18},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Brandt-Fischer-Holzer/07,
AUTHOR = {Brandt, Felix and Fischer, Felix and Holzer, Markus},
TITLE = {Symmetries and the complexity of pure Nash equilibrium},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {212-223},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kral/07,
AUTHOR = {Kr{\'a}l', Daniel},
TITLE = {Computing representations of matroids of bounded branch-width},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {224-235},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_20},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Heggernes-Suchan-Todinca-Villanger/07,
AUTHOR = {Heggernes, Pinar and Suchan, Karol and Todinca, Ioan and Villanger, Yngve},
TITLE = {Characterizing minimal interval completions --- Towards better understanding of profile and pathwidth},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {236-247},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_21},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Glasser-Selman-Travers-Wagner/07,
AUTHOR = {Gla{\ss}er, Christian and Selman, Alan L. and Travers, Stephen and Wagner, Klaus W.},
TITLE = {The complexity of unions of disjoint sets},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {248-259},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_22},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bienvenu/07,
AUTHOR = {Bienvenu, Laurent},
TITLE = {Kolmogorov-Loveland stochasticity and Kolmogorov complexity},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {260-271},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Funke-Laue/07,
AUTHOR = {Funke, Stefan and Laue, S{\"o}ren},
TITLE = {Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {272-283},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_24},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hundt-Liskiewicz/07,
AUTHOR = {Hundt, Christian and Li{\'s}kiewicz, Maciej},
TITLE = {On the complexity of affine image matching},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {284-295},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_25},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Esparza-Kiefer-Luttenberger/07,
AUTHOR = {Esparza, Javier and Kiefer, Stefan and Luttenberger, Michael},
TITLE = {On fixed point equations over commutative semirings},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {296-307},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_26},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Sattler-Klein/07,
AUTHOR = {Sattler-Klein, Andrea},
TITLE = {An exponential lower bound for prefix Gr{\"o}bner bases in free monoid rings},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {308-319},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_27},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bodlaender/07,
AUTHOR = {Bodlaender, Hans L.},
TITLE = {A cubic kernel for feedback vertex set},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {320-331},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_28},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Damaschke/07,
AUTHOR = {Damaschke, Peter},
TITLE = {The union of minimal hitting sets: Parameterized combinatorial bounds and counting},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {332-343},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_29},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Tedder-Corneil/07,
AUTHOR = {Tedder, Marc and Corneil, Derek},
TITLE = {An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {344-355},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_30},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Formenti-Kurka/07,
AUTHOR = {Formenti, Enrico and K{\r{u}}rka, Petr},
TITLE = {A search algorithm for the maximal attractor of a cellular automaton},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {356-366},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_31},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lafitte-Weiss/07,
AUTHOR = {Lafitte, Gr{\'e}gory and Weiss, Michael},
TITLE = {Universal tilings},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {367-380},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_32},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bertoni-Goldwurm-Lonati/07,
AUTHOR = {Bertoni, Alberto and Goldwurm, Massimiliano and Lonati, Violetta},
TITLE = {On the complexity of unary tiling-recognizable picture languages},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {381-392},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_33},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Simon/07,
AUTHOR = {Simon, Hans Ulrich},
TITLE = {A characterization of strong learnability in the statistical query model},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {393-404},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_34},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Poland/07,
AUTHOR = {Poland, Jan},
TITLE = {On the consistency of discrete Bayesian learning},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {405-416},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_35},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Koiran-Perifel/07,
AUTHOR = {Koiran, Pascal and Perifel, Sylvain},
TITLE = {$VP$SPACE and a transfer theorem over the reals},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {417-428},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_36},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cai-Lu/07,
AUTHOR = {Cai, Jin-Yi and Lu, Pinyan},
TITLE = {On symmetric signatures in holographic algorithms},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {429-440},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_37},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Doerr/07,
AUTHOR = {Doerr, Benjamin},
TITLE = {Randomly rounding rationals with cardinality constraints and derandomizations},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {441-452},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_38},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Huang/07,
AUTHOR = {Huang, Chien-Chung},
TITLE = {Cheating to get better roommates in a random stable matching},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {453-464},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_39},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Busch-Tirthapura/07,
AUTHOR = {Busch, Costas and Tirthapura, Srikanta},
TITLE = {A deterministic algorithm for summarizing asynchronous streams over a sliding window},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {465-476},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_40},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Limaye-Mahajan-Rao/07,
AUTHOR = {Limaye, Nutan and Mahajan, Meena and Rao, B.V. Raghavendra},
TITLE = {Arithmetizing classes around $NC^1$ and $L$},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {477-488},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_41},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Agrawal-Hoang-Thierauf/07,
AUTHOR = {Agrawal, Manindra and Hoang, Thanh Minh and Thierauf, Thomas},
TITLE = {The polynomially bounded perfect matching problem is in $NC^2$},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {489-499},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_42},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chattopadhyay-Krebs-Koucky-Szegedy-Tesson-Therien/07,
AUTHOR = {Chattopadhyay, Arkadev and Krebs, Andreas and Kouck{\'y}, Michal and Szegedy, Mario and Tesson, Pascal and Th{\'e}rien, Denis},
TITLE = {Languages with bounded multiparty communication complexity},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {500-511},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_43},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kavitha-Mehlhorn-Michail/07,
AUTHOR = {Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios},
TITLE = {New approximation algorithms for minimum cycle bases of graphs},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {512-523},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_44},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hajirasouliha-Jowhari-Kumar-Sundaram/07,
AUTHOR = {Hajirasouliha, Iman and Jowhari, Hossein and Kumar, Ravi and Sundaram, Ravi},
TITLE = {On completing Latin squares},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {524-535},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_45},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Czumaj-Sohler/07,
AUTHOR = {Czumaj, Artur and Sohler, Christian},
TITLE = {Small space representations for metric min-sum $k$-clustering and their applications},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {536-548},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_46},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bresolin-Montanari-Sala/07,
AUTHOR = {Bresolin, Davide and Montanari, Angelo and Sala, Pietro},
TITLE = {An optimal tableau-based decision algorithm for propositional neighborhood logic},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {549-560},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_47},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Schwentick-Weber/07,
AUTHOR = {Schwentick, Thomas and Weber, Volker},
TITLE = {Bounded-variable fragments of hybrid logics},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {561-572},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_48},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Schroder-Pattinson/07,
AUTHOR = {Schr{\"o}der, Lutz and Pattinson, Dirk},
TITLE = {Rank-1 modal logics are coalgebraic},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {573-585},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_49},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ivanyos-Sanselme-Santha/07,
AUTHOR = {Ivanyos, G{\'a}bor and Sanselme, Luc and Santha, Miklos},
TITLE = {An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {586-597},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_50},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Childs-Harrow-Wocjan/07,
AUTHOR = {Childs, Andrew and Harrow, Aram W. and Wocjan, Pawe{\l}},
TITLE = {Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {598-609},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_51},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hayashi-Iwama-Nishimura-Raymond-Yamashita/07,
AUTHOR = {Hayashi, Masahito and Iwama, Kazuo and Nishimura, Harumichi and Raymond, Rudy and Yamashita, Shigeru},
TITLE = {Quantum network coding},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {610-621},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_52},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bojanczyk-Hoffman/07,
AUTHOR = {Boja{\'n}czyk, Miko{\l}aj and Hoffman, Piotr},
TITLE = {Reachability in unions of commutative rewriting systems is decidable},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {622-633},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_53},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bursuc-Comon-Lundh-Delaune/07,
AUTHOR = {Bursuc, Sergiu and Comon-Lundh, Hubert and Delaune, St{\'e}phanie},
TITLE = {Associative-commutative deducibility constraints},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {634-645},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_54},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kusters-Truderung/07,
AUTHOR = {K{\"u}sters, Ralf and Truderung, Tomasz},
TITLE = {On the automatic analysis of recursive security protocols with XOR},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {646-657},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_55},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gamzu-Segev/07,
AUTHOR = {Gamzu, Iftah and Segev, Danny},
TITLE = {Improved online algorithms for the sorting buffer problem},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {658-669},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_56},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Brenner-Schafer/07,
AUTHOR = {Brenner, Janina and Sch{\"a}fer, Guido},
TITLE = {Cost sharing methods for makespan and completion time scheduling},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {670-681},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_57},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Verbitsky/07,
AUTHOR = {Verbitsky, Oleg},
TITLE = {Planar graphs: Logical complexity and parallel isomorphism tests},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {682-693},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_58},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Schnoor-Schnoor/07,
AUTHOR = {Schnoor, Henning and Schnoor, Ilka},
TITLE = {Enumerating all solutions for constraint satisfaction problems},
BOOKTITLE = {Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS'2007 (Aachen, Germany, February 22-24, 2007)},
SERIES = {LNCS},
VOLUME = {4393},
PAGES = {694-705},
YEAR = {2007},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
URL = {http://dx.doi.org/10.1007/978-3-540-70918-3_59},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}