
Conferences in DBLP
Preface  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009). [Citation Graph (, )][DBLP]
Mediating for Reduction (on Minimizing Alternating Büchi Automata). [Citation Graph (, )][DBLP]
Algorithms for Message Ferrying on Mobile ad hoc Networks. [Citation Graph (, )][DBLP]
Arithmetic Circuits and the Hadamard Product of Polynomials. [Citation Graph (, )][DBLP]
Kernels for Feedback Arc Set In Tournaments. [Citation Graph (, )][DBLP]
On the Memory Consumption of Probabilistic Pushdown Automata. [Citation Graph (, )][DBLP]
ContinuousTime Stochastic Games with TimeBounded Reachability. [Citation Graph (, )][DBLP]
Deterministic Automata and Extensions of Weak MSO. [Citation Graph (, )][DBLP]
On Timed Alternating Simulation for Concurrent Timed Games. [Citation Graph (, )][DBLP]
Covering of ordinals. [Citation Graph (, )][DBLP]
Fractional Pebbling and Thrifty Branching Programs. [Citation Graph (, )][DBLP]
The Wadge Hierarchy of MaxRegular Languages. [Citation Graph (, )][DBLP]
Automata and temporal logic over arbitrary linear time. [Citation Graph (, )][DBLP]
Graph Isomorphism for K_{3, 3}free and K_5free graphs is in Logspace. [Citation Graph (, )][DBLP]
Domination Problems in NowhereDense Classes. [Citation Graph (, )][DBLP]
Simulation based security in the applied pi calculus. [Citation Graph (, )][DBLP]
The Covering and Boundedness Problems for Branching Vector Addition Systems. [Citation Graph (, )][DBLP]
Subexponential Algorithms for Partial Cover Problems. [Citation Graph (, )][DBLP]
On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities. [Citation Graph (, )][DBLP]
Kolmogorov Complexity in Randomness Extraction. [Citation Graph (, )][DBLP]
Donation Center Location Problem. [Citation Graph (, )][DBLP]
NonLocal Box Complexity and Secure Function Evaluation. [Citation Graph (, )][DBLP]
Verification and Refutation of Probabilistic Specifications via Games. [Citation Graph (, )][DBLP]
Approximating FaultTolerant GroupSteiner Problems. [Citation Graph (, )][DBLP]
Bounded Size Graph Clustering with Applications to Stream Processing. [Citation Graph (, )][DBLP]
A Finegrained Analysis of a Simple Independent Set Algorithm. [Citation Graph (, )][DBLP]
Using Elimination Theory to construct Rigid Matrices. [Citation Graph (, )][DBLP]
On Nondeterministic Unranked Tree Automata with Sibling Constraints. [Citation Graph (, )][DBLP]
Functionally Private Approximations of NegligiblyBiased Estimators. [Citation Graph (, )][DBLP]
Nash Equilibrium in Generalised Muller Games. [Citation Graph (, )][DBLP]
Modelchecking counting properties of 1safe nets with buffers in paraPSPACE. [Citation Graph (, )][DBLP]
Synthesis of Finitestate and Definable Winning Strategies. [Citation Graph (, )][DBLP]
The Power of Depth 2 Circuits over Algebras. [Citation Graph (, )][DBLP]
Deductive Verification of Continuous Dynamical Systems. [Citation Graph (, )][DBLP]
Recurrence and Transience for Probabilistic Automata. [Citation Graph (, )][DBLP]
Structure and Specification as Sources of Complexity. [Citation Graph (, )][DBLP]
Priced Timed Automata: Theory and Tools. [Citation Graph (, )][DBLP]
Fighting bit Rot with Types (Experience Report: Scala Collections). [Citation Graph (, )][DBLP]
Iterative Methods in Combinatorial Optimization. [Citation Graph (, )][DBLP]
Randomness extractors  applications and constructions. [Citation Graph (, )][DBLP]
