- 5 Ergebnisse
Kleinster Preis: € 53,49, größter Preis: € 104,72, Mittelwert: € 87,36
1
FST TCS 2000: Foundations of Software Technology and Theoretical Science
Bestellen
bei Hugendubel.de
€ 96,49
Versand: € 0,001
Bestellengesponserter Link

FST TCS 2000: Foundations of Software Technology and Theoretical Science - neues Buch

2000, ISBN: 9783540444503

FST TCS 2000: Foundations of Software Technology and Theoretical Science ab 96.49 € als pdf eBook: 20th Conference New Delhi India December13-15 2000 Proceedings. Aus dem Bereich: eBooks,… Mehr…

Nr. 33482599. Versandkosten:, , DE. (EUR 0.00)
2
FST TCS 2000: Foundations of Software Technology and Theoretical Science
Bestellen
bei eBook.de
€ 53,49
Bestellengesponserter Link
FST TCS 2000: Foundations of Software Technology and Theoretical Science - neues Buch

2000, ISBN: 9783540444503

FST TCS 2000: Foundations of Software Technology and Theoretical Science - 20th Conference New Delhi India December13-15 2000 Proceedings: ab 53.49 € eBooks > Fachthemen & Wissenschaft > … Mehr…

Versandkosten:in stock, , , plus shipping costs., zzgl. Versandkosten
3
FST TCS 2000: Foundations of Software Technology and Theoretical Science
Bestellen
bei eBook.de
€ 96,49
Versand: € 0,001
Bestellengesponserter Link
FST TCS 2000: Foundations of Software Technology and Theoretical Science - neues Buch

2000

ISBN: 9783540444503

FST TCS 2000: Foundations of Software Technology and Theoretical Science - 20th Conference New Delhi India December13-15 2000 Proceedings: ab 96.49 € Medien > Bücher > E-books, [PU: Sprin… Mehr…

Nr. 33482599. Versandkosten:, , DE. (EUR 0.00)
4
Bestellen
bei lehmanns.de
€ 104,72
Versand: € 0,001
Bestellengesponserter Link
Sanjiv Kapoor; Sanjiva Prasad:
FST TCS 2000: Foundations of Software Technology and Theoretical Science - neues Buch

2003, ISBN: 9783540444503

20th Conference, New Delhi, India, December13-15, 2000 Proceedings, eBooks, eBook Download (PDF), [PU: Springer Berlin Heidelberg], Springer Berlin Heidelberg, 2003

Versandkosten:Download sofort lieferbar. (EUR 0.00)
5
FST TCS 2000: Foundations of Software Technology and Theoretical Science - Sanjiv Kapoor; Sanjiva Prasad
Bestellen
bei Springer.com
€ 85,59
Versand: € 0,001
Bestellengesponserter Link
Sanjiv Kapoor; Sanjiva Prasad:
FST TCS 2000: Foundations of Software Technology and Theoretical Science - neues Buch

2000, ISBN: 9783540444503

There is currently no description available Books > Computer Science eBook, Springer Shop

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch

Detailangaben zum Buch - FST TCS 2000: Foundations of Software Technology and Theoretical Science


EAN (ISBN-13): 9783540444503
Erscheinungsjahr: 2000
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-01-21T22:49:34+01:00 (Zurich)
Detailseite zuletzt geändert am 2023-05-31T13:36:47+02:00 (Zurich)
ISBN/EAN: 9783540444503

ISBN - alternative Schreibweisen:
978-3-540-44450-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: 2000, technology technology, foundations science, software


Daten vom Verlag:

Autor/in: Sanjiv Kapoor; Sanjiva Prasad
Titel: Lecture Notes in Computer Science; FST TCS 2000: Foundations of Software Technology and Theoretical Science - 20th Conference, New Delhi, India, December13-15, 2000 Proceedings
Verlag: Springer; Springer Berlin
538 Seiten
Erscheinungsjahr: 2003-06-26
Berlin; Heidelberg; DE
Sprache: Englisch
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

< zum Archiv...