Conferences in DBLP

Symposium on Theoretical Aspects of Computer Science (STACS) (stacs)
2009 (conf/stacs/2009)

1. 
   Preface - 26th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]
   
   
2. 
   A Comparison of Techniques for Sampling Web Pages. [Citation Graph (, )][DBLP]
   
   
3. 
   Profinite Methods in Automata Theory. [Citation Graph (, )][DBLP]
   
   
4. 
   Lower Bounds for Multi-Pass Processing of Multiple Data Streams. [Citation Graph (, )][DBLP]
   
   
5. 
   Shortest Paths Avoiding Forbidden Subpaths. [Citation Graph (, )][DBLP]
   
   
6. 
   Generating Shorter Bases for Hard Random Lattices. [Citation Graph (, )][DBLP]
   
   
7. 
   Quantum Query Complexity of Multilinear Identity Testing. [Citation Graph (, )][DBLP]
   
   
8. 
   An Order on Sets of Tilings Corresponding to an Order on Languages. [Citation Graph (, )][DBLP]
   
   
9. 
   Compressed Representations of Permutations, and Applications. [Citation Graph (, )][DBLP]
   
   
10. 
    On the Average Complexity of Moore's State Minimization Algorithm. [Citation Graph (, )][DBLP]
    
    
11. 
    Testing Linear-Invariant Non-Linear Properties. [Citation Graph (, )][DBLP]
    
    
12. 
    Kolmogorov Complexity and Solovay Functions. [Citation Graph (, )][DBLP]
    
    
13. 
    Weak MSO with the Unbounding Quantifier. [Citation Graph (, )][DBLP]
    
    
14. 
    Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    A Polynomial Kernel for Multicut in Trees. [Citation Graph (, )][DBLP]
    
    
16. 
    On Local Symmetries and Universality in Cellular Automata. [Citation Graph (, )][DBLP]
    
    
17. 
    Qualitative Reachability in Stochastic BPA Games. [Citation Graph (, )][DBLP]
    
    
18. 
    Locally Decodable Quantum Codes. [Citation Graph (, )][DBLP]
    
    
19. 
    Enumerating Homomorphisms. [Citation Graph (, )][DBLP]
    
    
20. 
    Hardness and Algorithms for Rainbow Connectivity. [Citation Graph (, )][DBLP]
    
    
21. 
    Nonclairvoyant Speed Scaling for Flow and Energy. [Citation Graph (, )][DBLP]
    
    
22. 
    An Approximation Algorithm for l_infinity Fitting Robinson Structures to Distances. [Citation Graph (, )][DBLP]
    
    
23. 
    Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. [Citation Graph (, )][DBLP]
    
    
24. 
    Reverse Engineering Prefix Tables. [Citation Graph (, )][DBLP]
    
    
25. 
    The Price of Anarchy in Cooperative Network Creation Games. [Citation Graph (, )][DBLP]
    
    
26. 
    Error-Correcting Data Structures. [Citation Graph (, )][DBLP]
    
    
27. 
    Fragments of First-Order Logic over Infinite Words. [Citation Graph (, )][DBLP]
    
    
28. 
    Undecidable Properties of Limit Set Dynamics of Cellular Automata. [Citation Graph (, )][DBLP]
    
    
29. 
    Semi-Online Preemptive Scheduling: One Algorithm for All Variants. [Citation Graph (, )][DBLP]
    
    
30. 
    Improved Approximations for Guarding 1.5-Dimensional Terrains. [Citation Graph (, )][DBLP]
    
    
31. 
    Cover Time and Broadcast Time. [Citation Graph (, )][DBLP]
    
    
32. 
    Economical Caching. [Citation Graph (, )][DBLP]
    
    
33. 
    Computing Graph Roots Without Short Cycles. [Citation Graph (, )][DBLP]
    
    
34. 
    A Generalization of Nemhauser and Trotter's Local Optimization Theorem. [Citation Graph (, )][DBLP]
    
    
35. 
    Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. [Citation Graph (, )][DBLP]
    
    
36. 
    Forward Analysis for WSTS, Part I: Completions. [Citation Graph (, )][DBLP]
    
    
37. 
    Approximating Acyclicity Parameters of Sparse Hypergraphs. [Citation Graph (, )][DBLP]
    
    
38. 
    Optimal Cache-Aware Suffix Selection. [Citation Graph (, )][DBLP]
    
    
39. 
    Randomness on Computable Probability Spaces - A Dynamical Point of View. [Citation Graph (, )][DBLP]
    
    
40. 
    The Dynamic Complexity of Formal Languages. [Citation Graph (, )][DBLP]
    
    
41. 
    A Complexity Dichotomy for Partition Functions with Mixed Signs. [Citation Graph (, )][DBLP]
    
    
42. 
    Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness. [Citation Graph (, )][DBLP]
    
    
43. 
    More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. [Citation Graph (, )][DBLP]
    
    
44. 
    A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. [Citation Graph (, )][DBLP]
    
    
45. 
    Random Fruits on the Zielonka Tree. [Citation Graph (, )][DBLP]
    
    
46. 
    Ambiguity and Communication. [Citation Graph (, )][DBLP]
    
    
47. 
    On the Borel Inseparability of Game Tree Languages. [Citation Graph (, )][DBLP]
    
    
48. 
    Equations over Sets of Natural Numbers with Addition Only. [Citation Graph (, )][DBLP]
    
    
49. 
    Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. [Citation Graph (, )][DBLP]
    
    
50. 
    Polynomial Kernelizations for MIN F⁺Pi₁ and MAX NP. [Citation Graph (, )][DBLP]
    
    
51. 
    Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time. [Citation Graph (, )][DBLP]
    
    
52. 
    Efficient Isomorphism Testing for a Class of Group Extensions. [Citation Graph (, )][DBLP]
    
    
53. 
    On Approximating Multi-Criteria TSP. [Citation Graph (, )][DBLP]
    
    
54. 
    Tractable Structures for Constraint Satisfaction with Truth Tables. [Citation Graph (, )][DBLP]
    
    
55. 
    Büchi Complementation Made Tight. [Citation Graph (, )][DBLP]
    
    
56. 
    Strong Completeness of Coalgebraic Modal Logics. [Citation Graph (, )][DBLP]
    
    
57. 
    A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints. [Citation Graph (, )][DBLP]
    
    
58. 
    Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence. [Citation Graph (, )][DBLP]