The Resource Algorithms - ESA 2000 : 8th annual European symposium, Saarbrücken, Germany, September 5-8, 2000 : proceedings, Mike Paterson (ed.)

Algorithms - ESA 2000 : 8th annual European symposium, Saarbrücken, Germany, September 5-8, 2000 : proceedings, Mike Paterson (ed.)

Label
Algorithms - ESA 2000 : 8th annual European symposium, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Title
Algorithms - ESA 2000
Title remainder
8th annual European symposium, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Statement of responsibility
Mike Paterson (ed.)
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
DLC
Illustrations
illustrations
Index
index present
LC call number
QA76.9.A43
LC item number
E83 2000
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2000
http://bibfra.me/vocab/lite/meetingName
ESA (Symposium)
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorName
Paterson, Michael S
http://library.link/vocab/subjectName
  • Computer algorithms
  • algorithme graphe
  • algorithme réparti
  • algorithme parallèle
  • complexité
  • algorithmique
  • Algorithmes
  • Computer algorithms
  • Algoritmen
  • Algoritmos e estruturas de dados
  • Matematica da computacao
  • Algorithmes
Label
Algorithms - ESA 2000 : 8th annual European symposium, Saarbrücken, Germany, September 5-8, 2000 : proceedings, Mike Paterson (ed.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Web Information Retrieval -- an Algorithmic Perspective / Monika Henzinger -- Computational Biology -- Algorithms and More / Thomas Lengauer -- Polygon Decomposition for Efficient Construction of Minkowski Sums / Pankaj K. Agarwal, Eyal Flato and Dan Halperin -- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts / Alexander A. Ageev and Maxim I. Sviridenko -- Offline List Update Is NP-Hard / Christoph Ambuhl -- Computing Largest Common Point Sets under Approximate Congruence / Christoph Ambuhl, Samarjit Chakraborty and Bernd Gartner -- Online Algorithms for Caching Multimedia Streams / Matthew Andrews and Kamesh Munagala -- On Recognizing Cayley Graphs / Lali Barriere, Pierre Fraigniaud and Cyril Gavoille / [et al.] -- Fast Algorithms for Even/Odd Minimum Cuts and Generalizations / Andras A. Benczur and Ottilia Fulop -- Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs / S. Besparnyatnikh, B. Bhattacharya and J. Mark Keil / [et al.] -- Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset / Peter Brass -- Range Searching Over Tree Cross Products / Adam L. Buchsbaum, Michael T. Goodrich and Jeffery R. Westbrook -- A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem / Robert Carr, Toshihiro Fujito and Goran Konjevod / [et al.] -- The Minimum Range Assignment Problem on Linear Radio Networks / A. E. F. Clementi, A. Ferreira and P. Penna / [et al.] -- Property Testing in Computational Geometry / Artur Czumaj, Christian Sohler and Martin Ziegler -- On R-trees with Low Stabbing Number / Mark de Berg, Joachim Gudmundsson and Mikael Hammar / [et al.] -- K-D Trees Are Better when Cut on the Longest Side / Matthew Dickerson, Christian A. Duncan and Michael T. Goodrich -- On Multicriteria Online Problems / Michele Flammini and Gaia Nicosia -- Online Scheduling Revisited / Rudolf Fleischer and Michaela Wahl -- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem / Daya Ram Gaur, Toshihide Ibaraki and Ramesh Krishnamurti -- I/O-Efficient Well-Separated Pair Decomposition and Its Applications / Sathish Govindarajan, Tamas Lukovszki and Anil Maheshwari / [et al.] -- Higher Order Delaunay Triangulations / Joachim Gudmundsson, Mikael Hammar and Marc van Kreveld -- On Representations of Algebraic-Geometric Codes for List Decoding / Venkatesan Guruswami and Madhu Sudan -- Minimizing a Convex Cost Closure Set / Dorit S. Hochbaum and Maurice Queyranne -- Preemptive Scheduling with Rejection / Han Hoogeveen, Martin Skutella and Gerhard J. Woeginger -- Simpler and Faster Vertex-Connectivity Augmentation Algorithms / Tsan-sheng Hsu -- Scheduling Broadcasts in Wireless Networks / Bala Kalyanasundaram, Kirk Pruhs and Mahe Velauthapillai -- Jitter Regulation in an Internet Router with Delay Consideration / Hisashi Koga -- Approximation in Curvature-Constrained Shortest Paths through a Sequence of Points / Jae-Ha Lee, Otfried Cheong and Woo-Cheol Kwon / [et al.] -- Resource Constrained Shortest Paths / Kurt Mehlhorn and Mark Ziegelmann -- On the Competitiveness of Linear Search / J. Ian Munro -- Maintaining a Minimum Spanning Tree Under Transient Node Failures / Enrico Nardelli, Guido Proietti and Peter Widmayer -- Minimum Depth Graph Embedding / Maurizio Pizzonia and Roberto Tamassia -- New Algorithms for Two-Label Point Labeling / Zhongping Qin, Alexander Wolff and Yinfeng Xu / [et al.] -- Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms / Naila Rahman and Rajeev Raman -- How Helpers Hasten h-Relations / Peter Sanders and Roberto Solis-Oba -- Computing Optimal Linear Layouts of Trees in Linear Time / Konstantin Skodinis -- Coloring Sparse Random Graphs in Polynomial Average Time / C. R. Subramanian -- Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine / Marjan van den Akker, Han Hoogeveen and Nodari Vakhania -- Collision Detection Using Bounding Boxes: Convexity Helps / Yunhong Zhou and Subhash Suri
Dimensions
24 cm.
Dimensions
unknown
Extent
ix, 450 pages
Isbn
9783540410041
Lccn
00063582
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Other physical details
illustrations
Specific material designation
remote
System control number
  • (OCoLC)44775237
  • (OCoLC)ocm44775237
Label
Algorithms - ESA 2000 : 8th annual European symposium, Saarbrücken, Germany, September 5-8, 2000 : proceedings, Mike Paterson (ed.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Web Information Retrieval -- an Algorithmic Perspective / Monika Henzinger -- Computational Biology -- Algorithms and More / Thomas Lengauer -- Polygon Decomposition for Efficient Construction of Minkowski Sums / Pankaj K. Agarwal, Eyal Flato and Dan Halperin -- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts / Alexander A. Ageev and Maxim I. Sviridenko -- Offline List Update Is NP-Hard / Christoph Ambuhl -- Computing Largest Common Point Sets under Approximate Congruence / Christoph Ambuhl, Samarjit Chakraborty and Bernd Gartner -- Online Algorithms for Caching Multimedia Streams / Matthew Andrews and Kamesh Munagala -- On Recognizing Cayley Graphs / Lali Barriere, Pierre Fraigniaud and Cyril Gavoille / [et al.] -- Fast Algorithms for Even/Odd Minimum Cuts and Generalizations / Andras A. Benczur and Ottilia Fulop -- Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs / S. Besparnyatnikh, B. Bhattacharya and J. Mark Keil / [et al.] -- Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset / Peter Brass -- Range Searching Over Tree Cross Products / Adam L. Buchsbaum, Michael T. Goodrich and Jeffery R. Westbrook -- A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem / Robert Carr, Toshihiro Fujito and Goran Konjevod / [et al.] -- The Minimum Range Assignment Problem on Linear Radio Networks / A. E. F. Clementi, A. Ferreira and P. Penna / [et al.] -- Property Testing in Computational Geometry / Artur Czumaj, Christian Sohler and Martin Ziegler -- On R-trees with Low Stabbing Number / Mark de Berg, Joachim Gudmundsson and Mikael Hammar / [et al.] -- K-D Trees Are Better when Cut on the Longest Side / Matthew Dickerson, Christian A. Duncan and Michael T. Goodrich -- On Multicriteria Online Problems / Michele Flammini and Gaia Nicosia -- Online Scheduling Revisited / Rudolf Fleischer and Michaela Wahl -- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem / Daya Ram Gaur, Toshihide Ibaraki and Ramesh Krishnamurti -- I/O-Efficient Well-Separated Pair Decomposition and Its Applications / Sathish Govindarajan, Tamas Lukovszki and Anil Maheshwari / [et al.] -- Higher Order Delaunay Triangulations / Joachim Gudmundsson, Mikael Hammar and Marc van Kreveld -- On Representations of Algebraic-Geometric Codes for List Decoding / Venkatesan Guruswami and Madhu Sudan -- Minimizing a Convex Cost Closure Set / Dorit S. Hochbaum and Maurice Queyranne -- Preemptive Scheduling with Rejection / Han Hoogeveen, Martin Skutella and Gerhard J. Woeginger -- Simpler and Faster Vertex-Connectivity Augmentation Algorithms / Tsan-sheng Hsu -- Scheduling Broadcasts in Wireless Networks / Bala Kalyanasundaram, Kirk Pruhs and Mahe Velauthapillai -- Jitter Regulation in an Internet Router with Delay Consideration / Hisashi Koga -- Approximation in Curvature-Constrained Shortest Paths through a Sequence of Points / Jae-Ha Lee, Otfried Cheong and Woo-Cheol Kwon / [et al.] -- Resource Constrained Shortest Paths / Kurt Mehlhorn and Mark Ziegelmann -- On the Competitiveness of Linear Search / J. Ian Munro -- Maintaining a Minimum Spanning Tree Under Transient Node Failures / Enrico Nardelli, Guido Proietti and Peter Widmayer -- Minimum Depth Graph Embedding / Maurizio Pizzonia and Roberto Tamassia -- New Algorithms for Two-Label Point Labeling / Zhongping Qin, Alexander Wolff and Yinfeng Xu / [et al.] -- Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms / Naila Rahman and Rajeev Raman -- How Helpers Hasten h-Relations / Peter Sanders and Roberto Solis-Oba -- Computing Optimal Linear Layouts of Trees in Linear Time / Konstantin Skodinis -- Coloring Sparse Random Graphs in Polynomial Average Time / C. R. Subramanian -- Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine / Marjan van den Akker, Han Hoogeveen and Nodari Vakhania -- Collision Detection Using Bounding Boxes: Convexity Helps / Yunhong Zhou and Subhash Suri
Dimensions
24 cm.
Dimensions
unknown
Extent
ix, 450 pages
Isbn
9783540410041
Lccn
00063582
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Other physical details
illustrations
Specific material designation
remote
System control number
  • (OCoLC)44775237
  • (OCoLC)ocm44775237

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 ...