Da: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
EUR 4,72
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: Good. Price has been reduced by 10% until Monday, Oct. 20 (sale item) 680 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 104,30
Convertire valutaQuantità: 15 disponibili
Aggiungi al carrelloCondizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 103,17
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 122,12
Convertire valutaQuantità: 15 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 111,41
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Editore: Springer Berlin Heidelberg, 1996
ISBN 10: 3540614400 ISBN 13: 9783540614401
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 106,99
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.