The SCEAS System
Navigation Menu

Conferences in DBLP

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


  1. Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  2. Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  3. Beyond omega-Regular Languages. [Citation Graph (, )][DBLP]


  4. Reflections on Multivariate Algorithmics and Problem Parameterization. [Citation Graph (, )][DBLP]


  5. Mathematics, Cryptology, Security. [Citation Graph (, )][DBLP]


  6. Large-Girth Roots of Graphs. [Citation Graph (, )][DBLP]


  7. The Tropical Double Description Method. [Citation Graph (, )][DBLP]


  8. The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. [Citation Graph (, )][DBLP]


  9. Evasiveness and the Distribution of Prime Numbers. [Citation Graph (, )][DBLP]


  10. Dynamic Sharing of a Multiple Access Channel. [Citation Graph (, )][DBLP]


  11. Exact Covers via Determinants. [Citation Graph (, )][DBLP]


  12. On Iterated Dominance, Matrix Elimination, and Matched Paths. [Citation Graph (, )][DBLP]


  13. AMS Without 4-Wise Independence on Product Domains. [Citation Graph (, )][DBLP]


  14. Quantum Algorithms for Testing Properties of Distributions. [Citation Graph (, )][DBLP]


  15. Optimal Query Complexity for Reconstructing Hypergraphs. [Citation Graph (, )][DBLP]


  16. Ultimate Traces of Cellular Automata. [Citation Graph (, )][DBLP]


  17. Two-phase Algorithms for the Parametric Shortest Path Problem. [Citation Graph (, )][DBLP]


  18. Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window. [Citation Graph (, )][DBLP]


  19. Robust Fault Tolerant Uncapacitated Facility Location. [Citation Graph (, )][DBLP]


  20. Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. [Citation Graph (, )][DBLP]


  21. Log-space Algorithms for Paths and Matchings in k-trees. [Citation Graph (, )][DBLP]


  22. Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. [Citation Graph (, )][DBLP]


  23. The Traveling Salesman Problem under Squared Euclidean Distances. [Citation Graph (, )][DBLP]


  24. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. [Citation Graph (, )][DBLP]


  25. Planar Subgraph Isomorphism Revisited. [Citation Graph (, )][DBLP]


  26. Intrinsic Universality in Self-Assembly. [Citation Graph (, )][DBLP]


  27. Sponsored Search, Market Equilibria, and the Hungarian Method. [Citation Graph (, )][DBLP]


  28. Dispersion in Unit Disks. [Citation Graph (, )][DBLP]


  29. Long Non-crossing Configurations in the Plane. [Citation Graph (, )][DBLP]


  30. The Complexity of Approximating Bounded-Degree Boolean #CSP. [Citation Graph (, )][DBLP]


  31. The Complexity of the List Homomorphism Problem for Graphs. [Citation Graph (, )][DBLP]


  32. Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. [Citation Graph (, )][DBLP]


  33. Computing Least Fixed Points of Probabilistic Systems of Polynomials. [Citation Graph (, )][DBLP]


  34. The k-in-a-path Problem for Claw-free Graphs. [Citation Graph (, )][DBLP]


  35. Finding Induced Subgraphs via Minimal Triangulations. [Citation Graph (, )][DBLP]


  36. Inseparability and Strong Hypotheses for Disjoint NP Pairs. [Citation Graph (, )][DBLP]


  37. Branching-time Model Checking of One-counter Processes. [Citation Graph (, )][DBLP]


  38. Evolving Multialgebras Unify All Usual Sequential Computation Models. [Citation Graph (, )][DBLP]


  39. Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. [Citation Graph (, )][DBLP]


  40. Revisiting the Rice Theorem of Cellular Automata. [Citation Graph (, )][DBLP]


  41. On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity. [Citation Graph (, )][DBLP]


  42. Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion. [Citation Graph (, )][DBLP]


  43. On Equations over Sets of Integers. [Citation Graph (, )][DBLP]


  44. Randomized Algorithm for Agreeable Deadlines Packet Scheduling. [Citation Graph (, )][DBLP]


  45. Collapsible Pushdown Graphs of Level 2 are Tree-Automatic. [Citation Graph (, )][DBLP]


  46. Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. [Citation Graph (, )][DBLP]


  47. Holant Problems for Regular Graphs with Complex Edge Functions. [Citation Graph (, )][DBLP]


  48. Is Ramsey's Theorem omega-automatic?. [Citation Graph (, )][DBLP]


  49. An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem. [Citation Graph (, )][DBLP]


  50. Treewidth Reduction for Constrained Separation and Bipartization Problems. [Citation Graph (, )][DBLP]


  51. Online Correlation Clustering. [Citation Graph (, )][DBLP]


  52. The Recognition of Tolerance and Bounded Tolerance Graphs. [Citation Graph (, )][DBLP]


  53. Decidability of the Interval Temporal Logic ABB over the Natural Numbers. [Citation Graph (, )][DBLP]


  54. Relaxed Spanners for Directed Disk Graphs. [Citation Graph (, )][DBLP]


  55. Unsatisfiable Linear CNF Formulas Are Large and Complex. [Citation Graph (, )][DBLP]


  56. Construction Sequences and Certifying 3-Connectedness. [Citation Graph (, )][DBLP]


  57. Named Models in Coalgebraic Hybrid Logic. [Citation Graph (, )][DBLP]


  58. A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem. [Citation Graph (, )][DBLP]


  59. Alternation-Trading Proofs, Linear Programming, and Lower Bounds. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002