FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings - neues Buch
2007, ISBN: 3540770496
2007 Kartoniert / Broschiert Informatik, Compiler und Übersetzer, Software Engineering, Theoretische Informatik, Automat; automata; automatatheory; complexity; complexitytheory; compute… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings - Taschenbuch
2007, ISBN: 3540770496
[EAN: 9783540770497], Gebraucht, guter Zustand, [SC: 0.0], [PU: Springer Berlin], COMPLEXITY THEORY,COMPUTER,PROGRAMMING,AUTOMATA THEORY,ALGORITHM ANALYSIS AND PROBLEM COMPLEXITY,MATHEMAT… Mehr…
ZVAB.com Buchpark, Trebbin, Germany [83435977] [Rating: 5 (von 5)] NOT NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) Details... |
2007, ISBN: 9783540770497
*FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science* - 27th International Conference New Delhi India December 12-14 2007 Proceedings. Auflage 2007 / Taschenb… Mehr…
Hugendubel.de Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., zzgl. Versandkosten. (EUR 3.95) Details... |
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings - gebrauchtes Buch
2007, ISBN: 9783540770497
[PU: Springer Berlin], Neubindung, Buchrücken fehlerhaft geklebt, Aufl. 2007 4067189/12, DE, [SC: 0.00], gebraucht; sehr gut, gewerbliches Angebot, 2007, Banküberweisung, Kreditkarte, Pay… Mehr…
booklooker.de |
2007, ISBN: 9783540770497
1st Edition, by V. Arvind; â??Sanjiva Prasad, PRINT ISBN: 9783540770497 E-TEXT ISBN: 9783540770503 Springer Nature eBook Other pricing structure might be available at vitalsource.com., Sp… Mehr…
VitalSource.com new in stock United States. Versandkosten:plus shipping costs., zzgl. Versandkosten Details... |
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings - neues Buch
2007, ISBN: 3540770496
2007 Kartoniert / Broschiert Informatik, Compiler und Übersetzer, Software Engineering, Theoretische Informatik, Automat; automata; automatatheory; complexity; complexitytheory; compute… Mehr…
Arvind, V. und Sanjiva Prasad:
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings - Taschenbuch2007, ISBN: 3540770496
[EAN: 9783540770497], Gebraucht, guter Zustand, [SC: 0.0], [PU: Springer Berlin], COMPLEXITY THEORY,COMPUTER,PROGRAMMING,AUTOMATA THEORY,ALGORITHM ANALYSIS AND PROBLEM COMPLEXITY,MATHEMAT… Mehr…
2007
ISBN: 9783540770497
*FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science* - 27th International Conference New Delhi India December 12-14 2007 Proceedings. Auflage 2007 / Taschenb… Mehr…
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings - gebrauchtes Buch
2007, ISBN: 9783540770497
[PU: Springer Berlin], Neubindung, Buchrücken fehlerhaft geklebt, Aufl. 2007 4067189/12, DE, [SC: 0.00], gebraucht; sehr gut, gewerbliches Angebot, 2007, Banküberweisung, Kreditkarte, Pay… Mehr…
2007, ISBN: 9783540770497
1st Edition, by V. Arvind; â??Sanjiva Prasad, PRINT ISBN: 9783540770497 E-TEXT ISBN: 9783540770503 Springer Nature eBook Other pricing structure might be available at vitalsource.com., Sp… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science
EAN (ISBN-13): 9783540770497
ISBN (ISBN-10): 3540770496
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2007
Herausgeber: Springer Berlin Heidelberg
558 Seiten
Gewicht: 0,863 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-10-19T10:59:14+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-03-18T15:11:32+01:00 (Vienna)
ISBN/EAN: 9783540770497
ISBN - alternative Schreibweisen:
3-540-77049-6, 978-3-540-77049-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: prasad
Titel des Buches: new delhi, technology war, international conference computer science, xii international conference, the foundations the science war, foundations software technology and theoretical computer science, computer science 1st edition ebook, new india
Daten vom Verlag:
Autor/in: V. Arvind; Sanjiva Prasad
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings
Verlag: Springer; Springer Berlin
560 Seiten
Erscheinungsjahr: 2007-11-22
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIV, 560 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Informatik; Automat; automata; automata theory; complexity; complexity theory; computer; computer science; design; formal method; logic; mathematical logic; programming; algorithm analysis and problem complexity; Theory of Computation; Software Engineering; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Formal Languages and Automata Theory; Algorithms; Software Engineering; Compiler und Übersetzer; Algorithmen und Datenstrukturen; EA
Invited Papers.- The Multicore Revolution.- Streaming Algorithms for Selection and Approximate Sorting.- Adventures in Bidirectional Programming.- Program Analysis Using Weighted Pushdown Systems.- The Complexity of Zero Knowledge.- Contributed Papers.- The Priority k-Median Problem.- “Rent-or-Buy” Scheduling and Cost Coloring Problems.- Order Scheduling Models: Hardness and Algorithms.- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography.- Key Substitution in the Symbolic Analysis of Cryptographic Protocols.- Symbolic Bisimulation for the Applied Pi Calculus.- Non-mitotic Sets.- Reductions to Graph Isomorphism.- Strong Reductions and Isomorphism of Complete Sets.- Probabilistic and Topological Semantics for Timed Automata.- A Theory for Game Theories.- An Incremental Bisimulation Algorithm.- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.- Communication Lower Bounds Via the Chromatic Number.- The Deduction Theorem for Strong Propositional Proof Systems.- Satisfiability of Algebraic Circuits over Sets of Natural Numbers.- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems.- Synthesis of Safe Message-Passing Systems.- Automata and Logics for Timed Message Sequence Charts.- Propositional Dynamic Logic for Message-Passing Systems.- Better Algorithms and Bounds for Directed Maximum Leaf Problems.- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs.- Covering Graphs with Few Complete Bipartite Subgraphs.- Safely Composing Security Protocols.- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption.- Bounding Messages for Free in Security Protocols.- Triangulations of Line Segment Sets in the Plane.- ReconstructingConvex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections.- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures.- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.- Stochastic Müller Games are PSPACE-Complete.- Solving Parity Games in Big Steps.- Efficient and Expressive Tree Filters.- Markov Decision Processes with Multiple Long-Run Average Objectives.- A Formal Investigation of Diff3.- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem.- Undirected Graphs of Entanglement 2.- Acceleration in Convex Data-Flow Analysis.- Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths.- Closures and Modules Within Linear Logic Concurrent Constraint Programming.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780387587158 Foundations of Software Technology and Theoretical Computer Science: 14th Conference, Madras, India, December 15-17, 1994 : Proceedings (P. S. Thiagarajan)
- 9780387587158 Foundations of Software Technology and Theoretical Computer Science: 14th Conference, Madras, India, December 15-17, 1994 : Proceedings (P. S. Thiagarajan)
- 9780387138831 Foundations of Software Technology and Theoretical Computer Science (Lecture Notes in Computer Science) (Editor-Mathai Joseph)
- 9780387534879 Foundations of Software Technology and Theoretical Computer Science 10th Conference, Bangalore, India, Dec. 17-19, 1990 Proceedings (Lecture Notes in Computer Science) (Kesav V. Nori)
- 9780387549675 Foundations of Software Technology and Theoretical Computer Science 11th Conference, New Delhi, India December 17-19, 1991 Proceedings (S. Biswas; Editor-Kesav V. Nori)
- 9780387171791 Foundations of Software Technology and Theoretical Computer Science: Sixth Conference, New Delhi, India December 18-20, 1986 Proceedings (Editor-Kesav V. Nori)
- 9780387575292 Foundations of Software Technology and Theoretical Computer Science: 13th Conference Bombay, India, December 15-17, 1993 : Proceedings (R. K. Shyamasundar)
- FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings. (Hariharan, Ramesh et al. (Eds.))
< zum Archiv...