FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science - nouveau livre

EAN (ISBN-13): 9783540245971
Date de parution: 2003
Editeur: Springer Berlin Heidelberg

Livre dans la base de données depuis 2017-01-28T19:51:16+01:00 (Zurich)
Page de détail modifiée en dernier sur 2023-12-02T15:34:49+01:00 (Zurich)
ISBN/EAN: 9783540245971

ISBN - Autres types d'écriture:
978-3-540-24597-1
Autres types d'écriture et termes associés:
Auteur du livre: radhakrishnan
Titre du livre: 2003, software, computer science

---

Données de l'éditeur

Auteur: Paritosh K Pandya; Jaikumar Radhakrishnan
Titre: Lecture Notes in Computer Science; FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science - 23rd Conference, Mumbai India, December 15-17, 2003, Proceedings
Editeur: Springer; Springer Berlin
454 Pages
Date de parution: 2003-11-24
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIV, 454 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithm; algorithmics; algorithms; complexily theory; computer; computer science; computing theory; distributed algorithms; formal methods; optimization; program semantics; programming; programming calculs; programming theory; theoretical computer science; algorithm analysis and problem complexity; C; Theory of Computation; Computer and Information Systems Applications; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Algorithms; Computer Science; Angewandte Informatik; Compiler und Übersetzer; Algorithmen und Datenstrukturen; BC

Contributed Papers.- A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol.- Constructions of Sparse Asymmetric Connectors.- A Separation Logic for Resource Distribution.- An Equational Theory for Transactions.- Axioms for Regular Words.- 1-Bounded TWA Cannot Be Determinized.- Reachability Analysis of Process Rewrite Systems.- Pushdown Games with Unboundedness and Regular Conditions.- Real-Time Model-Checking: Parameters Everywhere.- The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata.- Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents.- Subtyping Constraints in Quasi-lattices.- An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case.- Word Equations over Graph Products.- Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models.- Comparing Sequences with Segment Rearrangements.- On Logically Defined Recognizable Tree Languages.- Randomized Time-Space Tradeoffs for Directed Graph Connectivity.- Distance-Preserving Approximations of Polygonal Paths.- Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra.- On the Covering Steiner Problem.- Minimality Results for the Spatial Logics.- Algorithms for Non-uniform Size Data Placement on Parallel Disks.- Efficient Algorithms for Abelian Group Isomorphism and Related Problems.- Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.- Model Checking and Satisfiability for Sabotage Modal Logic.- Merging and Sorting By Strip Moves.- The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase.- Distributed Games.- Maintenance of Multidimensional Histograms.- Tagging Makes Secrecy Decidable with Unbounded Nonces as Well.- Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties.- On the Greedy Superstring Conjecture.- Invited Papers.- Reasoning about Infinite State Systems Using Boolean Methods.- Stringent Relativization.- Component-Based Construction of Deadlock-Free Systems.- Moderately Hard Functions: From Complexity to Spam Fighting.- Zigzag Products, Expander Constructions, Connections, and Applications.
Includes supplementary material: sn.pub/extras