FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings

Buch | Softcover

XIV, 566 Seiten

2005
Springer Berlin (Verlag)
978-3-540-30495-1 (ISBN)

Artikel merken

This year marks a milestone in the history of FST&TCS, which ?rst took place in 1981. We would like to take this opportunity to express our appreciation of the foresight and commitment to excellence shown by the early organizersof the conference. The conference is now organized by IARCS (Indian Association for Researchin Computing Science), and the conference has been the foundation on which the IARCS community has been built. To commemorate the Silver Jubilee of FST&TCS, we had an extra day to accommodate special sessions and a larger number of invited speakers. As in previousyears,wewerefortunatetohaveanumberofhighlyeminentresearchers giving plenary talks. It gives us great pleasure to thank Manindra Agrawal, Tom Henzinger, Russell Impagliazzo, Raimund Seidel, Natarajan Shankar, Joel Spencer and Igor Walukiewicz for agreeing to give talks and for contributing to this volume. This year sconference attracted 167 submissions with authors from 29 co- tries. Except for some papers which were deemed to be out of scope by the ProgramCommittee (PC),eachsubmissionwasreviewedby atleastthreem- bers of the PC, with help from many external reviewers. With 466 reviews at hand, the PC deliberated for more than two weeks before ?nally selecting the 38 papers included in this volume. We thank all the reviewers for their inva- able help. The PC members put in a great deal of hard work to select the best papers from the submissions. We express our gratitude to all PC members for doing an excellent job. Special thanks are due to Kamal Lodaya for managing the conference software as well.

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 DynamicPeer-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.

Erscheint lt. Verlag	7.12.2005
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XIV, 566 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	816 g
Themenwelt	Mathematik / Informatik ► Informatik ► Software Entwicklung
Schlagworte	Algorithm analysis and problem complexity • Algorithmics • Approximation • Automat • Automata • Automata Theory • Complexity • Complexity theory • Computability • Computational Discrete Mathematics • Computer • Computer Science • Computing Theory • Concurrency • Design • distributed algorithms • Formal Languages • Formal Method • formal methods • Logic • Mathematical Foundations • Mathematical Logic • Optimization • programming • programming calculus • Programming Theory • Software Technology • theory of computing
ISBN-10	3-540-30495-9 / 3540304959
ISBN-13	978-3-540-30495-1 / 9783540304951
Zustand	Neuware