BN.com Gift Guide

Algorithms and Complexity: Third Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$87.06
Used and New from Other Sellers
Used and New from Other Sellers
from $36.43
Usually ships in 1-2 business days
(Save 63%)
Other sellers (Paperback)
  • All (8) from $36.43   
  • New (6) from $36.43   
  • Used (2) from $58.22   

Overview

This book constitutes the refereed proceedings of the Third Italian Conference on Algorithms and Complexity, CIAC'97, held in Rome, Italy in March 1997.
The 25 revised full papers included in the volume were carefully selected from a total of 74 submissions; also included is an invited paper and an invited abstract. All in all, the papers present an interesting snapshot of current research activities and recent results in theory and applications of sequential, distributed, and parallel algorithms, data structures, and computational complexity.

Read More Show Less

Product Details

  • ISBN-13: 9783540625926
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 4/11/1997
  • Series: Lecture Notes in Computer Science Series , #1203
  • Edition description: 1997
  • Edition number: 1
  • Pages: 319
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.69 (d)

Table of Contents

Algorithms and data structures for control dependence and related compiler problems.- Embedding interconnection networks in grids via the Layered Cross Product.- Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5.- The optimum cost chromatic partition problem.- Fault tolerant K-center problems.- R 1?tt SN (NP) distinguishes robust many-one and Turing completeness.- Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy.- On the drift of short schedules.- On removing non-degeneracy assumptions in computational geometry.- Maintaining maxima under boundary updates.- An optimal algorithm for one-separation of a set of isothetic polygons.- Nice drawings for planar bipartite graphs.- Area requirement of Gabriel drawings (extended abstract).- Design of reliable combinatorial algorithms using certificates.- An improved deterministic algorithm for generalized random sampling.- Polynomial time algorithms for some self-duality problems.- A note on updating suffix tree labels.- Relaxed balanced red-black trees.- The algorithmic complexity of chemical threshold testing.- A meticulous analysis of mergesort programs.- BSP-like external-memory computation.- Topological chaos for elementary cellular automata.- On the complexity of balanced Boolean functions.- On sets with easy certificates and the existence of one-way permutations.- Isomorphism for graphs of bounded distance width.- Hardness of approximating problems on cubic graphs.- Tree contractions and evolutionary trees.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)