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)

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
Creator
Contributor
Editor
Provider
Subject
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 algorithms-oriented research, design and analysis
Member of
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)
Instantiates
Publication
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 method-lookup for object oriented languages -- Priority queues: Small, monotone and trans-dichotomous -- Simulated Annealing and its problems to color graphs -- The capacitated K-center problem -- A unified local ratio approximation of node-deletion 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 red-blue intersections between two sets of connected line segments -- Matching convex shapes with respect to the symmetric difference -- On minimum-area hulls -- Negative-cycle detection algorithms -- A new regular grammar pattern matching algorithm -- Lempel-Ziv index for q-grams -- Computing upper and lower bounds on textile nesting problems -- On-line and off-line approximation algorithms for vector covering problems -- Competitive analysis of randomized paging algorithms -- On-line competitive algorithms for call admission in optical networks -- Race-condition 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/3-540-61680-2
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-70667-0
Label
Algorithms — ESA '96 : Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings, edited by Josep Diaz, Maria Serna, (electronic resource)
Publication
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 method-lookup for object oriented languages -- Priority queues: Small, monotone and trans-dichotomous -- Simulated Annealing and its problems to color graphs -- The capacitated K-center problem -- A unified local ratio approximation of node-deletion 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 red-blue intersections between two sets of connected line segments -- Matching convex shapes with respect to the symmetric difference -- On minimum-area hulls -- Negative-cycle detection algorithms -- A new regular grammar pattern matching algorithm -- Lempel-Ziv index for q-grams -- Computing upper and lower bounds on textile nesting problems -- On-line and off-line approximation algorithms for vector covering problems -- Competitive analysis of randomized paging algorithms -- On-line competitive algorithms for call admission in optical networks -- Race-condition 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/3-540-61680-2
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-70667-0

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...