skip to content
Computing and combinatorics : 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009 : proceedings Preview this item
ClosePreview this item
Checking...

Computing and combinatorics : 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009 : proceedings

Author: Hung Q Ngo
Publisher: Berlin : Springer, ©2009.
Series: Lecture notes in computer science, 5609.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Conference papers and proceedings
Congresses
Additional Physical Format: Print version:
COCOON 2009 (2009 : Niagara Falls, N.Y.).
Computing and combinatorics.
Berlin ; New York : Springer, ©2009
(OCoLC)422688976
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Hung Q Ngo
ISBN: 9783642028823 3642028829
OCLC Number: 437345738
Description: 1 online resource (xiii, 540 pages) : illustrations.
Contents: Invited 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.
Series Title: Lecture notes in computer science, 5609.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Other Titles: COCOON 2009
Responsibility: Hung Q. Ngo (ed.).

Abstract:

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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/437345738> # Computing and combinatorics : 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009 : proceedings
    a schema:CreativeWork, schema:MediaObject, schema:Book ;
   library:oclcnum "437345738" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/908394028#Place/berlin> ; # Berlin
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/908394028#Topic/statistics_as_topic> ; # Statistics as Topic
   schema:about <http://experiment.worldcat.org/entity/work/data/908394028#Topic/informatique> ; # Informatique
   schema:about <http://experiment.worldcat.org/entity/work/data/908394028#Topic/mathematical_computing> ; # Mathematical Computing
   schema:about <http://dewey.info/class/511.6/e22/> ;
   schema:about <http://id.worldcat.org/fast/868963> ; # Combinatorial analysis--Data processing
   schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
   schema:about <http://experiment.worldcat.org/entity/work/data/908394028#Topic/computer_science> ; # Computer science
   schema:about <http://id.loc.gov/authorities/subjects/sh2009120719> ; # Combinatorial analysis--Data processing
   schema:alternateName "COCOON 2009" ;
   schema:bookFormat schema:EBook ;
   schema:contributor <http://viaf.org/viaf/273608295> ; # Hung Q. Ngo
   schema:copyrightYear "2009" ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/908394028#Meeting/cocoon_conference_15th_2009_niagara_falls_n_y> ; # COCOON (Conference) (15th : 2009 : Niagara Falls, N.Y.)
   schema:datePublished "2009" ;
   schema:description "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."@en ;
   schema:description "Invited 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."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/908394028> ;
   schema:genre "Conference papers and proceedings"@en ;
   schema:genre "Electronic books"@en ;
   schema:genre "Conference publication"@en ;
   schema:genre "Congresses"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/908394028#Series/lecture_notes_in_computer_science> ; # Lecture notes in computer science ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/908394028#Series/lncs_sublibrary_sl_1_theoretical_computer_science_and_general_issues> ; # LNCS sublibrary. SL 1, Theoretical computer science and general issues
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/908394028#Series/lncs_sublibrary> ; # LNCS sublibrary.
   schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science,
   schema:isSimilarTo <http://www.worldcat.org/oclc/422688976> ;
   schema:name "Computing and combinatorics : 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009 : proceedings"@en ;
   schema:productID "437345738" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/437345738#PublicationEvent/berlin_springer_2009> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/908394028#Agent/springer> ; # Springer
   schema:url <http://dx.doi.org/10.1007/978-3-642-02882-3> ;
   schema:url <http://www.myilibrary.com?id=229793> ;
   schema:url <https://login.proxy.lib.strath.ac.uk/login?url=http://dx.doi.org/10.1007/978-3-642-02882-3> ;
   schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-642-02881-6> ;
   schema:url <http://site.ebrary.com/id/10317654> ;
   schema:workExample <http://worldcat.org/isbn/9783642028823> ;
   umbel:isLike <http://d-nb.info/1000432866> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/437345738> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/908394028#Meeting/cocoon_conference_15th_2009_niagara_falls_n_y> # COCOON (Conference) (15th : 2009 : Niagara Falls, N.Y.)
    a bgn:Meeting, schema:Event ;
   schema:location <http://experiment.worldcat.org/entity/work/data/908394028#Place/niagara_falls_n_y> ; # Niagara Falls, N.Y.)
   schema:name "COCOON (Conference) (15th : 2009 : Niagara Falls, N.Y.)" ;
    .

<http://experiment.worldcat.org/entity/work/data/908394028#Place/niagara_falls_n_y> # Niagara Falls, N.Y.)
    a schema:Place ;
   schema:name "Niagara Falls, N.Y.)" ;
    .

<http://experiment.worldcat.org/entity/work/data/908394028#Series/lecture_notes_in_computer_science> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/437345738> ; # Computing and combinatorics : 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009 : proceedings
   schema:name "Lecture notes in computer science ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/908394028#Series/lncs_sublibrary> # LNCS sublibrary.
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/437345738> ; # Computing and combinatorics : 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009 : proceedings
   schema:name "LNCS sublibrary." ;
    .

<http://experiment.worldcat.org/entity/work/data/908394028#Series/lncs_sublibrary_sl_1_theoretical_computer_science_and_general_issues> # LNCS sublibrary. SL 1, Theoretical computer science and general issues
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/437345738> ; # Computing and combinatorics : 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009 : proceedings
   schema:name "LNCS sublibrary. SL 1, Theoretical computer science and general issues" ;
    .

<http://experiment.worldcat.org/entity/work/data/908394028#Topic/mathematical_computing> # Mathematical Computing
    a schema:Intangible ;
   schema:name "Mathematical Computing"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/908394028#Topic/statistics_as_topic> # Statistics as Topic
    a schema:Intangible ;
   schema:name "Statistics as Topic"@en ;
    .

<http://id.loc.gov/authorities/subjects/sh2009120719> # Combinatorial analysis--Data processing
    a schema:Intangible ;
   schema:name "Combinatorial analysis--Data processing"@en ;
    .

<http://id.worldcat.org/fast/868963> # Combinatorial analysis--Data processing
    a schema:Intangible ;
   schema:name "Combinatorial analysis--Data processing"@en ;
    .

<http://id.worldcat.org/fast/872451> # Computer science
    a schema:Intangible ;
   schema:name "Computer science"@en ;
    .

<http://viaf.org/viaf/273608295> # Hung Q. Ngo
    a schema:Person ;
   schema:familyName "Ngo" ;
   schema:givenName "Hung Q." ;
   schema:name "Hung Q. Ngo" ;
    .

<http://worldcat.org/isbn/9783642028823>
    a schema:ProductModel ;
   schema:isbn "3642028829" ;
   schema:isbn "9783642028823" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science,
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/437345738> ; # Computing and combinatorics : 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009 : proceedings
   schema:issn "0302-9743" ;
   schema:name "Lecture notes in computer science," ;
    .

<http://www.worldcat.org/oclc/422688976>
    a schema:CreativeWork ;
   rdfs:label "Computing and combinatorics." ;
   schema:description "Print version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/437345738> ; # Computing and combinatorics : 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009 : proceedings
    .

<http://www.worldcat.org/title/-/oclc/437345738>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/437345738> ; # Computing and combinatorics : 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009 : proceedings
   schema:dateModified "2017-09-04" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.