| Invited Papers Semiper fect-Information Games Computational Complexity Since 1980 Developments in Data Structure Research During the First 25 Years of FSTTCS Inference Systems for Logical Algorithms From Logic to Games Proving Lower Bounds Via Pseudo-random Generators Contributed Papers No Coreset, No Cry: II Improved Bounds on the Union Complexity of Fat Objects On the Bisimulation Congruence in )/-Calculus Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names Approximation Algorithms for Wavelength Assignment The Set Cover with Pairs Problem Non-disclosure for Distributed Mobile Code Quantitative Models and Implicit Complexity The MSO Theory of Connectedly Communicating Processes Reachability of Hennessy-Milner Properties for Weakly Extended PRS Decision Procedures for Queues with Integer Constraints The Directed Planar Reachability Problem Dimensions of Copeland-ErdSs Sequences Refining the Undecidability Frontier of Hybrid Automata When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses S. Muthukrishnan Practical Algorithms for Tracking Database Join Sizes On Sampled Semantics of Timed Systems Eventual Timed Automata Causal Closure for MSC Languages Reachability Analysis of Multithreaded Software with Asynchronous Communication …… Author Index |
内容加载中，请稍后...
商品评论（0条）