FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science 23rd Conference, Mumbai India, December 15-17, 2003, Proceedings / edited by Paritosh K Pandya, Jaikumar Radhakrishnan.

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Pandya, Paritosh K. (Editor), Radhakrishnan, Jaikumar (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
Edition:1st ed. 2003.
Series:Lecture Notes in Computer Science, 2914
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3233303
003 MWH
005 20191022112405.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 |a 9783540245971 
024 7 |a 10.1007/b94618  |2 doi 
035 |a (DE-He213)978-3-540-24597-1 
050 4 |a E-Book 
072 7 |a UY  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UY  |2 thema 
072 7 |a UYA  |2 thema 
245 1 0 |a FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science  |h [electronic resource] :  |b 23rd Conference, Mumbai India, December 15-17, 2003, Proceedings /  |c edited by Paritosh K Pandya, Jaikumar Radhakrishnan. 
250 |a 1st ed. 2003. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2003. 
300 |a XIV, 454 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2914 
490 1 |a Springer eBook Collection 
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 -- 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. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Computers. 
650 0 |a Application software. 
650 0 |a Computer logic. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Algorithms. 
690 |a Electronic resources (E-books) 
700 1 |a Pandya, Paritosh K.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Radhakrishnan, Jaikumar.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2914 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/b94618  |3 Click to view e-book  |t 0 
907 |a .b32333031  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21464686  |z 02-26-20 
999 f f |i d2638eee-0afe-5a14-847a-798c1bb02292  |s 27e9befa-45e0-5938-999c-778eb1342df0  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File