The Resource Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, edited by Tandy Warnow, Binhai Zhu, (electronic resource)

Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, edited by Tandy Warnow, Binhai Zhu, (electronic resource)

Label
Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings
Title
Computing and Combinatorics
Title remainder
9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings
Statement of responsibility
edited by Tandy Warnow, Binhai Zhu
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Member of
http://bibfra.me/vocab/relation/corporateauthor
oTX2b4J2ZV8
Dewey number
004
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • y9ZIVy-CMmY
  • 8hiErKPKwvc
Image bit depth
0
Language note
English
LC call number
QA76.9.A43
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2003
http://bibfra.me/vocab/lite/meetingName
COCOON (Conference)
Nature of contents
dictionaries
http://bibfra.me/vocab/lite/organizationName
COCOON 2003
http://library.link/vocab/relatedWorkOrContributorName
  • COCOON 2003
  • Warnow, Tandy.
  • Zhu, Binhai.
Series statement
Lecture Notes in Computer Science,
Series volume
2697
http://library.link/vocab/subjectName
  • Algorithms
  • Computer communication systems
  • Data structures (Computer science)
  • Computer science—Mathematics
  • Computer graphics
  • Algorithm Analysis and Problem Complexity
  • Science, Humanities and Social Sciences, multidisciplinary
  • Computer Communication Networks
  • Data Structures
  • Discrete Mathematics in Computer Science
  • Computer Graphics
Label
Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, edited by Tandy Warnow, Binhai Zhu, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
Invited Lecture -- LIAR! -- Experiments for Algorithm Engineering -- Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers -- Computational Geometry I -- Cylindrical Hierarchy for Deforming Necklaces -- Geometric Algorithms for Agglomerative Hierarchical Clustering -- Traveling Salesman Problem of Segments -- Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs -- Computational Biology I -- A Space Efficient Algorithm for Sequence Alignment with Inversions -- On the Similarity of Sets of Permutations and Its Applications to Genome Comparison -- On All-Substrings Alignment Problems -- Computational/Complexity Theory I -- The Specker-Blatter Theorem Revisited -- On the Divergence Bounded Computable Real Numbers -- Sparse Parity-Check Matrices over Finite Fields -- Graph Theory/Algorithms I -- On the Full and Bottleneck Full Steiner Tree Problems -- The Structure and Number of Global Roundings of a Graph -- On Even Triangulations of 2-Connected Embedded Graphs -- Automata/Petri Net Theory -- Petri Nets with Simple Circuits -- Automatic Verification of Multi-queue Discrete Timed Automata -- Graph Theory/Algorithms II -- List Total Colorings of Series-Parallel Graphs -- Finding Hidden Independent Sets in Interval Graphs -- Matroid Representation of Clique Complexes -- Complexity Theory II -- On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results -- The Complexity of Boolean Matrix Root Computation -- A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions -- Distributed Computing -- Group Mutual Exclusion Algorithms Based on Ticket Orders -- Distributed Algorithm for Better Approximation of the Maximum Matching -- Efficient Mappings for Parity-Declustered Data Layouts -- Web-Based Computing -- Approximate Rank Aggregation -- Perturbation of the Hyper-Linked Environment -- Fast Construction of Generalized Suffix Trees over a Very Large Alphabet -- Complexity Theory III -- Complexity Theoretic Aspects of Some Cryptographic Functions -- Quantum Sampling for Balanced Allocations -- Graph Theory/Algorithms III -- Fault-Hamiltonicity of Product Graph of Path and Cycle -- How to Obtain the Complete List of Caterpillars -- Randomized Approximation of the Stable Marriage Problem -- Computational Geometry II -- Tetris is Hard, Even to Approximate -- Approximate MST for UDG Locally -- Efficient Construction of Low Weight Bounded Degree Planar Spanner -- Graph Theory/Algorithms IV -- Isoperimetric Inequalities and the Width Parameters of Graphs -- Graph Coloring and the Immersion Order -- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs -- Scheduling -- Scheduling Broadcasts with Deadlines -- Improved Competitive Algorithms for Online Scheduling with Partial Job Values -- Majority Equilibrium for Public Facility Allocation -- Computational Geometry III -- On Constrained Minimum Pseudotriangulations -- Pairwise Data Clustering and Applications -- Covering a Set of Points with a Minimum Number of Turns -- Graph Drawing -- Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees -- Bounds for Convex Crossing Numbers -- On Spectral Graph Drawing -- Computational Biology II -- On a Conjecture on Wiener Indices in Combinatorial Chemistry -- Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data -- Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences -- Genomic Distances under Deletions and Insertions -- Fixed-Parameter Complexity Theory -- Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable
Dimensions
unknown
Edition
1st ed. 2003.
Extent
1 online resource (XIV, 566 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540450719
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/3-540-45071-8
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000212046
  • (SSID)ssj0000322170
  • (PQKBManifestationID)11234000
  • (PQKBTitleCode)TC0000322170
  • (PQKBWorkID)10282523
  • (PQKB)10383113
  • (DE-He213)978-3-540-45071-9
  • (MiAaPQ)EBC3071674
  • (EXLCZ)991000000000212046
Label
Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, edited by Tandy Warnow, Binhai Zhu, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
Invited Lecture -- LIAR! -- Experiments for Algorithm Engineering -- Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers -- Computational Geometry I -- Cylindrical Hierarchy for Deforming Necklaces -- Geometric Algorithms for Agglomerative Hierarchical Clustering -- Traveling Salesman Problem of Segments -- Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs -- Computational Biology I -- A Space Efficient Algorithm for Sequence Alignment with Inversions -- On the Similarity of Sets of Permutations and Its Applications to Genome Comparison -- On All-Substrings Alignment Problems -- Computational/Complexity Theory I -- The Specker-Blatter Theorem Revisited -- On the Divergence Bounded Computable Real Numbers -- Sparse Parity-Check Matrices over Finite Fields -- Graph Theory/Algorithms I -- On the Full and Bottleneck Full Steiner Tree Problems -- The Structure and Number of Global Roundings of a Graph -- On Even Triangulations of 2-Connected Embedded Graphs -- Automata/Petri Net Theory -- Petri Nets with Simple Circuits -- Automatic Verification of Multi-queue Discrete Timed Automata -- Graph Theory/Algorithms II -- List Total Colorings of Series-Parallel Graphs -- Finding Hidden Independent Sets in Interval Graphs -- Matroid Representation of Clique Complexes -- Complexity Theory II -- On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results -- The Complexity of Boolean Matrix Root Computation -- A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions -- Distributed Computing -- Group Mutual Exclusion Algorithms Based on Ticket Orders -- Distributed Algorithm for Better Approximation of the Maximum Matching -- Efficient Mappings for Parity-Declustered Data Layouts -- Web-Based Computing -- Approximate Rank Aggregation -- Perturbation of the Hyper-Linked Environment -- Fast Construction of Generalized Suffix Trees over a Very Large Alphabet -- Complexity Theory III -- Complexity Theoretic Aspects of Some Cryptographic Functions -- Quantum Sampling for Balanced Allocations -- Graph Theory/Algorithms III -- Fault-Hamiltonicity of Product Graph of Path and Cycle -- How to Obtain the Complete List of Caterpillars -- Randomized Approximation of the Stable Marriage Problem -- Computational Geometry II -- Tetris is Hard, Even to Approximate -- Approximate MST for UDG Locally -- Efficient Construction of Low Weight Bounded Degree Planar Spanner -- Graph Theory/Algorithms IV -- Isoperimetric Inequalities and the Width Parameters of Graphs -- Graph Coloring and the Immersion Order -- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs -- Scheduling -- Scheduling Broadcasts with Deadlines -- Improved Competitive Algorithms for Online Scheduling with Partial Job Values -- Majority Equilibrium for Public Facility Allocation -- Computational Geometry III -- On Constrained Minimum Pseudotriangulations -- Pairwise Data Clustering and Applications -- Covering a Set of Points with a Minimum Number of Turns -- Graph Drawing -- Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees -- Bounds for Convex Crossing Numbers -- On Spectral Graph Drawing -- Computational Biology II -- On a Conjecture on Wiener Indices in Combinatorial Chemistry -- Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data -- Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences -- Genomic Distances under Deletions and Insertions -- Fixed-Parameter Complexity Theory -- Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable
Dimensions
unknown
Edition
1st ed. 2003.
Extent
1 online resource (XIV, 566 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540450719
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/3-540-45071-8
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000212046
  • (SSID)ssj0000322170
  • (PQKBManifestationID)11234000
  • (PQKBTitleCode)TC0000322170
  • (PQKBWorkID)10282523
  • (PQKB)10383113
  • (DE-He213)978-3-540-45071-9
  • (MiAaPQ)EBC3071674
  • (EXLCZ)991000000000212046

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...