|
|
|
|
| LEADER |
02695nam a22005895i 4500 |
| 001 |
978-3-642-45278-9 |
| 003 |
DE-He213 |
| 005 |
20151204163520.0 |
| 007 |
cr nn 008mamaa |
| 008 |
131125s2013 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642452789
|9 978-3-642-45278-9
|
| 024 |
7 |
|
|a 10.1007/978-3-642-45278-9
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.M35
|
| 072 |
|
7 |
|a PBD
|2 bicssc
|
| 072 |
|
7 |
|a UYAM
|2 bicssc
|
| 072 |
|
7 |
|a COM018000
|2 bisacsh
|
| 072 |
|
7 |
|a MAT008000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Combinatorial Algorithms
|h [electronic resource] :
|b 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers /
|c edited by Thierry Lecroq, Laurent Mouchard.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2013.
|
| 300 |
|
|
|a XXII, 474 p. 135 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 8288
|
| 505 |
0 |
|
|a Algorithms on graphs -- Algorithms on strings -- Discrete geometry -- Satisfiability.
|
| 520 |
|
|
|a This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry; and satisfiability.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Combinatorics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Combinatorics.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 700 |
1 |
|
|a Lecroq, Thierry.
|e editor.
|
| 700 |
1 |
|
|a Mouchard, Laurent.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642452772
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 8288
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-45278-9
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
