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: Automata, Languages, and Programming
    sub title: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I
  name:
    name part: Halldórsson, Magnús M.
    role:
      role term: editor.
  name:
    name part: Iwama, Kazuo.
    role:
      role term: editor.
  name:
    name part: Kobayashi, Naoki.
    role:
      role term: editor.
  name:
    name part: Speckmann, Bettina.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2015
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XXXI, 1111 p. 78 illus. online resource.
  abstract: The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The 143 revised full papers presented were carefully reviewed and selected from 507 submissions. The papers are organized in the following three tracks: algorithms, complexity, and games; logic, semantics, automata, and theory of programming; and foundations of networked computation: models, algorithms, and information management.
  table of contents: Statistical Randomized Encodings: A Complexity Theoretic View -- Tighter Fourier Transform Lower Bounds -- Quantifying Competitiveness in Paging with Locality of Reference -- Approximation Algorithms for Computing Maximin Share Allocations -- Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare -- Batched Point Location in SINR Diagrams via Algebraic Tools -- On the Randomized Competitive Ratio of Reordering Buffer Management with Non-uniform Costs -- Serving in the Dark Should Be Done Non-uniformly -- Finding the Median (Obliviously) with Bounded Space -- Approximation Algorithms for Min-Sum k-Clustering -- Solving Linear Programming with Constraints Unknown -- Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources -- Limitations of Algebraic Approaches to Graph Isomorphism Testing -- Fully Dynamic Matching in Bipartite Graphs -- Feasible Interpolation for QBF Resolution Calculi -- Simultaneous Approximation of Constraint Satisfaction Problems -- Design of Dynamic Algorithms via Primal-Dual Method -- What Percentage of Programs Halt? -- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems -- Spotting Trees with Few Leaves -- Constraint Satisfaction Problems over the Integers with Successor -- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits -- Algorithms and Complexity for Turaev-Viro Invariants -- Big Data on the Rise? – Testing Monotonicity of Distributions -- Unit Interval Editing Is Fixed-Parameter Tractable -- Streaming Algorithms for Submodular Function Maximization -- Multilinear Pseudorandom Functions -- Zero-Fixing Extractors for Sub-Logarithmic Entropy -- Interactive Proofs with Approximately Commuting Provers -- Popular Matchings with Two-Sided Preferences and One-Sided Ties -- Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity -- On Convergence and Threshold Properties of Discrete Lotka-Volterra Po…
  note: edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Information storage and retrieval
  subject:
    topic: Computer Science
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Computation by Abstract Devices
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Information Storage and Retrieval
  subject:
    topic: Information Systems Applications (incl. Internet)
  subject:
    topic: Discrete Mathematics in Computer Science
  classification: QA76.9.A43
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 9134
  identifier: 9783662476727
  identifier: http://dx.doi.org/10.1007/978-3-662-47672-7
  record info:
    record creation date: 150619
    record change date: 20151204175446.0
    record identifier: 978-3-662-47672-7