Automata, Languages and Programming: 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Buy Used
Buy Used from
(Save 25%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $3.30
Usually ships in 1-2 business days
(Save 97%)
Other sellers (Paperback)
  • All (19) from $3.30   
  • New (10) from $55.31   
  • Used (9) from $3.30   

More About This Textbook


This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS).
The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the u-Calculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures...

Read More Show Less

Product Details

  • ISBN-13: 9783540614401
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 6/26/1996
  • Series: Lecture Notes in Computer Science Series, #1099
  • Edition description: 1996
  • Edition number: 1
  • Pages: 684
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.46 (d)

Table of Contents

Saturation-based theorem proving (abstract).- Bandwidth efficient parallel computation.- Variable-length maximal codes.- Lower bounds for prepositional proofs and independence results in bounded arithmetic.- Algebraic characterizations of decorated trace equivalences over tree-like structures.- Fast asynchronous systems in dense time.- A hierarchy theorem for the—-calculus.- An effective tableau system for the linear time—-calculus.- Characterizing fairness implementability for multiparty interaction.- Termination of context-sensitive rewriting by rewriting.- A complete gentzen-style axiomatization for set constraints.- Fatal errors in conditional expressions.- Different types of arrow between logical frameworks.- Effective models of polymorphism, subtyping and recursion (extended abstract).- Regularity for a large class of context-free processes is decidable.- On infinite transition graphs having a decidable monadic theory.- Semi-groups acting on context-free graphs.- Hard sets method and semilinear reservoir method with applications.- Random polynomials and polynomial factorization.- Optimal gröbner base algorithms for binomial ideals.- Minimum fill-in on circle and circular-arc graphs.- Practical approximation schemes for maximum induced-subgraph problems on K 3,3-free or K 5-free graphs.- Searching a fixed graph.- Improved sampling with applications to dynamic graph algorithms.- The expressive power of existential first order sentences of büchi's sequential calculus.- Fixpoints for rabin tree automata make complementation easy.- New upper bounds to the limitedness of distance automata.- Recognizing regular expressions by means of dataflow networks.- On the power of randomized branching programs.- Hitting sets derandomize BPP.- On type-2 probabilistic quantifiers.- Speeding-up single-tape nondeterministic computations by single alternation, with separation results.- On—-generators and codes.- On standard Sturmian morphisms.- Constructions and bounds for visual cryptography.- On capital investment.- Lower bounds for static dictionaries on RAMs with bit operations but no multiplication.- Lower bounds for row minima searching.- On the complexity of relational problems for finite state processes.- Deciding finiteness of Petri nets up to bisimulation.- Mobile processes with a distributed environment.- The meaning of negative premises in transition system specifications II.- Average case analyses of list update algorithms, with applications to data compression.- Self-organizing data structures with dependent accesses.- Lopsided trees: Analyses, algorithms, and applications.- Optimal logarithmic time randomized suffix tree construction.- Improved parallel approximation of a class of integer programming problems.- Efficient collective communication in optical networks.- Shared-memory simulations on a faulty-memory DMM.- Fast deterministic backtrack search.- Agent rendezvous: A dynamic symmetry-breaking problem.- Efficient asynchronous consensus with the value-oblivious adversary scheduler.- A formal framework for evaluating heuristic programs.- Improved scheduling algorithms for minsum criteria.- On the complexity of string folding.- A polynomial-time algorithm for near-perfect phylogeny.

Read More Show Less

Customer Reviews

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

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & 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 & 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 & 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 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


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & 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 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)