|
|
|
|
LEADER |
02642nam a22005535i 4500 |
001 |
7335 |
003 |
DE-He213 |
005 |
20130725192301.0 |
007 |
cr nn 008mamaa |
008 |
100301s2009 gw | s |||| 0|eng d |
020 |
# |
# |
|a 9783642028823
|9 978-3-642-02882-3
|
024 |
7 |
# |
|a 10.1007/978-3-642-02882-3
|2 doi
|
050 |
# |
4 |
|a QA76.9.A43
|
072 |
# |
7 |
|a UMB
|2 bicssc
|
072 |
# |
7 |
|a COM051300
|2 bisacsh
|
082 |
0 |
4 |
|a 005.1
|2 23
|
100 |
1 |
# |
|a Ngo, Hung Q.
|e editor.
|
245 |
1 |
0 |
|a Computing and Combinatorics
|b 15th Annual International Conference, COCOON 2009 Niagara Falls, NY, USA, July 13-15, 2009 Proceedings /
|c edited by Hung Q. Ngo.
|h [electronic resource] :
|
264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2009.
|
300 |
# |
# |
|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,
|v 5609
|x 0302-9743 ;
|
520 |
# |
# |
|a This volume constitutes the refereed proceedings of the 15th International Computing and Combinatorics Conference, COCOON 2009, held in New York, NY, USA in July 2009. The 51 revised extended abstracts presented were carefully reviewed and selected from 125 submissions. The papers are organized in topical sections on algorithmic game theory and coding theory, algorithms and data structures, graph drawing, algorithms and data structures, cryptography and security, algorithms, computational geometry, approximation algorithms, computational biology and bioinformatics, sampling and learning, complexity and computability, probabilistic analysis, and algorithms and data structures.
|
650 |
# |
0 |
|a Computer science.
|
650 |
# |
0 |
|a Computer Communication Networks.
|
650 |
# |
0 |
|a Data structures (Computer science).
|
650 |
# |
0 |
|a Computer software.
|
650 |
# |
0 |
|a Computational complexity.
|
650 |
# |
0 |
|a Algorithms.
|
650 |
# |
0 |
|a Combinatorics.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Computer Communication Networks.
|
650 |
2 |
4 |
|a Data Structures.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Combinatorics.
|
710 |
2 |
# |
|a SpringerLink (Online service)
|
773 |
0 |
# |
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642028816
|
830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 5609
|x 0302-9743 ;
|
856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-02882-3
|
912 |
# |
# |
|a ZDB-2-SCS
|
912 |
# |
# |
|a ZDB-2-LNC
|
950 |
# |
# |
|a Computer Science (Springer-11645)
|