STACS A

60 papers

YearTitle / Authors
2007A Calculus and Algebra for Distributed Data Management.
Serge Abiteboul
2007A Characterization of Strong Learnability in the Statistical Query Model.
Hans Ulrich Simon
2007A Cubic Kernel for Feedback Vertex Set.
Hans L. Bodlaender
2007A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window.
Costas Busch, Srikanta Tirthapura
2007A First Investigation of Sturmian Trees.
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2007A New Bound for Pure Greedy Hot Potato Routing.
Manfred Kunde
2007A New Rank Technique for Formula Size Lower Bounds.
Troy Lee
2007A Search Algorithm for the Maximal Attractor of a Cellular Automaton.
Enrico Formenti, Petr Kurka
2007Admissibility in Infinite Games.
Dietmar Berwanger
2007An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups.
Gábor Ivanyos, Luc Sanselme, Miklos Santha
2007An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings.
Andrea Sattler-Klein
2007An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic.
Davide Bresolin, Angelo Montanari, Pietro Sala
2007An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs.
Marc Tedder, Derek G. Corneil
2007Arithmetizing Classes Around NC
Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao
2007Associative-Commutative Deducibility Constraints.
Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune
2007Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets.
Stefan Funke, Sören Laue
2007Bounded-Variable Fragments of Hybrid Logics.
Thomas Schwentick, Volker Weber
2007Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs.
Robert Elsässer, Thomas Sauerwald
2007Characterizing Minimal Interval Completions.
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
2007Cheating to Get Better Roommates in a Random Stable Matching.
Chien-Chung Huang
2007Compact Forbidden-Set Routing.
Bruno Courcelle, Andrew Twigg
2007Computing Representations of Matroids of Bounded Branch-Width.
Daniel Král
2007Correlations of Partial Words.
Francine Blanchet-Sadri, Joshua D. Gafni, Kevin H. Wilson
2007Cost Sharing Methods for Makespan and Completion Time Scheduling.
Janina A. Brenner, Guido Schäfer
2007Enumerating All Solutions for Constraint Satisfaction Problems.
Henning Schnoor, Ilka Schnoor
2007Hard Metrics from Cayley Graphs of Abelian Groups.
Ilan Newman, Yuri Rabinovich
2007Improved Online Algorithms for the Sorting Buffer Problem.
Iftah Gamzu, Danny Segev
2007Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity.
Laurent Bienvenu
2007Languages with Bounded Multiparty Communication Complexity.
Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien
2007Light Orthogonal Networks with Constant Geometric Dilation.
Adrian Dumitrescu, Csaba D. Tóth
2007New Approximation Algorithms for Minimum Cycle Bases of Graphs.
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
2007On Completing Latin Squares.
Iman Hajirasouliha, Hossein Jowhari, Ravi Kumar, Ravi Sundaram
2007On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds.
Peter Bürgisser
2007On Fixed Point Equations over Commutative Semirings.
Javier Esparza, Stefan Kiefer, Michael Luttenberger
2007On Symmetric Signatures in Holographic Algorithms.
Jin-Yi Cai, Pinyan Lu
2007On the Automatic Analysis of Recursive Security Protocols with XOR.
Ralf Küsters, Tomasz Truderung
2007On the Complexity of Affine Image Matching.
Christian Hundt, Maciej Liskiewicz
2007On the Complexity of Unary Tiling-Recognizable Picture Languages.
Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati
2007On the Consistency of Discrete Bayesian Learning.
Jan Poland
2007On the Size of the Universal Automaton of a Regular Language.
Sylvain Lombardy
2007Planar Graphs: Logical Complexity and Parallel Isomorphism Tests.
Oleg Verbitsky
2007Pure Stationary Optimal Strategies in Markov Decision Processes.
Hugo Gimbert
2007Quantum Network Coding.
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita
2007Randomly Rounding Rationals with Cardinality Constraints and Derandomizations.
Benjamin Doerr
2007Rank-1 Modal Logics Are Coalgebraic.
Lutz Schröder, Dirk Pattinson
2007Reachability in Unions of Commutative Rewriting Systems Is Decidable.
Mikolaj Bojanczyk, Piotr Hoffman
2007STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings
Wolfgang Thomas, Pascal Weil
2007Small Space Representations for Metric Min-Sum
Artur Czumaj, Christian Sohler
2007Speed-Up Techniques for Shortest-Path Computations.
Dorothea Wagner, Thomas Willhalm
2007Symmetries and the Complexity of Pure Nash Equilibrium.
Felix Brandt, Felix A. Fischer, Markus Holzer
2007Testing Convexity Properties of Tree Colorings.
Eldar Fischer, Orly Yahalom
2007The Büchi Complementation Saga.
Moshe Y. Vardi
2007The Complexity of Unions of Disjoint Sets.
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
2007The Polynomially Bounded Perfect Matching Problem Is in NC
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf
2007The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.
Peter Damaschke
2007Universal Tilings.
Grégory Lafitte, Michael Weiss
2007VPSPACE and a Transfer Theorem over the Reals.
Pascal Koiran, Sylvain Perifel
2007Wavelength Management in WDM Rings to Maximize the Number of Connections.
Ioannis Caragiannis
2007Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem.
Andrew M. Childs, Aram W. Harrow, Pawel Wocjan
2007Why Almost All
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik