FST TCS 2000: Foundations of Software Technology and Theoretical Science - nuovo libro

EAN (ISBN-13): 9783540444503
Anno di pubblicazione: 2000
Editore: Springer Berlin Heidelberg

Libro nella banca dati dal 2017-01-21T22:49:34+01:00 (Zurich)
Pagina di dettaglio ultima modifica in 2023-05-31T13:36:47+02:00 (Zurich)
ISBN/EAN: 9783540444503

ISBN - Stili di scrittura alternativi:
978-3-540-44450-3
Stili di scrittura alternativi e concetti di ricerca simili:
Titolo del libro: 2000, technology technology, foundations science, software

---

Dati dell'editore

Autore: Sanjiv Kapoor; Sanjiva Prasad
Titolo: Lecture Notes in Computer Science; FST TCS 2000: Foundations of Software Technology and Theoretical Science - 20th Conference, New Delhi, India, December13-15, 2000 Proceedings
Editore: Springer; Springer Berlin
538 Pagine
Anno di pubblicazione: 2003-06-26
Berlin; Heidelberg; DE
Lingua: Inglese
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIV, 538 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Theoretical computer science; XML; algorithms; automata; complexity; complexity theory; computing theory; discrete mathematics; formal methods; formal verification; model checking; program semantics; programming; software science; verification; algorithm analysis and problem complexity; C; Theory of Computation; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Formal Languages and Automata Theory; Algorithms; Mathematics of Computing; Computer Science; Compiler und Übersetzer; Algorithmen und Datenstrukturen; Mathematik für Informatiker; BC

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.
Includes supplementary material: sn.pub/extras