- 5 Risultati
prezzo più basso: € 11,20, prezzo più alto: € 55,60, prezzo medio: € 37,01
1
Data Structures and Efficient Algorithms Final Report on the DFG Special Joint Initiative - Ottmann, Thomas (Herausgeber); Monien, Burkhard (Herausgeber)
Ordina
da Achtung-Buecher.de
€ 55,60
Spedizione: € 0,001
Ordina
Dettagli del offerente
Link sponsorizzato
Ottmann, Thomas (Herausgeber); Monien, Burkhard (Herausgeber):

Data Structures and Efficient Algorithms Final Report on the DFG Special Joint Initiative - nuovo libro

1992, ISBN: 3540554882

1992 Kartoniert / Broschiert Algorithmus, Datenverarbeitung / Informationsmanagement, Datenverarbeitung / Datenverschlüsselung, Kryptografie, Grafik (EDV), Intelligenz / Künstliche Inte… Altro …

Costi di spedizione:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
Chiudere (X)
2
Data structures and efficient algorithms : final report on the DFG special joint initiative. B. Monien ; Th. Ottmann (ed.) / Lecture notes in computer science ; 594 - Monien, Burkhard (Herausgeber)
Ordina
da AbeBooks.de
CHF 10,95
(indicativi € 11,27)
Spedizione: € 11,731
Ordina
Dettagli del offerente
Link sponsorizzato

Monien, Burkhard (Herausgeber):

Data structures and efficient algorithms : final report on the DFG special joint initiative. B. Monien ; Th. Ottmann (ed.) / Lecture notes in computer science ; 594 - edizione con copertina flessibile

1992, ISBN: 3540554882

[EAN: 9783540554882], [PU: Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong ; Barcelona ; Budapest : Springer], GEOMETRIEVERARBEITUNG ; DATENSTRUKTUR EFFIZIENTER ALGORI… Altro …

Costi di spedizione: EUR 11.73 Wimbauer Buchversand, Hagen, NRW, Germany [52093458] [Rating: 5 (von 5)]
Chiudere (X)
3
Data structures and efficient algorithms : final report on the DFG special joint initiative. B. Monien ; Th. Ottmann (ed.) / Lecture notes in computer science ; 594 - Monien, Burkhard (Herausgeber)
Ordina
da booklooker.de
€ 11,20
Spedizione: € 14,001
Ordina
Dettagli del offerente
Link sponsorizzato
Monien, Burkhard (Herausgeber):
Data structures and efficient algorithms : final report on the DFG special joint initiative. B. Monien ; Th. Ottmann (ed.) / Lecture notes in computer science ; 594 - libri usati

1992

ISBN: 9783540554882

[PU: Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong ; Barcelona ; Budapest : Springer], VIII, 389 S. : graph. Darst. ; 24 cm kart. Kanten etwas berieben / bestossen, … Altro …

Costi di spedizione:Versand in die Schweiz. (EUR 14.00) Wimbauer Buchversand
Chiudere (X)
4
Data Structures and Efficient Algorithms - Burkhard Monien/ Thomas Ottmann
Ordina
da Hugendubel.de
€ 53,49
Spedizione: € 3,951
Ordina
Dettagli del offerente
Link sponsorizzato
Burkhard Monien/ Thomas Ottmann:
Data Structures and Efficient Algorithms - edizione con copertina flessibile

ISBN: 9783540554882

*Data Structures and Efficient Algorithms* - Final Report on the DFG Special Joint Initiative. Auflage 1992 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, English,, International, G… Altro …

Costi di spedizione:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., zzgl. Versandkosten. (EUR 3.95)
Chiudere (X)
5
Data Structures and Efficient Algorithms - Burkhard Monien/ Thomas Ottmann
Ordina
da Hugendubel.de
€ 53,49
Spedizione: € 0,001
Ordina
Dettagli del offerente
Link sponsorizzato
Burkhard Monien/ Thomas Ottmann:
Data Structures and Efficient Algorithms - edizione con copertina flessibile

ISBN: 9783540554882

*Data Structures and Efficient Algorithms* - Final Report on the DFG Special Joint Initiative. Auflage 1992 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, Ratgeber, Computer & Inter… Altro …

Costi di spedizione:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)
Chiudere (X)
1Poiché alcune piattaforme non trasmettono le condizioni di spedizione e queste possono dipendere dal paese di consegna, dal prezzo di acquisto, dal peso e dalle dimensioni dell'articolo, dall'eventuale iscrizione alla piattaforma, dalla consegna diretta da parte della piattaforma o tramite un fornitore terzo (Marketplace), ecc. è possibile che le spese di spedizione indicate da eurolibro non corrispondano a quelle della piattaforma offerente.

Dati bibliografici del miglior libro corrispondente

Dettagli del libro
Data Structures and Efficient Algorithms
Autore:
Titolo:
ISBN:

3540554882


Algorithms are a central concept in computer science. TheGerman Science Foundation (DFG) started a special jointinitiative on data structures and efficient algorithms in1986 with the aim of encouraging collaborative research onalgorithms. For a period of five years about a dozenprojects were funded with an emphasis on algorithms and datastructures for geometric problems, on the one hand, andparallel and distributed algorithms, on the other.This volume contains 18 papers that are intended to give animpression of the achievements of this joint researchinitiative. The first group of papers addresses research onfundamental data structures, computational geometry, graphalgorithms, computer graphics, and spatial databases. Thesecond group of papers centers on the following problems:the design of parallel architectures and routing strategies,simulation of parallel machines, and the design ofdistributed algorithms for solving difficult problems.

Informazioni dettagliate del libro - Data Structures and Efficient Algorithms


EAN (ISBN-13): 9783540554882
ISBN (ISBN-10): 3540554882
Copertina rigida
Copertina flessibile
Anno di pubblicazione: 1992
Editore: Springer Berlin Heidelberg
389 Pagine
Peso: 0,608 kg

Libro nella banca dati dal 2007-05-24T09:05:37+02:00 (Zurich)
Pagina di dettaglio ultima modifica in 2024-01-24T12:14:01+01:00 (Zurich)
ISBN/EAN: 3540554882

ISBN - Stili di scrittura alternativi:
3-540-55488-2, 978-3-540-55488-2
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : ottmann, burkhard, thomas, monien
Titolo del libro: special report, algorithms data structures, computer algorithms, initiative, final report, data science, algorithm and data structures, dfg, lecture notes computer science

Dati dell'editore

Autore: Burkhard Monien; Thomas Ottmann
Titolo: Lecture Notes in Computer Science; Data Structures and Efficient Algorithms - Final Report on the DFG Special Joint Initiative
Editore: Springer; Springer Berlin
395 Pagine
Anno di pubblicazione: 1992-05-20
Berlin; Heidelberg; DE
Lingua: Inglese
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
IX, 395 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithm; algorithms; computational geometry; computer; computer graphics; data structure; data structures; databases; simulation; tar; algorithm analysis and problem complexity; Theory of Computation; Programming Techniques; Computer System Implementation; Algorithms; Computer Graphics; Data Science; Computerprogrammierung und Softwareentwicklung; Systemanalyse und -design; Algorithmen und Datenstrukturen; Grafikprogrammierung; Datenbanken; EA

Resemblance and symmetries of geometric patterns.- Selected topics from computational geometry, data structures and motion planning.- Processing of hierarchically defined graphs and graph families.- The combination of spatial access methods and computational geometry in geographic database systems.- A flexible and extensible index manager for spatial database systems.- The performance of object decomposition techniques for spatial query processing.- Distributed image synthesis with breadth-first ray tracing and the ray-z-buffer.- Restricted orientation computational geometry.- Monotonous Bisector* Trees — a tool for efficient partitioning of complex scenes of geometric objects.- Learning convex sets under uniform distribution.- Spatial access structures for geometric databases.- On spanning trees with low crossing numbers.- High performance universal hashing, with applications to shared memory simulations.- Distributed game tree search on a massively parallel system.- Balanced strategies for routing on meshes.- Complexity of Boolean functions on PRAMs - Lower bound techniques.- Enumerative vs. genetic optimization two parallel algorithms for the bin packing problem.- Area efficient methods to increase the reliability of circuits.
< Per archiviare...