Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Computing and Combinatorics : Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings, edited by Tao Jiang, D. T. Lee, (electronic resource)
Computing and Combinatorics : Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings, edited by Tao Jiang, D. T. Lee, (electronic resource)
Resource Information
The item Computing and Combinatorics : Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings, edited by Tao Jiang, D. T. Lee, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Computing and Combinatorics : Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings, edited by Tao Jiang, D. T. Lee, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 This book constitutes the refereed proceedings of the Third Annual International Computing and Combinatorics Conference, COCOON'97, held in Shanghai, China, in August 1997. The volume presents 53 revised full papers selected from a total of 106 submissions. The papers are organized in sections on parallel and distributed computing, computational geometry, complexity, computational biology, computability, cryptography and computational finance, graph algorithms, algorithms, rewriting and logic, algorithms and applications, automata languages and complexity, and mathematical programming and genetic algorithms
 Language
 eng
 Extent
 XII, 524 p.
 Contents

 Conflictfree access to templates of trees and hypercubes in parallel memory systems
 Manytoone packet routing via matchings
 A multitree generating routing scheme using acyclic orientations
 An algorithm for Heilbronn's problem
 Optimal multiresolution polygonal approximation
 Constructing a strongly convex superhull of points
 Fast range searching with Delaunay Triangulations
 Resolution of Hartmanis' conjecture for NLhard sparse sets
 Can large fanin circuits perform reliable computations in the presence of noise?
 On set systems with restricted intersections modulo a composite number
 Size and variable ordering of OBDDs representing threshold functions
 The performance of neighborjoining algorithms of phylogeny reconstruction
 Inferring evolutionary trees with strong combinatorial evidence
 Parsimony is hard to beat!
 On the complexity of computing evolutionary trees
 Computable invariance
 Subclasses of computable real valued functions
 Computability on continuous, lower semicontinuous and upper semicontinuous real functions
 Contrastoptimal k out of n secret sharing schemes in visual cryptography
 A Rabintype scheme based on y 2 ? x 3 + bx 2 mod n
 Optimal bidding algorithms against cheating in multipleobject auctions
 Spring algorithms and symmetry
 Generalized vertexrankings of partial ktrees
 A selected tour of the theory of identification matrices
 Efficient domination on permutation graphs and trapezoid graphs
 On physical mapping algorithms: An errortolerant test for the consecutive ones property
 The median problem for breakpoints in comparative genomics
 Fast algorithms for aligning sequences with restricted affine gap penalties
 A matrix representation of phylogenetic trees
 Edge and node searching problems on trees
 Construction of nearly optimal multiway trees
 Optimal algorithms for circle partitioning
 Hexagonal routing of multiterminal nets
 Design and analysis of parallel setterm unification
 On modularity of completeness in ordersorted term rewriting systems
 A threevalued quantificational logic of context
 A compact storage scheme for fast waveletbased subregion retrieval
 A declustering algorithm for minimising spatial join cost
 Fixed topology steiner trees and spanning forests with applications in network communications
 A branchandbound algorithm for computing node weighted steiner minimum trees
 A complete characterization of repetitive morphisms over the twoletter alphabet
 An algorithm for identifying spliced languages
 The shapes of trees
 Tally languages accepted by alternating multitape finite automata
 Independent spanning trees of chordal rings
 Rearrangeable graphs
 Projective torus networks
 On the 100% rule of sensitivity analysis in linear programming
 Enumerating triangulations for products of two simplices and for arbitrary configurations of points
 Tree structure genetic algorithm with a nourishment mechanism
 An approach to scalability of parallel matrix multiplication algorithms
 Limited acceleration mechanism for cell loss free flow control in ATM networks
 They are just butterflies
 Mutual search
 Eigenvalues, eigenvectors, and graph partitioning
 Corrigendum: Exact learning of subclasses of CDNF formulas with membership queries
 Isbn
 9783540695226
 Label
 Computing and Combinatorics : Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings
 Title
 Computing and Combinatorics
 Title remainder
 Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings
 Statement of responsibility
 edited by Tao Jiang, D. T. Lee
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the Third Annual International Computing and Combinatorics Conference, COCOON'97, held in Shanghai, China, in August 1997. The volume presents 53 revised full papers selected from a total of 106 submissions. The papers are organized in sections on parallel and distributed computing, computational geometry, complexity, computational biology, computability, cryptography and computational finance, graph algorithms, algorithms, rewriting and logic, algorithms and applications, automata languages and complexity, and mathematical programming and genetic algorithms
 http://library.link/vocab/creatorName
 Jiang, Tao
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Lee, D. T.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 1276
 http://library.link/vocab/subjectName

 Computer science
 Computer Communication Networks
 Computer software
 Computational complexity
 Computer graphics
 Combinatorics
 Computer Science
 Algorithm Analysis and Problem Complexity
 Discrete Mathematics in Computer Science
 Computer Graphics
 Computer Communication Networks
 Combinatorics
 Label
 Computing and Combinatorics : Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings, edited by Tao Jiang, D. T. Lee, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Conflictfree access to templates of trees and hypercubes in parallel memory systems  Manytoone packet routing via matchings  A multitree generating routing scheme using acyclic orientations  An algorithm for Heilbronn's problem  Optimal multiresolution polygonal approximation  Constructing a strongly convex superhull of points  Fast range searching with Delaunay Triangulations  Resolution of Hartmanis' conjecture for NLhard sparse sets  Can large fanin circuits perform reliable computations in the presence of noise?  On set systems with restricted intersections modulo a composite number  Size and variable ordering of OBDDs representing threshold functions  The performance of neighborjoining algorithms of phylogeny reconstruction  Inferring evolutionary trees with strong combinatorial evidence  Parsimony is hard to beat!  On the complexity of computing evolutionary trees  Computable invariance  Subclasses of computable real valued functions  Computability on continuous, lower semicontinuous and upper semicontinuous real functions  Contrastoptimal k out of n secret sharing schemes in visual cryptography  A Rabintype scheme based on y 2 ? x 3 + bx 2 mod n  Optimal bidding algorithms against cheating in multipleobject auctions  Spring algorithms and symmetry  Generalized vertexrankings of partial ktrees  A selected tour of the theory of identification matrices  Efficient domination on permutation graphs and trapezoid graphs  On physical mapping algorithms: An errortolerant test for the consecutive ones property  The median problem for breakpoints in comparative genomics  Fast algorithms for aligning sequences with restricted affine gap penalties  A matrix representation of phylogenetic trees  Edge and node searching problems on trees  Construction of nearly optimal multiway trees  Optimal algorithms for circle partitioning  Hexagonal routing of multiterminal nets  Design and analysis of parallel setterm unification  On modularity of completeness in ordersorted term rewriting systems  A threevalued quantificational logic of context  A compact storage scheme for fast waveletbased subregion retrieval  A declustering algorithm for minimising spatial join cost  Fixed topology steiner trees and spanning forests with applications in network communications  A branchandbound algorithm for computing node weighted steiner minimum trees  A complete characterization of repetitive morphisms over the twoletter alphabet  An algorithm for identifying spliced languages  The shapes of trees  Tally languages accepted by alternating multitape finite automata  Independent spanning trees of chordal rings  Rearrangeable graphs  Projective torus networks  On the 100% rule of sensitivity analysis in linear programming  Enumerating triangulations for products of two simplices and for arbitrary configurations of points  Tree structure genetic algorithm with a nourishment mechanism  An approach to scalability of parallel matrix multiplication algorithms  Limited acceleration mechanism for cell loss free flow control in ATM networks  They are just butterflies  Mutual search  Eigenvalues, eigenvectors, and graph partitioning  Corrigendum: Exact learning of subclasses of CDNF formulas with membership queries
 Dimensions
 unknown
 Extent
 XII, 524 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540695226
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/BFb0045065
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540695226
 Label
 Computing and Combinatorics : Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings, edited by Tao Jiang, D. T. Lee, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Conflictfree access to templates of trees and hypercubes in parallel memory systems  Manytoone packet routing via matchings  A multitree generating routing scheme using acyclic orientations  An algorithm for Heilbronn's problem  Optimal multiresolution polygonal approximation  Constructing a strongly convex superhull of points  Fast range searching with Delaunay Triangulations  Resolution of Hartmanis' conjecture for NLhard sparse sets  Can large fanin circuits perform reliable computations in the presence of noise?  On set systems with restricted intersections modulo a composite number  Size and variable ordering of OBDDs representing threshold functions  The performance of neighborjoining algorithms of phylogeny reconstruction  Inferring evolutionary trees with strong combinatorial evidence  Parsimony is hard to beat!  On the complexity of computing evolutionary trees  Computable invariance  Subclasses of computable real valued functions  Computability on continuous, lower semicontinuous and upper semicontinuous real functions  Contrastoptimal k out of n secret sharing schemes in visual cryptography  A Rabintype scheme based on y 2 ? x 3 + bx 2 mod n  Optimal bidding algorithms against cheating in multipleobject auctions  Spring algorithms and symmetry  Generalized vertexrankings of partial ktrees  A selected tour of the theory of identification matrices  Efficient domination on permutation graphs and trapezoid graphs  On physical mapping algorithms: An errortolerant test for the consecutive ones property  The median problem for breakpoints in comparative genomics  Fast algorithms for aligning sequences with restricted affine gap penalties  A matrix representation of phylogenetic trees  Edge and node searching problems on trees  Construction of nearly optimal multiway trees  Optimal algorithms for circle partitioning  Hexagonal routing of multiterminal nets  Design and analysis of parallel setterm unification  On modularity of completeness in ordersorted term rewriting systems  A threevalued quantificational logic of context  A compact storage scheme for fast waveletbased subregion retrieval  A declustering algorithm for minimising spatial join cost  Fixed topology steiner trees and spanning forests with applications in network communications  A branchandbound algorithm for computing node weighted steiner minimum trees  A complete characterization of repetitive morphisms over the twoletter alphabet  An algorithm for identifying spliced languages  The shapes of trees  Tally languages accepted by alternating multitape finite automata  Independent spanning trees of chordal rings  Rearrangeable graphs  Projective torus networks  On the 100% rule of sensitivity analysis in linear programming  Enumerating triangulations for products of two simplices and for arbitrary configurations of points  Tree structure genetic algorithm with a nourishment mechanism  An approach to scalability of parallel matrix multiplication algorithms  Limited acceleration mechanism for cell loss free flow control in ATM networks  They are just butterflies  Mutual search  Eigenvalues, eigenvectors, and graph partitioning  Corrigendum: Exact learning of subclasses of CDNF formulas with membership queries
 Dimensions
 unknown
 Extent
 XII, 524 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540695226
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/BFb0045065
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540695226
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

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.bu.edu/portal/ComputingandCombinatoricsThirdAnnual/WTpSjDw4iX8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/ComputingandCombinatoricsThirdAnnual/WTpSjDw4iX8/">Computing and Combinatorics : Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings, edited by Tao Jiang, D. T. Lee, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University 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 Computing and Combinatorics : Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings, edited by Tao Jiang, D. T. Lee, (electronic resource)
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.bu.edu/portal/ComputingandCombinatoricsThirdAnnual/WTpSjDw4iX8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/ComputingandCombinatoricsThirdAnnual/WTpSjDw4iX8/">Computing and Combinatorics : Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings, edited by Tao Jiang, D. T. Lee, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>