Home > Computing and Information Technology > Computer science > STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings(577 Lecture Notes in Computer Science)
STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings(577 Lecture Notes in Computer Science)

STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings(577 Lecture Notes in Computer Science)

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This volume gives the proceedings of the ninth Symposium on Theoretical Aspects of Computer Science (STACS). This annual symposium is held alternately in France and Germany and is organized jointly by the Special Interest Group for Fundamental Computer Science of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (AFCET) and the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI). The volume includes three invited lectures and sections on parallel algorithms, logic and semantics, computational geometry, automata and languages, structural complexity, computational geometry and learning theory, complexity and communication, distributed systems, complexity, algorithms, cryptography, VLSI, words and rewriting, and systems.

Table of Contents:
Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives.- The parallel complexity of tree embedding problems (extended abstract).- A theory of strict P-completeness.- Fast and optimal simulations between CRCW PRAMs.- Suitability of the propositional temporal logic to express properties of real-time systems.- Axiomatizations of backtracking.- Joining k- and l-recognizable sets of natural numbers.- On the performance of networks with multiple busses.- Efficient algorithms for solving systems of linear equations and path problems.- Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition.- A simplified technique for hidden-line elimination in terrains.- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes.- Equality and disequality constraints on direct subterms in tree automata.- Deterministic regular languages.- The extended low hierarchy is an infinite hierarchy.- Locally definable acceptance types for polynomial time machines.- The theory of the polynomial many-one degrees of recursive sets is undecidable.- A plane-sweep algorithm for finding a closest pair among convex planar objects.- Linear approximation of simple objects.- Language learning without overgeneralization.- The log-star revolution.- Separating counting communication complexity classes.- A nonlinear lower bound on the practical combinational complexity.- Characterizations of some complexity classes between ? 2 p and ? 2 p .- On complexity classes and algorithmically random languages.- New time hierarchy results for deterministic TMS.- Unconditional Byzantine agreement for any number of faulty processors.- Broadcasting in butterfly and debruijn networks.- Intervalapproximations of message causality in distributed executions.- On the approximability of the maximum common subgraph problem.- The complexity of colouring circle graphs.- Graph isomorphism is low for PP.- A simple linear time algorithm for triangulating three-colored graphs.- On locally optimal alignments in genetic sequences.- Secure commitment against a powerful adversary.- Communication efficient Zero-knowledge Proofs of knowledge.- Four results on randomized incremental constructions.- Enclosing many boxes by an optimal pair of boxes.- Performance driven k-layer wiring.- Synthesis for testability: Binary Decision Diagrams.- Compression and entropy.- Iterative devices generating infinite words.- On the factorization conjecture.- Conditional semi-Thue systems for presenting monoids.- A combinatorial bound for linear programming and related problems.- In-place linear probing sort.- Speeding up two string-matching algorithms.- The ANIGRAF system.- A programming language for symbolic computation of regular languages, automata and semigroups.- ?SPEED: a system for the specification and verification of microprocessors.- A discrete event simulator of communication algorithms in interconnection networks.- ALPHA DU CENTAUR: An environment for the design of systolic arrays.- Verification of communicating processes by means of automata reduction and abstraction.- Distributed system simulator (DSS).- An interactive proof tool for process algebras.- SPECI90 A term rewriting and narrowing system.


Best Sellers


Product Details
  • ISBN-13: 9783540552109
  • 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: 628
  • Returnable: N
  • Spine Width: 33 mm
  • Weight: 888 gr
  • ISBN-10: 3540552103
  • Publisher Date: 04 Feb 1992
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 577 Lecture Notes in Computer Science
  • Sub Title: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings
  • Width: 155 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings(577 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings(577 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.

STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings(577 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!
    ASK VIDYA