05896nam a22005535i 4500001001800000003000900018005001700027007001500044008004100059020001800100024002800118050001700146072001500163072001600178072002300194072002300217082001700240245019300257264006100450300003400511336002600545337002600571338003600597347002400633490005800657505336800715520062004083650002204703650003604725650001504761650001604776650003504792650002304827650002604850650002204876650002704898650002604925650004704951650004604998650002305044650003705067700002505104700002405129710003405153773002005187776003605207830005805243856004105301978-3-540-69522-6DE-He21320170515111448.0cr nn 008mamaa121227s1997 gw | s |||| 0|eng d a97835406952267 a10.1007/BFb00450652doi 4aQA75.5-76.95 7aUY2bicssc 7aUYA2bicssc 7aCOM0140002bisacsh 7aCOM0310002bisacsh04a004.015122310aComputing and Combinatoricsh[electronic resource] :bThird Annual International Conference, COCOON '97 Shanghai, China, August 20–22, 1997 Proceedings /cedited by Tao Jiang, D. T. Lee. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c1997. aXII, 524 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v12760 aConflict-free access to templates of trees and hypercubes in parallel memory systems -- Many-to-one packet routing via matchings -- A multi-tree 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 NL-hard 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 neighbor-joining 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 semi-continuous and upper semi-continuous real functions -- Contrast-optimal k out of n secret sharing schemes in visual cryptography -- A Rabin-type scheme based on y 2 ? x 3 + bx 2 mod n -- Optimal bidding algorithms against cheating in multiple-object auctions -- Spring algorithms and symmetry -- Generalized vertex-rankings of partial k-trees -- A selected tour of the theory of identification matrices -- Efficient domination on permutation graphs and trapezoid graphs -- On physical mapping algorithms: An error-tolerant 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 set-term unification -- On modularity of completeness in order-sorted term rewriting systems -- A three-valued quantificational logic of context -- A compact storage scheme for fast wavelet-based subregion retrieval -- A declustering algorithm for minimising spatial join cost -- Fixed topology steiner trees and spanning forests with applications in network communications -- A branch-and-bound algorithm for computing node weighted steiner minimum trees -- A complete characterization of repetitive morphisms over the two-letter 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. aThis 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. 0aComputer science. 0aComputer communication systems. 0aComputers. 0aAlgorithms. 0aComputer sciencexMathematics. 0aComputer graphics. 0aDiscrete mathematics.14aComputer Science.24aTheory of Computation.24aDiscrete Mathematics.24aAlgorithm Analysis and Problem Complexity.24aDiscrete Mathematics in Computer Science.24aComputer Graphics.24aComputer Communication Networks.1 aJiang, Tao.eeditor.1 aLee, D. T.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540633570 0aLecture Notes in Computer Science,x0302-9743 ;v127640uhttp://dx.doi.org/10.1007/BFb0045065