Algorithm Theory -- SWAT 2012 [electronic resource] : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012, Proceedings / edited by Fedor V. Fomin, Petteri Kaski.
Contributor(s): Fomin, Fedor V [editor.]
| Kaski, Petteri [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 7357Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012Edition: 1st ed. 2012.Description: XIII, 410 p. 62 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642311550.Subject(s): Algorithms | Computer science -- Mathematics | Discrete mathematics | Artificial intelligence -- Data processing | Algorithms | Discrete Mathematics in Computer Science | Data ScienceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online
In:
Springer Nature eBookSummary: This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. The 34 papers were carefully reviewed and selected from a total of 127 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures.
No physical items for this record
This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. The 34 papers were carefully reviewed and selected from a total of 127 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures.
There are no comments for this item.