Computing and Combinatorics
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings(2387 Lecture Notes in Computer Science)
Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings(2387 Lecture Notes in Computer Science)

Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings(2387 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



International Edition


X
About the Book

The abstract and papers in this volume were presented at the Eighth Annual International Computing and Combinatorics Conference (COCOON 2002), held on August 15-17 in Singapore. The topics cover various aspects of theoretical computer science and combinatorics related to computing. Submissionstotheconferencethisyearwereconductedelectronically. The60 papers were selected for presentation from a total of 106 submitted papers from Australia (6), Canada (3), China (6), Germany (9), India (5), Japan (11), Korea (10), Singapore (5), Taiwan (8), United States (29), and 11 other countries and regions (14). The papers were evaluated by an international program comm- tee consisting of Mikhail Atallah, Jik Chang, Tim Ting Chen, Siu-Wing Cheng, Omer Egecioglu, Fan Chung Graham, Susanne Hambrusch, Sorin Istrail, S- path Kannan, Ming-Yang Kao, Shlomo Moran, Koji Nakano, Takao Nishizeki, Steve Olariu, Gheorghe Paun, Pandu Rangan, Sartaj Sahni, Arto Salomaa, Igor Shparlinski, Janos Simon, Paul Spirakis, Chung Piaw Teo, Jan van Leeuwen, Paul Vitanyi, Peter Widmayer, and Hsu-Chun Yen. It is expected that most of the accepted papers will appear in a more complete form in scienti?c journals. In addition to the contributed papers, three invited lectures were presented by Eugene W. Myers, Sartaj Sahni, and Arto Salomaa. We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and external referees (listed in the proceedings) for their excellent work, and the three invited spe- ers.

Table of Contents:
Invited Lectures.- The Assembly of the Human and Mouse Genomes.- Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching.- DNA Complementarity and Paradigms of Computing.- Complexity Theory I.- On Higher Arthur-Merlin Classes.- (2 + f(n))-SAT and Its Properties.- On the Minimal Polynomial of a Matrix.- Computable Real Functions of Bounded Variation and Semi-computable Real Numbers.- Discrete Algorithms I.- Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees.- Coloring Algorithms on Subcubic Graphs.- Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs.- Extending the Accommodating Function.- Computational Biology and Learning Theory I.- Inverse Parametric Sequence Alignment.- The Full Steiner Tree Problem in Phylogeny.- Inferring a Union of Halfspaces from Examples.- Dictionary Look-Up within Small Edit Distance.- Coding Theory and Cryptography.- Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm.- Co-orthogonal Codes.- Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2m).- A Combinatorial Approach to Anonymous Membership Broadcast.- Parallel and Distributed Architectures.- Solving Constraint Satisfaction Problems with DNA Computing.- New Architecture and Algorithms for Degradable VLSI/WSI Arrays.- Cluster: A Fast Tool to Identify Groups of Similar Programs.- Broadcasting in Generalized de Bruijn Digraphs.- Graph Theory.- On the Connected Domination Number of Random Regular Graphs.- On the Number of Minimum Cuts in a Graph.- On Crossing Numbers of 5-Regular Graphs.- Maximum Flows and Critical Vertices in AND/OR Graphs.- Radio Networks.- New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks.- Simple MutualExclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model.- Time and Energy Optimal List Ranking Algorithms on the k-Channel Broadcast Communication Model.- Energy-Efficient Size Approximation of Radio Networks with No Collision Detection.- Automata and Formal Languages.- A New Class of Symbolic Abstract Neural Nets: Tissue P Systems.- Transducers with Set Output.- Self-assembling Finite Automata.- Repetition Complexity of Words.- Internet Networks.- Using PageRank to Characterize Web Structure.- On Randomized Broadcasting and Gossiping in Radio Networks.- Fast and Dependable Communication in Hyper-rings.- Computational Geometry I.- The On-Line Heilbronn’s Triangle Problem in Three and Four Dimensions.- Algorithms for Normal Curves and Surfaces.- Terrain Polygon Decomposition, with Application to Layered Manufacturing.- Computational Biology and Learning Theory II.- Supertrees by Flipping.- A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays.- Sharpening Occam’s Razor.- Approximating 3D Points with Cylindrical Segments.- Discrete Algorithms II.- Algorithms for the Multicolorings of Partial k-Trees.- A Fault-Tolerant Merge Sorting Algorithm.- 2-Compromise Usability in 1-Dimensional Statistical Databases.- Computational Geometry II.- An Experimental Study and Comparison of Topological Peeling and Topological Walk.- On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.- On-Line Grid-Packing with a Single Active Grid.- Bend Minimization in Orthogonal Drawings Using Integer Programming.- Combinatorial Optimization.- The Conditional Location of a Median Path.- New Results on the k-Truck Problem.- Theory of Equal-Flows in Networks.- Minimum Back-Walk-Free Latency Problem.- Complexity II.- CountingSatisfying Assignments in 2-SAT and 3-SAT.- On the Maximum Number of Irreducible Coverings of an n-Vertex Graph by n — 3 Cliques.- On Reachability in Graphs with Bounded Independence Number.- On Parameterized Enumeration.- Quantum Computing.- Probabilistic Reversible Automata and Quantum Automata.- Quantum versus Deterministic Counter Automata.- Quantum DNF Learnability Revisited.


Best Sellers


Product Details
  • ISBN-13: 9783540439967
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 614
  • Returnable: N
  • Sub Title: 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings
  • ISBN-10: 354043996X
  • Publisher Date: 31 Jul 2002
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 2387 Lecture Notes in Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings(2387 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings(2387 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Computing and Combinatorics: 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002 Proceedings(2387 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!