LEADER 06554nam 22007575 450 001 996465977303316 005 20200704174007.0 010 $a3-540-49633-5 024 7 $a10.1007/BFb0009475 035 $a(CKB)1000000000234571 035 $a(SSID)ssj0000321210 035 $a(PQKBManifestationID)11254886 035 $a(PQKBTitleCode)TC0000321210 035 $a(PQKBWorkID)10263101 035 $a(PQKB)10334932 035 $a(DE-He213)978-3-540-49633-5 035 $a(PPN)155179608 035 $a(EXLCZ)991000000000234571 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Computation$b[electronic resource] $e7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings /$fedited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (X, 458 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1178 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-62048-6 327 $aApplications of a numbering scheme for polygonal obstacles in the plane -- Multicast communication in high speed networks -- Incremental convex hull algorithms are not output sensitive -- Separating and shattering long line segments -- Optimal line bipartitions of point sets -- Interval finding and its application to data mining -- On the approximability of the Steiner tree problem in phylogeny -- Approximation and special cases of common subtrees and editing distance -- Two-dimensional dynamic dictionary matching -- Discovering unbounded unions of regular pattern languages from positive examples -- Extremal problems for geometric hypergraphs -- Computing fair and bottleneck matchings in geometric graphs -- Computing the maximum overlap of two convex polygons under translations -- OBDDs of a monotone function and of its prime implicants -- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs -- Graph searching on chordal graphs -- An algorithm for enumerating all directed spanning trees in a directed graph -- Vertex ranking of asteroidal triple-free graphs -- Recursively divisible problems -- StUSPACE(log n) ?-DSPACE(log2 n/log log n) -- Finding edge-disjoint paths in partial k-trees -- Optimal augmentation for bipartite componentwise biconnectivity in linear time -- Towards more precise parallel biconnectivity approximation -- The complexity of probabilistic versus deterministic finite automata -- Bounded length UCFG equivalence -- The Steiner Minimal Tree problem in the ?-geometry plane -- A study of the LMT-skeleton -- A new subgraph of minimum weight triangulations -- Dynamic tree routing under the ?matching with consumption? model -- Dimension-exchange token distribution on the mesh and the torus -- Directed hamiltonian packing in d-dimensional meshes and its application -- k-pairs non-crossing shortest paths in a simple polygon -- Minimum convex partition of a polygon with holes by cuts in given directions -- Efficient list ranking on the reconfigurable mesh, with applications -- Periodic merging networks -- Minimizing wavelengths in an all-optical ring network -- Competitive analysis of on-line disk scheduling -- Scheduling interval ordered tasks with non-uniform deadlines -- Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis -- The multi-variable modular polynomial and its applications to cryptography -- Bounds and algorithms for a practical task allocation model (extended abstract) -- Scheduling algorithms for strict multithreaded computations -- On multi-threaded Paging -- A fast and efficient homophonic coding algorithm -- An improvement of the digital cash protocol of Okamoto and Ohta. 330 $aThis book constitutes the refereed proceedings of the 7th International Symposium on Algorithms and Computation, ISAAC'96, held in Osaka, Japan, in December 1996. The 43 revised full papers were selected from a total of 119 submissions; also included are an abstract of one invited talk and a full version of a second. Among the topics covered are computational geometry, graph theory, graph algorithms, combinatorial optimization, searching and sorting, networking, scheduling, and coding and cryptology. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1178 606 $aComputers 606 $aAlgorithms 606 $aComputer communication systems 606 $aComputer graphics 606 $aComputer mathematics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 606 $aComputational Mathematics and Numerical Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M1400X 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer communication systems. 615 0$aComputer graphics. 615 0$aComputer mathematics. 615 14$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 615 24$aComputer Communication Networks. 615 24$aComputer Graphics. 615 24$aComputational Mathematics and Numerical Analysis. 676 $a004.0151 702 $aAsano$b Tetsuo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aIgarashi$b Yoshihide$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNagamochi$b Hiroshi$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMiyano$b Satoru$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSuri$b Subhash$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465977303316 996 $aAlgorithms and Computation$9771857 997 $aUNISA