FST TCS 2000: Foundations of Software Technology and Theoretical Science 20th Conference, New Delhi, India, December13-15, 2000 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Kapoor, Sanjiv (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Prasad, Sanjiva (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Computer Science, 1974
• Θέματα: Computers.; Computer logic.; Programming languages (Electronic computers).; Mathematical logic.; Algorithms.; Computer science-Mathematics.; Theory of Computation.; Logics and Meanings of Programs.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Formal Languages.; Algorithm Analysis and Problem Complexity.; Mathematics of Computing.

 Invited Presentations -- Model Checking: Theory into Practice -- An Algebra for XML Query -- Irregularities of Distribution, Derandomization, and Complexity Theory -- Rewriting Logic as a Metalogical Framework -- Frequency Assignment in Mobile Phone Systems -- Data Provenance: Some Basic Issues -- Contributions -- Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition -- On-Line Edge-Coloring with a Fixed Number of Colors -- On Approximability of the Independent/Connected Edge Dominating Set Problems -- Model Checking CTL Properties of Pushdown Systems -- A Decidable Dense Branching-Time Temporal Logic -- Fair Equivalence Relations -- Arithmetic Circuits and Polynomial Replacement Systems -- Depth-3 Arithmetic Circuits for S inn su2 (X) and Extensions of the Graham-Pollack Theorem -- The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite -- Combining Semantics with Non-standard Interpreter Hierarchies -- Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping -- Dynamically Ordered Probabilistic Choice Logic Programming -- Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems -- Planar Graph Blocking for External Searching -- A Complete Fragment of Higher-Order Duration ?-Calculus -- A Complete Axiomatisation for Timed Automata -- Text Sparsification via Local Maxima -- Approximate Swapped Matching -- A Semantic Theory for Heterogeneous System Design -- Formal Verification of the Ricart-Agrawala Algorithm -- On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation -- ? in2 sup -Completeness: A Classical Approach for New Results -- Is the Standard Proof System for SAT P-Optimal? -- A General Framework for Types in Graph Rewriting -- The Ground Congruence for Chi Calculus -- Inheritance in the Join Calculus -- Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints -- Dynamic Spectrum Allocation: The Impotency of Duration Notification -- The Fine Structure of Game Lambda Models -- Strong Normalization of Second Order Symmetric ?-Calculus -- Scheduling to Minimize the Average Completion Time of Dedicated Tasks -- Hunting for Functionally Analogous Genes -- Keeping Track of the Latest Gossip in Shared Memory Systems -- Concurrent Knowledge and Logical Clock Abstractions -- Decidable Hierarchies of Starfree Languages -- Prefix Languages of Church-Rosser Languages.