0
Your cart

Your cart is empty

Books > Computing & IT > Computer communications & networking

Buy Now

Computing and Combinatorics - 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999, Proceedings (Paperback, 1999 ed.) Loot Price: R1,796
Discovery Miles 17 960
Computing and Combinatorics - 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999, Proceedings...

Computing and Combinatorics - 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999, Proceedings (Paperback, 1999 ed.)

Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama

Series: Lecture Notes in Computer Science, 1627

 (sign in to rate)
Loot Price R1,796 Discovery Miles 17 960 | Repayment Terms: R168 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Donate to Gift Of The Givers

The abstracts and papers in this volume were presented at the Fifth Annual International Computing and Combinatorics Conference (COCOON '99), which was held in Tokyo, Japan from July 26 to 28, 1999. The topics cover most aspects of theoretical computer science and combinatorics pertaining to computing. In response to the call for papers, 88 high-quality extended abstracts were submitted internationally, of which 46 were selected for presentation by the p- gram committee. Every submitted paper was reviewed by at least three program committee members. Many of these papers represent reports on continuing - search, and it is expected that most of them will appear in a more polished and complete form in scienti c journals. In addition to the regular papers, this v- ume contains abstracts of two invited plenary talks by Prabhakar Raghavan and Seinosuke Toda. The conference also included a special talk by Kurt Mehlhorn on LEDA (Library of E cient Data types and Algorithms). The Hao Wang Award (inaugurated at COCOON '97) is given to honor the paper judged by the program committee to have the greatest scienti c merit. The recipients of the Hao Wang Award 1999 were Hiroshi Nagamochi and Tos- hide Ibaraki for their paper \An Approximation for Finding a Smallest 2-Edge- Connected Subgraph Containing a Speci ed Spanning Tree".

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Lecture Notes in Computer Science, 1627
Release date: July 1999
First published: 1999
Editors: Takao Asano • Hiroshi Imai • D. T. Lee • Shin-Ichi Nakano • Takeshi Tokuyama
Dimensions: 235 x 155 x 26mm (L x W x T)
Format: Paperback
Pages: 494
Edition: 1999 ed.
ISBN-13: 978-3-540-66200-6
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Computer communications & networking > General
LSN: 3-540-66200-6
Barcode: 9783540662006

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners