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 — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings, edited by Josep Diaz, Maria Serna, (electronic resource)
Algorithms — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings, edited by Josep Diaz, Maria Serna, (electronic resource)
Resource Information
The item Algorithms — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings, edited by Josep Diaz, Maria Serna, (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 — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings, edited by Josep Diaz, Maria Serna, (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 4th European Symposium on Algorithms, ESA '96, held in Barcelona, Spain, in September 1996. The book presents 40 revised full papers selected from 124 submissions; also are included extended abstracts of two invited presentations. The papers included cover all research areas on algorithms and their analysis as it is carried out in the fields of computer science, discrete applied and algorithmic mathematics, operations research, and all other areas of algorithmsoriented research, design and analysis
 Language
 eng
 Extent
 XII, 568 p.
 Contents

 Analysis of Shellsort and related algorithms
 Drawing with colors
 Approximating the unsatisfiability threshold of random formulas (Extended Abstract)
 Preemptive weighted completion time scheduling of parallel jobs
 Approximation algorithms for dynamic storage allocation
 Positive linear programming, parallel approximation and PCP's
 Scheduling jobs with communication delays: Using infeasible solutions for approximation
 Randomization of search trees by subtree size
 Efficient dynamic methodlookup for object oriented languages
 Priority queues: Small, monotone and transdichotomous
 Simulated Annealing and its problems to color graphs
 The capacitated Kcenter problem
 A unified local ratio approximation of nodedeletion problems
 Approximation algorithms for connected dominating sets
 Greedy algorithms for the shortest common superstring that are asymtotically optimal
 On the depth of randomly generated circuits
 The analysis of linear probing hashing with buckets
 Parallel algorithms for partitioning sorted sets and related problems
 Fast generation of random permutations via networks simulation
 On the Parallel Dynamic Dictionary Matching problem: New results with applications
 Parallel algorithms for series parallel graphs
 Parallel complexity of householder QR factorization
 Reporting redblue intersections between two sets of connected line segments
 Matching convex shapes with respect to the symmetric difference
 On minimumarea hulls
 Negativecycle detection algorithms
 A new regular grammar pattern matching algorithm
 LempelZiv index for qgrams
 Computing upper and lower bounds on textile nesting problems
 Online and offline approximation algorithms for vector covering problems
 Competitive analysis of randomized paging algorithms
 Online competitive algorithms for call admission in optical networks
 Racecondition detection in parallel computation with semaphores (extended abstract)
 Efficient wavelength routing on directed fiber trees
 A lower bound for nearly minimal adaptive and hot potato algorithms
 The structure of circular decomposable metrics
 Faster algorithms for subgraph isomorphism of ?connected partial ?trees
 Planar spanners and approximate shortest path queries among obstacles in the plane
 A new approach to optimal planning of robot motion on a tree with obstacles
 Generalized streets revisited
 Computational aspects of organization theory
 Isbn
 9783540706670
 Label
 Algorithms — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings
 Title
 Algorithms — ESA '96
 Title remainder
 Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings
 Statement of responsibility
 edited by Josep Diaz, Maria Serna
 Subject

 Combinatorics
 Computer graphics
 Data structures (Computer science)
 Computer Graphics
 Computational complexity
 Computer software
 Computer science
 Computer science
 Algorithm Analysis and Problem Complexity
 Computer Science
 Computational complexity
 Computer Science
 Data Structures
 Discrete Mathematics in Computer Science
 Data structures (Computer science)
 Computer software
 Combinatorics
 Electronic resources
 Computer software
 Computer graphics
 Computer Communication Networks
 Computer Science
 Computer Graphics
 Computer science
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 4th European Symposium on Algorithms, ESA '96, held in Barcelona, Spain, in September 1996. The book presents 40 revised full papers selected from 124 submissions; also are included extended abstracts of two invited presentations. The papers included cover all research areas on algorithms and their analysis as it is carried out in the fields of computer science, discrete applied and algorithmic mathematics, operations research, and all other areas of algorithmsoriented research, design and analysis
 http://library.link/vocab/creatorName
 Diaz, Josep
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Serna, Maria.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 1136
 http://library.link/vocab/subjectName

 Computer science
 Computer Communication Networks
 Data structures (Computer science)
 Computer software
 Computational complexity
 Computer graphics
 Combinatorics
 Computer Science
 Algorithm Analysis and Problem Complexity
 Combinatorics
 Computer Graphics
 Data Structures
 Computer Communication Networks
 Discrete Mathematics in Computer Science
 Label
 Algorithms — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings, edited by Josep Diaz, Maria Serna, (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
 Analysis of Shellsort and related algorithms  Drawing with colors  Approximating the unsatisfiability threshold of random formulas (Extended Abstract)  Preemptive weighted completion time scheduling of parallel jobs  Approximation algorithms for dynamic storage allocation  Positive linear programming, parallel approximation and PCP's  Scheduling jobs with communication delays: Using infeasible solutions for approximation  Randomization of search trees by subtree size  Efficient dynamic methodlookup for object oriented languages  Priority queues: Small, monotone and transdichotomous  Simulated Annealing and its problems to color graphs  The capacitated Kcenter problem  A unified local ratio approximation of nodedeletion problems  Approximation algorithms for connected dominating sets  Greedy algorithms for the shortest common superstring that are asymtotically optimal  On the depth of randomly generated circuits  The analysis of linear probing hashing with buckets  Parallel algorithms for partitioning sorted sets and related problems  Fast generation of random permutations via networks simulation  On the Parallel Dynamic Dictionary Matching problem: New results with applications  Parallel algorithms for series parallel graphs  Parallel complexity of householder QR factorization  Reporting redblue intersections between two sets of connected line segments  Matching convex shapes with respect to the symmetric difference  On minimumarea hulls  Negativecycle detection algorithms  A new regular grammar pattern matching algorithm  LempelZiv index for qgrams  Computing upper and lower bounds on textile nesting problems  Online and offline approximation algorithms for vector covering problems  Competitive analysis of randomized paging algorithms  Online competitive algorithms for call admission in optical networks  Racecondition detection in parallel computation with semaphores (extended abstract)  Efficient wavelength routing on directed fiber trees  A lower bound for nearly minimal adaptive and hot potato algorithms  The structure of circular decomposable metrics  Faster algorithms for subgraph isomorphism of ?connected partial ?trees  Planar spanners and approximate shortest path queries among obstacles in the plane  A new approach to optimal planning of robot motion on a tree with obstacles  Generalized streets revisited  Computational aspects of organization theory
 Dimensions
 unknown
 Extent
 XII, 568 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540706670
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540616802
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540706670
 Label
 Algorithms — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings, edited by Josep Diaz, Maria Serna, (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
 Analysis of Shellsort and related algorithms  Drawing with colors  Approximating the unsatisfiability threshold of random formulas (Extended Abstract)  Preemptive weighted completion time scheduling of parallel jobs  Approximation algorithms for dynamic storage allocation  Positive linear programming, parallel approximation and PCP's  Scheduling jobs with communication delays: Using infeasible solutions for approximation  Randomization of search trees by subtree size  Efficient dynamic methodlookup for object oriented languages  Priority queues: Small, monotone and transdichotomous  Simulated Annealing and its problems to color graphs  The capacitated Kcenter problem  A unified local ratio approximation of nodedeletion problems  Approximation algorithms for connected dominating sets  Greedy algorithms for the shortest common superstring that are asymtotically optimal  On the depth of randomly generated circuits  The analysis of linear probing hashing with buckets  Parallel algorithms for partitioning sorted sets and related problems  Fast generation of random permutations via networks simulation  On the Parallel Dynamic Dictionary Matching problem: New results with applications  Parallel algorithms for series parallel graphs  Parallel complexity of householder QR factorization  Reporting redblue intersections between two sets of connected line segments  Matching convex shapes with respect to the symmetric difference  On minimumarea hulls  Negativecycle detection algorithms  A new regular grammar pattern matching algorithm  LempelZiv index for qgrams  Computing upper and lower bounds on textile nesting problems  Online and offline approximation algorithms for vector covering problems  Competitive analysis of randomized paging algorithms  Online competitive algorithms for call admission in optical networks  Racecondition detection in parallel computation with semaphores (extended abstract)  Efficient wavelength routing on directed fiber trees  A lower bound for nearly minimal adaptive and hot potato algorithms  The structure of circular decomposable metrics  Faster algorithms for subgraph isomorphism of ?connected partial ?trees  Planar spanners and approximate shortest path queries among obstacles in the plane  A new approach to optimal planning of robot motion on a tree with obstacles  Generalized streets revisited  Computational aspects of organization theory
 Dimensions
 unknown
 Extent
 XII, 568 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540706670
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540616802
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540706670
Subject
 Algorithm Analysis and Problem Complexity
 Combinatorics
 Combinatorics
 Computational complexity
 Computational complexity
 Computer Communication Networks
 Computer Graphics
 Computer Graphics
 Computer Science
 Computer Science
 Computer Science
 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)
 Discrete Mathematics in 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/Algorithms%E2%80%94ESA96FourthAnnualEuropean/zmukjEEMgC4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Algorithms%E2%80%94ESA96FourthAnnualEuropean/zmukjEEMgC4/">Algorithms — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings, edited by Josep Diaz, Maria Serna, (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 — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings, edited by Josep Diaz, Maria Serna, (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/Algorithms%E2%80%94ESA96FourthAnnualEuropean/zmukjEEMgC4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Algorithms%E2%80%94ESA96FourthAnnualEuropean/zmukjEEMgC4/">Algorithms — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings, edited by Josep Diaz, Maria Serna, (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>