- 5 Results
Lowest price: € 53.49, highest price: € 96.49, average price: € 65.95
1
Algorithms and Data Structures : 4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings - Selim G. Akl
Order
at ZVAB.com
€ 53.74
Shipment: € 0.001
Order
Provider details
Sponsored link
Selim G. Akl:

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

1995, ISBN: 3540602208

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

NEW BOOK. Shipping costs:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
close (x)
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)
Order
at Achtung-Buecher.de
€ 55.60
Shipment: € 0.001
Order
Provider details
Sponsored link

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 - new book

1995, ISBN: 3540602208

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

Shipping costs:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
close (x)
3
Algorithms and Data Structures
Order
at Springer.com
€ 53.49
Shipment: € 0.001
Order
Provider details
Sponsored link
Algorithms and Data Structures - new book

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… More...

Nr. 978-3-540-60220-0. Shipping costs:Worldwide free shipping, , DE. (EUR 0.00)
close (x)
4
Order
at Biblio.co.uk
$ 74.22
(aprox. € 70.44)
Shipment: € 11.741
Order
Provider details
Sponsored link
Frank Dehne:
Algorithms and Data Structures: 4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings - Paperback

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… More...

Shipping costs: EUR 11.74 The Saint Bookstore
close (x)
5
Algorithms and Data Structures - Selim G. Akl/ Frank Dehne/ Jörg-Rüdiger Sack
Order
at Hugendubel.de
€ 96.49
Shipment: € 0.001
Order
Provider details
Sponsored link
Selim G. Akl/ Frank Dehne/ Jörg-Rüdiger Sack:
Algorithms and Data Structures - Paperback

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… More...

Shipping costs:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)
close (x)
1As some platforms do not transmit shipping conditions to us and these may depend on the country of delivery, the purchase price, the weight and size of the item, a possible membership of the platform, a direct delivery by the platform or via a third-party provider (Marketplace), etc., it is possible that the shipping costs indicated by euro-book.co.uk / euro-book.co.uk do not correspond to those of the offering platform.

Bibliographic data of the best matching book

Details of the book
Algorithms and Data Structures
Author:
Title:
ISBN:

3540602208


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.

Details of the book - Algorithms and Data Structures


EAN (ISBN-13): 9783540602200
ISBN (ISBN-10): 3540602208
Hardcover
Paperback
Publishing year: 1995
Publisher: Springer Berlin Heidelberg
536 Pages
Weight: 0,801 kg
Language: eng/Englisch

Book in our database since 2007-11-25T15:09:49+00:00 (London)
Detail page last modified on 2024-04-03T14:49:46+01:00 (London)
ISBN/EAN: 3540602208

ISBN - alternate spelling:
3-540-60220-8, 978-3-540-60220-0
Alternate spelling and related search-keywords:
Book author: santoro, nicola jörg, sacks, aki, diger, frank rüdiger, sack, dehn frank, akl, dehne, preparata, selim
Book title: computer, science structures, kingston, algorithms data structures, lectures, wad, data net ufo, august 1995, algorithm and data structures, proceedings international workshop

Information from Publisher

Author: Selim G. Akl; Frank Dehne; Jörg-Rüdiger Sack; Nicola Santoro
Title: Lecture Notes in Computer Science; Algorithms and Data Structures - 4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings
Publisher: Springer; Springer Berlin
526 Pages
Publishing year: 1995-08-02
Berlin; Heidelberg; DE
Language: English
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 526 p.

BC; 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; 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.
< to archive...