The Resource Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)
Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)
Resource Information
The item Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 This book constitutes the refereed proceedings of the 6th International Conference on Theory and Applications of Models of Computation, TAMC 2009, held in Changsha, China in May 2009. The 39 full papers presented together with 7 invited papers as well as 3 plenary talks were selected from 86 submissions. The papers address the three main themes of the conference which were Computability, Complexity, and Algorithms. The conference aimed to bring together researchers with interests in theoretical computer science, algorithmic mathematics, and applications to the physical sciences
 Language
 eng
 Extent
 1 online resource (xiv, 482 pages)
 Note
 Title from title screen (viewed August 14, 2009)
 Contents

 Plenary Talks
 Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks
 Constraints, Graphs, Algebra, Logic, and Complexity
 Distributed Systems and Their Environments
 Invited Special Session: Models of Computation
 Coevolution and Information Signals in Biological Sequences
 The Extended Turing Model as Contextual Tool
 Strong Positive Reducibilities
 Invited Special Session: Algorithms and Complexity
 FixedParameter Algorithms for GraphModeled Date Clustering
 On Spanners of Geometric Graphs
 Searching Trees: An Essay
 Approximability and FixedParameter Tractability for the Exemplar Genomic Distance Problems
 Contributed Papers
 A Quadratic Kernel for 3Set Packing
 Quantitative Aspects of SpeedUp and Gap Phenomena
 Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG
 On the Connection between Interval Size Functions and Path Counting
 On the Red/Blue Spanning Tree Problem
 Undecidability of CostBounded Reachability in Priced Probabilistic Timed Automata
 A Computational Proof of Complexity of Some Restricted Counting Problems
 BlockGraph Width
 Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs
 On Parameterized Exponential Time Complexity
 BestOrder Streaming Model
 Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces
 Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
 Improved Deterministic Algorithms for Weighted Matching and Packing Problems
 Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
 Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
 A Complete Characterisation of the Linear CliqueWidth of Path Powers
 Preserving Privacy versus Data Retention
 Kolmogorov Complexity and Combinatorial Methods in Communication Complexity
 An Almost Totally Universal Tile Set
 Linear Kernel for Planar Connected Dominating Set
 A Simple Greedy Algorithm for the kDisjoint Flow Problem
 Minimizing ANDEXOR Expressions for MultipleValued TwoInput Logic Functions
 Exact and Experimental Algorithms for a HuffmanBased Error Detecting Code
 Terminal Coalgebras for MeasurePolynomial Functors
 High Minimal Pairs in the Enumeration Degrees
 Searching a Circular Corridor with Two Flashlights
 On the Complexity of the Multiple Stack TSP, kSTSP
 Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
 An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues
 A FixedParameter Enumeration Algorithm for the Weighted FVS Problem
 On the Tractability of Maximal Strip Recovery
 Greedy Local Search and Vertex Cover in Sparse Random Graphs
 Embedding the Diamond Lattice in the c.e. ttDegrees with Superhigh Atoms
 Feasibility of Motion Planning on Directed Graphs
 PolynomialTime Algorithm for Sorting by Generalized Translocations
 The TwoGuard Polygon Walk Problem
 Approximation and Hardness Results for Label Cut and Related Problems
 An Observation on NonMalleable WitnessIndistinguishability and NonMalleable ZeroKnowledge
 Isbn
 9783642020179
 Label
 Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings
 Title
 Theory and applications of models of computation
 Title remainder
 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings
 Statement of responsibility
 Jianer Chen, S. Barry Cooper (eds.)
 Title variation

 Models of computation
 TAMC 2009
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 6th International Conference on Theory and Applications of Models of Computation, TAMC 2009, held in Changsha, China in May 2009. The 39 full papers presented together with 7 invited papers as well as 3 plenary talks were selected from 86 submissions. The papers address the three main themes of the conference which were Computability, Complexity, and Algorithms. The conference aimed to bring together researchers with interests in theoretical computer science, algorithmic mathematics, and applications to the physical sciences
 Cataloging source
 GW5XE
 Dewey number
 004.0151
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA267.7
 LC item number
 .T36 2009
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2009
 http://bibfra.me/vocab/lite/meetingName
 TAMC (Conference)
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorName

 Chen, Jianer
 Cooper, S. B.
 Series statement

 Lecture notes in computer science,
 LNCS sublibrary: SL 1 Theoretical computer science and general issues
 Series volume
 5532
 http://library.link/vocab/subjectName

 Computational complexity
 Computable functions
 Informatique
 Computable functions
 Computational complexity
 Label
 Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)
 Note
 Title from title screen (viewed August 14, 2009)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Plenary Talks  Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks  Constraints, Graphs, Algebra, Logic, and Complexity  Distributed Systems and Their Environments  Invited Special Session: Models of Computation  Coevolution and Information Signals in Biological Sequences  The Extended Turing Model as Contextual Tool  Strong Positive Reducibilities  Invited Special Session: Algorithms and Complexity  FixedParameter Algorithms for GraphModeled Date Clustering  On Spanners of Geometric Graphs  Searching Trees: An Essay  Approximability and FixedParameter Tractability for the Exemplar Genomic Distance Problems  Contributed Papers  A Quadratic Kernel for 3Set Packing  Quantitative Aspects of SpeedUp and Gap Phenomena  Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG  On the Connection between Interval Size Functions and Path Counting  On the Red/Blue Spanning Tree Problem  Undecidability of CostBounded Reachability in Priced Probabilistic Timed Automata  A Computational Proof of Complexity of Some Restricted Counting Problems  BlockGraph Width  Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs  On Parameterized Exponential Time Complexity  BestOrder Streaming Model  Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces  Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data  Improved Deterministic Algorithms for Weighted Matching and Packing Problems  Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover  Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability  A Complete Characterisation of the Linear CliqueWidth of Path Powers  Preserving Privacy versus Data Retention  Kolmogorov Complexity and Combinatorial Methods in Communication Complexity  An Almost Totally Universal Tile Set  Linear Kernel for Planar Connected Dominating Set  A Simple Greedy Algorithm for the kDisjoint Flow Problem  Minimizing ANDEXOR Expressions for MultipleValued TwoInput Logic Functions  Exact and Experimental Algorithms for a HuffmanBased Error Detecting Code  Terminal Coalgebras for MeasurePolynomial Functors  High Minimal Pairs in the Enumeration Degrees  Searching a Circular Corridor with Two Flashlights  On the Complexity of the Multiple Stack TSP, kSTSP  Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments  An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues  A FixedParameter Enumeration Algorithm for the Weighted FVS Problem  On the Tractability of Maximal Strip Recovery  Greedy Local Search and Vertex Cover in Sparse Random Graphs  Embedding the Diamond Lattice in the c.e. ttDegrees with Superhigh Atoms  Feasibility of Motion Planning on Directed Graphs  PolynomialTime Algorithm for Sorting by Generalized Translocations  The TwoGuard Polygon Walk Problem  Approximation and Hardness Results for Label Cut and Related Problems  An Observation on NonMalleable WitnessIndistinguishability and NonMalleable ZeroKnowledge
 Control code
 424511615
 Dimensions
 unknown
 Extent
 1 online resource (xiv, 482 pages)
 Form of item
 online
 Isbn
 9783642020179
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations.
 http://library.link/vocab/ext/overdrive/overdriveId
 9783642020162
 Specific material designation
 remote
 System control number
 (OCoLC)424511615
 Label
 Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)
 Note
 Title from title screen (viewed August 14, 2009)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Plenary Talks  Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks  Constraints, Graphs, Algebra, Logic, and Complexity  Distributed Systems and Their Environments  Invited Special Session: Models of Computation  Coevolution and Information Signals in Biological Sequences  The Extended Turing Model as Contextual Tool  Strong Positive Reducibilities  Invited Special Session: Algorithms and Complexity  FixedParameter Algorithms for GraphModeled Date Clustering  On Spanners of Geometric Graphs  Searching Trees: An Essay  Approximability and FixedParameter Tractability for the Exemplar Genomic Distance Problems  Contributed Papers  A Quadratic Kernel for 3Set Packing  Quantitative Aspects of SpeedUp and Gap Phenomena  Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG  On the Connection between Interval Size Functions and Path Counting  On the Red/Blue Spanning Tree Problem  Undecidability of CostBounded Reachability in Priced Probabilistic Timed Automata  A Computational Proof of Complexity of Some Restricted Counting Problems  BlockGraph Width  Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs  On Parameterized Exponential Time Complexity  BestOrder Streaming Model  Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces  Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data  Improved Deterministic Algorithms for Weighted Matching and Packing Problems  Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover  Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability  A Complete Characterisation of the Linear CliqueWidth of Path Powers  Preserving Privacy versus Data Retention  Kolmogorov Complexity and Combinatorial Methods in Communication Complexity  An Almost Totally Universal Tile Set  Linear Kernel for Planar Connected Dominating Set  A Simple Greedy Algorithm for the kDisjoint Flow Problem  Minimizing ANDEXOR Expressions for MultipleValued TwoInput Logic Functions  Exact and Experimental Algorithms for a HuffmanBased Error Detecting Code  Terminal Coalgebras for MeasurePolynomial Functors  High Minimal Pairs in the Enumeration Degrees  Searching a Circular Corridor with Two Flashlights  On the Complexity of the Multiple Stack TSP, kSTSP  Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments  An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues  A FixedParameter Enumeration Algorithm for the Weighted FVS Problem  On the Tractability of Maximal Strip Recovery  Greedy Local Search and Vertex Cover in Sparse Random Graphs  Embedding the Diamond Lattice in the c.e. ttDegrees with Superhigh Atoms  Feasibility of Motion Planning on Directed Graphs  PolynomialTime Algorithm for Sorting by Generalized Translocations  The TwoGuard Polygon Walk Problem  Approximation and Hardness Results for Label Cut and Related Problems  An Observation on NonMalleable WitnessIndistinguishability and NonMalleable ZeroKnowledge
 Control code
 424511615
 Dimensions
 unknown
 Extent
 1 online resource (xiv, 482 pages)
 Form of item
 online
 Isbn
 9783642020179
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations.
 http://library.link/vocab/ext/overdrive/overdriveId
 9783642020162
 Specific material designation
 remote
 System control number
 (OCoLC)424511615
Subject
 Computable functions
 Computable functions  Congresses
 Computational complexity
 Computational complexity
 Computational complexity  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Informatique
 Computable functions
Genre
Member of
 LNCS sublibrary, SL 1, Theoretical computer science and general issues
 Lecture notes in computer science, 5532
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Theoryandapplicationsofmodelsofcomputation/Ng60IUX9ngw/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Theoryandapplicationsofmodelsofcomputation/Ng60IUX9ngw/">Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Theoryandapplicationsofmodelsofcomputation/Ng60IUX9ngw/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Theoryandapplicationsofmodelsofcomputation/Ng60IUX9ngw/">Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 1822, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>