04550nmm a2200457 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100002500139245022400164250001700388260006300405300003300468505099000501505084001491505003602331505050702367653002602874653004802900653001702948653001402965653003602979653003803015653002403053653003803077653001803115653001803133653001803151700003403169700003603203700003303239710003403272041001903306989003803325490003803363856006803401082001303469520061003482EB000658462EBX0100000000000000051154400000000000000.0cr|||||||||||||||||||||140122 ||| eng a97835404823381 aNg, Kam W.e[editor]00aAlgorithms and ComputationhElektronische Ressourceb4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedingscedited by Kam W. Ng, Prabhakar Raghavan, N.V. Balasubramanian, Francis Y.L. Chin a1st ed. 1993 aBerlin, HeidelbergbSpringer Berlin Heidelbergc1993, 1993 aXIII, 546 pbonline resource0 aReaching a goal with directional uncertainty -- Constructing degree-3 spanners with other sparseness properties -- Remembering conflicts in history yields dynamic algorithms -- Coloring random graphs in polynomial expected time -- Graphical degree sequence problems with connectivity requirements -- How to treat delete requests in semi-online problems -- Finding the shortest watchman route in a simple polygon -- Constructing shortest watchman routes by divide-and-conquer -- A graph coloring result and its consequences for some guarding problems -- The maximum k-dependent and f-dependent set problem -- Finding shortest non-crossing rectilinear paths in plane regions -- Treewidth of circle graphs -- A framework for constructing heap-like structures in-place -- Double-ended binomial queues -- A simple balanced search tree with O(1) worst-case update time -- Mapping dynamic data and algorithm structures into product networks -- Permutation routing on reconfigurable meshes -- 0 aRandomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists -- Randomized on-line algorithms for the page replication problem -- New algorithms for minimizing the longest wire length during circuit compaction -- Parallel algorithms for single-layer channel routing -- Consecutive interval query and dynamic programming on intervals -- An improved algorithm for the traveler's problem -- Vehicle scheduling on a tree with release and handling times -- Scheduling algorithms for a chain-like task system -- Weighted independent perfect domination on cocomparability graphs -- Plane sweep algorithms for the polygonal approximation problems with applications -- Optimal rectilinear steiner tree for extremal point sets -- Faster approximation algorithms for the rectilinear steiner tree problem0 aA survey of recent research -- 0 aFoot-prints vs tokens -- Recent developments on the approximability of combinatorial problems -- On the relationship among cryptographic physical assumptions -- Separating complexity classes related to bounded alternating ?-branching programs -- The complexity of the optimal variable ordering problems of shared binary decision diagrams -- On Horn envelopes and hypergraph transversals -- Page migration algorithms using work functions -- Memory paging for connectivity and path problems in graphs -- aTheory of Computation aProbability Theory and Stochastic Processes aStatisticsĀ aComputers aComputation by Abstract Devices aInformation Storage and Retrieval aStatistics, general aInformation storage and retrieval aCombinatorics aProbabilities aCombinatorics1 aRaghavan, Prabhakare[editor]1 aBalasubramanian, N.V.e[editor]1 aChin, Francis Y.L.e[editor]2 aSpringerLink (Online service)07aeng2ISO 639-2 bSBAaSpringer Book Archives -20040 aLecture Notes in Computer Science uhttps://doi.org/10.1007/3-540-57568-5?nosfx=yxVerlag3Volltext0 a004.0151 aThis volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present original research in such areas as design and analysis of algorithms, computational complexity, and theory of computation. Topics covered include: - automata, languages, and computability, - combinatorial, graph, geometric, and randomized algorithms, - networks and distributed algorithms, - VLSIand parallel algorithms, - theory of learning and robotics, - number theory and robotics. Three invited papers are also included