ISBN: 9783540471035
Algorithms are a central concept in computer science. The German Science Foundation (DFG) started a special joint initiative on data structures and efficient algorithms in 1986 with the a… Mehr…
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00) Details... |
ISBN: 9783540471035
Computer Science; Theory of Computation; Programming Techniques; Computer System Implementation; Algorithm Analysis and Problem Complexity; Computer Graphics; Data Structures algorithm, a… Mehr…
Springer.com Versandkosten: EUR 0.00 Details... |
ISBN: 9783540471035
Computer Science; Theory of Computation; Programming Techniques; Computer System Implementation; Algorithm Analysis and Problem Complexity; Computer Graphics; Data Structures algorithm, a… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540471035
Computer Science; Theory of Computation; Programming Techniques; Computer System Implementation; Algorithm Analysis and Problem Complexity; Computer Graphics; Data Structures algorithm, a… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540471035
Algorithms are a central concept in computer science. The German Science Foundation (DFG) started a special joint initiative on data structures and efficient algorithms in 1986 with the a… Mehr…
ISBN: 9783540471035
Computer Science; Theory of Computation; Programming Techniques; Computer System Implementation; Algorithm Analysis and Problem Complexity; Computer Graphics; Data Structures algorithm, a… Mehr…
ISBN: 9783540471035
Computer Science; Theory of Computation; Programming Techniques; Computer System Implementation; Algorithm Analysis and Problem Complexity; Computer Graphics; Data Structures algorithm, a… Mehr…
ISBN: 9783540471035
Computer Science; Theory of Computation; Programming Techniques; Computer System Implementation; Algorithm Analysis and Problem Complexity; Computer Graphics; Data Structures algorithm, a… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Data Structures and Efficient Algorithms
EAN (ISBN-13): 9783540471035
Herausgeber: Springer Science+Business Media
Buch in der Datenbank seit 2017-03-24T14:25:31+01:00 (Vienna)
Detailseite zuletzt geändert am 2021-09-23T16:04:43+02:00 (Vienna)
ISBN/EAN: 9783540471035
ISBN - alternative Schreibweisen:
978-3-540-47103-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: algorithms
Daten vom Verlag:
Autor/in: Burkhard Monien; Thomas Ottmann
Titel: Lecture Notes in Computer Science; Data Structures and Efficient Algorithms - Final Report on the DFG Special Joint Initiative
Verlag: Springer; Springer Berlin
395 Seiten
Erscheinungsjahr: 2005-07-07
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
IX, 395 p.
EA; E107; eBook; Nonbooks, PBS / 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; C; Theory of Computation; Programming Techniques; Computer System Implementation; Algorithm Analysis and Problem Complexity; Computer Graphics; Data Structures; Theory of Computation; Programming Techniques; Computer System Implementation; Algorithms; Computer Graphics; Data Science; Computer Science; Computerprogrammierung und Softwareentwicklung; Systemanalyse und -design; Algorithmen und Datenstrukturen; Grafikprogrammierung; Datenbanken; BC
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.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783875548822 Data Structures And Efficient Algorithms: Final Report On The Dfg Special Joint Initiative (Monien, Ottmann,)
- 9783875548822 Data Structures And Efficient Algorithms: Final Report On The Dfg Special Joint Initiative (Monien, Ottmann,)
- 9783540554882 Data Structures and Efficient Algorithms (Burkhard Monien/ Thomas Ottmann)
- 9780387554884 Data Structures and Efficient Algorithms: Final Report on the Dfg Special Joint Initiative (Lecture Notes in Computer Science) (Ottmann, T.)
- Data Structures and Efficient Algorithms. Final Report on the DFG Special Joint Initiative. (= Lecture Notes in Computer Science, No. 594) (Monien, B. und Th. (Eds.) Ottmann)
< zum Archiv...