000 06032nam a22005775i 4500
001 978-3-642-02882-3
003 DE-He213
005 20240730192737.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
072 7 _aUMB
_2thema
082 0 4 _a518.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.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_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 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_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 DistinctDue 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 -- Algorithmsand Data Structures -- Popular Matchings: Structure and Algorithms -- Graph-Based Data Clustering with Overlaps -- Directional Geometric Routing on Mobile Ad Hoc Networks.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer networks .
_931572
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aComputer Communication Networks.
_9151153
650 2 4 _aData Science.
_934092
650 2 4 _aDiscrete Mathematics.
_912873
700 1 _aNgo, Hung Q.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151154
710 2 _aSpringerLink (Online service)
_9151155
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642028816
776 0 8 _iPrinted edition:
_z9783642028830
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5609
_9151156
856 4 0 _uhttps://doi.org/10.1007/978-3-642-02882-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94414
_d94414