- 5 Risultati
prezzo più basso: € 4,45, prezzo più alto: € 114,75, prezzo medio: € 66,95
1
FST TCS 2000: Foundations of Software Technology and Theoretical Science : 20th Conference, New Delhi, India, December13-15, 2000 Proceedings - Sanjiva Prasad
Ordina
da ZVAB.com
€ 52,96
Spedizione: € 0,001
OrdinaLink sponsorizzato
Sanjiva Prasad:

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

2000, ISBN: 3540414134

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

NEW BOOK. Costi di spedizione:Versandkostenfrei. (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
Ordina
da BookDepository.com
€ 114,75
Spedizione: € 0,001
OrdinaLink sponsorizzato

Sanjiv Kapoor:

FST TCS 2000: Foundations of Software Technology and Theoretical Science - edizione con copertina flessibile

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… Altro …

Costi di spedizione:Versandkostenfrei. (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)
Ordina
da Achtung-Buecher.de
€ 55,60
Spedizione: € 0,001
OrdinaLink sponsorizzato
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 - nuovo libro

2000

ISBN: 3540414134

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

Costi di spedizione:Versandkostenfrei 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
Ordina
da amazon.de
€ 4,45
Spedizione: € 3,001
OrdinaLink sponsorizzato
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) - edizione con copertina flessibile

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… Altro …

Gut Costi di spedizione:Auf 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
Ordina
da lehmanns.de
€ 106,99
Spedizione: € 0,001
OrdinaLink sponsorizzato
Sanjiv Kapoor; Sanjiva Prasad:
FST TCS 2000: Foundations of Software Technology and Theoretical Science - edizione con copertina flessibile

2000, ISBN: 9783540414131

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

Costi di spedizione:Versand in 10-14 Tagen. (EUR 0.00)

1Poiché alcune piattaforme non trasmettono le condizioni di spedizione e queste possono dipendere dal paese di consegna, dal prezzo di acquisto, dal peso e dalle dimensioni dell'articolo, dall'eventuale iscrizione alla piattaforma, dalla consegna diretta da parte della piattaforma o tramite un fornitore terzo (Marketplace), ecc. è possibile che le spese di spedizione indicate da eurolibro non corrispondano a quelle della piattaforma offerente.

Dati bibliografici del miglior libro corrispondente

Dettagli del libro
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.

Informazioni dettagliate del libro - 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
Copertina rigida
Copertina flessibile
Anno di pubblicazione: 2000
Editore: Springer
552 Pagine
Peso: 0,824 kg
Lingua: eng/Englisch

Libro nella banca dati dal 2008-06-05T17:04:17+02:00 (Zurich)
Pagina di dettaglio ultima modifica in 2024-03-18T15:11:35+01:00 (Zurich)
ISBN/EAN: 9783540414131

ISBN - Stili di scrittura alternativi:
3-540-41413-4, 978-3-540-41413-1
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : kapoor
Titolo del libro: new delhi, tcs for ever, foundations software technology and theoretical computer science, 2000, new india


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: 2000-11-29
Berlin; Heidelberg; DE
Lingua: Inglese
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

< Per archiviare...