Buy STACS 98 Book by Michel Morvan from book shop
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings(1373 Lecture Notes in Computer Science)
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings(1373 Lecture Notes in Computer Science)

STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings(1373 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



International Edition


X
About the Book

This book constitutes the strictly refereed proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98, held in Paris, France, in February 1998.The volume presents three invited surveys together with 52 revised full papers selected from a total of 155 submissions. The papers are organized in topical sections on algorithms and data structures, logic, complexity, and automata and formal languages.

Table of Contents:
Random graphs, random walks, differential equations and the probabilistic analysis of algorithms.- Distributed online frequency assignment in cellular networks.- Floats, integers, and single source shortest paths.- A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and automata.- Simplifying the modal mu-calculus alternation hierarchy.- On disguised double horn functions and extensions.- The complexity of propositional linear temporal logics in simple cases.- Searching constant width mazes captures the AC 0 hierarchy.- Nearly optimal language compression using extractors.- Random sparse bit strings at the threshold of adjacency.- Lower bounds for randomized read-k-times branching programs.- Inducing an order on cellular automata by a grouping operation.- Attractors of D-dimensional Linear Cellular Automata.- Optimal simulations between unary automata.- Shuffle of ?-words: Algebraic aspects.- A generalization of resource-bounded measure, with an application (Extended abstract).- The complexity of modular graph automorphism.- Unary quantifiers, transitive closure, and relations of large degree.- On the structure of valiant's complexity classes.- On the existence of polynomial time approximation schemes for OBDD minimization.- Complexity of problems on graphs represented as OBDDs.- Equivalence test and ordering transformation for parity-OBDDs of different variable ordering.- Size and structure of random ordered binary decision diagrams.- Provable security for block ciphers by decorrelation.- On the approximation of finding A(nother) Hamiltonian cycle in cubic Hamiltonian graphs.- The mutual exclusion scheduling problem for permutation and comparability graphs.- Massaging a linear programming solution to give a 2-approximation for ageneralization of the vertex cover problem.- Partially persistent search trees with transcript operations.- Relating hierarchies of word and tree automata.- Languages defined with modular counting quantifiers.- Hierarchies of principal twist-closed trios.- Radix representations of algebraic number fields and finite automata.- Sorting and searching on the word RAM.- Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi Diagram.- On Batcher's merge sorts as parallel sorting algorithms.- Minimum spanning trees for minor-closed graph classes in parallel.- Optimal broadcasting in almost trees and partial k-trees.- Local normal forms for first-order logic with applications to games and automata.- Axiomatizing the equational theory of regular tree languages.- A Logical Characterization of Systolic Languages.- Optimal proof systems for propositional logic and complete sets.- The (parallel) approximability of non-boolean satisfiability problems and restricted integer programming.- Interactive protocols on the reals.- Result-indistinguishable zero-knowledge proofs: Increased power and constant-round protocols.- Bounded size dictionary compression: SCk-completeness and NC algorithms.- Expressive completeness of LTrL on finite traces: An algebraic proof.- On uniform DOL words.- Series-parallel posets: Algebra, automata and languages.- On the expected number of nodes at level k in 0-balanced trees.- Cell flipping in permutation diagrams.- Construction of non-intersecting colored flows through a planar cellular figure.- Recursively enumerable reals and chaitin ? numbers.- Uniformly defining complexity classes of functions.- Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width.


Best Sellers


Product Details
  • ISBN-13: 9783540642305
  • 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: 636
  • Returnable: Y
  • Sub Title: 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings
  • ISBN-10: 3540642307
  • Publisher Date: 18 Feb 1998
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 1373 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
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings(1373 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings(1373 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 98: 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings(1373 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

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!