HOME > Detail View

Detail View

Computing and combinatorics : first annual international conference, COCOON'95, Xi'an, China, August 1995 : proceedings

Computing and combinatorics : first annual international conference, COCOON'95, Xi'an, China, August 1995 : proceedings

Material type
단행본
Personal Author
Du, Dingzhu. Li, Ming.
Title Statement
Computing and combinatorics : first annual international conference, COCOON'95, Xi'an, China, August 1995 : proceedings / Ding-Zhu Du, Ming Li, eds.
Publication, Distribution, etc
Berlin ;   New York :   Springer-Verlag,   c1995.  
Physical Medium
xiii, 654 p. : ill. ; 24 cm.
Series Statement
Lecture notes in computer science ;959.
ISBN
354060216X (alk. paper)
Bibliography, Etc. Note
Includes bibliographical references and index.
Subject Added Entry-Topical Term
Computer science --Congresses. Combinatorial analysis --Congresses.
000 01017camuuu200265 a 4500
001 000000923940
005 19990205131644.0
008 950724s1995 gw a b 101 0 eng
010 ▼a 95024802
020 ▼a 354060216X (alk. paper)
040 ▼a DLC ▼c DLC ▼d DLC ▼d 244002
049 0 ▼l 151046132
050 0 0 ▼a QA75.5 ▼b .I5443 1995
082 0 0 ▼a 004/.01/5116 ▼2 20
090 ▼a 004.015116 ▼b I61c
111 2 ▼a International conference on computing and combinatorics ▼n (1st : ▼d 1995 : ▼c Sian, China)
245 1 0 ▼a Computing and combinatorics : ▼b first annual international conference, COCOON'95, Xi'an, China, August 1995 : proceedings / ▼c Ding-Zhu Du, Ming Li, eds.
260 ▼a Berlin ; ▼a New York : ▼b Springer-Verlag, ▼c c1995.
300 ▼a xiii, 654 p. : ▼b ill. ; ▼c 24 cm.
440 0 ▼a Lecture notes in computer science ; ▼v 959.
504 ▼a Includes bibliographical references and index.
650 0 ▼a Computer science ▼x Congresses.
650 0 ▼a Combinatorial analysis ▼x Congresses.
700 1 ▼a Du, Dingzhu.
700 1 ▼a Li, Ming.

Holdings Information

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Sejong Academic Information Center/Science & Technology/ Call Number 004.015116 I61c Accession No. 151046132 Availability Available Due Date Make a Reservation Service C

Contents information

Table of Contents

The complexity of mean payoff games.- Approximation of coNP sets by NP-complete sets.- How to draw a planar clustered graph.- An efficient orthogonal grid drawing algorithm for cubic graphs.- Constrained independence system and triangulations of planar point sets.- Three dimensional weak visibility: Complexity and applications.- Rectangulating rectilinear polygons in parallel.- Efficient randomized incremental algorithm for the closest pair problem using Leafary trees.- Testing containment of object-oriented conjunctive queries is ? 2 p -hard.- Computing infinite relations using finite expressions: A new approach to the safety issue in relational databases.- Set-term unification in a logic database language.- Computations with finite closure systems and implications.- Maximum tree-packing in time O(n5/2).- Optimal algorithms for finding connected components of an unknown graph.- The multi-weighted spanning tree problem.- Algorithmic graph embeddings.- Analysis of quorum-based protocols for distributed (k+1)-exclusion.- A highly fault-tolerant quorum consensus method for managing replicated data.- Constructing Craig interpolation formulas.- Currying of order-sorted term rewriting systems.- Stack and queue number of 2-trees.- Shortest paths in random weighted graphs.- Simple reduction of f-colorings to edge-colorings.- Output-size sensitiveness of OBDD construction through maximal independent set problem.- Small weight bases for hamming codes.- Toeplitz words, generalized periodicity and periodically iterated morphisms.- A construction for enumerating k-coloured Motzkin paths.- On public-key cryptosystem based on Church-Rosser string-rewriting systems.- Extending the Hong-Kung model to memory hierarchies.- On log-time alternating Turing machines of alternation depth k.- New bound for affine resolvable designs and its application to authentication codes.- Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 5.- Efficient parallel algorithms for some tree layout problems.- Conservative algorithms for parallel and sequential integer sorting.- An optimal algorithm for proper learning of unions of two rectangles with queries.- Disjunctions of negated counting functions are efficiently learnable with equivalence queries.- Non-empty cross-3-intersection theorems of subsets.- Convexity of minimal total dominating functions in graphs.- Transformations for maximal planar graphs with minimum degree five.- An asynchronous parallel method for linear systems.- On a kind of sequence of polynomials.- Hamiltonian cycles in 2-generated Cayley digraphs of abelian groups.- Pandiagonal magic squares.- PFFM and Quasi-Morishima matrices.- Edge-face total chromatic number of outerplanar graphs with ? (G)=6.- Sets computable in polynomial time on average.- Rankable distributions do not provide harder instances than uniform distributions.- Transformations that preserve malignness of universal distributions.- Intersection suffices for Boolean hierarchy equivalence.- A 2 3 log 3-competitive algorithm for the counterfeit coin problem.- Searching rigid data structures.- A better subgraph of the minimum weight triangulation.- Sequence decomposition method for computing a Grobner basis and its application to bivariate spline.- A broadcasting algorithm on the arrangement graph.- A fast maximum finding algorithm on broadcast communication.- Broadcasting in general networks I: Trees.- Uni-directional alternating group graphs.- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes.- Compact location problems with budget and communication constraints.- Minimum dominating sets of intervals on lines.- Two-dimensional pattern matching on a dynamic library of texts.- Structure in approximation classes.- Improved lower bounds for the randomized Boppana-Halldorsson algorithm for MAXCLIQUE.- MNP: A class of NP optimization problems.- Semidefinite programming and its applicat


Information Provided By: : Aladin

New Arrivals Books in Related Fields