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 Algorithms : International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings, edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, (electronic resource)
Algorithms : International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings, edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, (electronic resource)
Resource Information
The item Algorithms : International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings, edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, (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 Algorithms : International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings, edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, (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 is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 1618, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 68 research meetings each year. This symposium is the first international symposium organized by SIGAL. In response to the call for papers, 88 papers were submitted from around the world. The program committee selected 34 for presentation at the symposium. The symposium also included 5 invited lectures and 10 invited presentations. The subjects of the papers range widely in the field of discrete algorithms in theoretical computer science. Keywords for these subjects are: computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra
 Language
 eng
 Extent
 X, 482 p.
 Contents

 Recent progress in string algorithms
 Selection networks
 Computing edgeconnectivity in multiple and capacitated graphs
 Efficient sequential and parallel algorithms for planar minimum cost flow
 Structural analyses on the complexity of inverting functions
 Oracles versus proof techniques that do not relativize
 20Relative neighborhood graphs are Hamiltonian
 The KGabriel graphs and their applications
 Parallel algorithms for generating subsets and set partitions
 Parallel algorithms for linked list and beyond
 Local tournaments and proper circular arc graphs
 Fast algorithms for the dominating set problem on permutation graphs
 Two probabilistic results on merging
 Randomized broadcast in networks
 On the construction of abstract voronoi diagrams, II
 Searching in higher dimension
 Finding extrema with unary predicates
 Implicitly searching convolutions and computing depth of collision
 Characterization for a family of infinitely many irreducible Equally Spaced Polynomials
 Distributed algorithms for deciphering
 An efficient algorithm for optimal loop parallelization (extended abstract)
 Another view on the SSS* algorithm
 Algorithms from complexity theory: Polynomialtime operations for complex sets
 Complexity cores and hard problem instances
 Spatial point location and its applications
 Sublinear merging and natural merge sort
 Constructing strongly convex approximate hulls with inaccurate primitives
 Computing puiseuxseries solutions to determinatal equations via combinatorial relaxation
 A tight lower bound on the size of planar permutation networks
 Simultaneous solution of families of problems
 Algorithms for projecting points to give the most uniform distribution with applications to hashing
 Topological sweeping in three dimensions
 Finding leastweight subsequences with fewer processors
 Derandomization by exploiting redundancy and mutual independence
 Planar separators and the Euclidean norm
 On the complexity of isometric embedding in the hypercube
 Distributed function evaluation in the presence of transmission faults
 Optimal linear broadcast
 Graph augmentation problems for a specified set of vertices
 A heuristic algorithm for the kcenter problem with vertex weight
 Parallel convexity algorithms for digitized images on a linear array of processors
 Parallel algorithms for labeling image components
 A hyperplane Incidence problem with applications to counting distances
 Splitting a configuration in a simplex
 Weaving patterns of lines and line segments in space
 Efficient parallel algorithms for path problems in planar directed graphs
 Parallel algorithms for finding Steiner forests in planar graphs
 Optimally managing the history of an evolving forest
 Isbn
 9783540471776
 Label
 Algorithms : International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings
 Title
 Algorithms
 Title remainder
 International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings
 Statement of responsibility
 edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki
 Subject

 Computation by Abstract Devices
 Statistics
 Probability Theory and Stochastic Processes
 Computer science
 Information Storage and Retrieval
 Information storage and retrieval systems
 Computer software
 Algorithm Analysis and Problem Complexity
 Statistics, general
 Information storage and retrieval systems
 Combinatorial analysis
 Combinatorial analysis
 Computer Science
 Computer Science
 Statistics
 Distribution (Probability theory)
 Combinatorics
 Electronic resources
 Computer science
 Combinatorial analysis
 Computer software
 Computer software
 Combinatorics
 Distribution (Probability theory)
 Combinatorics
 Statistics
 Distribution (Probability theory)
 Information storage and retrieval systems
 Computer Science
 Computer science
 Language
 eng
 Summary
 This is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 1618, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 68 research meetings each year. This symposium is the first international symposium organized by SIGAL. In response to the call for papers, 88 papers were submitted from around the world. The program committee selected 34 for presentation at the symposium. The symposium also included 5 invited lectures and 10 invited presentations. The subjects of the papers range widely in the field of discrete algorithms in theoretical computer science. Keywords for these subjects are: computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra
 http://library.link/vocab/creatorName
 Asano, Tetsuo
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Ibaraki, Toshihide.
 Imai, Hiroshi.
 Nishizeki, Takao.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 450
 http://library.link/vocab/subjectName

 Computer science
 Computer software
 Information storage and retrieval systems
 Combinatorial analysis
 Distribution (Probability theory)
 Statistics
 Computer Science
 Algorithm Analysis and Problem Complexity
 Computation by Abstract Devices
 Combinatorics
 Probability Theory and Stochastic Processes
 Statistics, general
 Information Storage and Retrieval
 Label
 Algorithms : International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings, edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, (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
 Recent progress in string algorithms  Selection networks  Computing edgeconnectivity in multiple and capacitated graphs  Efficient sequential and parallel algorithms for planar minimum cost flow  Structural analyses on the complexity of inverting functions  Oracles versus proof techniques that do not relativize  20Relative neighborhood graphs are Hamiltonian  The KGabriel graphs and their applications  Parallel algorithms for generating subsets and set partitions  Parallel algorithms for linked list and beyond  Local tournaments and proper circular arc graphs  Fast algorithms for the dominating set problem on permutation graphs  Two probabilistic results on merging  Randomized broadcast in networks  On the construction of abstract voronoi diagrams, II  Searching in higher dimension  Finding extrema with unary predicates  Implicitly searching convolutions and computing depth of collision  Characterization for a family of infinitely many irreducible Equally Spaced Polynomials  Distributed algorithms for deciphering  An efficient algorithm for optimal loop parallelization (extended abstract)  Another view on the SSS* algorithm  Algorithms from complexity theory: Polynomialtime operations for complex sets  Complexity cores and hard problem instances  Spatial point location and its applications  Sublinear merging and natural merge sort  Constructing strongly convex approximate hulls with inaccurate primitives  Computing puiseuxseries solutions to determinatal equations via combinatorial relaxation  A tight lower bound on the size of planar permutation networks  Simultaneous solution of families of problems  Algorithms for projecting points to give the most uniform distribution with applications to hashing  Topological sweeping in three dimensions  Finding leastweight subsequences with fewer processors  Derandomization by exploiting redundancy and mutual independence  Planar separators and the Euclidean norm  On the complexity of isometric embedding in the hypercube  Distributed function evaluation in the presence of transmission faults  Optimal linear broadcast  Graph augmentation problems for a specified set of vertices  A heuristic algorithm for the kcenter problem with vertex weight  Parallel convexity algorithms for digitized images on a linear array of processors  Parallel algorithms for labeling image components  A hyperplane Incidence problem with applications to counting distances  Splitting a configuration in a simplex  Weaving patterns of lines and line segments in space  Efficient parallel algorithms for path problems in planar directed graphs  Parallel algorithms for finding Steiner forests in planar graphs  Optimally managing the history of an evolving forest
 Dimensions
 unknown
 Extent
 X, 482 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540471776
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540529217
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540471776
 Label
 Algorithms : International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings, edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, (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
 Recent progress in string algorithms  Selection networks  Computing edgeconnectivity in multiple and capacitated graphs  Efficient sequential and parallel algorithms for planar minimum cost flow  Structural analyses on the complexity of inverting functions  Oracles versus proof techniques that do not relativize  20Relative neighborhood graphs are Hamiltonian  The KGabriel graphs and their applications  Parallel algorithms for generating subsets and set partitions  Parallel algorithms for linked list and beyond  Local tournaments and proper circular arc graphs  Fast algorithms for the dominating set problem on permutation graphs  Two probabilistic results on merging  Randomized broadcast in networks  On the construction of abstract voronoi diagrams, II  Searching in higher dimension  Finding extrema with unary predicates  Implicitly searching convolutions and computing depth of collision  Characterization for a family of infinitely many irreducible Equally Spaced Polynomials  Distributed algorithms for deciphering  An efficient algorithm for optimal loop parallelization (extended abstract)  Another view on the SSS* algorithm  Algorithms from complexity theory: Polynomialtime operations for complex sets  Complexity cores and hard problem instances  Spatial point location and its applications  Sublinear merging and natural merge sort  Constructing strongly convex approximate hulls with inaccurate primitives  Computing puiseuxseries solutions to determinatal equations via combinatorial relaxation  A tight lower bound on the size of planar permutation networks  Simultaneous solution of families of problems  Algorithms for projecting points to give the most uniform distribution with applications to hashing  Topological sweeping in three dimensions  Finding leastweight subsequences with fewer processors  Derandomization by exploiting redundancy and mutual independence  Planar separators and the Euclidean norm  On the complexity of isometric embedding in the hypercube  Distributed function evaluation in the presence of transmission faults  Optimal linear broadcast  Graph augmentation problems for a specified set of vertices  A heuristic algorithm for the kcenter problem with vertex weight  Parallel convexity algorithms for digitized images on a linear array of processors  Parallel algorithms for labeling image components  A hyperplane Incidence problem with applications to counting distances  Splitting a configuration in a simplex  Weaving patterns of lines and line segments in space  Efficient parallel algorithms for path problems in planar directed graphs  Parallel algorithms for finding Steiner forests in planar graphs  Optimally managing the history of an evolving forest
 Dimensions
 unknown
 Extent
 X, 482 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540471776
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540529217
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540471776
Subject
 Algorithm Analysis and Problem Complexity
 Combinatorial analysis
 Combinatorial analysis
 Combinatorial analysis
 Combinatorics
 Combinatorics
 Combinatorics
 Computation by Abstract Devices
 Computer Science
 Computer Science
 Computer Science
 Computer science
 Computer science
 Computer science
 Computer software
 Computer software
 Computer software
 Distribution (Probability theory)
 Distribution (Probability theory)
 Distribution (Probability theory)
 Electronic resources
 Information Storage and Retrieval
 Information storage and retrieval systems
 Information storage and retrieval systems
 Information storage and retrieval systems
 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/AlgorithmsInternationalSymposiumSIGAL90/QeR7hkAjZAI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsInternationalSymposiumSIGAL90/QeR7hkAjZAI/">Algorithms : International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings, edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, (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 Algorithms : International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings, edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, (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/AlgorithmsInternationalSymposiumSIGAL90/QeR7hkAjZAI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsInternationalSymposiumSIGAL90/QeR7hkAjZAI/">Algorithms : International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings, edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, (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>