STACS A

60 papers

YearTitle / Authors
2008A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract).
Thomas Schwentick
2008A Mahler's theorem for functions from words to integers.
Jean-Eric Pin, Pedro V. Silva
2008A Theory for Valiant's Matchcircuits (Extended Abstract).
Angsheng Li, Mingji Xia
2008Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science.
Susanne Albers, Pascal Weil
2008An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines.
Pinyan Lu, Changyuan Yu
2008Analytic aspects of the shuffle product.
Marni Mishna, Mike Zabrocki
2008Cardinality and counting quantifiers on omega-automatic structures.
Lukasz Kaiser, Sasha Rubin, Vince Bárány
2008Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic.
Dietrich Kuske
2008Complexity of solutions of equations over sets of natural numbers.
Alexander Okhotin, Artur Jez
2008Computing Minimum Spanning Trees with Uncertainty.
Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman
2008Connecting Polygonizations via Stretches and Twangs.
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami
2008Convergence Thresholds of Newton's Method for Monotone Polynomial Equations.
Javier Esparza, Stefan Kiefer, Michael Luttenberger
2008Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set.
Johan M. M. van Rooij, Hans L. Bodlaender
2008Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.
Samir Datta, Raghav Kulkarni, Sambuddha Roy
2008Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps.
Jean-François Dufourd
2008Distinguishing Short Quantum Computations.
Bill Rosgen
2008Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.
Christian Glaßer, Heinz Schmitz, Victor L. Selivanov
2008Efficient Minimization of DFAs with Partial Transition.
Antti Valmari, Petri Lehtinen
2008Ehrenfeucht-Fraïssé Goes Automatic for Real Addition.
Felix Klaedtke
2008Equilibria, Fixed Points, and Complexity Classes.
Mihalis Yannakakis
2008Factoring Polynomials over Finite Fields using Balance Test.
Chandan Saha
2008Finding Irrefutable Certificates for S
Venkatesan T. Chakaravarthy, Sambuddha Roy
2008Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees.
Viet Tung Hoang, Wing-Kin Sung
2008Geodesic Fréchet Distance Inside a Simple Polygon.
Atlas F. Cook, Carola Wenk
2008Geometric Set Cover and Hitting Sets for Polytopes in R
Sören Laue
2008Improved Algorithms for the Range Next Value Problem and Applications.
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen
2008Lagrangian Relaxation and Partial Cover (Extended Abstract).
Julián Mestre
2008Limit complexities revisited.
Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin
2008Lower bounds for adaptive linearity tests.
Shachar Lovett
2008Minimizing Flow Time in the Wireless Gathering Problem.
Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
2008Model Checking Games for the Quantitative µ-Calculus.
Diana Fischer, Erich Grädel, Lukasz Kaiser
2008New Combinatorial Complete One-Way Functions.
Arist Kojevnikov, Sergey I. Nikolenko
2008On Dynamic Breadth-First Search in External-Memory.
Ulrich Meyer
2008On Geometric Spanners of Euclidean and Unit Disk Graphs.
Iyad A. Kanj, Ljubomir Perkovic
2008On Termination for Faulty Channel Machines.
Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell
2008On the Complexity of Elementary Modal Logics.
Edith Hemaspaandra, Henning Schnoor
2008On the Complexity of the Interlace Polynomial.
Markus Bläser, Christian Hoffmann
2008On the Induced Matching Problem.
Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer
2008On the decomposition of k-valued rational relations.
Jacques Sakarovitch, Rodrigo de Souza
2008Order-Invariant MSO is Stronger than Counting MSO in the Finite.
Tobias Ganzow, Sasha Rubin
2008Preface - 25th International Symposium on Theoretical Aspects of Computer Science.
Susanne Albers, Pascal Weil
2008Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2008, Bordeaux, France, February 21-23, 2008
Susanne Albers, Pascal Weil
2008Pushdown Compression.
Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel
2008Quantifying Homology Classes.
Chao Chen, Daniel Freedman
2008Quantum search with variable times.
Andris Ambainis
2008Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental.
Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz
2008Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs.
Éric Colin de Verdière, Alexander Schrijver
2008Space Hierarchy Results for Randomized Models.
Jeff Kinne, Dieter van Melkebeek
2008Stackelberg Network Pricing Games.
Patrick Briest, Martin Hoefer, Piotr Krysta
2008Structural aspects of tilings.
Alexis Ballier, Bruno Durand, Emmanuel Jeandel
2008Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound.
Joshua Brody, Amit Chakrabarti
2008Succinctness of the Complement and Intersection of Regular Expressions.
Wouter Gelade, Frank Neven
2008The Frobenius Problem in a Free Monoid.
Jui-Yi Kao, Jeffrey O. Shallit, Zhi Xu
2008The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace.
Thomas Thierauf, Fabian Wagner
2008Tight Bounds for Blind Search on the Integers.
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
2008Trimmed Moebius Inversion and Graphs of Bounded Degree.
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2008Trimming of Graphs, with Application to Point Labeling.
Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
2008Understanding Maximal Repetitions in Strings.
Maxime Crochemore, Lucian Ilie
2008Weak index versus Borel rank.
Filip Murlak
2008Weighted Matching in the Semi-Streaming Model.
Mariano Zelke