| 000 | 04595nam a22005895i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-24597-1 | ||
| 003 | DE-He213 | ||
| 005 | 20240423132446.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2003 gw | s |||| 0|eng d | ||
| 020 |
_a9783540245971 _9978-3-540-24597-1 |
||
| 024 | 7 |
_a10.1007/b94618 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aFST TCS 2003: Foundations of Software Technology and Theoretical Computer Science _h[electronic resource] : _b23rd Conference, Mumbai India, December 15-17, 2003, Proceedings / _cedited by Paritosh K Pandya, Jaikumar Radhakrishnan. |
| 250 | _a1st ed. 2003. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2003. |
|
| 300 |
_aXIV, 454 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2914 |
|
| 505 | 0 | _aContributed 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. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aApplication software. | |
| 650 | 0 | _aCompilers (Computer programs). | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 1 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aComputer and Information Systems Applications. |
| 650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
| 650 | 2 | 4 | _aCompilers and Interpreters. |
| 650 | 2 | 4 | _aAlgorithms. |
| 700 | 1 |
_aPandya, Paritosh K. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aRadhakrishnan, Jaikumar. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540206804 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662196397 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2914 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/b94618 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c187979 _d187979 |
||