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 Complexity : Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings, edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista, (electronic resource)
Algorithms and Complexity : Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings, edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista, (electronic resource)
Resource Information
The item Algorithms and Complexity : Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings, edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista, (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 Complexity : Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings, edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista, (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 book constitutes the refereed proceedings of the Third Italian Conference on Algorithms and Complexity, CIAC'97, held in Rome, Italy in March 1997. The 25 revised full papers included in the volume were carefully selected from a total of 74 submissions; also included is an invited paper and an invited abstract. All in all, the papers present an interesting snapshot of current research activities and recent results in theory and applications of sequential, distributed, and parallel algorithms, data structures, and computational complexity
 Language
 eng
 Extent
 IX, 319 p.
 Contents

 Algorithms and data structures for control dependence and related compiler problems
 Embedding interconnection networks in grids via the Layered Cross Product
 Finding optimum kvertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5
 The optimum cost chromatic partition problem
 Fault tolerant Kcenter problems
 R 1?tt SN (NP) distinguishes robust manyone and Turing completeness
 Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
 On the drift of short schedules
 On removing nondegeneracy assumptions in computational geometry
 Maintaining maxima under boundary updates
 An optimal algorithm for oneseparation of a set of isothetic polygons
 Nice drawings for planar bipartite graphs
 Area requirement of Gabriel drawings (extended abstract)
 Design of reliable combinatorial algorithms using certificates
 An improved deterministic algorithm for generalized random sampling
 Polynomial time algorithms for some selfduality problems
 A note on updating suffix tree labels
 Relaxed balanced redblack trees
 The algorithmic complexity of chemical threshold testing
 A meticulous analysis of mergesort programs
 BSPlike externalmemory computation
 Topological chaos for elementary cellular automata
 On the complexity of balanced Boolean functions
 On sets with easy certificates and the existence of oneway permutations
 Isomorphism for graphs of bounded distance width
 Hardness of approximating problems on cubic graphs
 Tree contractions and evolutionary trees
 Isbn
 9783540683230
 Label
 Algorithms and Complexity : Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings
 Title
 Algorithms and Complexity
 Title remainder
 Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings
 Statement of responsibility
 edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista
 Subject

 Computation by Abstract Devices
 Computer graphics
 Data structures (Computer science)
 Computer Graphics
 Computer science
 Computer science
 Computer software
 Algorithm Analysis and Problem Complexity
 Data structures (Computer science)
 Combinatorics
 Computer Science
 Data Structures
 Computer graphics
 Computer Science
 Combinatorics
 Computer Graphics
 Computer graphics
 Data structures (Computer science)
 Electronic resources
 Computer software
 Computer software
 Combinatorics
 Computer Science
 Computer Graphics
 Computer science
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the Third Italian Conference on Algorithms and Complexity, CIAC'97, held in Rome, Italy in March 1997. The 25 revised full papers included in the volume were carefully selected from a total of 74 submissions; also included is an invited paper and an invited abstract. All in all, the papers present an interesting snapshot of current research activities and recent results in theory and applications of sequential, distributed, and parallel algorithms, data structures, and computational complexity
 http://library.link/vocab/creatorName
 Bongiovanni, Giancarlo
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Bovet, Daniel Pierre.
 Battista, Giuseppe.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 1203
 http://library.link/vocab/subjectName

 Computer science
 Data structures (Computer science)
 Computer software
 Computer graphics
 Combinatorics
 Computer Science
 Algorithm Analysis and Problem Complexity
 Computation by Abstract Devices
 Data Structures
 Computer Graphics
 Combinatorics
 Label
 Algorithms and Complexity : Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings, edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista, (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
 Algorithms and data structures for control dependence and related compiler problems  Embedding interconnection networks in grids via the Layered Cross Product  Finding optimum kvertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5  The optimum cost chromatic partition problem  Fault tolerant Kcenter problems  R 1?tt SN (NP) distinguishes robust manyone and Turing completeness  Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy  On the drift of short schedules  On removing nondegeneracy assumptions in computational geometry  Maintaining maxima under boundary updates  An optimal algorithm for oneseparation of a set of isothetic polygons  Nice drawings for planar bipartite graphs  Area requirement of Gabriel drawings (extended abstract)  Design of reliable combinatorial algorithms using certificates  An improved deterministic algorithm for generalized random sampling  Polynomial time algorithms for some selfduality problems  A note on updating suffix tree labels  Relaxed balanced redblack trees  The algorithmic complexity of chemical threshold testing  A meticulous analysis of mergesort programs  BSPlike externalmemory computation  Topological chaos for elementary cellular automata  On the complexity of balanced Boolean functions  On sets with easy certificates and the existence of oneway permutations  Isomorphism for graphs of bounded distance width  Hardness of approximating problems on cubic graphs  Tree contractions and evolutionary trees
 Dimensions
 unknown
 Extent
 IX, 319 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540683230
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540625925
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540683230
 Label
 Algorithms and Complexity : Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings, edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista, (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
 Algorithms and data structures for control dependence and related compiler problems  Embedding interconnection networks in grids via the Layered Cross Product  Finding optimum kvertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5  The optimum cost chromatic partition problem  Fault tolerant Kcenter problems  R 1?tt SN (NP) distinguishes robust manyone and Turing completeness  Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy  On the drift of short schedules  On removing nondegeneracy assumptions in computational geometry  Maintaining maxima under boundary updates  An optimal algorithm for oneseparation of a set of isothetic polygons  Nice drawings for planar bipartite graphs  Area requirement of Gabriel drawings (extended abstract)  Design of reliable combinatorial algorithms using certificates  An improved deterministic algorithm for generalized random sampling  Polynomial time algorithms for some selfduality problems  A note on updating suffix tree labels  Relaxed balanced redblack trees  The algorithmic complexity of chemical threshold testing  A meticulous analysis of mergesort programs  BSPlike externalmemory computation  Topological chaos for elementary cellular automata  On the complexity of balanced Boolean functions  On sets with easy certificates and the existence of oneway permutations  Isomorphism for graphs of bounded distance width  Hardness of approximating problems on cubic graphs  Tree contractions and evolutionary trees
 Dimensions
 unknown
 Extent
 IX, 319 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540683230
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540625925
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540683230
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
 Data Structures
 Data structures (Computer science)
 Data structures (Computer science)
 Data structures (Computer science)
 Electronic resources
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/AlgorithmsandComplexityThirdItalian/Mi2VPZA2RVs/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandComplexityThirdItalian/Mi2VPZA2RVs/">Algorithms and Complexity : Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings, edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista, (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 Complexity : Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings, edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista, (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/AlgorithmsandComplexityThirdItalian/Mi2VPZA2RVs/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandComplexityThirdItalian/Mi2VPZA2RVs/">Algorithms and Complexity : Third Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings, edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista, (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>