
Conferences in DBLP
The Multicore Revolution. [Citation Graph (, )][DBLP]
Streaming Algorithms for Selection and Approximate Sorting. [Citation Graph (, )][DBLP]
Adventures in Bidirectional Programming. [Citation Graph (, )][DBLP]
Program Analysis Using Weighted Pushdown Systems. [Citation Graph (, )][DBLP]
The Complexity of Zero Knowledge. [Citation Graph (, )][DBLP]
The Priority kMedian Problem. [Citation Graph (, )][DBLP]
"RentorBuy" Scheduling and Cost Coloring Problems. [Citation Graph (, )][DBLP]
Order Scheduling Models: Hardness and Algorithms. [Citation Graph (, )][DBLP]
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. [Citation Graph (, )][DBLP]
Key Substitution in the Symbolic Analysis of Cryptographic Protocols. [Citation Graph (, )][DBLP]
Symbolic Bisimulation for the Applied Pi Calculus. [Citation Graph (, )][DBLP]
Nonmitotic Sets. [Citation Graph (, )][DBLP]
Reductions to Graph Isomorphism. [Citation Graph (, )][DBLP]
Strong Reductions and Isomorphism of Complete Sets. [Citation Graph (, )][DBLP]
Probabilistic and Topological Semantics for Timed Automata. [Citation Graph (, )][DBLP]
A Theory for Game Theories. [Citation Graph (, )][DBLP]
An Incremental Bisimulation Algorithm. [Citation Graph (, )][DBLP]
Logspace Algorithms for Computing Shortest and Longest Paths in SeriesParallel Graphs. [Citation Graph (, )][DBLP]
Communication Lower Bounds Via the Chromatic Number. [Citation Graph (, )][DBLP]
The Deduction Theorem for Strong Propositional Proof Systems. [Citation Graph (, )][DBLP]
Satisfiability of Algebraic Circuits over Sets of Natural Numbers. [Citation Graph (, )][DBLP]
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. [Citation Graph (, )][DBLP]
Synthesis of Safe MessagePassing Systems. [Citation Graph (, )][DBLP]
Automata and Logics for Timed Message Sequence Charts. [Citation Graph (, )][DBLP]
Propositional Dynamic Logic for MessagePassing Systems. [Citation Graph (, )][DBLP]
Better Algorithms and Bounds for Directed Maximum Leaf Problems. [Citation Graph (, )][DBLP]
Faster Algorithms for AllPairs Small Stretch Distances in Weighted Graphs. [Citation Graph (, )][DBLP]
Covering Graphs with Few Complete Bipartite Subgraphs. [Citation Graph (, )][DBLP]
Safely Composing Security Protocols. [Citation Graph (, )][DBLP]
Computationally Sound Typing for Noninterference: The Case of Deterministic Encryption. [Citation Graph (, )][DBLP]
Bounding Messages for Free in Security Protocols. [Citation Graph (, )][DBLP]
Triangulations of Line Segment Sets in the Plane. [Citation Graph (, )][DBLP]
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. [Citation Graph (, )][DBLP]
Finding a Rectilinear Shortest Path in R^{2} Using Corridor Based Staircase Structures. [Citation Graph (, )][DBLP]
Compressed Dynamic Tries with Applications to LZCompression in Sublinear Time and Space. [Citation Graph (, )][DBLP]
Stochastic Müller Games are PSPACEComplete. [Citation Graph (, )][DBLP]
Solving Parity Games in Big Steps. [Citation Graph (, )][DBLP]
Efficient and Expressive Tree Filters. [Citation Graph (, )][DBLP]
Markov Decision Processes with Multiple LongRun Average Objectives. [Citation Graph (, )][DBLP]
A Formal Investigation of. [Citation Graph (, )][DBLP]
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. [Citation Graph (, )][DBLP]
Undirected Graphs of Entanglement 2. [Citation Graph (, )][DBLP]
Acceleration in Convex DataFlow Analysis. [Citation Graph (, )][DBLP]
Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths. [Citation Graph (, )][DBLP]
Closures and Modules Within Linear Logic Concurrent Constraint Programming. [Citation Graph (, )][DBLP]
