Coverart for item
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)

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
Creator
Contributor
Editor
Provider
Subject
Language
eng
Summary
This is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 16-18, 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 6-8 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
Member of
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)
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
Recent progress in string algorithms -- Selection networks -- Computing edge-connectivity 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 -- 20-Relative neighborhood graphs are Hamiltonian -- The K-Gabriel 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: Polynomial-time 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 puiseux-series 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 least-weight 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 k-center 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/3-540-52921-7
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-47177-6
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)
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
Recent progress in string algorithms -- Selection networks -- Computing edge-connectivity 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 -- 20-Relative neighborhood graphs are Hamiltonian -- The K-Gabriel 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: Polynomial-time 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 puiseux-series 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 least-weight 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 k-center 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/3-540-52921-7
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-47177-6

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