Conferences in DBLP

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

1. 
   Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]
   
   
2. 
   Preface - 25th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]
   
   
3. 
   Understanding Maximal Repetitions in Strings. [Citation Graph (, )][DBLP]
   
   
4. 
   A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). [Citation Graph (, )][DBLP]
   
   
5. 
   Equilibria, Fixed Points, and Complexity Classes. [Citation Graph (, )][DBLP]
   
   
6. 
   Pushdown Compression. [Citation Graph (, )][DBLP]
   
   
7. 
   Quantum search with variable times. [Citation Graph (, )][DBLP]
   
   
8. 
   Structural aspects of tilings. [Citation Graph (, )][DBLP]
   
   
9. 
   Limit complexities revisited. [Citation Graph (, )][DBLP]
   
   
10. 
    Trimmed Moebius Inversion and Graphs of Bounded Degree. [Citation Graph (, )][DBLP]
    
    
11. 
    On the Complexity of the Interlace Polynomial. [Citation Graph (, )][DBLP]
    
    
12. 
    Minimizing Flow Time in the Wireless Gathering Problem. [Citation Graph (, )][DBLP]
    
    
13. 
    On Termination for Faulty Channel Machines. [Citation Graph (, )][DBLP]
    
    
14. 
    Stackelberg Network Pricing Games. [Citation Graph (, )][DBLP]
    
    
15. 
    Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. [Citation Graph (, )][DBLP]
    
    
16. 
    Finding Irrefutable Certificates for S₂^p via Arthur and Merlin. [Citation Graph (, )][DBLP]
    
    
17. 
    Quantifying Homology Classes. [Citation Graph (, )][DBLP]
    
    
18. 
    Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    Geodesic Fréchet Distance Inside a Simple Polygon. [Citation Graph (, )][DBLP]
    
    
20. 
    Improved Algorithms for the Range Next Value Problem and Applications. [Citation Graph (, )][DBLP]
    
    
21. 
    Connecting Polygonizations via Stretches and Twangs. [Citation Graph (, )][DBLP]
    
    
22. 
    Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. [Citation Graph (, )][DBLP]
    
    
23. 
    Tight Bounds for Blind Search on the Integers. [Citation Graph (, )][DBLP]
    
    
24. 
    Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps. [Citation Graph (, )][DBLP]
    
    
25. 
    Trimming of Graphs, with Application to Point Labeling. [Citation Graph (, )][DBLP]
    
    
26. 
    Computing Minimum Spanning Trees with Uncertainty. [Citation Graph (, )][DBLP]
    
    
27. 
    Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. [Citation Graph (, )][DBLP]
    
    
28. 
    Model Checking Games for the Quantitative µ-Calculus. [Citation Graph (, )][DBLP]
    
    
29. 
    Order-Invariant MSO is Stronger than Counting MSO in the Finite. [Citation Graph (, )][DBLP]
    
    
30. 
    Succinctness of the Complement and Intersection of Regular Expressions. [Citation Graph (, )][DBLP]
    
    
31. 
    Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. [Citation Graph (, )][DBLP]
    
    
32. 
    On the Complexity of Elementary Modal Logics. [Citation Graph (, )][DBLP]
    
    
33. 
    Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees. [Citation Graph (, )][DBLP]
    
    
34. 
    Complexity of solutions of equations over sets of natural numbers. [Citation Graph (, )][DBLP]
    
    
35. 
    Cardinality and counting quantifiers on omega-automatic structures. [Citation Graph (, )][DBLP]
    
    
36. 
    On the Induced Matching Problem. [Citation Graph (, )][DBLP]
    
    
37. 
    On Geometric Spanners of Euclidean and Unit Disk Graphs. [Citation Graph (, )][DBLP]
    
    
38. 
    The Frobenius Problem in a Free Monoid. [Citation Graph (, )][DBLP]
    
    
39. 
    Space Hierarchy Results for Randomized Models. [Citation Graph (, )][DBLP]
    
    
40. 
    Ehrenfeucht-Fraïssé Goes Automatic for Real Addition. [Citation Graph (, )][DBLP]
    
    
41. 
    New Combinatorial Complete One-Way Functions. [Citation Graph (, )][DBLP]
    
    
42. 
    Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. [Citation Graph (, )][DBLP]
    
    
43. 
    Geometric Set Cover and Hitting Sets for Polytopes in R³. [Citation Graph (, )][DBLP]
    
    
44. 
    A Theory for Valiant's Matchcircuits (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
45. 
    Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental. [Citation Graph (, )][DBLP]
    
    
46. 
    Lower bounds for adaptive linearity tests. [Citation Graph (, )][DBLP]
    
    
47. 
    An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines. [Citation Graph (, )][DBLP]
    
    
48. 
    Lagrangian Relaxation and Partial Cover (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
49. 
    On Dynamic Breadth-First Search in External-Memory. [Citation Graph (, )][DBLP]
    
    
50. 
    Analytic aspects of the shuffle product. [Citation Graph (, )][DBLP]
    
    
51. 
    Weak index versus Borel rank. [Citation Graph (, )][DBLP]
    
    
52. 
    A Mahler's theorem for functions from words to integers. [Citation Graph (, )][DBLP]
    
    
53. 
    Distinguishing Short Quantum Computations. [Citation Graph (, )][DBLP]
    
    
54. 
    Factoring Polynomials over Finite Fields using Balance Test. [Citation Graph (, )][DBLP]
    
    
55. 
    On the decomposition of k-valued rational relations. [Citation Graph (, )][DBLP]
    
    
56. 
    The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. [Citation Graph (, )][DBLP]
    
    
57. 
    Efficient Minimization of DFAs with Partial Transition. [Citation Graph (, )][DBLP]
    
    
58. 
    Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. [Citation Graph (, )][DBLP]
    
    
59. 
    Weighted Matching in the Semi-Streaming Model. [Citation Graph (, )][DBLP]