Vor Ort
Merkzettel Warenkorb
  • Produktbild: FST TCS 2000: Foundations of Software Technology and Theoretical Science
  • Produktbild: FST TCS 2000: Foundations of Software Technology and Theoretical Science
Band 1974

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

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

29.11.2000

Abbildungen

XIV, 538 p.

Herausgeber

Sanjiv Kapoor + weitere

Verlag

Springer Berlin

Seitenzahl

538

Maße (L/B/H)

23,5/15,5/3 cm

Gewicht

826 g

Auflage

2000

Sprache

Englisch

ISBN

978-3-540-41413-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

29.11.2000

Abbildungen

XIV, 538 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

538

Maße (L/B/H)

23,5/15,5/3 cm

Gewicht

826 g

Auflage

2000

Sprache

Englisch

ISBN

978-3-540-41413-1

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: FST TCS 2000: Foundations of Software Technology and Theoretical Science
  • Produktbild: FST TCS 2000: Foundations of Software Technology and Theoretical Science
  • 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.