- 5 Résultats
prix le plus bas: € 4,45, prix le plus élevé: € 114,75, prix moyen: € 66,95
1
FST TCS 2000: Foundations of Software Technology and Theoretical Science : 20th Conference, New Delhi, India, December13-15, 2000 Proceedings - Sanjiva Prasad
Commander
sur ZVAB.com
€ 52,96
Envoi: € 0,001
CommanderLien sponsorisé
Sanjiva Prasad:

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

2000, ISBN: 3540414134

[EAN: 9783540414131], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; INFORMATIK; THEORETICALCOMPUTERSCIENCE; XML; ALGORITHMS; AUTOMATA; COMPLEXITY; COMPLEXITYTHEORY; C… Plus…

NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
2
FST TCS 2000: Foundations of Software Technology and Theoretical Science - Sanjiv Kapoor
Commander
sur BookDepository.com
€ 114,75
Envoi: € 0,001
CommanderLien sponsorisé

Sanjiv Kapoor:

FST TCS 2000: Foundations of Software Technology and Theoretical Science - Livres de poche

2000, ISBN: 9783540414131

Paperback, [PU: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG], The Foundations of SoftwareTechnology and Theoretical Computer Science c- ference (FST TCS) is a well-established ann… Plus…

Frais d'envoiVersandkostenfrei. (EUR 0.00)
3
FST TCS 2000: Foundations of Software Technology and Theoretical Science 20th Conference, New Delhi, India, December13-15, 2000 Proceedings - Prasad, Sanjiva (Herausgeber); Kapoor, Sanjiv (Herausgeber)
Commander
sur Achtung-Buecher.de
€ 55,60
Envoi: € 0,001
CommanderLien sponsorisé
Prasad, Sanjiva (Herausgeber); Kapoor, Sanjiv (Herausgeber):
FST TCS 2000: Foundations of Software Technology and Theoretical Science 20th Conference, New Delhi, India, December13-15, 2000 Proceedings - nouveau livre

2000

ISBN: 3540414134

2000 Kartoniert / Broschiert Algorithmus, Informatik, Algorithmen und Datenstrukturen, Compiler und Übersetzer, Theoretische Informatik, theoreticalcomputerscience; XML; algorithms; aut… Plus…

Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
4
FST TCS 2000: Foundations of Software Technology and Theoretical Science: 20th Conference, New Delhi, India, December13-15, 2000 Proceedings (Lecture Notes in Computer Science, 1974, Band 1974) - Prasad, Sanjiva, Kapoor, Sanjiv
Commander
sur amazon.de
€ 4,45
Envoi: € 3,001
CommanderLien sponsorisé
Prasad, Sanjiva, Kapoor, Sanjiv:
FST TCS 2000: Foundations of Software Technology and Theoretical Science: 20th Conference, New Delhi, India, December13-15, 2000 Proceedings (Lecture Notes in Computer Science, 1974, Band 1974) - Livres de poche

2008, ISBN: 9783540414131

Springer, Taschenbuch, Auflage: 2000, 552 Seiten, Publiziert: 2008-06-13T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: Illustrations, 3.73 kg, Informatik, IT-Ausbildung & -Berufe, Compu… Plus…

Gut Frais d'envoiAuf Lager. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Zubal Books Inc.
5
FST TCS 2000: Foundations of Software Technology and Theoretical Science - Sanjiv Kapoor; Sanjiva Prasad
Commander
sur lehmanns.de
€ 106,99
Envoi: € 0,001
CommanderLien sponsorisé
Sanjiv Kapoor; Sanjiva Prasad:
FST TCS 2000: Foundations of Software Technology and Theoretical Science - Livres de poche

2000, ISBN: 9783540414131

20th Conference, New Delhi, India, December13-15, 2000 Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2000

Frais d'envoiVersand in 10-14 Tagen. (EUR 0.00)

1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
FST TCS 2000: Foundations of Software Technology and Theoretical Science: 20th Conference, New Delhi, India, December13-15, 2000 Proceedings (Lecture Notes in Computer Science, 1974, Band 1974)

This book constitutes the refereed proceedings of the 20th international Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2000, held in New Delhi, India in December 2000. The 36 revised full papers presented were carefully reviewed and selected from a total of 141 submissions; also included are six invited papers. The volume provides broad coverage of the logical and mathematical foundations of computer science and spans the whole range of theoretical computer science.

Informations détaillées sur le livre - FST TCS 2000: Foundations of Software Technology and Theoretical Science: 20th Conference, New Delhi, India, December13-15, 2000 Proceedings (Lecture Notes in Computer Science, 1974, Band 1974)


EAN (ISBN-13): 9783540414131
ISBN (ISBN-10): 3540414134
Version reliée
Livre de poche
Date de parution: 2000
Editeur: Springer
552 Pages
Poids: 0,824 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2008-06-05T17:04:17+02:00 (Zurich)
Page de détail modifiée en dernier sur 2024-03-18T15:11:35+01:00 (Zurich)
ISBN/EAN: 9783540414131

ISBN - Autres types d'écriture:
3-540-41413-4, 978-3-540-41413-1
Autres types d'écriture et termes associés:
Auteur du livre: kapoor
Titre du livre: new delhi, tcs for ever, foundations software technology and theoretical computer science, 2000, new india


Données de l'éditeur

Auteur: Sanjiv Kapoor; Sanjiva Prasad
Titre: Lecture Notes in Computer Science; FST TCS 2000: Foundations of Software Technology and Theoretical Science - 20th Conference, New Delhi, India, December13-15, 2000 Proceedings
Editeur: Springer; Springer Berlin
538 Pages
Date de parution: 2000-11-29
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIV, 538 p.

BC; Hardcover, Softcover / 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; Theory of Computation; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Formal Languages and Automata Theory; Algorithms; Mathematics of Computing; Compiler und Übersetzer; Algorithmen und Datenstrukturen; Mathematik für Informatiker; EA

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

< pour archiver...