Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Michael Kowalczyk, Jin-yi Cai |
Holant Problems for Regular Graphs with Complex Edge Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France, pp. 525-536, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-16-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Angelo Montanari, Gabriele Puppis, Pietro Sala, Guido Sciavicco |
Decidability of the Interval Temporal Logic ABB over the Natural Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France, pp. 597-608, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-16-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Yves Marion, Thomas Schwentick (eds.) |
27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-16-3 The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
1 | Fedor V. Fomin, Yngve Villanger |
Finding Induced Subgraphs via Minimal Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France, pp. 383-394, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-16-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Lance Fortnow, Jack H. Lutz, Elvira Mayordomo |
Inseparability and Strong Hypotheses for Disjoint NP Pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France, pp. 395-404, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-16-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Fabian Kuhn |
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 613-624, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam |
The Price of Anarchy in Cooperative Network Creation Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 301-312, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Nathalie Aubrun, Mathieu Sablik |
An Order on Sets of Tilings Corresponding to an Order on Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 99-110, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Vikraman Arvind, Partha Mukhopadhyay |
Quantum Query Complexity of Multilinear Identity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 87-98, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy |
Computing Graph Roots Without Short Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 397-408, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Jean-Yves Marion |
Preface - 26th International Symposium on Theoretical Aspects of Computer Science. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 231-242, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Mikolaj Bojanczyk |
Weak MSO with the Unbounding Quantifier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 159-170, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Kratsch |
Polynomial Kernelizations for MIN F+Pi1 and MAX NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 601-612, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Mustaq Ahmed, Anna Lubiw |
Shortest Paths Avoiding Forbidden Subpaths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 63-74, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Volker Diekert, Manfred Kufleitner |
Fragments of First-Order Logic over Infinite Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 325-336, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Tomás Brázdil, Václav Brozek, Antonín Kucera 0001, Jan Obdrzálek |
Qualitative Reachability in Stochastic BPA Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 207-218, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Sven Schewe |
Büchi Complementation Made Tight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 661-672, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | François Le Gall |
Efficient Isomorphism Testing for a Class of Group Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 625-636, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
Approximating Acyclicity Parameters of Sparse Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 445-456, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Mahdi Cheraghchi, Amin Shokrollahi |
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 277-288, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo |
A Polynomial Kernel for Multicut in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 183-194, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs |
Nonclairvoyant Speed Scaling for Flow and Energy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 255-264, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Kirsten, Sylvain Lombardy |
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 589-600, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Bodo Manthey |
On Approximating Multi-Criteria TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 637-648, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Eric Pin |
Profinite Methods in Automata Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 31-50, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Glencora Borradaile, Erik D. Demaine, Siamak Tazari |
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 171-182, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Joël Alwen, Chris Peikert |
Generating Shorter Bases for Hard Random Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 75-86, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Florian Horn 0001 |
Random Fruits on the Zielonka Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 541-552, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Wouter Gelade, Marcel Marquardt, Thomas Schwentick |
The Dynamic Complexity of Formal Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 481-492, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Victor Chepoi, Morgan Seston |
An Approximation Algorithm for linfinity Fitting Robinson Structures to Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 265-276, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Gianni Franceschini, Roberto Grossi, S. Muthukrishnan 0001 |
Optimal Cache-Aware Suffix Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 457-468, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Dániel Marx |
Tractable Structures for Constraint Satisfaction with Truth Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 649-660, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Sourav Chakraborty 0001, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and Algorithms for Rainbow Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 243-254, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Juraj Hromkovic, Georg Schnitger |
Ambiguity and Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 553-564, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann |
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 529-540, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bienvenu, Rod Downey |
Kolmogorov Complexity and Solovay Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 147-158, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Jean-Yves Marion (eds.) |
26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5 The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
1 | Eda Baykan, Monika Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler |
A Comparison of Techniques for Sampling Web Pages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 13-30, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley |
A Complexity Dichotomy for Partition Functions with Mixed Signs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 493-504, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible 0001, Saket Saurabh 0001, Yngve Villanger |
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 421-432, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Julien Clément 0001, Maxime Crochemore, Giuseppina Rindone |
Reverse Engineering Prefix Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 289-300, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Nicole Schweikardt |
Lower Bounds for Multi-Pass Processing of Multiple Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 51-61, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Szczepan Hummel, Henryk Michalewski, Damian Niwinski |
On the Borel Inseparability of Game Tree Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 565-575, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao 0001 |
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 517-528, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Alain Finkel, Jean Goubault-Larrecq |
Forward Analysis for WSTS, Part I: Completions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 433-444, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Ronald de Wolf |
Error-Correcting Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 313-324, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Pietro di Lena, Luciano Margara |
Undecidable Properties of Limit Set Dynamics of Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 337-347, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Artur Jez, Alexander Okhotin |
Equations over Sets of Natural Numbers with Addition Only. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 577-588, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija |
Improved Approximations for Guarding 1.5-Dimensional Terrains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 361-371, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Robert Elsässer, Thomas Sauerwald |
Cover Time and Broadcast Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 373-384, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Jérémy Barbay, Gonzalo Navarro 0001 |
Compressed Representations of Permutations, and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 111-122, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | André Gronemeier |
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 505-516, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Jop Briët, Ronald de Wolf |
Locally Decodable Quantum Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 219-230, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Tomás Ebenlendr, Jirí Sgall |
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 349-360, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Frédérique Bassino, Julien David, Cyril Nicaud |
On the Average Complexity of Moore's State Minimization Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 123-134, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 409-420, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Lutz Schröder, Dirk Pattinson |
Strong Completeness of Coalgebraic Modal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 673-684, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Kenya Ueno |
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 685-696, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Arnab Bhattacharyya 0001, Victor Chen, Madhu Sudan 0001, Ning Xie 0002 |
Testing Linear-Invariant Non-Linear Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 135-146, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Péter Gács, Mathieu Hoyrup, Cristobal Rojas |
Randomness on Computable Probability Spaces - A Dynamical Point of View. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 469-480, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Marius Zimand |
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 697-708, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking |
Economical Caching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 385-396, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Boyer 0001, Guillaume Theyssier |
On Local Symmetries and Universality in Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp. 195-206, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 978-3-939897-09-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff 0001 |
Trimming of Graphs, with Application to Point Labeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 265-276, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Javier Esparza, Stefan Kiefer, Michael Luttenberger |
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 289-300, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer 0001 |
On the Induced Matching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 397-408, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Filip Murlak |
Weak index versus Borel rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 573-584, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Chao Chen 0012, Daniel Freedman |
Quantifying Homology Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 169-180, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Chandan Saha 0001 |
Factoring Polynomials over Finite Fields using Balance Test. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 609-620, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Thierauf, Fabian Wagner |
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 633-644, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Wouter Gelade, Frank Neven |
Succinctness of the Complement and Intersection of Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 325-336, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Samir Datta, Raghav Kulkarni, Sambuddha Roy |
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 229-240, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Iyad A. Kanj, Ljubomir Perkovic |
On Geometric Spanners of Euclidean and Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 409-420, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan T. Chakaravarthy, Sambuddha Roy |
Finding Irrefutable Certificates for S2p via Arthur and Merlin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 157-168, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Eric Pin, Pedro V. Silva |
A Mahler's theorem for functions from words to integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 585-596, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Jacques Sakarovitch, Rodrigo de Souza |
On the decomposition of k-valued rational relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 621-632, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Johan M. M. van Rooij, Hans L. Bodlaender |
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 657-668, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Patrick Briest, Martin Hoefer 0001, Piotr Krysta |
Stackelberg Network Pricing Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 133-142, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Pascal Weil |
Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Sören Laue |
Geometric Set Cover and Hitting Sets for Polytopes in R3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 479-490, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Jui-Yi Kao, Jeffrey O. Shallit, Zhi Xu 0002 |
The Frobenius Problem in a Free Monoid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 421-432, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Dietrich Kuske |
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 467-478, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie |
Minimizing Flow Time in the Wireless Gathering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 109-120, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Pinyan Lu, Changyuan Yu |
An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 527-538, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Okhotin, Artur Jez |
Complexity of solutions of equations over sets of natural numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 373-384, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Christian Glaßer, Heinz Schmitz, Victor L. Selivanov |
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 337-348, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Markus Bläser, Christian Hoffmann 0001 |
On the Complexity of the Interlace Polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 97-108, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Angsheng Li, Mingji Xia |
A Theory for Valiant's Matchcircuits (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 491-502, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Shachar Lovett |
Lower bounds for adaptive linearity tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 515-526, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Pascal Weil (eds.) |
STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
1 | Thomas Schwentick |
A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 17-18, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami |
Connecting Polygonizations via Stretches and Twangs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 217-228, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Diana Fischer, Erich Grädel, Lukasz Kaiser |
Model Checking Games for the Quantitative µ-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 301-312, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Maxime Crochemore, Lucian Ilie |
Understanding Maximal Repetitions in Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 11-16, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
Trimmed Moebius Inversion and Graphs of Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 85-96, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Ulrich Meyer 0001 |
On Dynamic Breadth-First Search in External-Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 551-560, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Pascal Weil |
Preface - 25th International Symposium on Theoretical Aspects of Computer Science. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 1-6, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Mariano Zelke |
Weighted Matching in the Semi-Streaming Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 669-680, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Edith Hemaspaandra, Henning Schnoor |
On the Complexity of Elementary Modal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 349-360, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|