|
|
Conferences in DBLP
A Survey of Stochastic Games with Limsup and Liminf Objectives. [Citation Graph (, )][DBLP]
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions. [Citation Graph (, )][DBLP]
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types. [Citation Graph (, )][DBLP]
When Are Timed Automata Determinizable? [Citation Graph (, )][DBLP]
Faithful Loops for Aperiodic E-Ordered Monoids. [Citation Graph (, )][DBLP]
Boundedness of Monadic Second-Order Formulae over Finite Words. [Citation Graph (, )][DBLP]
Semilinear Program Feasibility. [Citation Graph (, )][DBLP]
Floats and Ropes: A Case Study for Formal Numerical Program Verification. [Citation Graph (, )][DBLP]
Reachability in Stochastic Timed Games. [Citation Graph (, )][DBLP]
Equations Defining the Polynomial Closure of a Lattice of Regular Languages. [Citation Graph (, )][DBLP]
Approximating Markov Processes by Averaging. [Citation Graph (, )][DBLP]
The Theory of Stabilisation Monoids and Regular Cost Functions. [Citation Graph (, )][DBLP]
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. [Citation Graph (, )][DBLP]
On Constructor Rewrite Systems and the Lambda-Calculus. [Citation Graph (, )][DBLP]
On Regular Temporal Logics with Past, . [Citation Graph (, )][DBLP]
Forward Analysis for WSTS, Part II: Complete WSTS. [Citation Graph (, )][DBLP]
Qualitative Concurrent Stochastic Games with Imperfect Information. [Citation Graph (, )][DBLP]
Diagrammatic Confluence and Completion. [Citation Graph (, )][DBLP]
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus. [Citation Graph (, )][DBLP]
LTL Path Checking Is Efficiently Parallelizable. [Citation Graph (, )][DBLP]
An Explicit Formula for the Free Exponential Modality of Linear Logic. [Citation Graph (, )][DBLP]
Decidability of the Guarded Fragment with the Transitive Closure. [Citation Graph (, )][DBLP]
Weak Alternating Timed Automata. [Citation Graph (, )][DBLP]
A Decidable Characterization of Locally Testable Tree Languages. [Citation Graph (, )][DBLP]
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games. [Citation Graph (, )][DBLP]
Google's Auction for TV Ads. [Citation Graph (, )][DBLP]
Graph Sparsification in the Semi-streaming Model. [Citation Graph (, )][DBLP]
Sort Me If You Can: How to Sort Dynamic Data. [Citation Graph (, )][DBLP]
Maximum Bipartite Flow in Networks with Adaptive Channel Width. [Citation Graph (, )][DBLP]
Mediated Population Protocols. [Citation Graph (, )][DBLP]
Rumor Spreading in Social Networks. [Citation Graph (, )][DBLP]
MANETS: High Mobility Can Make Up for Low Transmission Power. [Citation Graph (, )][DBLP]
Multiple Random Walks and Interacting Particle Systems. [Citation Graph (, )][DBLP]
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. [Citation Graph (, )][DBLP]
On a Network Generalization of the Minmax Theorem. [Citation Graph (, )][DBLP]
Rate-Based Transition Systems for Stochastic Process Calculi. [Citation Graph (, )][DBLP]
Improved Algorithms for Latency Minimization in Wireless Networks. [Citation Graph (, )][DBLP]
Efficient Methods for Selfish Network Design. [Citation Graph (, )][DBLP]
Smoothed Analysis of Balancing Networks. [Citation Graph (, )][DBLP]
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. [Citation Graph (, )][DBLP]
Multi-armed Bandits with Metric Switching Costs. [Citation Graph (, )][DBLP]
Algorithms for Secretary Problems on Graphs and Hypergraphs. [Citation Graph (, )][DBLP]
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. [Citation Graph (, )][DBLP]
Secure Function Collection with Sublinear Storage. [Citation Graph (, )][DBLP]
Worst-Case Efficiency Analysis of Queueing Disciplines. [Citation Graph (, )][DBLP]
On Observing Dynamic Prioritised Actions in SOC. [Citation Graph (, )][DBLP]
A Distributed and Oblivious Heap. [Citation Graph (, )][DBLP]
Proportional Response Dynamics in the Fisher Market. [Citation Graph (, )][DBLP]
|
