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 instance 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 material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Instance, Electronic.
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)
Resource Information
The instance 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 material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Instance, Electronic.
 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)
 Title remainder
 Third Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings
 Medium
 electronic resource
 Statement of responsibility
 edited by Tao Jiang, D. T. Lee
 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
 Record ID
 992079154401161
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540695226
Context
Context of 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)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/resource/WTpSjDw4iX8/" typeof="Book http://bibfra.me/vocab/lite/Instance"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/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 Instance 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/resource/WTpSjDw4iX8/" typeof="Book http://bibfra.me/vocab/lite/Instance"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/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>