The Resource Algorithms and computation : Third International Symposium, ISAAC '92, Nagoya, Japan, December 1618, 1992 : proceedings, T. Ibaraki [and others] (eds.)
Algorithms and computation : Third International Symposium, ISAAC '92, Nagoya, Japan, December 1618, 1992 : proceedings, T. Ibaraki [and others] (eds.)
Resource Information
The item Algorithms and computation : Third International Symposium, ISAAC '92, Nagoya, Japan, December 1618, 1992 : proceedings, T. Ibaraki [and others] (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Algorithms and computation : Third International Symposium, ISAAC '92, Nagoya, Japan, December 1618, 1992 : proceedings, T. Ibaraki [and others] (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 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
 1 online resource (xi, 510 pages)
 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 1618, 1992 : proceedings
 Title
 Algorithms and computation
 Title remainder
 Third International Symposium, ISAAC '92, Nagoya, Japan, December 1618, 1992 : proceedings
 Statement of responsibility
 T. Ibaraki [and others] (eds.)
 Subject

 Computer algorithms
 Computer algorithms
 Computer algorithms  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Numerical calculations  Data processing
 Numerical calculations  Data processing
 Numerical calculations  Data processing  Congresses
 Algorithmes  Congrès
 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
 Action
 digitized
 Cataloging source
 OCLCE
 Dewey number
 004/.01/5118
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA76.9.A43
 LC item number
 I73 1992
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 1992
 http://bibfra.me/vocab/lite/meetingName
 ISAAC (Symposium)
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorName
 Ibaraki, Toshihide
 Series statement
 Lecture notes in computer science
 Series volume
 650
 http://library.link/vocab/subjectName

 Computer algorithms
 Numerical calculations
 Computer algorithms
 Numerical calculations
 Algorithmes
 Label
 Algorithms and computation : Third International Symposium, ISAAC '92, Nagoya, Japan, December 1618, 1992 : proceedings, T. Ibaraki [and others] (eds.)
 Antecedent source
 file reproduced from original
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 black and white
 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
 Control code
 613121612
 Dimensions
 unknown
 Extent
 1 online resource (xi, 510 pages)
 Form of item
 online
 Isbn
 9783540475019
 Level of compression

 lossless
 lossy
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations.
 Reformatting quality

 preservation
 access
 Reproduction note
 Electronic reproduction.
 Specific material designation
 remote
 System control number
 (OCoLC)613121612
 System details
 Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
 Label
 Algorithms and computation : Third International Symposium, ISAAC '92, Nagoya, Japan, December 1618, 1992 : proceedings, T. Ibaraki [and others] (eds.)
 Antecedent source
 file reproduced from original
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 black and white
 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
 Control code
 613121612
 Dimensions
 unknown
 Extent
 1 online resource (xi, 510 pages)
 Form of item
 online
 Isbn
 9783540475019
 Level of compression

 lossless
 lossy
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations.
 Reformatting quality

 preservation
 access
 Reproduction note
 Electronic reproduction.
 Specific material designation
 remote
 System control number
 (OCoLC)613121612
 System details
 Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
Subject
 Computer algorithms
 Computer algorithms
 Computer algorithms  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Numerical calculations  Data processing
 Numerical calculations  Data processing
 Numerical calculations  Data processing  Congresses
 Algorithmes  Congrès
Genre
Member of
Library Links
Embed
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.library.missouri.edu/portal/AlgorithmsandcomputationThirdInternational/ifzl7VBkrUI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AlgorithmsandcomputationThirdInternational/ifzl7VBkrUI/">Algorithms and computation : Third International Symposium, ISAAC '92, Nagoya, Japan, December 1618, 1992 : proceedings, T. Ibaraki [and others] (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri 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 1618, 1992 : proceedings, T. Ibaraki [and others] (eds.)
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.library.missouri.edu/portal/AlgorithmsandcomputationThirdInternational/ifzl7VBkrUI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AlgorithmsandcomputationThirdInternational/ifzl7VBkrUI/">Algorithms and computation : Third International Symposium, ISAAC '92, Nagoya, Japan, December 1618, 1992 : proceedings, T. Ibaraki [and others] (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>