FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings / edited by R. Ramanujam, Sandeep Sen.

Saved in:

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Ramanujam, R. (Editor), Sen, Sandeep (Editor)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edition:	1st ed. 2005.
Series:	Theoretical Computer Science and General Issues ; 3821 Springer eBook Collection.
Subjects:	Software engineering. Computers. Computer logic. Programming languages (Electronic computers). Algorithms. Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

Invited Papers
Semiperfect-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
Erd?s Magic
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-Erdös 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
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
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
Towards a CTL* Tableau
Bisimulation Quantified Logics: Undecidability
Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems
On the Expressiveness of TPTL and MTL
Modal Strength Reduction in Quantified Discrete Duration Calculus
Comparing Trees Via Crossing Minimization
On Counting the Number of Consistent Genotype Assignments for Pedigrees
Fixpoint Logics on Hierarchical Structures
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic
Proofs of Termination of Rewrite Systems for Polytime Functions
On the Controller Synthesis for Finite-State Markov Decision Processes
Reasoning About Quantum Knowledge.

FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings / edited by R. Ramanujam, Sandeep Sen.

Similar Items