|
|
|
|
| LEADER |
03745nmm a2200373 u 4500 |
| 001 |
EB000652099 |
| 003 |
EBX01000000000000001348846 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540245971
|
| 100 |
1 |
|
|a Pandya, Paritosh K.
|e [editor]
|
| 245 |
0 |
0 |
|a FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
|h Elektronische Ressource
|b 23rd Conference, Mumbai India, December 15-17, 2003, Proceedings
|c edited by Paritosh K Pandya, Jaikumar Radhakrishnan
|
| 250 |
|
|
|a 1st ed. 2003
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2003, 2003
|
| 300 |
|
|
|a XIV, 454 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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 --
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Application software
|
| 653 |
|
|
|a Computer and Information Systems Applications
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Radhakrishnan, Jaikumar
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/b94618
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b94618?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|