Conferences in DBLP

Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (fsttcs)
2007 (conf/fsttcs/2007)

1. 
   The Multicore Revolution. [Citation Graph (, )][DBLP]
   
   
2. 
   Streaming Algorithms for Selection and Approximate Sorting. [Citation Graph (, )][DBLP]
   
   
3. 
   Adventures in Bidirectional Programming. [Citation Graph (, )][DBLP]
   
   
4. 
   Program Analysis Using Weighted Pushdown Systems. [Citation Graph (, )][DBLP]
   
   
5. 
   The Complexity of Zero Knowledge. [Citation Graph (, )][DBLP]
   
   
6. 
   The Priority k-Median Problem. [Citation Graph (, )][DBLP]
   
   
7. 
   "Rent-or-Buy" Scheduling and Cost Coloring Problems. [Citation Graph (, )][DBLP]
   
   
8. 
   Order Scheduling Models: Hardness and Algorithms. [Citation Graph (, )][DBLP]
   
   
9. 
   On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. [Citation Graph (, )][DBLP]
   
   
10. 
    Key Substitution in the Symbolic Analysis of Cryptographic Protocols. [Citation Graph (, )][DBLP]
    
    
11. 
    Symbolic Bisimulation for the Applied Pi Calculus. [Citation Graph (, )][DBLP]
    
    
12. 
    Non-mitotic Sets. [Citation Graph (, )][DBLP]
    
    
13. 
    Reductions to Graph Isomorphism. [Citation Graph (, )][DBLP]
    
    
14. 
    Strong Reductions and Isomorphism of Complete Sets. [Citation Graph (, )][DBLP]
    
    
15. 
    Probabilistic and Topological Semantics for Timed Automata. [Citation Graph (, )][DBLP]
    
    
16. 
    A Theory for Game Theories. [Citation Graph (, )][DBLP]
    
    
17. 
    An Incremental Bisimulation Algorithm. [Citation Graph (, )][DBLP]
    
    
18. 
    Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    Communication Lower Bounds Via the Chromatic Number. [Citation Graph (, )][DBLP]
    
    
20. 
    The Deduction Theorem for Strong Propositional Proof Systems. [Citation Graph (, )][DBLP]
    
    
21. 
    Satisfiability of Algebraic Circuits over Sets of Natural Numbers. [Citation Graph (, )][DBLP]
    
    
22. 
    Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. [Citation Graph (, )][DBLP]
    
    
23. 
    Synthesis of Safe Message-Passing Systems. [Citation Graph (, )][DBLP]
    
    
24. 
    Automata and Logics for Timed Message Sequence Charts. [Citation Graph (, )][DBLP]
    
    
25. 
    Propositional Dynamic Logic for Message-Passing Systems. [Citation Graph (, )][DBLP]
    
    
26. 
    Better Algorithms and Bounds for Directed Maximum Leaf Problems. [Citation Graph (, )][DBLP]
    
    
27. 
    Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. [Citation Graph (, )][DBLP]
    
    
28. 
    Covering Graphs with Few Complete Bipartite Subgraphs. [Citation Graph (, )][DBLP]
    
    
29. 
    Safely Composing Security Protocols. [Citation Graph (, )][DBLP]
    
    
30. 
    Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption. [Citation Graph (, )][DBLP]
    
    
31. 
    Bounding Messages for Free in Security Protocols. [Citation Graph (, )][DBLP]
    
    
32. 
    Triangulations of Line Segment Sets in the Plane. [Citation Graph (, )][DBLP]
    
    
33. 
    Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. [Citation Graph (, )][DBLP]
    
    
34. 
    Finding a Rectilinear Shortest Path in R² Using Corridor Based Staircase Structures. [Citation Graph (, )][DBLP]
    
    
35. 
    Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. [Citation Graph (, )][DBLP]
    
    
36. 
    Stochastic Müller Games are PSPACE-Complete. [Citation Graph (, )][DBLP]
    
    
37. 
    Solving Parity Games in Big Steps. [Citation Graph (, )][DBLP]
    
    
38. 
    Efficient and Expressive Tree Filters. [Citation Graph (, )][DBLP]
    
    
39. 
    Markov Decision Processes with Multiple Long-Run Average Objectives. [Citation Graph (, )][DBLP]
    
    
40. 
    A Formal Investigation of. [Citation Graph (, )][DBLP]
    
    
41. 
    Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. [Citation Graph (, )][DBLP]
    
    
42. 
    Undirected Graphs of Entanglement 2. [Citation Graph (, )][DBLP]
    
    
43. 
    Acceleration in Convex Data-Flow Analysis. [Citation Graph (, )][DBLP]
    
    
44. 
    Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths. [Citation Graph (, )][DBLP]
    
    
45. 
    Closures and Modules Within Linear Logic Concurrent Constraint Programming. [Citation Graph (, )][DBLP]