Algorithms and Computation : 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings

This 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 computati...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Ng, Kam W. (Editor), Raghavan, Prabhakar (Editor), Balasubramanian, N.V. (Editor), Chin, Francis Y.L. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1993, 1993
Edition:1st ed. 1993
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 04565nmm a2200469 u 4500
001 EB000658462
003 EBX01000000000000000511544
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540482338 
100 1 |a Ng, Kam W.  |e [editor] 
245 0 0 |a Algorithms and Computation  |h Elektronische Ressource  |b 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings  |c edited by Kam W. Ng, Prabhakar Raghavan, N.V. Balasubramanian, Francis Y.L. Chin 
250 |a 1st ed. 1993 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1993, 1993 
300 |a XIII, 546 p  |b online resource 
505 0 |a Reaching 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 --  
505 0 |a Randomized 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 problem 
505 0 |a A survey of recent research --  
505 0 |a Foot-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 --  
653 |a Theory of Computation 
653 |a Probability Theory and Stochastic Processes 
653 |a Statistics  
653 |a Computers 
653 |a Computation by Abstract Devices 
653 |a Information Storage and Retrieval 
653 |a Statistics, general 
653 |a Information storage and retrieval 
653 |a Combinatorics 
653 |a Probabilities 
653 |a Combinatorics 
700 1 |a Raghavan, Prabhakar  |e [editor] 
700 1 |a Balasubramanian, N.V.  |e [editor] 
700 1 |a Chin, Francis Y.L.  |e [editor] 
710 2 |a SpringerLink (Online service) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
856 |u https://doi.org/10.1007/3-540-57568-5?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 004.0151 
520 |a This 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