Isbn: 9783540677871 - computing and combinatorics: 6th annual international conference, cocoon 2000, sydney, australia, july 26-28, 2000 proceedings: 1858 (lecture notes in computer science, 1858) (13 resultados)

ISBN
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (13)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: Springer, 2000

    3540677879 / 9783540677871

    • Tapa blanda

    Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Usado - Como Nuevo

    EUR 64,28

    Envío por EUR 2,30 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: As New. Unread book in perfect condition.

  • Idioma: Inglés

    Editorial: Springer, 2000

    3540677879 / 9783540677871

    • Tapa blanda

    Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 61,05

    Envío por EUR 13,17 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New. In English.

  • Idioma: Inglés

    Editorial: Springer, 2000

    3540677879 / 9783540677871

    • Tapa blanda

    Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 72,68

    Envío por EUR 2,30 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New.

  • Idioma: Inglés

    Editorial: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2000

    3540677879 / 9783540677871

    • Tapa blanda

    Librería: Rarewaves.com USA, London, LONDO, Reino UnidoRarewaves.com USA

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 75,07

     Gastos de envío gratis 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Paperback. Condición: New. 2000 ed. The papers in this volume were selected for presentation at the 6th Annual International Computing and Combinatorics Conference (COCOON2000), in Sydney, Australia from July 26 - 28, 2000. The topics cover many areas in t- oretical computer science and combinatorial optimization. There were 81 high quality papers submitted to COCOON2000. Each paper was reviewed by at least three program committee members, and the 44 papers were selected. It is expected that most of them will appear in a more complete form in scientic journals. In addition to the selected papers, the volume also contains the papers from two invited keynote speeches by Christos Papad- itriou and Richard Brent. This year the Hao Wang Award was given to honor the paper judged by the programcommittee to have the greatest merit. The recipient is \Approximating Uniform TriangularMeshes in Polygons"byFranz Aurenhammer, NaokiKatoh, Hiromichi Kojima, Makoto Ohsaki, and Yinfeng Xu. The rst Best Young - searcher paper award was given to William Duckworth for his paper \Maximum Induced Matchings of Random Cubic Graphs".We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and the external referees, sponsors, the local organizers, ACM SIGACT for handling electronic subm- sions,Springer-Verlagfor their support, and Debbie Hatherellfor her assistance.

  • Idioma: Inglés

    Editorial: Springer 2000-07, 2000

    3540677879 / 9783540677871

    • Tapa blanda

    Librería: Chiron Media, Wallingford, Reino UnidoChiron Media

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 57,60

    Envío por EUR 18,07 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 10 disponibles

    PF. Condición: New.

  • Condición: Nuevo

    EUR 60,57

    Envío por EUR 17,50 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New.

  • Condición: Usado - Como Nuevo

    EUR 67,23

    Envío por EUR 17,50 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: As New. Unread book in perfect condition.

  • Idioma: Inglés

    Editorial: Springer, Springer, 2000

    3540677879 / 9783540677871

    • Tapa blanda

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 53,49

    Envío por EUR 63,72 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponibles

    Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The papers in this volume were selected for presentation at the 6th Annual International Computing and Combinatorics Conference (COCOON2000), in Sydney, Australia from July 26 - 28, 2000. The topics cover many areas in t- oretical computer science and combinatorial optimization. There were 81 high quality papers submitted to COCOON2000. Each paper was reviewed by at least three program committee members, and the 44 papers were selected. It is expected that most of them will appear in a more complete form in scientic journals. In addition to the selected papers, the volume also contains the papers from two invited keynote speeches by Christos Papad- itriou and Richard Brent. This year the Hao Wang Award was given to honor the paper judged by the programcommittee to have the greatest merit. The recipient is Approximating Uniform TriangularMeshes in Polygons'byFranz Aurenhammer, NaokiKatoh, Hiromichi Kojima, Makoto Ohsaki, and Yinfeng Xu. The rst Best Young - searcher paper award was given to William Duckworth for his paper Maximum Induced Matchings of Random Cubic Graphs'. We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and the external referees, sponsors, the local organizers, ACM SIGACT for handling electronic subm- sions,Springer-Verlagfor their support, and Debbie Hatherellfor her assistance.

  • Idioma: Inglés

    Editorial: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2000

    3540677879 / 9783540677871

    • Tapa blanda

    Librería: Rarewaves.com UK, London, Reino UnidoRarewaves.com UK

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 67,49

    Envío por EUR 75,85 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Paperback. Condición: New. 2000 ed. The papers in this volume were selected for presentation at the 6th Annual International Computing and Combinatorics Conference (COCOON2000), in Sydney, Australia from July 26 - 28, 2000. The topics cover many areas in t- oretical computer science and combinatorial optimization. There were 81 high quality papers submitted to COCOON2000. Each paper was reviewed by at least three program committee members, and the 44 papers were selected. It is expected that most of them will appear in a more complete form in scientic journals. In addition to the selected papers, the volume also contains the papers from two invited keynote speeches by Christos Papad- itriou and Richard Brent. This year the Hao Wang Award was given to honor the paper judged by the programcommittee to have the greatest merit. The recipient is \Approximating Uniform TriangularMeshes in Polygons"byFranz Aurenhammer, NaokiKatoh, Hiromichi Kojima, Makoto Ohsaki, and Yinfeng Xu. The rst Best Young - searcher paper award was given to William Duckworth for his paper \Maximum Induced Matchings of Random Cubic Graphs".We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and the external referees, sponsors, the local organizers, ACM SIGACT for handling electronic subm- sions,Springer-Verlagfor their support, and Debbie Hatherellfor her assistance.

  • Idioma: Inglés

    Editorial: Springer Berlin Heidelberg Jul 2000, 2000

    3540677879 / 9783540677871

    • Tapa blanda
    • Impresión bajo demanda

    Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 53,49

    Envío por EUR 23,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The papers in this volume were selected for presentation at the 6th Annual International Computing and Combinatorics Conference (COCOON2000), in Sydney, Australia from July 26 - 28, 2000. The topics cover many areas in t- oretical computer science and combinatorial optimization. There were 81 high quality papers submitted to COCOON2000. Each paper was reviewed by at least three program committee members, and the 44 papers were selected. It is expected that most of them will appear in a more complete form in scientic journals. In addition to the selected papers, the volume also contains the papers from two invited keynote speeches by Christos Papad- itriou and Richard Brent. This year the Hao Wang Award was given to honor the paper judged by the programcommittee to have the greatest merit. The recipient is Approximating Uniform TriangularMeshes in Polygons'byFranz Aurenhammer, NaokiKatoh, Hiromichi Kojima, Makoto Ohsaki, and Yinfeng Xu. The rst Best Young - searcher paper award was given to William Duckworth for his paper Maximum Induced Matchings of Random Cubic Graphs'. We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and the external referees, sponsors, the local organizers, ACM SIGACT for handling electronic subm- sions,Springer-Verlagfor their support, and Debbie Hatherellfor her assistance. 496 pp. Englisch.

  • Idioma: Inglés

    Editorial: Springer Berlin Heidelberg, 2000

    3540677879 / 9783540677871

    • Tapa blanda
    • Impresión bajo demanda

    Librería: moluna, Greven, Alemaniamoluna

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 48,37

    Envío por EUR 48,99 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Includes supplementary material: sn.pub/extrasInvited Talks.- Theoretical Problems Related to the Internet.- Recent Progress and Prospects for Integer Factorisation Algorithms.- Hao Wang Award Paper.- Approximating Uniform Triangular Meshes in Po.

  • Idioma: Inglés

    Editorial: Springer, Springer Jul 2000, 2000

    3540677879 / 9783540677871

    • Tapa blanda
    • Impresión bajo demanda

    Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 53,49

    Envío por EUR 60,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponibles

    Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Talks.- Theoretical Problems Related to the Internet.- Recent Progress and Prospects for Integer Factorisation Algorithms.- Hao Wang Award Paper.- Approximating Uniform Triangular Meshes in Polygons.- The Best Young Researcher Paper.- Maximum Induced Matchings of Random Cubic Graphs.- Computational Geometry 1.- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems.- On Local Transformation of Polygons with Visibility Properties.- Graph Drawing.- Embedding Problems for Paths with Direction Constrained Edges.- Characterization of Level Non-planar Graphs by Minimal Patterns.- Rectangular Drawings of Plane Graphs Without Designated Corners.- Computing Optimal Embeddings for Planar Graphs.- Graph Theory and Algorithms 1.- Approximation Algorithms for Independent Sets in Map Graphs.- Hierarchical Topological Inference on Planar Disc Maps.- Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs.- Complexity, Discrete Mathematics, and Number Theory.- Parameterized Complexity of Finding Subgraphs with Hereditary Properties.- Some Results on Tries with Adaptive Branching.- Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound.- Closure Properties of Real Number Classes under Limits and Computable Operators.- Graph Theory and Algorithms 2.- A Characterization of Graphs with Vertex Cover Six.- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree.- Online Algorithms.- Online Independent Sets.- Two-Dimensional On-Line Bin Packing Problem with Rotatable Items.- Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.- Ordinal On-Line Scheduling on Two Uniform Machines.- Parallel and Distributed Computing.- Agents, Distributed Algorithms, and Stabilization.- A Fast Sorting Algorithm and Its Generalization on Broadcast Communications.- Efficient List Ranking Algorithms on Reconfigurable Mesh.- Computational Geometry 2.- Tripods Do Not Pack Densely.- An Efficient k Nearest Neighbor Searching Algorithm for a Query Line.- Tetrahedralization of Two Nested Convex Polyhedra.- Efficient Algorithms for Two-Center Problems for a Convex Polygon.- Combinatorial Optimization.- On Computation of Arbitrage for Markets with Friction.- On Some Optimization Problems in Obnoxious Facility Location.- Generating Necklaces and Strings with Forbidden Substrings.- Optimal Labelling of Point Features in the Slider Model.- Data Structures and Computational Biology.- Mappings for Conflict-Free Access of Paths in Elementary Data Structures.- Theory of Trinomial Heaps.- Polyhedral Aspects of the Consecutive Ones Problem.- The Complexity of Physical Mapping with Strict Chimerism.- Learning and Cryptography.- Logical Analysis of Data with Decomposable Structures.- Learning from Approximate Data.- A Combinatorial Approach to Asymmetric Traitor Tracing.- Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs.- Automata and Quantum Computing.- One-Way Probabilistic Reversible and Quantum One-Counter Automata.- Similarity Enrichment in Image Compression through Weighted Finite Automata.- On the Power of Input-Synchronized Alternating Finite Automata.- Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 496 pp. Englisch.

  • Más imágenes

    Idioma: Inglés

    Editorial: Springer, 2000

    3540677879 / 9783540677871

    • Tapa blanda
    • Impresión bajo demanda

    Librería: preigu, Osnabrück, Alemaniapreigu

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 50,25

    Envío por EUR 70,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 5 disponibles

    Taschenbuch. Condición: Neu. Computing and Combinatorics | 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings | Ding-Zhu Du (u. a.) | Taschenbuch | xii | Englisch | 2000 | Springer | EAN 9783540677871 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.