rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Space-Efficient Data Structures, Streams, and Algorithms
    sub title: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday
  name:
    name part: Brodnik, Andrej.
    role:
      role term: editor.
  name:
    name part: López-Ortiz, Alejandro.
    role:
      role term: editor.
  name:
    name part: Raman, Venkatesh.
    role:
      role term: editor.
  name:
    name part: Viola, Alfredo.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2013
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XXVIII, 363 p. 58 illus. online resource.
  abstract: This Festschrift volume, published in honour of J. Ian Munro, contains contributions written by some of his colleagues, former students, and friends. In celebration of his 66th birthday the colloquium "Conference on Space Efficient Data Structures, Streams and Algorithms" was held in Waterloo, ON, Canada, during August 15-16, 2013. The articles presented herein cover some of the main topics of Ian's research interests. Together they give a good overall perspective of the last 40 years of research in algorithms and data structures.
  table of contents: The Query Complexity of Finding a Hidden Permutation -- Bounds for Scheduling Jobs on Grid Processors -- Quake Heaps: A Simple Alternative to Fibonacci Heaps -- Variations on Instant Insanity -- A Simple Linear-Space Data Structure for Constant-Time Range -- Closing a Long-Standing Complexity Gap for Selection: V3(42) = 50 -- Frugal Streaming for Estimating Quantiles -- From Time to Space: Fast Algorithms That Yield Small and Fast Data -- Computing (and life) Is all About Tradeoffs: A Small Sample of Some Computational Tradeoffs -- A History of Distribution-Sensitive Data Structures -- A Survey on Priority Queues -- On Generalized Comparison-Based Sorting Problems -- A Survey of the Game “Lights Out!” -- Random Access to High-Order Entropy Compressed Text -- Succinct and Implicit Data Structures for Computational Geometry -- In Pursuit of the Dynamic Optimality Conjecture -- A Survey of Algorithms and Models for List Update -- Orthogonal Range Searching for Text Indexing -- A Survey of Data Structures in the Bitprobe Model -- Succinct Representations of Ordinal Trees -- Array Range Queries -- Indexes for Document Retrieval with Relevance.
  note: edited by Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Algorithms
  subject:
    topic: Numerical analysis
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer graphics
  subject:
    topic: Computer Science
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Data Structures
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Computer Graphics
  subject:
    topic: Numeric Computing
  subject:
    topic: Computer Communication Networks
  classification: QA76.9.A43
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 8066
  identifier: 9783642402739
  identifier: http://dx.doi.org/10.1007/978-3-642-40273-9
  record info:
    record creation date: 130810
    record change date: 20151031051033.0
    record identifier: 978-3-642-40273-9