LEADER 05227nam 22007455 450 001 996465734803316 005 20200629142917.0 010 $a3-540-47103-0 024 7 $a10.1007/3-540-55488-2 035 $a(CKB)1000000000233816 035 $a(SSID)ssj0000322438 035 $a(PQKBManifestationID)11247772 035 $a(PQKBTitleCode)TC0000322438 035 $a(PQKBWorkID)10283681 035 $a(PQKB)11321946 035 $a(DE-He213)978-3-540-47103-5 035 $a(PPN)155187317 035 $a(EXLCZ)991000000000233816 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aData Structures and Efficient Algorithms$b[electronic resource] $eFinal Report on the DFG Special Joint Initiative /$fedited by Burkhard Monien, Thomas Ottmann 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (IX, 395 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v594 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-55488-2 327 $aResemblance 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. 330 $aAlgorithms 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 aim of encouraging collaborative research on algorithms. For a period of five years about a dozen projects were funded with an emphasis on algorithms and data structures for geometric problems, on the one hand, and parallel and distributed algorithms, on the other. This volume contains 18 papers that are intended to give an impression of the achievements of this joint research initiative. The first group of papers addresses research on fundamental data structures, computational geometry, graph algorithms, computer graphics, and spatial databases. The second group of papers centers on the following problems: the design of parallel architectures and routing strategies, simulation of parallel machines, and the design of distributed algorithms for solving difficult problems. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v594 606 $aComputers 606 $aComputer programming 606 $aArchitecture, Computer 606 $aAlgorithms 606 $aComputer graphics 606 $aData structures (Computer science) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 615 0$aComputers. 615 0$aComputer programming. 615 0$aArchitecture, Computer. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 0$aData structures (Computer science). 615 14$aTheory of Computation. 615 24$aProgramming Techniques. 615 24$aComputer System Implementation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputer Graphics. 615 24$aData Structures. 676 $a006.6 702 $aMonien$b Burkhard$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aOttmann$b Thomas$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465734803316 996 $aData Structures and efficient algorithms$91492495 997 $aUNISA