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 : Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings, edited by M. Bonuccelli, P. Crescenzi, R. Petreschi, (electronic resource)
Algorithms and Complexity : Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings, edited by M. Bonuccelli, P. Crescenzi, R. Petreschi, (electronic resource)
Resource Information
The item Algorithms and Complexity : Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings, edited by M. Bonuccelli, P. Crescenzi, R. Petreschi, (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 : Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings, edited by M. Bonuccelli, P. Crescenzi, R. Petreschi, (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
 The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Rome. This biannual conference series is intended to present research contributions in theory and applications of sequential, parallel, and distributed algorithms, data structures, and computational complexity. The volume contains four invited presentations and 14 regular presentations selected from 32 submissions, each of which was evaluated by at least four program committee members. The invited presentations are by J. Hartmanis and S. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U. Vishkin, and M. Yannakakis
 Language
 eng
 Extent
 IX, 227 p.
 Contents

 On the intellectual terrain around NP
 Advances in graph drawing
 On a parallelalgorithms method for string matching problems (overview)
 Some open problems in approximation
 New local search approximation techniques for maximum generalized satisfiability problems
 Learning behaviors of automata from multiplicity and equivalence queries
 Measures of Boolean function complexity based on Harmonic Analysis
 Graph theory and interactive protocols for Reachability Problems on finite Cellular automata
 Parallel pruning decomposition (PDS) and biconnected components of graphs
 A noninteractive electronic cash system
 A unified scheme for routing in expander based networks
 Dynamization of backtrackfree search for the constraint satisfaction problem
 Efficient reorganization of binary search trees
 Timemessage tradeoffs for the weak unison problem
 On set equalitytesting
 On the complexity of some reachability problems
 On selfreducible sets of low information content
 Lower bounds for merging on the hypercube
 Isbn
 9783540483373
 Label
 Algorithms and Complexity : Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings
 Title
 Algorithms and Complexity
 Title remainder
 Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings
 Statement of responsibility
 edited by M. Bonuccelli, P. Crescenzi, R. Petreschi
 Subject

 Computation by Abstract Devices
 Combinatorics
 Data structures (Computer science)
 Computer software
 Computer science
 Computer science
 Algorithm Analysis and Problem Complexity
 Computer Science
 Computer Science
 Data Structures
 Data structures (Computer science)
 Computer software
 Combinatorics
 Electronic resources
 Computer software
 Computer Science
 Computer science
 Language
 eng
 Summary
 The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Rome. This biannual conference series is intended to present research contributions in theory and applications of sequential, parallel, and distributed algorithms, data structures, and computational complexity. The volume contains four invited presentations and 14 regular presentations selected from 32 submissions, each of which was evaluated by at least four program committee members. The invited presentations are by J. Hartmanis and S. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U. Vishkin, and M. Yannakakis
 http://library.link/vocab/creatorName
 Bonuccelli, M
 Image bit depth
 0
 LC call number
 QA75.576.95
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Crescenzi, P.
 Petreschi, R.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 778
 http://library.link/vocab/subjectName

 Computer science
 Data structures (Computer science)
 Computer software
 Combinatorics
 Computer Science
 Computation by Abstract Devices
 Algorithm Analysis and Problem Complexity
 Data Structures
 Combinatorics
 Label
 Algorithms and Complexity : Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings, edited by M. Bonuccelli, P. Crescenzi, R. Petreschi, (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
 On the intellectual terrain around NP  Advances in graph drawing  On a parallelalgorithms method for string matching problems (overview)  Some open problems in approximation  New local search approximation techniques for maximum generalized satisfiability problems  Learning behaviors of automata from multiplicity and equivalence queries  Measures of Boolean function complexity based on Harmonic Analysis  Graph theory and interactive protocols for Reachability Problems on finite Cellular automata  Parallel pruning decomposition (PDS) and biconnected components of graphs  A noninteractive electronic cash system  A unified scheme for routing in expander based networks  Dynamization of backtrackfree search for the constraint satisfaction problem  Efficient reorganization of binary search trees  Timemessage tradeoffs for the weak unison problem  On set equalitytesting  On the complexity of some reachability problems  On selfreducible sets of low information content  Lower bounds for merging on the hypercube
 Dimensions
 unknown
 Extent
 IX, 227 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540483373
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540578110
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540483373
 Label
 Algorithms and Complexity : Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings, edited by M. Bonuccelli, P. Crescenzi, R. Petreschi, (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
 On the intellectual terrain around NP  Advances in graph drawing  On a parallelalgorithms method for string matching problems (overview)  Some open problems in approximation  New local search approximation techniques for maximum generalized satisfiability problems  Learning behaviors of automata from multiplicity and equivalence queries  Measures of Boolean function complexity based on Harmonic Analysis  Graph theory and interactive protocols for Reachability Problems on finite Cellular automata  Parallel pruning decomposition (PDS) and biconnected components of graphs  A noninteractive electronic cash system  A unified scheme for routing in expander based networks  Dynamization of backtrackfree search for the constraint satisfaction problem  Efficient reorganization of binary search trees  Timemessage tradeoffs for the weak unison problem  On set equalitytesting  On the complexity of some reachability problems  On selfreducible sets of low information content  Lower bounds for merging on the hypercube
 Dimensions
 unknown
 Extent
 IX, 227 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540483373
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540578110
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540483373
Subject
 Algorithm Analysis and Problem Complexity
 Combinatorics
 Combinatorics
 Computation by Abstract Devices
 Computer Science
 Computer Science
 Computer Science
 Computer science
 Computer science
 Computer science
 Computer software
 Computer software
 Computer software
 Data Structures
 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/AlgorithmsandComplexitySecondItalian/K859TK2jTHE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandComplexitySecondItalian/K859TK2jTHE/">Algorithms and Complexity : Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings, edited by M. Bonuccelli, P. Crescenzi, R. Petreschi, (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 : Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings, edited by M. Bonuccelli, P. Crescenzi, R. Petreschi, (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/AlgorithmsandComplexitySecondItalian/K859TK2jTHE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandComplexitySecondItalian/K859TK2jTHE/">Algorithms and Complexity : Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings, edited by M. Bonuccelli, P. Crescenzi, R. Petreschi, (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>