Fst Tcs 2003: Foundations Of Software Technology And Theoretical Computer Science: 23rd Conference, Mumbai India, by Paritosh K PandyaFst Tcs 2003: Foundations Of Software Technology And Theoretical Computer Science: 23rd Conference, Mumbai India, by Paritosh K Pandya

Fst Tcs 2003: Foundations Of Software Technology And Theoretical Computer Science: 23rd Conference…

byParitosh K PandyaEditorJaikumar Radhakrishnan

Paperback | December 3, 2003

Pricing and Purchase Info

$136.79 online 
$164.50 list price save 16%
Earn 684 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

share their expertise.
Title:Fst Tcs 2003: Foundations Of Software Technology And Theoretical Computer Science: 23rd Conference…Format:PaperbackDimensions:454 pages, 23.3 × 15.5 × 0.02 inPublished:December 3, 2003Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540206809

ISBN - 13:9783540206804

Look for similar items by category:

Reviews

Table of Contents

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.