Conferences in DBLP

(csr)
2010 (conf/csr/2010)

1. 
   Algorithms for Energy Management. [Citation Graph (, )][DBLP]
   
   
2. 
   Sofic and Almost of Finite Type Tree-Shifts. [Citation Graph (, )][DBLP]
   
   
3. 
   Proof-Based Design of Security Protocols. [Citation Graph (, )][DBLP]
   
   
4. 
   Approximating the Minimum Length of Synchronizing Words Is Hard. [Citation Graph (, )][DBLP]
   
   
5. 
   Realizability of Dynamic MSC Languages. [Citation Graph (, )][DBLP]
   
   
6. 
   The max quasi-independent set Problem. [Citation Graph (, )][DBLP]
   
   
7. 
   Equilibria in Quantitative Reachability Games. [Citation Graph (, )][DBLP]
   
   
8. 
   Quotient Complexity of Closed Languages. [Citation Graph (, )][DBLP]
   
   
9. 
   Right-Sequential Functions on Infinite Words. [Citation Graph (, )][DBLP]
   
   
10. 
    Kernelization. [Citation Graph (, )][DBLP]
    
    
11. 
    Zigzags in Turing Machines. [Citation Graph (, )][DBLP]
    
    
12. 
    Frameworks for Logically Classifying Polynomial-Time Optimisation Problems. [Citation Graph (, )][DBLP]
    
    
13. 
    Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. [Citation Graph (, )][DBLP]
    
    
14. 
    Identical Relations in Symmetric Groups and Separating Words with Reversible Automata. [Citation Graph (, )][DBLP]
    
    
15. 
    Time Optimal d-List Colouring of a Graph. [Citation Graph (, )][DBLP]
    
    
16. 
    The Cantor Space as a Generic Model of Topologically Presented Knowledge. [Citation Graph (, )][DBLP]
    
    
17. 
    Algorithmics - Is There Hope for a Unified Theory? [Citation Graph (, )][DBLP]
    
    
18. 
    Classifying Rankwidth k-DH-Graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms. [Citation Graph (, )][DBLP]
    
    
20. 
    A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem. [Citation Graph (, )][DBLP]
    
    
21. 
    Balancing Bounded Treewidth Circuits. [Citation Graph (, )][DBLP]
    
    
22. 
    Obtaining Online Ecological Colourings by Generalizing First-Fit. [Citation Graph (, )][DBLP]
    
    
23. 
    Classical Simulation and Complexity of Quantum Computations. [Citation Graph (, )][DBLP]
    
    
24. 
    Prefix-Free and Prefix-Correct Complexities with Compound Conditions. [Citation Graph (, )][DBLP]
    
    
25. 
    Monotone Complexity of a Pair. [Citation Graph (, )][DBLP]
    
    
26. 
    Symbolic Models for Single-Conclusion Proof Logics. [Citation Graph (, )][DBLP]
    
    
27. 
    Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA. [Citation Graph (, )][DBLP]
    
    
28. 
    Advancing Matrix Computations with Randomized Preprocessing. [Citation Graph (, )][DBLP]
    
    
29. 
    Transfinite Sequences of Constructive Predicate Logics. [Citation Graph (, )][DBLP]
    
    
30. 
    The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms. [Citation Graph (, )][DBLP]
    
    
31. 
    A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. [Citation Graph (, )][DBLP]
    
    
32. 
    Complexity of Propositional Proofs. [Citation Graph (, )][DBLP]
    
    
33. 
    Quantization of Random Walks: Search Algorithms and Hitting Time. [Citation Graph (, )][DBLP]
    
    
34. 
    Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]
    
    
35. 
    Growth of Power-Free Languages over Large Alphabets. [Citation Graph (, )][DBLP]
    
    
36. 
    A Partially Synchronizing Coloring. [Citation Graph (, )][DBLP]
    
    
37. 
    An Encoding Invariant Version of Polynomial Time Computable Distributions. [Citation Graph (, )][DBLP]
    
    
38. 
    Prehistoric Phenomena and Self-referentiality. [Citation Graph (, )][DBLP]