You have Guest access.
Log In
Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas and Wolfgang Thomas
Front matter
1-15
A Survey of Stochastic Games with Limsup and Liminf Objectives
16-30
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
31-42
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
43-54
When Are Timed Automata Determinizable?
55-66
Faithful Loops for Aperiodic E-Ordered Monoids (Extended Abstract)
67-78
Boundedness of Monadic Second-Order Formulae over Finite Words
79-90
Semilinear Program Feasibility
91-102
Floats and Ropes: A Case Study for Formal Numerical Program Verification
103-114
Reachability in Stochastic Timed Games
115-126
Equations Defining the Polynomial Closure of a Lattice of Regular Languages
127-138
Approximating Markov Processes by Averaging
139-150
The Theory of Stabilisation Monoids and Regular Cost Functions
151-162
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
163-174
On Constructor Rewrite Systems and the Lambda-Calculus
175-187
On Regular Temporal Logics with Past,
188-199
Forward Analysis for WSTS, Part II: Complete WSTS
200-211
Qualitative Concurrent Stochastic Games with Imperfect Information
212-222
Diagrammatic Confluence and Completion
223-234
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
235-246
LTL Path Checking Is Efficiently Parallelizable
247-260
An Explicit Formula for the Free Exponential Modality of Linear Logic
261-272
Decidability of the Guarded Fragment with the Transitive Closure
273-284
Weak Alternating Timed Automata
285-296
A Decidable Characterization of Locally Testable Tree Languages
297-308
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
309-327
Google’s Auction for TV Ads
328-338
Graph Sparsification in the Semi-streaming Model
339-350
Sort Me If You Can: How to Sort Dynamic Data
351-362
Maximum Bipartite Flow in Networks with Adaptive Channel Width
363-374
Mediated Population Protocols
375-386
Rumor Spreading in Social Networks
387-398
MANETS: High Mobility Can Make Up for Low Transmission Power
399-410
Multiple Random Walks and Interacting Particle Systems
411-422
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
423-434
On a Network Generalization of the Minmax Theorem
435-446
Rate-Based Transition Systems for Stochastic Process Calculi
447-458
Improved Algorithms for Latency Minimization in Wireless Networks
459-471
Efficient Methods for Selfish Network Design
472-483
Smoothed Analysis of Balancing Networks
484-495
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
496-507
Multi-armed Bandits with Metric Switching Costs
508-520
Algorithms for Secretary Problems on Graphs and Hypergraphs
521-533
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
534-545
Secure Function Collection with Sublinear Storage
546-557
Worst-Case Efficiency Analysis of Queueing Disciplines
558-570
On Observing Dynamic Prioritised Actions in SOC
571-582
A Distributed and Oblivious Heap
583-594
Proportional Response Dynamics in the Fisher Market
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info