skip to content
Fsttcs 2004: Foundations of Software Technology and Theoretical Computer Science : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings. Preview this item
ClosePreview this item
Checking...

Fsttcs 2004: Foundations of Software Technology and Theoretical Computer Science : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings.

Author: Kamal Lodaya; Meena Mahajan; Springer-Verlag.
Publisher: New York : Springer, May 2005.
Series: Lecture Notes in Computer Science Ser.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
Annotation.
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Printed edition:
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Kamal Lodaya; Meena Mahajan; Springer-Verlag.
ISBN: 9783540305385 3540305386 3540240586 9783540240587
OCLC Number: 846886486
Description: 1 online resource
Contents: Invited Papers --
Genome Halving Problem Revisited --
Verifying Probabilistic Procedural Programs --
Streaming Algorithms for Geometric Problems --
Toward a Grainless Semantics for Shared-Variable Concurrency --
Regular Languages, Unambiguous Concatenation and Computational Complexity --
Contributed Papers --
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets --
On the Urgency Expressiveness --
Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages --
A Decidable Fragment of Separation Logic --
Approximate Range Searching Using Binary Space Partitions --
Representable Disjoint NP-Pairs --
Symbolic Reachability Analysis of Higher-Order Context-Free Processes --
Optimal Strategies in Priced Timed Game Automata --
A Calculus for Trust Management --
Short-Cuts on Star, Source and Planar Unfoldings --
Subdividing Alpha Complex --
Real-Counter Automata and Their Decision Problems --
Adjunct Elimination Through Games in Static Ambient Logic --
On the Bisimulation Invariant Fragment of Monadic ?1 in the Finite --
On the Complexity of Hilbert's 17th Problem --
Who is Pointing When to Whom? --
An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix --
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems --
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS --
Minimum Weight Pseudo-Triangulations --
Join Algorithms for the Theory of Uninterpreted Functions --
No, Coreset, No Cry --
Hardness Hypotheses, Derandomization, and Circuit Complexity --
Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract --
Learning Languages from Positive Data and a Finite Number of Queries --
The Complexity of the Local Hamiltonian Problem --
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds --
Adaptive Stabilization of Reactive Protocols --
Visibly Pushdown Games --
Refinement and Separation Contexts --
Decidability of MSO Theories of Tree Structures --
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks --
Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size --
Testing Geometric Convexity --
Complexity of Linear Connectivity Problems in Directed Hypergraphs --
Actively Learning to Verify Safety for FIFO Automata --
Reasoning About Game Equilibria Using Temporal Logic --
Alternation in Equational Tree Automata Modulo XOR.
Series Title: Lecture Notes in Computer Science Ser.

Abstract:

Annotation.

This book constitutes the refereed proceedings of the 24th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004, held in Chennai, India, in December 2004. The 35 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 176 submissions. The papers address a broad variety of current issues in software science, programming theory, systems design and analysis, formal methods, mathematical logic, mathematical foundations, discrete mathematics, combinatorial mathematics, complexity theory, automata theory, and theoretical computer science in general.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


\n\n

Primary Entity<\/h3>\n
<http:\/\/www.worldcat.org\/oclc\/846886486<\/a>> # Fsttcs 2004: Foundations of Software Technology and Theoretical Computer Science : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings.<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Book<\/a>, schema:MediaObject<\/a>, schema:CreativeWork<\/a> ;\u00A0\u00A0\u00A0\nlibrary:oclcnum<\/a> \"846886486<\/span>\" ;\u00A0\u00A0\u00A0\nlibrary:placeOfPublication<\/a> <http:\/\/id.loc.gov\/vocabulary\/countries\/nju<\/a>> ;\u00A0\u00A0\u00A0\nlibrary:placeOfPublication<\/a> <http:\/\/dbpedia.org\/resource\/New_York_City<\/a>> ; # New York<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/logic_design<\/a>> ; # Logic design<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/dewey.info\/class\/005.3\/e22\/<\/a>> ;\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/software_engineering_programming_and_operating_systems<\/a>> ; # Software Engineering\/Programming and Operating Systems<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/software_engineering<\/a>> ; # Software engineering<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/computer_science<\/a>> ; # Computer science<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/computer_software<\/a>> ; # Computer software<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/algorithm_analysis_and_problem_complexity<\/a>> ; # Algorithm Analysis and Problem Complexity<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/logics_and_meanings_of_programs<\/a>> ; # Logics and Meanings of Programs<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/programming_languages_compilers_interpreters<\/a>> ; # Programming Languages, Compilers, Interpreters<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/information_theory<\/a>> ; # Information theory<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/mathematical_logic_and_formal_languages<\/a>> ; # Mathematical Logic and Formal Languages<\/span>\n\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/theory_of_computation<\/a>> ; # Theory of Computation<\/span>\n\u00A0\u00A0\u00A0\nschema:bookFormat<\/a> schema:EBook<\/a> ;\u00A0\u00A0\u00A0\nschema:contributor<\/a> <http:\/\/viaf.org\/viaf\/168669677<\/a>> ; # Springer-Verlag.<\/span>\n\u00A0\u00A0\u00A0\nschema:contributor<\/a> <http:\/\/viaf.org\/viaf\/217243856<\/a>> ; # Meena Mahajan<\/span>\n\u00A0\u00A0\u00A0\nschema:creator<\/a> <http:\/\/viaf.org\/viaf\/188501928<\/a>> ; # Kamal Lodaya<\/span>\n\u00A0\u00A0\u00A0\nschema:datePublished<\/a> \"May 2005<\/span>\" ;\u00A0\u00A0\u00A0\nschema:description<\/a> \"Invited Papers -- Genome Halving Problem Revisited -- Verifying Probabilistic Procedural Programs -- Streaming Algorithms for Geometric Problems -- Toward a Grainless Semantics for Shared-Variable Concurrency -- Regular Languages, Unambiguous Concatenation and Computational Complexity -- Contributed Papers -- Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets -- On the Urgency Expressiveness -- Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages -- A Decidable Fragment of Separation Logic -- Approximate Range Searching Using Binary Space Partitions -- Representable Disjoint NP-Pairs -- Symbolic Reachability Analysis of Higher-Order Context-Free Processes -- Optimal Strategies in Priced Timed Game Automata -- A Calculus for Trust Management -- Short-Cuts on Star, Source and Planar Unfoldings -- Subdividing Alpha Complex -- Real-Counter Automata and Their Decision Problems -- Adjunct Elimination Through Games in Static Ambient Logic -- On the Bisimulation Invariant Fragment of Monadic ?1 in the Finite -- On the Complexity of Hilbert\'s 17th Problem -- Who is Pointing When to Whom? -- An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix -- Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems -- Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS -- Minimum Weight Pseudo-Triangulations -- Join Algorithms for the Theory of Uninterpreted Functions -- No, Coreset, No Cry -- Hardness Hypotheses, Derandomization, and Circuit Complexity -- Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract -- Learning Languages from Positive Data and a Finite Number of Queries -- The Complexity of the Local Hamiltonian Problem -- Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds -- Adaptive Stabilization of Reactive Protocols -- Visibly Pushdown Games -- Refinement and Separation Contexts -- Decidability of MSO Theories of Tree Structures -- Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks -- Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size -- Testing Geometric Convexity -- Complexity of Linear Connectivity Problems in Directed Hypergraphs -- Actively Learning to Verify Safety for FIFO Automata -- Reasoning About Game Equilibria Using Temporal Logic -- Alternation in Equational Tree Automata Modulo XOR.<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\nschema:description<\/a> \"Annotation.<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\nschema:exampleOfWork<\/a> <http:\/\/worldcat.org\/entity\/work\/id\/9187946254<\/a>> ;\u00A0\u00A0\u00A0\nschema:inLanguage<\/a> \"en<\/span>\" ;\u00A0\u00A0\u00A0\nschema:isPartOf<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Series\/lecture_notes_in_computer_science_ser<\/a>> ; # Lecture Notes in Computer Science Ser.<\/span>\n\u00A0\u00A0\u00A0\nschema:isSimilarTo<\/a> <http:\/\/worldcat.org\/entity\/work\/data\/9187946254#CreativeWork\/<\/a>> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Fsttcs 2004: Foundations of Software Technology and Theoretical Computer Science : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings.<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\nschema:productID<\/a> \"846886486<\/span>\" ;\u00A0\u00A0\u00A0\nschema:publication<\/a> <http:\/\/www.worldcat.org\/title\/-\/oclc\/846886486#PublicationEvent\/new_york_springer_may_2005<\/a>> ;\u00A0\u00A0\u00A0\nschema:publisher<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Agent\/springer<\/a>> ; # Springer<\/span>\n\u00A0\u00A0\u00A0\nschema:url<\/a> <https:\/\/link.springer.com\/book\/10.1007\/978-3-540-24058-7<\/a>> ;\u00A0\u00A0\u00A0\nschema:url<\/a> <https:\/\/doi.org\/10.1007\/b104325<\/a>> ;\u00A0\u00A0\u00A0\nschema:url<\/a> <http:\/\/VH7QX3XE2P.search.serialssolutions.com\/?V=1.0&L=VH7QX3XE2P&S=JCs&C=TC0000159558&T=marc&tab=BOOKS<\/a>> ;\u00A0\u00A0\u00A0\nschema:url<\/a> <https:\/\/link.springer.com\/book\/10.1007%2F978-3-540-24058-7<\/a>> ;\u00A0\u00A0\u00A0\nschema:url<\/a> <https:\/\/link.springer.com\/10.1007\/b104325<\/a>> ;\u00A0\u00A0\u00A0\nschema:workExample<\/a> <http:\/\/worldcat.org\/isbn\/9783540305385<\/a>> ;\u00A0\u00A0\u00A0\nschema:workExample<\/a> <http:\/\/worldcat.org\/isbn\/9783540240587<\/a>> ;\u00A0\u00A0\u00A0\nwdrs:describedby<\/a> <http:\/\/www.worldcat.org\/title\/-\/oclc\/846886486<\/a>> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n\n

Related Entities<\/h3>\n
<http:\/\/dbpedia.org\/resource\/New_York_City<\/a>> # New York<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Place<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"New York<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/dewey.info\/class\/005.3\/e22\/<\/a>>\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Agent\/springer<\/a>> # Springer<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nbgn:Agent<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Springer<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Series\/lecture_notes_in_computer_science_ser<\/a>> # Lecture Notes in Computer Science Ser.<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nbgn:PublicationSeries<\/a> ;\u00A0\u00A0\u00A0\nschema:hasPart<\/a> <http:\/\/www.worldcat.org\/oclc\/846886486<\/a>> ; # Fsttcs 2004: Foundations of Software Technology and Theoretical Computer Science : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings.<\/span>\n\u00A0\u00A0\u00A0\nschema:name<\/a> \"Lecture Notes in Computer Science Ser.<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/algorithm_analysis_and_problem_complexity<\/a>> # Algorithm Analysis and Problem Complexity<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Algorithm Analysis and Problem Complexity<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/computer_science<\/a>> # Computer science<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Computer science<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/computer_software<\/a>> # Computer software<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Computer software<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/information_theory<\/a>> # Information theory<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Information theory<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/logic_design<\/a>> # Logic design<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Logic design<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/logics_and_meanings_of_programs<\/a>> # Logics and Meanings of Programs<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Logics and Meanings of Programs<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/mathematical_logic_and_formal_languages<\/a>> # Mathematical Logic and Formal Languages<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Mathematical Logic and Formal Languages<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/programming_languages_compilers_interpreters<\/a>> # Programming Languages, Compilers, Interpreters<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Programming Languages, Compilers, Interpreters<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/software_engineering<\/a>> # Software engineering<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Software engineering<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/software_engineering_programming_and_operating_systems<\/a>> # Software Engineering\/Programming and Operating Systems<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Software Engineering\/Programming and Operating Systems<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9187946254#Topic\/theory_of_computation<\/a>> # Theory of Computation<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Intangible<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Theory of Computation<\/span>\"@en<\/a> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/id.loc.gov\/vocabulary\/countries\/nju<\/a>>\u00A0\u00A0\u00A0\u00A0a \nschema:Place<\/a> ;\u00A0\u00A0\u00A0\ndcterms:identifier<\/a> \"nju<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/viaf.org\/viaf\/168669677<\/a>> # Springer-Verlag.<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Organization<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Springer-Verlag.<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/viaf.org\/viaf\/188501928<\/a>> # Kamal Lodaya<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Person<\/a> ;\u00A0\u00A0\u00A0\nschema:familyName<\/a> \"Lodaya<\/span>\" ;\u00A0\u00A0\u00A0\nschema:givenName<\/a> \"Kamal<\/span>\" ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Kamal Lodaya<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/viaf.org\/viaf\/217243856<\/a>> # Meena Mahajan<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Person<\/a> ;\u00A0\u00A0\u00A0\nschema:familyName<\/a> \"Mahajan<\/span>\" ;\u00A0\u00A0\u00A0\nschema:givenName<\/a> \"Meena<\/span>\" ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Meena Mahajan<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/worldcat.org\/entity\/work\/data\/9187946254#CreativeWork\/<\/a>>\u00A0\u00A0\u00A0\u00A0a \nschema:CreativeWork<\/a> ;\u00A0\u00A0\u00A0\nschema:description<\/a> \"Printed edition:<\/span>\" ;\u00A0\u00A0\u00A0\nschema:isSimilarTo<\/a> <http:\/\/www.worldcat.org\/oclc\/846886486<\/a>> ; # Fsttcs 2004: Foundations of Software Technology and Theoretical Computer Science : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings.<\/span>\n\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/worldcat.org\/isbn\/9783540240587<\/a>>\u00A0\u00A0\u00A0\u00A0a \nschema:ProductModel<\/a> ;\u00A0\u00A0\u00A0\nschema:isbn<\/a> \"3540240586<\/span>\" ;\u00A0\u00A0\u00A0\nschema:isbn<\/a> \"9783540240587<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/worldcat.org\/isbn\/9783540305385<\/a>>\u00A0\u00A0\u00A0\u00A0a \nschema:ProductModel<\/a> ;\u00A0\u00A0\u00A0\nschema:isbn<\/a> \"3540305386<\/span>\" ;\u00A0\u00A0\u00A0\nschema:isbn<\/a> \"9783540305385<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/www.worldcat.org\/title\/-\/oclc\/846886486<\/a>>\u00A0\u00A0\u00A0\u00A0a \ngenont:InformationResource<\/a>, genont:ContentTypeGenericResource<\/a> ;\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/www.worldcat.org\/oclc\/846886486<\/a>> ; # Fsttcs 2004: Foundations of Software Technology and Theoretical Computer Science : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings.<\/span>\n\u00A0\u00A0\u00A0\nschema:dateModified<\/a> \"2020-10-06<\/span>\" ;\u00A0\u00A0\u00A0\nvoid:inDataset<\/a> <http:\/\/purl.oclc.org\/dataset\/WorldCat<\/a>> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n