FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings - nuovo libro

EAN (ISBN-13): 9783540770497
ISBN (ISBN-10): 3540770496
Copertina rigida
Copertina flessibile
Anno di pubblicazione: 2007
Editore: Springer Berlin Heidelberg
558 Pagine
Peso: 0,863 kg
Lingua: eng/Englisch

Libro nella banca dati dal 2007-10-19T10:59:14+02:00 (Zurich)
Pagina di dettaglio ultima modifica in 2024-03-18T15:11:32+01:00 (Zurich)
ISBN/EAN: 9783540770497

ISBN - Stili di scrittura alternativi:
3-540-77049-6, 978-3-540-77049-7
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : prasad
Titolo del libro: 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

---

Dati dell'editore

Autore: V. Arvind; Sanjiva Prasad
Titolo: 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
Editore: Springer; Springer Berlin
560 Pagine
Anno di pubblicazione: 2007-11-22
Berlin; Heidelberg; DE
Lingua: Inglese
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.