|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
b3233689 |
003 |
MWH |
005 |
20191021201126.0 |
007 |
cr nn 008mamaa |
008 |
121227s2003 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540450719
|
024 |
7 |
|
|a 10.1007/3-540-45071-8
|2 doi
|
035 |
|
|
|a (DE-He213)978-3-540-45071-9
|
050 |
|
4 |
|a E-Book
|
072 |
|
7 |
|a UMB
|2 bicssc
|
072 |
|
7 |
|a COM051300
|2 bisacsh
|
072 |
|
7 |
|a UMB
|2 thema
|
245 |
1 |
0 |
|a Computing and Combinatorics
|h [electronic resource] :
|b 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings /
|c edited by Tandy Warnow, Binhai Zhu.
|
250 |
|
|
|a 1st ed. 2003.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2003.
|
300 |
|
|
|a XIV, 566 p.
|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,
|x 0302-9743 ;
|v 2697
|
490 |
1 |
|
|a Springer eBook Collection
|
505 |
0 |
|
|a 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.
|
590 |
|
|
|a Loaded electronically.
|
590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer communication systems.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Computer science—Mathematics.
|
650 |
|
0 |
|a Computer graphics.
|
690 |
|
|
|a Electronic resources (E-books)
|
700 |
1 |
|
|a Warnow, Tandy.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Zhu, Binhai.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2697
|
830 |
|
0 |
|a Springer eBook Collection.
|
856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/3-540-45071-8
|3 Click to view e-book
|
907 |
|
|
|a .b32336895
|b 04-18-22
|c 02-26-20
|
998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|
902 |
|
|
|a springer purchased ebooks
|
903 |
|
|
|a SEB-COLL
|
945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i21468540
|z 02-26-20
|
999 |
f |
f |
|i ab98799e-3778-5993-94bc-99dce666b2f1
|s 46c4f470-2432-5880-8c30-4775ce1432ca
|
952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|e E-Book
|h Library of Congress classification
|i Elec File
|n 1
|