9783540405344 - computing and combinatorics: 9th annual international conference, cocoon 2003, big sky, mt, usa, july 25-28, 2003, proceedings: 2697 di warnow, tandy; zhu, binhai (14 risultati)
- Brossura
Da: Antiquariat Thomas Haker GmbH & Co. KG, Berlin, GermaniaAntiquariat Thomas Haker GmbH & Co. KG
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Ottimo
EUR 15,04
EUR 20,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Sehr gut. XIII, 560 S.; Ill. Very good. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 945.
- Brossura
Da: Better World Books, Mishawaka, U.S.A.Better World Books
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 38,69
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Condizione: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Computing and Combinatorics : 9th Annual International Conference, Cocoon 2003, Big Sky, Mt, Usa, July 25-28, 2003 : Proceedings
Cocoon 200 (2003 Big Sky, Mont.); Warnow, Tandy; Zhu, Binhai
- Brossura
Da: GreatBookPrices, Columbia, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 60,83
EUR 2,27 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,57
EUR 13,87 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
Computing and Combinatorics : 9th Annual International Conference, Cocoon 2003, Big Sky, Mt, Usa, July 25-28, 2003 : Proceedings
Cocoon 200 (2003 Big Sky, Mont.); Warnow, Tandy; Zhu, Binhai
- Brossura
Da: GreatBookPrices, Columbia, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 73,01
EUR 2,27 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE 2003
- Brossura
Da: Rarewaves.com USA, London, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 75,36
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. 2003 ed. The refereed proceedings of the 9th Annual International Computing and Combinatorics Conference, COCOON 2003, held in Big Sky, MT, USA in July 2003. The 52 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 114 submissions. The papers… are organized in topical sections on computational geometry, computational biology, computability and complexity theory, graph theory and graph algorithms, automata and Petri net theory, distributed computing, Web-based computing, scheduling, graph drawing, and fixed-parameter complexity theory.
Computing and Combinatorics : 9th Annual International Conference, Cocoon 2003, Big Sky, Mt, Usa, July 25-28, 2003 : Proceedings
Cocoon 200 (2003 Big Sky, Mont.); Warnow, Tandy; Zhu, Binhai
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,55
EUR 17,36 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
Computing and Combinatorics : 9th Annual International Conference, Cocoon 2003, Big Sky, Mt, Usa, July 25-28, 2003 : Proceedings
Cocoon 200 (2003 Big Sky, Mont.); Warnow, Tandy; Zhu, Binhai
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 66,67
EUR 17,36 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 64,34 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Therefereed proceedings of the 9th Annual International Computing and Combinatorics Conference, COCOON 2003, held in Big Sky, MT, USA in July 2003.The 52 revised full papers presented together with 3 invited contributions were carefully reviewed a…nd selected from 114 submissions. The papers are organized in topical sections on computational geometry, computational biology, computability and complexity theory, graph theory and graph algorithms, automata and Petri net theory, distributed computing, Web-based computing, scheduling, graph drawing, and fixed-parameter complexity theory.
Altre immagini- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 50,25
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Computing and Combinatorics | 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings | Tandy Warnow (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2003 | Springer | EAN 9783540405344 | Verantwortliche Person für die EU: Springer Nature Cust…omer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.
- Brossura
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 66,06
EUR 75,24 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. 2003rd.
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Therefereed proceedings of the 9th Annual International Computing and Combinatorics Conference, COCOON 2003, held in Big Sky, MT, USA in July 2003.The 52 revised full papers presented together with 3 invited contributions were care…fully reviewed and selected from 114 submissions. The papers are organized in topical sections on computational geometry, computational biology, computability and complexity theory, graph theory and graph algorithms, automata and Petri net theory, distributed computing, Web-based computing, scheduling, graph drawing, and fixed-parameter complexity theory. 580 pp. Englisch.
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 48,37
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The refereed proceedings of the 9th Annual International Computing and Combinatorics Conference, COCOON 2003, held in Big Sky, MT, USA in July 2003.The 52 revised full papers presented to…gether with 3 invited contributions were carefully revi.
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 f…or 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 580 pp. Englisch.
