Items related to Fundamentals of Computation Theory: 13th International...
Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings: 2138 (Lecture Notes in Computer Science, 2138) - Softcover
Synopsis
This book constitutes the refereed proceedings of the 13th International Symposium Fundamentals of Computation Theory, FCT 2001, as well as of the International Workshop on Efficient Algorithms, WEA 2001, held in Riga, Latvia, in August 2001. The 28 revised full FCT papers and 15 short papers presented together with six invited contributions and 8 revised full WEA papers as well as three invited WEA contributions have been carefully reviewed and selected. Among the topics addressed are a broad variety of topics from theoretical computer science, algorithmics and programming theory. The WEA papers deal with graph and network algorithms, flow and routing problems, scheduling and approximation algorithms, etc.
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date2001
- ISBN 10 3540424873
- ISBN 13 9783540424871
- BindingPaperback
- LanguageEnglish
- Number of pages564
- EditorFreivalds Rusins
Search results for Fundamentals of Computation Theory: 13th International...
Stock Image
Fundamentals of Computation Theory: 13th International Symposium, Fct 2001, Riga, Latvia, August 22-24, 2001. Proceedings
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.72. Seller Inventory # G3540424873I4N00
Quantity: 1 available
Stock Image
Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings (Lecture Notes in Computer Science, 2138)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540424871_new
Quantity: Over 20 available
Seller Image
Fundamentals of Computation Theory
Published by
Springer Berlin Heidelberg Aug 2001, 2001
ISBN 10: 3540424873
ISBN 13: 9783540424871
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -ThesymposiaonFundamentalsofComputationTheoryareheldeverytwoyears. Following the tradition established at the rst FCT 1977, the conference brings together specialists in theoretical elds of Computer Science from various co- tries and stimulates mathematical research in theoretical computer science. - pics of interest for the satellite workshop onE cientAlgorithms WEA2001 are: computational complexity, graph and network algorithms, ow and routing - gorithms,coloringandpartitioning,cutsandconnectivity,packingandcovering, scheduling algorithms, approximation algorithms, inapproximability results, - line problems, randomized algorithms, integer programming, semide nite p- gramming, algorithmic geometry, polyhedral combinatorics, branch and bound algorithms, cutting plane algorithms, and various applications. The 13th FCT was held in Riga-Lielupe, August 22-24, 2001 with an - ditional day (August 25) for the satellite workshop WEA2001. The previous meetings were held in the following cities: Poznan-K ornik, Poland, 1977 Wendish-Rietz, Germany, 1979 Szeged, Hungary, 1981 Borgholm, Sweden, 1983 Cottbus, Germany, 1985 Kazan, Russia, 1987 Szeged, Hungary, 1989 Gosen-Berlin, Germany, 1991 Szeged, Hungary, 1993 Dresden, Germany, 1995 Krak ow, Poland, 1997 Iasi, Romania, 1999 Thisyearthenumberofsubmittedpaperswashigh.TheProgramCommittee decided to accept 28 submissions as regular papers and 15 submissions as short papers. Additionally, the Program Committee of WEA2001 accepted 8 papers. 564 pp. Englisch. Seller Inventory # 9783540424871
Quantity: 2 available
Seller Image
Fundamentals of Computation Theory : 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings
Published by
Springer Berlin Heidelberg, 2001
ISBN 10: 3540424873
ISBN 13: 9783540424871
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - ThesymposiaonFundamentalsofComputationTheoryareheldeverytwoyears. Following the tradition established at the rst FCT 1977, the conference brings together specialists in theoretical elds of Computer Science from various co- tries and stimulates mathematical research in theoretical computer science. - pics of interest for the satellite workshop onE cientAlgorithms WEA2001 are: computational complexity, graph and network algorithms, ow and routing - gorithms,coloringandpartitioning,cutsandconnectivity,packingandcovering, scheduling algorithms, approximation algorithms, inapproximability results, - line problems, randomized algorithms, integer programming, semide nite p- gramming, algorithmic geometry, polyhedral combinatorics, branch and bound algorithms, cutting plane algorithms, and various applications. The 13th FCT was held in Riga-Lielupe, August 22-24, 2001 with an - ditional day (August 25) for the satellite workshop WEA2001. The previous meetings were held in the following cities: Poznan-K ornik, Poland, 1977 Wendish-Rietz, Germany, 1979 Szeged, Hungary, 1981 Borgholm, Sweden, 1983 Cottbus, Germany, 1985 Kazan, Russia, 1987 Szeged, Hungary, 1989 Gosen-Berlin, Germany, 1991 Szeged, Hungary, 1993 Dresden, Germany, 1995 Krak ow, Poland, 1997 Iasi, Romania, 1999 Thisyearthenumberofsubmittedpaperswashigh.TheProgramCommittee decided to accept 28 submissions as regular papers and 15 submissions as short papers. Additionally, the Program Committee of WEA2001 accepted 8 papers. Seller Inventory # 9783540424871
Quantity: 1 available
Stock Image
Fundamentals of Computation Theory : 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001 Proceedings
Seller: D2D Books, Berkshire, United Kingdom
Seller rating 4 out of 5 stars
Soft cover. Condition: New. Springer-Verlag Berlin and Heidelberg GmbH & Co. K August 2001, 555 pages A BRAND NEW BOOK STILL IN UNOPENED CELLO WRAPPING. . Full refund if not satisfied. 24 hour despatch. Seller Inventory # r426
Quantity: 1 available
Seller Image
Fundamentals of Computation Theory
Published by
Springer Berlin Heidelberg, 2001
ISBN 10: 3540424873
ISBN 13: 9783540424871
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Papers.- Towards Axiomatic Basis of Inductive Inference.- Approximation Algorithms for Fractional Covering and Packing Problems, and Applications.- Challenges of Commutation.- Approximating Bounded Degree Instances of NP-Hard Problems.- Universal Al. Seller Inventory # 4889872
Quantity: Over 20 available
Stock Image
Fundamentals of Computation Theory: 13th International Symposium, Fct 2001, Riga, Latvia, August 2001 : Proceedings
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 1st edition. 542 pages. 9.50x6.25x1.25 inches. In Stock. Seller Inventory # x-3540424873
Quantity: 2 available
Seller Image
Fundamentals of Computation Theory
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 2001, 2001
ISBN 10: 3540424873
ISBN 13: 9783540424871
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware -ThesymposiaonFundamentalsofComputationTheoryareheldeverytwoyears. Following the tradition established at the rst FCT 1977, the conference brings together specialists in theoretical elds of Computer Science from various co- tries and stimulates mathematical research in theoretical computer science. - pics of interest for the satellite workshop onE cientAlgorithms WEA2001 are: computational complexity, graph and network algorithms, ow and routing - gorithms,coloringandpartitioning,cutsandconnectivity,packingandcovering, scheduling algorithms, approximation algorithms, inapproximability results, - line problems, randomized algorithms, integer programming, semide nite p- gramming, algorithmic geometry, polyhedral combinatorics, branch and bound algorithms, cutting plane algorithms, and various applications. The 13th FCT was held in Riga-Lielupe, August 22-24, 2001 with an - ditional day (August 25) for the satellite workshop WEA2001. The previous meetings were held in the following cities: ¿ Poznan-K¿ ornik, Poland, 1977 ¿ Wendish-Rietz, Germany, 1979 ¿ Szeged, Hungary, 1981 ¿ Borgholm, Sweden, 1983 ¿ Cottbus, Germany, 1985 ¿ Kazan, Russia, 1987 ¿ Szeged, Hungary, 1989 ¿ Gosen-Berlin, Germany, 1991 ¿ Szeged, Hungary, 1993 ¿ Dresden, Germany, 1995 ¿ Krak¿ ow, Poland, 1997 ¿ Iasi, Romania, 1999 Thisyearthenumberofsubmittedpaperswashigh.TheProgramCommittee decided to accept 28 submissions as regular papers and 15 submissions as short papers. Additionally, the Program Committee of WEA2001 accepted 8 papers.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 564 pp. Englisch. Seller Inventory # 9783540424871
Quantity: 2 available
Stock Image
Fundamentals of Computation Theory
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 566 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 11289888
Quantity: 4 available
Stock Image
Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings (Lecture Notes in Computer Science)
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Seller Inventory # DA1412073
Quantity: 1 available