The Resource ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by Wen-Lian Hsu, R. C. T. Lee, (electronic resource)

ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by Wen-Lian Hsu, R. C. T. Lee, (electronic resource)

Label
ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings
Title
ISA'91 Algorithms
Title remainder
2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings
Statement of responsibility
edited by Wen-Lian Hsu, R. C. T. Lee
Creator
Contributor
Editor
Provider
Subject
Language
eng
Summary
This volume presents the proceedings of the Second Annual International Symposium on Algorithms held at Academia Sinica, Taipei, Republic of China, December 16-18, 1991. The symposium was organized by the Institute of Information Science, Academia Sinica, and the National Tsing Hua University. In response to the program committee's call for papers, 90 papers were submitted, from which the committee selected 36 for presentation at the symposium. In addition to these contributed papers, the symposium included 5 invited talks. The subjects of the papers range widely in the area of discrete algorithms, over such topics as computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing and computational algebra
Member of
http://library.link/vocab/creatorName
Hsu, Wen-Lian
Image bit depth
0
LC call number
QA76.9.A43
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorName
  • Lee, R. C. T.
  • SpringerLink
Series statement
Lecture Notes in Computer Science,
Series volume
557
http://library.link/vocab/subjectName
  • Computer science
  • Computer software
  • Computer graphics
  • Combinatorics
  • Distribution (Probability theory)
  • Statistics
  • Computer Science
  • Algorithm Analysis and Problem Complexity
  • Computation by Abstract Devices
  • Combinatorics
  • Probability Theory and Stochastic Processes
  • Statistics, general
  • Computer Graphics
Label
ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by Wen-Lian Hsu, R. C. T. Lee, (electronic resource)
Instantiates
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Decision-making with incomplete information -- Maximum independet set of a permutation graph in k tracks -- Algorithms for square roots of graphs -- Distributed k-mutual exclusion problem and k-coteries -- Is the shuffle-exchange better than the butterfly? -- Weighted random assignments with application to hashing -- Scheduling file transfers under port and channel constraints -- Substitution decomposition on chordal graphs and applications -- Mixed-searching and proper-path-width -- Short wire routing in convex grids -- A new approach to knock-knee channel routing -- Circuit partitioning algorithms: Graph model versus geometry model -- Identifying 2-monotonic positive boolean functions in polynomial time -- An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm -- An on-line algorithm for navigating in unknown terrain -- On maintaining the width and diameter of a planar point-set online -- Optimal triangulations by retriangulating -- Approximating polygons and subdivisions with minimum link paths -- An incremental algorithm for constructing shortest watchman routes -- On hitting grid points in a convex polygon with straight lines -- On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs -- Dynamic programming on intervals -- Combinatorial optimization through order statistics -- Combinatorics and algorithms of geometric arrangements -- An analysis of randomized shear sort on the mesh computer -- Efficient parallel divide-and-conquer for a class of interconnection topologies -- Optimal specified root embedding of full binary trees in faulty hypercubes -- A tight lower bound for the worst case of Bottom-Up-Heapsort -- Historical searching and sorting -- Comparison-efficient and write-optimal searching and sorting -- Nearest neighbors revisited -- Competitiveness and response time in on-line algorithms -- A linear time optimal via assignment algorithm for Three-Dimensional channel routing -- Symmetry of information and one-way functions -- A linear time algorithm to recognize the double euler trail for series-parallel networks -- On finding a smallest augmentation to biconnect a graph (Extended abstract) -- A faster algorithm for edge-disjoint paths in planar graphs -- An optimal construction method for generalized convex layers -- Rectangular point location and the dynamic closest pair problem -- Parallel algorithms for some dominance problems based on a CREW PRAM -- Parallel algorithms for finding maximal k-dependent sets and maximal f-matchings
Dimensions
unknown
Extent
XI, 401 p.
File format
multiple file formats
Form of item
electronic
Isbn
9783540466000
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/3-540-54945-5
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-46600-0
Label
ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by Wen-Lian Hsu, R. C. T. Lee, (electronic resource)
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Decision-making with incomplete information -- Maximum independet set of a permutation graph in k tracks -- Algorithms for square roots of graphs -- Distributed k-mutual exclusion problem and k-coteries -- Is the shuffle-exchange better than the butterfly? -- Weighted random assignments with application to hashing -- Scheduling file transfers under port and channel constraints -- Substitution decomposition on chordal graphs and applications -- Mixed-searching and proper-path-width -- Short wire routing in convex grids -- A new approach to knock-knee channel routing -- Circuit partitioning algorithms: Graph model versus geometry model -- Identifying 2-monotonic positive boolean functions in polynomial time -- An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm -- An on-line algorithm for navigating in unknown terrain -- On maintaining the width and diameter of a planar point-set online -- Optimal triangulations by retriangulating -- Approximating polygons and subdivisions with minimum link paths -- An incremental algorithm for constructing shortest watchman routes -- On hitting grid points in a convex polygon with straight lines -- On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs -- Dynamic programming on intervals -- Combinatorial optimization through order statistics -- Combinatorics and algorithms of geometric arrangements -- An analysis of randomized shear sort on the mesh computer -- Efficient parallel divide-and-conquer for a class of interconnection topologies -- Optimal specified root embedding of full binary trees in faulty hypercubes -- A tight lower bound for the worst case of Bottom-Up-Heapsort -- Historical searching and sorting -- Comparison-efficient and write-optimal searching and sorting -- Nearest neighbors revisited -- Competitiveness and response time in on-line algorithms -- A linear time optimal via assignment algorithm for Three-Dimensional channel routing -- Symmetry of information and one-way functions -- A linear time algorithm to recognize the double euler trail for series-parallel networks -- On finding a smallest augmentation to biconnect a graph (Extended abstract) -- A faster algorithm for edge-disjoint paths in planar graphs -- An optimal construction method for generalized convex layers -- Rectangular point location and the dynamic closest pair problem -- Parallel algorithms for some dominance problems based on a CREW PRAM -- Parallel algorithms for finding maximal k-dependent sets and maximal f-matchings
Dimensions
unknown
Extent
XI, 401 p.
File format
multiple file formats
Form of item
electronic
Isbn
9783540466000
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/3-540-54945-5
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-46600-0

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...