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 and Computation : Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings, edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, (electronic resource)
Algorithms and Computation : Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings, edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, (electronic resource)
Resource Information
The item Algorithms and Computation : Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings, edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, (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 and Computation : Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings, edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, (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 gives the proceedings of ISAAC '92, the Third International Symposium on Algorithms and Computation, held in Nagoya, Japan, December 1992. The first symposium was held in Tokyo in 1990, as the first international symposium organized by SIGAL (Special Interest Groupon Algorithms in the Information Processing Society of Japan) to serve as anannual international forum in Asia for researchers in the area of algorithms. The second symposium was held in Taipei, Taiwan in 1991, where it was decided that computation would be included in the main scope of the symposium and that ISAAC would be its name. ISAAC '92 focuses on topics in design and analysis of algorithms, computational complexity, and theory of computation, including algorithms and data structures, parallel/distributed computing, automata and formal languages, probabilistic/approximation algorithms, computability and complexity, term rewriting systems, and computational geometry. The volume contains the accepted contributed papers and the invited papers
 Language
 eng
 Extent
 XII, 516 p.
 Contents

 Methods in parallel algorithmics and who may need to know them?
 Rectilinear paths among rectilinear obstacles
 Linear time algorithms for kcutwidth problem
 The kedgeconnectivity augmentation problem of weighted graphs
 Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity
 The application of the searching over separators strategy to solve some NPcomplete problems on planar graphs
 Parallel and online graph coloring algorithms
 Competitive analysis of the Round Robin algorithm
 Competitive analysis of the online algorithms for multiple stacks systems
 Selfadjusting augmented search trees
 Algorithms for a class of MinCut and MaxCut problem
 Algorithms for rectilinear optimal multicast tree problem
 Approximating treewidth and pathwidth of some classes of perfect graphs
 Graph spanners and connectivity
 Randomized rangemaxima in nearlyconstant parallel time
 Faulttolerant broadcasting in binary jumping networks
 Routing problems on the mesh of buses
 Selection networks with 8n log2 n size and O(log n) depth
 Relativizations of the P=? NP and other problems: Some developments in structural complexity theory
 Boolean circuit complexity
 Searching a solid pseudo 3sided orthoconvex grid
 An efficient parallel algorithm for geometrically characterising drawings of a class of 3D objects
 Topologically consistent algorithms related to convex polyhedra
 Characterizing and recognizing visibility graphs of Funnelshaped polygons
 On the complexity of composite numbers
 On malign input distributions for algorithms
 Lowness and the complexity of sparse and tally descriptions
 Honest iteration schemes of randomizing algorithms
 Approximating vertices of a convex polygon with grid points in the polygon
 Algorithms for determining the geometrical congruity in two and three dimensions
 On the relationships among constrained geometric structures
 Generating small convergent systems can be extremely hard
 Chew's theorem revisited — uniquely normalizing property of nonlinear term rewriting systems
 Higher order communicating processes with ValuePassing, Assignment and return of results
 Searching informed game trees
 How to generate realistic sample problems for network optimization
 Generalized assignment problems
 Recognizing an envelope of lines in linear time
 Approximation of polygonal curves with minimum number of line segments
 Wiring knockknee layouts: A global approach
 Algorithms for finding noncrossing paths with minimum total length in plane graphs
 On symmetry of information and polynomial time invertibility
 On probabilistic ACC circuits with an exactthreshold output gate
 Computational and statistical indistinguishabilities
 On symmetric differences of NPhard sets with weaklyPselective sets
 Restricted track assignment with applications
 A simple test for the consecutive ones property
 The longest common subsequence problem for small alphabet size between many strings
 The implicit dictionary problem revisited
 Sorting inplace with a worst case complexity of n log n?1.3n+O(log n) comparisons and ? n log n+O(1) transports
 Sorting and/by merging finger trees
 Isbn
 9783540475019
 Label
 Algorithms and Computation : Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings
 Title
 Algorithms and Computation
 Title remainder
 Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings
 Statement of responsibility
 edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
 Subject

 Computation by Abstract Devices
 Computer graphics
 Probability Theory and Stochastic Processes
 Computer Graphics
 Computer science
 Computer science
 Information Storage and Retrieval
 Statistics, general
 Information storage and retrieval systems
 Combinatorics
 Computer Science
 Computer graphics
 Computer Science
 Distribution (Probability theory)
 Statistics
 Distribution (Probability theory)
 Combinatorics
 Computer Graphics
 Computer graphics
 Electronic resources
 Statistics
 Information storage and retrieval systems
 Combinatorics
 Distribution (Probability theory)
 Statistics
 Information storage and retrieval systems
 Computer Science
 Computer Graphics
 Computer science
 Language
 eng
 Summary
 This volume gives the proceedings of ISAAC '92, the Third International Symposium on Algorithms and Computation, held in Nagoya, Japan, December 1992. The first symposium was held in Tokyo in 1990, as the first international symposium organized by SIGAL (Special Interest Groupon Algorithms in the Information Processing Society of Japan) to serve as anannual international forum in Asia for researchers in the area of algorithms. The second symposium was held in Taipei, Taiwan in 1991, where it was decided that computation would be included in the main scope of the symposium and that ISAAC would be its name. ISAAC '92 focuses on topics in design and analysis of algorithms, computational complexity, and theory of computation, including algorithms and data structures, parallel/distributed computing, automata and formal languages, probabilistic/approximation algorithms, computability and complexity, term rewriting systems, and computational geometry. The volume contains the accepted contributed papers and the invited papers
 http://library.link/vocab/creatorName
 Ibaraki, Toshihide
 Image bit depth
 0
 LC call number
 QA75.576.95
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Inagaki, Yasuyoshi.
 Iwama, Kazuo.
 Nishizeki, Takao.
 Yamashita, Masafumi.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 650
 http://library.link/vocab/subjectName

 Computer science
 Information storage and retrieval systems
 Computer graphics
 Combinatorics
 Distribution (Probability theory)
 Statistics
 Computer Science
 Computation by Abstract Devices
 Combinatorics
 Probability Theory and Stochastic Processes
 Statistics, general
 Information Storage and Retrieval
 Computer Graphics
 Label
 Algorithms and Computation : Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings, edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, (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
 Methods in parallel algorithmics and who may need to know them?  Rectilinear paths among rectilinear obstacles  Linear time algorithms for kcutwidth problem  The kedgeconnectivity augmentation problem of weighted graphs  Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity  The application of the searching over separators strategy to solve some NPcomplete problems on planar graphs  Parallel and online graph coloring algorithms  Competitive analysis of the Round Robin algorithm  Competitive analysis of the online algorithms for multiple stacks systems  Selfadjusting augmented search trees  Algorithms for a class of MinCut and MaxCut problem  Algorithms for rectilinear optimal multicast tree problem  Approximating treewidth and pathwidth of some classes of perfect graphs  Graph spanners and connectivity  Randomized rangemaxima in nearlyconstant parallel time  Faulttolerant broadcasting in binary jumping networks  Routing problems on the mesh of buses  Selection networks with 8n log2 n size and O(log n) depth  Relativizations of the P=? NP and other problems: Some developments in structural complexity theory  Boolean circuit complexity  Searching a solid pseudo 3sided orthoconvex grid  An efficient parallel algorithm for geometrically characterising drawings of a class of 3D objects  Topologically consistent algorithms related to convex polyhedra  Characterizing and recognizing visibility graphs of Funnelshaped polygons  On the complexity of composite numbers  On malign input distributions for algorithms  Lowness and the complexity of sparse and tally descriptions  Honest iteration schemes of randomizing algorithms  Approximating vertices of a convex polygon with grid points in the polygon  Algorithms for determining the geometrical congruity in two and three dimensions  On the relationships among constrained geometric structures  Generating small convergent systems can be extremely hard  Chew's theorem revisited — uniquely normalizing property of nonlinear term rewriting systems  Higher order communicating processes with ValuePassing, Assignment and return of results  Searching informed game trees  How to generate realistic sample problems for network optimization  Generalized assignment problems  Recognizing an envelope of lines in linear time  Approximation of polygonal curves with minimum number of line segments  Wiring knockknee layouts: A global approach  Algorithms for finding noncrossing paths with minimum total length in plane graphs  On symmetry of information and polynomial time invertibility  On probabilistic ACC circuits with an exactthreshold output gate  Computational and statistical indistinguishabilities  On symmetric differences of NPhard sets with weaklyPselective sets  Restricted track assignment with applications  A simple test for the consecutive ones property  The longest common subsequence problem for small alphabet size between many strings  The implicit dictionary problem revisited  Sorting inplace with a worst case complexity of n log n?1.3n+O(log n) comparisons and ? n log n+O(1) transports  Sorting and/by merging finger trees
 Dimensions
 unknown
 Extent
 XII, 516 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540475019
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540562796
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540475019
 Label
 Algorithms and Computation : Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings, edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, (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
 Methods in parallel algorithmics and who may need to know them?  Rectilinear paths among rectilinear obstacles  Linear time algorithms for kcutwidth problem  The kedgeconnectivity augmentation problem of weighted graphs  Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity  The application of the searching over separators strategy to solve some NPcomplete problems on planar graphs  Parallel and online graph coloring algorithms  Competitive analysis of the Round Robin algorithm  Competitive analysis of the online algorithms for multiple stacks systems  Selfadjusting augmented search trees  Algorithms for a class of MinCut and MaxCut problem  Algorithms for rectilinear optimal multicast tree problem  Approximating treewidth and pathwidth of some classes of perfect graphs  Graph spanners and connectivity  Randomized rangemaxima in nearlyconstant parallel time  Faulttolerant broadcasting in binary jumping networks  Routing problems on the mesh of buses  Selection networks with 8n log2 n size and O(log n) depth  Relativizations of the P=? NP and other problems: Some developments in structural complexity theory  Boolean circuit complexity  Searching a solid pseudo 3sided orthoconvex grid  An efficient parallel algorithm for geometrically characterising drawings of a class of 3D objects  Topologically consistent algorithms related to convex polyhedra  Characterizing and recognizing visibility graphs of Funnelshaped polygons  On the complexity of composite numbers  On malign input distributions for algorithms  Lowness and the complexity of sparse and tally descriptions  Honest iteration schemes of randomizing algorithms  Approximating vertices of a convex polygon with grid points in the polygon  Algorithms for determining the geometrical congruity in two and three dimensions  On the relationships among constrained geometric structures  Generating small convergent systems can be extremely hard  Chew's theorem revisited — uniquely normalizing property of nonlinear term rewriting systems  Higher order communicating processes with ValuePassing, Assignment and return of results  Searching informed game trees  How to generate realistic sample problems for network optimization  Generalized assignment problems  Recognizing an envelope of lines in linear time  Approximation of polygonal curves with minimum number of line segments  Wiring knockknee layouts: A global approach  Algorithms for finding noncrossing paths with minimum total length in plane graphs  On symmetry of information and polynomial time invertibility  On probabilistic ACC circuits with an exactthreshold output gate  Computational and statistical indistinguishabilities  On symmetric differences of NPhard sets with weaklyPselective sets  Restricted track assignment with applications  A simple test for the consecutive ones property  The longest common subsequence problem for small alphabet size between many strings  The implicit dictionary problem revisited  Sorting inplace with a worst case complexity of n log n?1.3n+O(log n) comparisons and ? n log n+O(1) transports  Sorting and/by merging finger trees
 Dimensions
 unknown
 Extent
 XII, 516 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540475019
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540562796
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540475019
Subject
 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
 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/AlgorithmsandComputationThirdInternational/BhZodp2LYyI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandComputationThirdInternational/BhZodp2LYyI/">Algorithms and Computation : Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings, edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, (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 and Computation : Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings, edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, (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/AlgorithmsandComputationThirdInternational/BhZodp2LYyI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandComputationThirdInternational/BhZodp2LYyI/">Algorithms and Computation : Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings, edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, (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>