| 000 | 05853nam a22005655i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-02882-3 | ||
| 003 | DE-He213 | ||
| 005 | 20160624102132.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2009 gw | s |||| 0|eng d | ||
| 020 |
_a9783642028823 _9978-3-642-02882-3 |
||
| 024 | 7 |
_a10.1007/978-3-642-02882-3 _2doi |
|
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 245 | 1 | 0 |
_aComputing and Combinatorics _h[electronic resource] : _b15th Annual International Conference, COCOON 2009 Niagara Falls, NY, USA, July 13-15, 2009 Proceedings / _cedited by Hung Q. Ngo. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2009. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2009. |
|
| 300 |
_aXIII, 540 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v5609 |
|
| 505 | 0 | _aInvited Talk -- Bidding on Configurations in Internet Ad Auctions -- Algorithmic Game Theory and Coding Theory -- An Attacker-Defender Game for Honeynets -- On the Performances of Nash Equilibria in Isolation Games -- Limits to List Decoding Random Codes -- Algorithms and Data Structures -- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem -- A (4n???4)-Bit Representation of a Rectangular Drawing or Floorplan -- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem -- GraphDrawing -- Coordinate Assignment for Cyclic Level Graphs -- Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs -- Edge-Intersection Graphs of k-Bend Paths in Grids -- Algorithms and Data Structures -- Efficient Data Structures for the Orthogonal Range Successor Problem -- Reconstruction of Interval Graphs -- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions -- Cryptography and Security -- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model -- Efficient Non-interactive Range Proof -- Approximation Algorithms for Key Management in Secure Multicast -- Algorithms -- On Smoothed Analysis of Quicksort and Hoare’s Find -- On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis -- Three New Algorithms for Regular Language Enumeration -- Computational Geometry -- Convex Partitions with 2-Edge Connected Dual Graphs -- The Closest Pair Problem under the Hamming Metric -- Space Efficient Multi-dimensional Range Reporting -- Approximation Algorithms -- Approximation Algorithms for a Network Design Problem -- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates -- On the Hardness and Approximability of Planar Biconnectivity Augmentation -- Computational Biology and Bioinformatics -- Determination of Glycan Structure from Tandem Mass Spectra -- On the Generalised Character Compatibility Problem for Non-branching Character Trees -- Inferring Peptide Composition from Molecular Formulas -- Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection -- Computing Bond Types in Molecule Graphs -- Sampling and Learning -- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries -- Finding a Level Ideal of a Poset -- A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise -- Extracting Computational Entropy and Learning Noisy Linear Functions -- HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank -- Algorithms -- Online Tree Node Assignment with Resource Augmentation -- Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well -- On Finding Small 2-Generating Sets -- Convex Recoloring Revisited: Complexity and Exact Algorithms -- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone -- Complexity and Computability -- Hierarchies and Characterizations of Stateless Multicounter Machines -- Efficient Universal Quantum Circuits -- An Improved Time-Space Lower Bound for Tautologies -- Probabilistic Analysis -- Multiple Round Random Ball Placement: Power of Second Chance -- The Weighted Coupon Collector’s Problem and Applications -- Sublinear-Time Algorithms for Tournament Graphs -- Complexity and Computability -- Classification of a Class of Counting Problems Using Holographic Reductions -- Separating NE from Some Nonuniform Nondeterministic Complexity Classes -- On the Readability of Monotone Boolean Formulae -- Algorithms and Data Structures -- Popular Matchings: Structure and Algorithms -- Graph-Based Data Clustering with Overlaps -- Directional Geometric Routing on Mobile Ad Hoc Networks. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer Communication Networks. | |
| 650 | 0 | _aData structures (Computer science). | |
| 650 | 0 | _aComputer software. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aCombinatorics. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aData Structures. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aCombinatorics. |
| 700 | 1 |
_aNgo, Hung Q. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642028816 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v5609 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-02882-3 |
| 942 |
_2EBK8607 _cEBK |
||
| 999 |
_c37901 _d37901 |
||