FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Ramanujam, R. (Editor ), Sen, Sandeep (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Theoretical Computer Science and General Issues, 3821
Temas:
Software engineering.
Computer science.
Compilers (Computer programs).
Algorithms.
Software Engineering.
Theory of Computation.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares