- 5 Résultats
prix le plus bas: € 53,49, prix le plus élevé: € 96,49, prix moyen: € 65,95
1
Algorithms and Data Structures : 4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings - Selim G. Akl
Commander
sur ZVAB.com
€ 53,74
Envoi: € 0,001
CommanderLien sponsorisé
Selim G. Akl:

Algorithms and Data Structures : 4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings - Livres de poche

1995, ISBN: 3540602208

[EAN: 9783540602200], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; DATASTRUCTURES; DATENSTRUKTUREN; GEOMETRICALGORITHMS; GEOMETRISCCHEALGORITHMEN; GRAPHALGORITHMS; G… Plus…

NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
2
Algorithms and Data Structures 4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings - Akl, Selim G. (Herausgeber); Santoro, Nicola (Herausgeber); Sack, Jörg-Rüdiger (Herausgeber); Dehne, Frank (Herausgeber)
Commander
sur Achtung-Buecher.de
€ 55,60
Envoi: € 0,001
CommanderLien sponsorisé

Akl, Selim G. (Herausgeber); Santoro, Nicola (Herausgeber); Sack, Jörg-Rüdiger (Herausgeber); Dehne, Frank (Herausgeber):

Algorithms and Data Structures 4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings - nouveau livre

1995, ISBN: 3540602208

1995 Kartoniert / Broschiert Algorithmus, Computerprogrammierung und Softwareentwicklung, Grafikprogrammierung, Datenbanken, Theoretische Informatik, datastructures; Datenstrukturen; ge… Plus…

Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
3
Algorithms and Data Structures
Commander
sur Springer.com
€ 53,49
Envoi: € 0,001
CommanderLien sponsorisé
Algorithms and Data Structures - nouveau livre

ISBN: 9783540602200

This volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS '95, held in Kingston, Canada in August 1995. The book presents 40 ful… Plus…

Nr. 978-3-540-60220-0. Frais d'envoiWorldwide free shipping, , DE. (EUR 0.00)
4
Commander
sur Biblio.co.uk
$ 74,22
(environ € 70,44)
Envoi: € 11,741
CommanderLien sponsorisé
Frank Dehne:
Algorithms and Data Structures: 4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings - Livres de poche

ISBN: 9783540602200

Paperback / softback. New. This volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS '95, held in Kingston, Canada in Augus… Plus…

Frais d'envoi EUR 11.74 The Saint Bookstore
5
Algorithms and Data Structures - Selim G. Akl/ Frank Dehne/ Jörg-Rüdiger Sack
Commander
sur Hugendubel.de
€ 96,49
Envoi: € 0,001
CommanderLien sponsorisé
Selim G. Akl/ Frank Dehne/ Jörg-Rüdiger Sack:
Algorithms and Data Structures - Livres de poche

ISBN: 9783540602200

Algorithms and Data Structures ab 96.49 € als Taschenbuch: 4th International Workshop WADS '95 Kingston Canada August 16 - 18 1995. Proceedings. Auflage 1995. Aus dem Bereich: Bücher, Eng… Plus…

Frais d'envoiShipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)

1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
Algorithms and Data Structures

This volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS '95, held in Kingston, Canada in August 1995.The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching.

Informations détaillées sur le livre - Algorithms and Data Structures


EAN (ISBN-13): 9783540602200
ISBN (ISBN-10): 3540602208
Version reliée
Livre de poche
Date de parution: 1995
Editeur: Springer Berlin Heidelberg
536 Pages
Poids: 0,801 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-11-25T16:09:49+01:00 (Zurich)
Page de détail modifiée en dernier sur 2024-02-06T21:41:00+01:00 (Zurich)
ISBN/EAN: 3540602208

ISBN - Autres types d'écriture:
3-540-60220-8, 978-3-540-60220-0
Autres types d'écriture et termes associés:
Auteur du livre: santoro, nicola jörg, sacks, aki, diger, frank rüdiger, sack, dehn frank, akl, dehne, preparata, selim
Titre du livre: computer, science structures, kingston, algorithms data structures, lectures, wad, data net ufo, august 1995, algorithm and data structures, proceedings international workshop


Données de l'éditeur

Auteur: Selim G. Akl; Frank Dehne; Jörg-Rüdiger Sack; Nicola Santoro
Titre: Lecture Notes in Computer Science; Algorithms and Data Structures - 4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings
Editeur: Springer; Springer Berlin
526 Pages
Date de parution: 1995-08-02
Berlin; Heidelberg; DE
Imprimé / Fabriqué en
Poids: 1,640 kg
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
X, 526 p.

BC; Theory of Computation; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Data Structures; Datenstrukturen; Geometric Algorithms; Geometriscche Algorithmen; Graph Algorithms; Graph Computations; Graphalgorithmen; Graphberechnungen; Scheduliing; algorithm; computational geometry; data structure; scheduling; algorithm analysis and problem complexity; Programming Techniques; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Data Structures; Computer Graphics; Theory of Computation; Programming Techniques; Algorithms; Data Science; Computer Graphics; Computerprogrammierung und Softwareentwicklung; Algorithmen und Datenstrukturen; Datenbanken; Grafikprogrammierung; EA

Lower bounds to processor-time tradeoffs under bounded-speed message propagation.- The two-line center problem from a polar view: a new algorithm and data structure.- On some geometric selection and optimization problems via sorted matrices.- Load balancing in quorum systems.- Balanced distributed search trees do not exist.- Two-floodlight illumination of convex polygons.- On the complexity of approximating and illuminating three-dimensional convex polyhedra.- Scheduling jobs that arrive over time.- Dynamic algorithms for the Dyck languages.- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications.- Computing a shortest watchman path in a simple polygon in polynomial-time.- Going home through an unknown street.- Page migration with limited local memory capacity.- Randomized algorithms for metrical task systems.- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining.- Computing common tangents without a separating line.- Online perfect matching and mobile computing.- Competitive algorithms for the on-line traveling salesman.- Quadrangulations of planar sets.- A linear-time construction of the relative neighborhood graph within a histogram.- Computing proximity drawings of trees in the 3-dimensional space.- Routing on trees via matchings.- A ranking algorithm for Hamilton paths in shuffle-exchange graphs.- Amortization results for chromatic search trees, with an application to priority queues.- Fast meldable priority queues.- On the computation of fast data transmissions in networks with capacities and delays.- Routing with delays when storage is costly.- Algorithmic arguments in physics of computation.- The buffer tree: A new technique for optimal I/O-algorithms.- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep.- Computing a dominating pair in an asteroidal triple-free graph in linear time.- A linear algorithm for the maximal planar subgraph problem.- Topology B-trees and their applications.- In-place calculation of minimum-redundancy codes.- Regular-factors in the complements of partial k-trees.- Obstructions to within a few vertices or edges of acyclic.- Faster enumeration of all spanning trees of a directed graph.- A simpler minimum spanning tree verification algorithm.- On approximation properties of the Independent set problem for degree 3 graphs.- Approximation of Constraint Satisfaction via local search.- On the difficulty of range searching.- Tables should be sorted (on random access machines).- Improved length bounds for the shortest superstring problem.- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles).- Experiences with the implementation of geometric algorithms.

< pour archiver...