STACS 89: 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989; Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$109.00
Used and New from Other Sellers
Used and New from Other Sellers
from $14.90
Usually ships in 1-2 business days
(Save 87%)
Other sellers (Paperback)
  • All (7) from $14.90   
  • New (3) from $87.62   
  • Used (4) from $14.90   

More About This Textbook

Overview

This volume contains the presentations of the Sixth Symposium on Theoretical Aspects of Computer Science (STACS 89) held at the University of Paderborn, February 16-18, 1989. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: computational geometry, automata theory and formal languages, semantics of programming languages, parallel algorithms, graph algorithms, complexity, structures, fault tolerance, completeness, distributed computing and concurrency.

Read More Show Less

Product Details

  • ISBN-13: 9783540508403
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 3/13/1989
  • Series: Lecture Notes in Computer Science Series , #349
  • Edition description: 1989
  • Edition number: 1
  • Pages: 546
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.13 (d)

Table of Contents

On genuinely time bounded computations.- Unified Algebras and action semantics.- Properties of infinite words : Recent results.- A first order logic for partial functions.- Observational implementations.- On the boundary of a union of Rays.- Dynamic planar point location with optimal query time.- An O(n log n) algorithm for computing a link center in a simple polygon.- Polynomial graph-colorings.- Time-optimal simulations of networks by universal parallel computers.- Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats.- Linear numeration systems,—-developments and finite automata.- A generalization of automatic sequences.- Word problems over traces which are solvable in linear time.- Computing minimum spanning forests on 1- and 2-dimensional processor arrays.- Parallel computation of discrete Voronoi diagrams.- Successive approximation in parallel graph algorithms.- Reversals and alternation.- On the power of parity polynomial time.- Complete problems and strong polynomial reducibilities.- If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n.- On the complexity of approximating the independent set problem.- Average number of messages for distributed leader finding in rings of processors.- Time vs bits.- Distributed computing on transitive networks: The torus.- Time is not a healer.- Area efficient methods to increase the reliability of combinatorial circuits.- Fault masking probabilities with single and multiple signature analysis.- Chain properties of rule closures.- It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair.- Algebraic specifications for domain theory.- The query topology in logic programming.- Testing membership: Beyond permutation groups.- Membership in polynomial ideals over Q is exponential space complete.- Some complexity theoretic aspects of AC rewriting.- Deciding bisimulation equivalences for a class of non-finite-state programs.- Measure of parallelism of distributed computations.- Decidability of weak fairness in petri nets.- New results on the generalized star-height problem.- On the equivalence problem for deterministic multitape automata and transducers.- Deciding equivalence of finite tree automata.- Concatenable segment trees.- Shortest edge-disjoint paths in graphs.- Rounds versus time for the two person pebble game.- AXE: the syntax driven diagram editor for visual languages used in the software engineering environments AxIS.- GraphEd: An interactive graph editor.- SAMPLE a language dependent prototyping environment.- Examining the satisfiability of the formulas of Propositional Dynamic Logic.- Amore: A system for computing automata, MOnoids, and regular expressions.- A proof system for type theory and CCS.- Implementation of a transition semantics for parallel programs with shared variables.

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)