Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, edited by Susanne Albers, Helmut Alt, Stefan Näher, (electronic resource)
Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, edited by Susanne Albers, Helmut Alt, Stefan Näher, (electronic resource)
Resource Information
The item Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, edited by Susanne Albers, Helmut Alt, Stefan Näher, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, edited by Susanne Albers, Helmut Alt, Stefan Näher, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Bob Constable. The volume's title is a translation of the title of Kurt Mehlhorn's first book, "Effiziente Algorithmen", published by TeubnerVerlag in 1977. This Festschrift demonstrates how the field of algorithmics has developed and matured in the decades since then. The papers included in this volume are organized in topical sections on models of computation and complexity; sorting and searching; combinatorial optimization with applications; computational geometry and geometric graphs; and algorithm engineering, exactness and robustness
 Language

 eng
 eng
 Edition
 1st ed. 2009.
 Extent
 1 online resource (IX, 439 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 Models of Computation and Complexity
 Building MathematicsBased Software Systems to Advance Science and Create Knowledge
 On Negations in Boolean Networks
 The Lovász Local Lemma and Satisfiability
 KolmogorovComplexity Based on Infinite Computations
 Pervasive Theory of Memory
 Introducing Quasirandomness to Computer Science
 Sorting and Searching
 Reflections on Optimal and Nearly Optimal Binary Search Trees
 Some Results for Elementary Operations
 Maintaining Ideally Distributed Random Search Trees without Extra Space
 A Pictorial Description of Cole’s Parallel Merge Sort
 Selfmatched Patterns, Golomb Rulers, and Sequence Reconstruction
 Combinatorial Optimization with Applications
 Algorithms for Energy Saving
 Minimizing Average FlowTime
 Integer Linear Programming in Computational Biology
 Via Detours to I/OEfficient Shortest Paths
 Computational Geometry and Geometric Graphs
 The Computational Geometry of Comparing Shapes
 Finding Nearest Larger Neighbors
 Multicore Implementations of Geometric Algorithms
 The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
 On Map Labeling with Leaders
 The Crossing Number of Graphs: Theory and Computation
 Algorithm Engineering, Exactness, and Robustness
 Algorithm Engineering – An Attempt at a Definition
 Of What Use Is FloatingPoint Arithmetic in Computational Geometry?
 Car or Public Transport—Two Worlds
 Is the World Linear?
 In Praise of Numerical Computation
 Much Ado about Zero
 Polynomial Precise Interval Analysis Revisited
 Isbn
 9783642034565
 Label
 Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
 Title
 Efficient Algorithms
 Title remainder
 Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
 Statement of responsibility
 edited by Susanne Albers, Helmut Alt, Stefan Näher
 Language

 eng
 eng
 Summary
 This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Bob Constable. The volume's title is a translation of the title of Kurt Mehlhorn's first book, "Effiziente Algorithmen", published by TeubnerVerlag in 1977. This Festschrift demonstrates how the field of algorithmics has developed and matured in the decades since then. The papers included in this volume are organized in topical sections on models of computation and complexity; sorting and searching; combinatorial optimization with applications; computational geometry and geometric graphs; and algorithm engineering, exactness and robustness
 Dewey number
 005.1
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 zai27giQTc8
 haicvze030E
 u98SHfpRD_s
 Image bit depth
 0
 Language note
 English
 LC call number
 QA76.676.66
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 Albers, Susanne.
 Alt, Helmut.
 Näher, Stefan.
 Series statement
 Theoretical Computer Science and General Issues
 Series volume
 5760
 http://library.link/vocab/subjectName

 Computer science
 Computer software
 Electronic data processing
 Programming Techniques
 Mathematics of Computing
 Discrete Mathematics
 Algorithm Analysis and Problem Complexity
 Math Applications in Computer Science
 Numeric Computing
 Label
 Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, edited by Susanne Albers, Helmut Alt, Stefan Näher, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code
 cr
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Contents
 Models of Computation and Complexity  Building MathematicsBased Software Systems to Advance Science and Create Knowledge  On Negations in Boolean Networks  The Lovász Local Lemma and Satisfiability  KolmogorovComplexity Based on Infinite Computations  Pervasive Theory of Memory  Introducing Quasirandomness to Computer Science  Sorting and Searching  Reflections on Optimal and Nearly Optimal Binary Search Trees  Some Results for Elementary Operations  Maintaining Ideally Distributed Random Search Trees without Extra Space  A Pictorial Description of Cole’s Parallel Merge Sort  Selfmatched Patterns, Golomb Rulers, and Sequence Reconstruction  Combinatorial Optimization with Applications  Algorithms for Energy Saving  Minimizing Average FlowTime  Integer Linear Programming in Computational Biology  Via Detours to I/OEfficient Shortest Paths  Computational Geometry and Geometric Graphs  The Computational Geometry of Comparing Shapes  Finding Nearest Larger Neighbors  Multicore Implementations of Geometric Algorithms  The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension  On Map Labeling with Leaders  The Crossing Number of Graphs: Theory and Computation  Algorithm Engineering, Exactness, and Robustness  Algorithm Engineering – An Attempt at a Definition  Of What Use Is FloatingPoint Arithmetic in Computational Geometry?  Car or Public Transport—Two Worlds  Is the World Linear?  In Praise of Numerical Computation  Much Ado about Zero  Polynomial Precise Interval Analysis Revisited
 Dimensions
 unknown
 Edition
 1st ed. 2009.
 Extent
 1 online resource (IX, 439 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783642034565
 Level of compression
 uncompressed
 Media category
 computer
 Media type code
 c
 Other control number
 10.1007/9783642034565
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000784719
 (SSID)ssj0000317350
 (PQKBManifestationID)11253069
 (PQKBTitleCode)TC0000317350
 (PQKBWorkID)10293022
 (PQKB)11635157
 (DEHe213)9783642034565
 (MiAaPQ)EBC3064512
 (EXLCZ)991000000000784719
 Label
 Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, edited by Susanne Albers, Helmut Alt, Stefan Näher, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code
 cr
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Contents
 Models of Computation and Complexity  Building MathematicsBased Software Systems to Advance Science and Create Knowledge  On Negations in Boolean Networks  The Lovász Local Lemma and Satisfiability  KolmogorovComplexity Based on Infinite Computations  Pervasive Theory of Memory  Introducing Quasirandomness to Computer Science  Sorting and Searching  Reflections on Optimal and Nearly Optimal Binary Search Trees  Some Results for Elementary Operations  Maintaining Ideally Distributed Random Search Trees without Extra Space  A Pictorial Description of Cole’s Parallel Merge Sort  Selfmatched Patterns, Golomb Rulers, and Sequence Reconstruction  Combinatorial Optimization with Applications  Algorithms for Energy Saving  Minimizing Average FlowTime  Integer Linear Programming in Computational Biology  Via Detours to I/OEfficient Shortest Paths  Computational Geometry and Geometric Graphs  The Computational Geometry of Comparing Shapes  Finding Nearest Larger Neighbors  Multicore Implementations of Geometric Algorithms  The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension  On Map Labeling with Leaders  The Crossing Number of Graphs: Theory and Computation  Algorithm Engineering, Exactness, and Robustness  Algorithm Engineering – An Attempt at a Definition  Of What Use Is FloatingPoint Arithmetic in Computational Geometry?  Car or Public Transport—Two Worlds  Is the World Linear?  In Praise of Numerical Computation  Much Ado about Zero  Polynomial Precise Interval Analysis Revisited
 Dimensions
 unknown
 Edition
 1st ed. 2009.
 Extent
 1 online resource (IX, 439 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783642034565
 Level of compression
 uncompressed
 Media category
 computer
 Media type code
 c
 Other control number
 10.1007/9783642034565
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000784719
 (SSID)ssj0000317350
 (PQKBManifestationID)11253069
 (PQKBTitleCode)TC0000317350
 (PQKBWorkID)10293022
 (PQKB)11635157
 (DEHe213)9783642034565
 (MiAaPQ)EBC3064512
 (EXLCZ)991000000000784719
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
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.libraries.ou.edu/portal/EfficientAlgorithmsEssaysDedicatedtoKurt/NCvOpYRKFM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/EfficientAlgorithmsEssaysDedicatedtoKurt/NCvOpYRKFM/">Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, edited by Susanne Albers, Helmut Alt, Stefan Näher, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma 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 Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, edited by Susanne Albers, Helmut Alt, Stefan Näher, (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.libraries.ou.edu/portal/EfficientAlgorithmsEssaysDedicatedtoKurt/NCvOpYRKFM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/EfficientAlgorithmsEssaysDedicatedtoKurt/NCvOpYRKFM/">Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, edited by Susanne Albers, Helmut Alt, Stefan Näher, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>