Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by WenLian 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 WenLian Hsu, R. C. T. Lee, (electronic resource)
Resource Information
The item ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by WenLian Hsu, R. C. T. Lee, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by WenLian Hsu, R. C. T. Lee, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 This volume presents the proceedings of the Second Annual International Symposium on Algorithms held at Academia Sinica, Taipei, Republic of China, December 1618, 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
 Language
 eng
 Extent
 XI, 401 p.
 Contents

 Decisionmaking with incomplete information
 Maximum independet set of a permutation graph in k tracks
 Algorithms for square roots of graphs
 Distributed kmutual exclusion problem and kcoteries
 Is the shuffleexchange 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
 Mixedsearching and properpathwidth
 Short wire routing in convex grids
 A new approach to knockknee channel routing
 Circuit partitioning algorithms: Graph model versus geometry model
 Identifying 2monotonic positive boolean functions in polynomial time
 An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm
 An online algorithm for navigating in unknown terrain
 On maintaining the width and diameter of a planar pointset 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 edgecolored 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 divideandconquer 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 BottomUpHeapsort
 Historical searching and sorting
 Comparisonefficient and writeoptimal searching and sorting
 Nearest neighbors revisited
 Competitiveness and response time in online algorithms
 A linear time optimal via assignment algorithm for ThreeDimensional channel routing
 Symmetry of information and oneway functions
 A linear time algorithm to recognize the double euler trail for seriesparallel networks
 On finding a smallest augmentation to biconnect a graph (Extended abstract)
 A faster algorithm for edgedisjoint 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 kdependent sets and maximal fmatchings
 Isbn
 9783540466000
 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 WenLian Hsu, R. C. T. Lee
 Subject

 Computation by Abstract Devices
 Computer graphics
 Probability Theory and Stochastic Processes
 Computer Graphics
 Computer science
 Computer science
 Computer software
 Algorithm Analysis and Problem Complexity
 Statistics, general
 Combinatorics
 Computer Science
 Computer graphics
 Computer Science
 Distribution (Probability theory)
 Statistics
 Distribution (Probability theory)
 Combinatorics
 Computer Graphics
 Computer graphics
 Electronic resources
 Statistics
 Computer software
 Computer software
 Combinatorics
 Distribution (Probability theory)
 Statistics
 Computer Science
 Computer Graphics
 Computer science
 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 1618, 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
 http://library.link/vocab/creatorName
 Hsu, WenLian
 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 WenLian Hsu, R. C. T. Lee, (electronic resource)
 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
 Decisionmaking with incomplete information  Maximum independet set of a permutation graph in k tracks  Algorithms for square roots of graphs  Distributed kmutual exclusion problem and kcoteries  Is the shuffleexchange 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  Mixedsearching and properpathwidth  Short wire routing in convex grids  A new approach to knockknee channel routing  Circuit partitioning algorithms: Graph model versus geometry model  Identifying 2monotonic positive boolean functions in polynomial time  An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm  An online algorithm for navigating in unknown terrain  On maintaining the width and diameter of a planar pointset 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 edgecolored 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 divideandconquer 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 BottomUpHeapsort  Historical searching and sorting  Comparisonefficient and writeoptimal searching and sorting  Nearest neighbors revisited  Competitiveness and response time in online algorithms  A linear time optimal via assignment algorithm for ThreeDimensional channel routing  Symmetry of information and oneway functions  A linear time algorithm to recognize the double euler trail for seriesparallel networks  On finding a smallest augmentation to biconnect a graph (Extended abstract)  A faster algorithm for edgedisjoint 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 kdependent sets and maximal fmatchings
 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/3540549455
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540466000
 Label
 ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by WenLian Hsu, R. C. T. Lee, (electronic resource)
 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
 Decisionmaking with incomplete information  Maximum independet set of a permutation graph in k tracks  Algorithms for square roots of graphs  Distributed kmutual exclusion problem and kcoteries  Is the shuffleexchange 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  Mixedsearching and properpathwidth  Short wire routing in convex grids  A new approach to knockknee channel routing  Circuit partitioning algorithms: Graph model versus geometry model  Identifying 2monotonic positive boolean functions in polynomial time  An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm  An online algorithm for navigating in unknown terrain  On maintaining the width and diameter of a planar pointset 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 edgecolored 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 divideandconquer 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 BottomUpHeapsort  Historical searching and sorting  Comparisonefficient and writeoptimal searching and sorting  Nearest neighbors revisited  Competitiveness and response time in online algorithms  A linear time optimal via assignment algorithm for ThreeDimensional channel routing  Symmetry of information and oneway functions  A linear time algorithm to recognize the double euler trail for seriesparallel networks  On finding a smallest augmentation to biconnect a graph (Extended abstract)  A faster algorithm for edgedisjoint 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 kdependent sets and maximal fmatchings
 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/3540549455
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540466000
Subject
 Algorithm Analysis and Problem Complexity
 Combinatorics
 Combinatorics
 Combinatorics
 Computation by Abstract Devices
 Computer Graphics
 Computer Graphics
 Computer Graphics
 Computer Science
 Computer Science
 Computer Science
 Computer graphics
 Computer graphics
 Computer graphics
 Computer science
 Computer science
 Computer science
 Computer software
 Computer software
 Computer software
 Distribution (Probability theory)
 Distribution (Probability theory)
 Distribution (Probability theory)
 Electronic resources
 Probability Theory and Stochastic Processes
 Statistics
 Statistics
 Statistics
 Statistics, general
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/ISA91Algorithms2ndInternationalSymposium/7S9OKoDAgEM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/ISA91Algorithms2ndInternationalSymposium/7S9OKoDAgEM/">ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by WenLian Hsu, R. C. T. Lee, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by WenLian Hsu, R. C. T. Lee, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/ISA91Algorithms2ndInternationalSymposium/7S9OKoDAgEM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/ISA91Algorithms2ndInternationalSymposium/7S9OKoDAgEM/">ISA'91 Algorithms : 2nd International Symposium on Algorithms Taipei, Republic of China, December 16–18, 1991 Proceedings, edited by WenLian Hsu, R. C. T. Lee, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>