The Resource Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource)

Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource)

Label
Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I
Title
Automata, Languages, and Programming
Title remainder
42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I
Statement of responsibility
edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Summary
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
Member of
Dewey number
005.1
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • Br7lOL0-mZg
  • fvEMMRA1-Eg
  • t8A_OjrnX88
  • _dAq6sYVjz4
Image bit depth
0
Language note
English
LC call number
QA76.9.A43
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorName
  • Halldórsson, Magnús M.
  • Iwama, Kazuo.
  • Kobayashi, Naoki.
  • Speckmann, Bettina.
Series statement
Theoretical Computer Science and General Issues
Series volume
9134
http://library.link/vocab/subjectName
  • Computer software
  • Computer science
  • Computer Communication Networks
  • Information storage and retrieval systems
  • Computational complexity
  • Algorithm Analysis and Problem Complexity
  • Computation by Abstract Devices
  • Computer Communication Networks
  • Information Storage and Retrieval
  • Information Systems Applications (incl. Internet)
  • Discrete Mathematics in Computer Science
Label
Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
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 Population Protocols -- Scheduling Bidirectional Traffic on a Path -- On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace -- On Planar Boolean CSP -- On Temporal Graph Exploration -- Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation -- A (1+e)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs -- Lower Bounds for the Graph Homomorphism Problem -- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree -- Relative Discrepancy Does not Separate Information and Communication Complexity -- A Galois Connection for Valued Constraint Languages of Infinite Size -- Approximately Counting H Colourings Is #BIS-Hard -- Taylor Polynomial Estimator for Estimating Frequency Moments -- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria -- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets -- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search -- Optimal Encodings for Range Top-k, Selection, and Min-Max -- 2-Vertex Connectivity in Directed Graphs -- Ground State Connectivity of Local Hamiltonians -- Uniform Kernelization Complexity of Hitting Forbidden Minors -- Counting Homomorphisms to Square-Free Graphs, Modulo 2 -- Approximately Counting Locally-Optimal Structures -- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Extended Abstract) -- Fast Algorithms for Diameter-Optimally Augmenting Paths -- Hollow Heaps -- Linear-Time List Recovery of High-Rate Expander Codes -- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time -- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs -- Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities -- Local Reductions -- Query Complexity in Expectation -- Near-Linear Query Complexity for Graph Inference -- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set -- Finding a Path in Group-Labeled Graphs with Two Labels Forbidden -- Lower Bounds for Sums of Powers of Low Degree Univariates -- Approximating CSPs Using LP Relaxation -- Comparator Circuits over Finite Bounded Posets -- Algebraic Properties of Valued Constraint Satisfaction Problem -- Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic -- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy -- Replacing Mark Bits with Randomness in Fibonacci Heaps -- A PTAS for the Weighted Unit Disk Cover Problem -- Approximating the Expected Values for Combinatorial Optimization Problems Over Stochastic Points -- Deterministic Truncation of Linear Matroids -- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set -- An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains -- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity -- A (2+e)-Approximation Algorithm for the Storage Allocation Problem -- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas -- Computing the Fréchet Distance Between Polygons with Holes -- An Improved Private Mechanism for Small Databases -- Binary Pattern Tile Set Synthesis Is NP-Hard -- Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity -- Condensed Unpredictability -- Sherali-Adams Relaxations for Valued CSPs -- Two-Sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm -- The Simultaneous Communication of Disjointness with Applications to Data Streams -- An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
Dimensions
unknown
Edition
1st ed. 2015.
Extent
1 online resource (XXXI, 1111 p. 78 illus.)
File format
multiple file formats
Form of item
online
Isbn
9783662476727
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-3-662-47672-7
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)3710000000437005
  • (SSID)ssj0001558444
  • (PQKBManifestationID)16182672
  • (PQKBTitleCode)TC0001558444
  • (PQKBWorkID)14819271
  • (PQKB)11216220
  • (DE-He213)978-3-662-47672-7
  • (EXLCZ)993710000000437005
Label
Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
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 Population Protocols -- Scheduling Bidirectional Traffic on a Path -- On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace -- On Planar Boolean CSP -- On Temporal Graph Exploration -- Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation -- A (1+e)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs -- Lower Bounds for the Graph Homomorphism Problem -- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree -- Relative Discrepancy Does not Separate Information and Communication Complexity -- A Galois Connection for Valued Constraint Languages of Infinite Size -- Approximately Counting H Colourings Is #BIS-Hard -- Taylor Polynomial Estimator for Estimating Frequency Moments -- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria -- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets -- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search -- Optimal Encodings for Range Top-k, Selection, and Min-Max -- 2-Vertex Connectivity in Directed Graphs -- Ground State Connectivity of Local Hamiltonians -- Uniform Kernelization Complexity of Hitting Forbidden Minors -- Counting Homomorphisms to Square-Free Graphs, Modulo 2 -- Approximately Counting Locally-Optimal Structures -- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Extended Abstract) -- Fast Algorithms for Diameter-Optimally Augmenting Paths -- Hollow Heaps -- Linear-Time List Recovery of High-Rate Expander Codes -- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time -- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs -- Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities -- Local Reductions -- Query Complexity in Expectation -- Near-Linear Query Complexity for Graph Inference -- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set -- Finding a Path in Group-Labeled Graphs with Two Labels Forbidden -- Lower Bounds for Sums of Powers of Low Degree Univariates -- Approximating CSPs Using LP Relaxation -- Comparator Circuits over Finite Bounded Posets -- Algebraic Properties of Valued Constraint Satisfaction Problem -- Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic -- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy -- Replacing Mark Bits with Randomness in Fibonacci Heaps -- A PTAS for the Weighted Unit Disk Cover Problem -- Approximating the Expected Values for Combinatorial Optimization Problems Over Stochastic Points -- Deterministic Truncation of Linear Matroids -- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set -- An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains -- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity -- A (2+e)-Approximation Algorithm for the Storage Allocation Problem -- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas -- Computing the Fréchet Distance Between Polygons with Holes -- An Improved Private Mechanism for Small Databases -- Binary Pattern Tile Set Synthesis Is NP-Hard -- Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity -- Condensed Unpredictability -- Sherali-Adams Relaxations for Valued CSPs -- Two-Sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm -- The Simultaneous Communication of Disjointness with Applications to Data Streams -- An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
Dimensions
unknown
Edition
1st ed. 2015.
Extent
1 online resource (XXXI, 1111 p. 78 illus.)
File format
multiple file formats
Form of item
online
Isbn
9783662476727
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-3-662-47672-7
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)3710000000437005
  • (SSID)ssj0001558444
  • (PQKBManifestationID)16182672
  • (PQKBTitleCode)TC0001558444
  • (PQKBWorkID)14819271
  • (PQKB)11216220
  • (DE-He213)978-3-662-47672-7
  • (EXLCZ)993710000000437005

Library Locations

  • Albert D. Cohen Management LibraryBorrow it
    181 Freedman Crescent, Winnipeg, MB, R3T 5V4, CA
    49.807878 -97.129961
  • Architecture/Fine Arts LibraryBorrow it
    84 Curry Place, Winnipeg, MB, CA
    49.807716 -97.136226
  • Archives and Special CollectionsBorrow it
    25 Chancellors Circle (Elizabeth Dafoe Library), Room 330, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Bibliothèque Alfred-Monnin (Université de Saint-Boniface)Borrow it
    200, avenue de la Cathédrale, Local 2110, Winnipeg, MB, R2H 0H7, CA
    49.888861 -97.119735
  • Bill Larson Library (Grace Hospital)Borrow it
    300 Booth Drive, G-227, Winnipeg, MB, R3J 3M7, CA
    49.882400 -97.276436
  • Carolyn Sifton - Helene Fuld Library (St. Boniface General Hospital)Borrow it
    409 Tache Avenue, Winnipeg, MB, R2H 2A6, CA
    49.883388 -97.126050
  • Concordia Hospital LibraryBorrow it
    1095 Concordia Avenue, Winnipeg, MB, R2K 3S8, CA
    49.913252 -97.064683
  • Donald W. Craik Engineering LibraryBorrow it
    75B Chancellors Circle (Engineering Building E3), Room 361, Winnipeg, MB, R3T 2N2, CA
    49.809053 -97.133292
  • E.K. Williams Law LibraryBorrow it
    224 Dysart Road, Winnipeg, MB, R3T 5V4, CA
    49.811829 -97.131017
  • Eckhardt-Gramatté Music LibraryBorrow it
    136 Dafoe Road (Taché Arts Complex), Room 257, Winnipeg, MB, R3T 2N2, CA
    49.807964 -97.132222
  • Elizabeth Dafoe LibraryBorrow it
    25 Chancellors Circle, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Fr. H. Drake Library (St. Paul's College)Borrow it
    70 Dysart Road, Winnipeg, MB, R3T 2M6, CA
    49.810605 -97.138184
  • J.W. Crane Memorial Library (Deer Lodge Centre)Borrow it
    2109 Portage Avenue, Winnipeg, MB, R3J 0L3, CA
    49.878000 -97.235520
  • Libraries Annex (not open to the public; please see web page for details)Borrow it
    25 Chancellors Circle (in the Elizabeth Dafoe Library), Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Neil John Maclean Health Sciences LibraryBorrow it
    727 McDermot Avenue (Brodie Centre), 200 Level, Winnipeg, MB, R3E 3P5, CA
    49.903563 -97.160554
  • Sciences and Technology LibraryBorrow it
    186 Dysart Road, Winnipeg, MB, R3T 2M8, CA
    49.811526 -97.133257
  • Seven Oaks General Hospital LibraryBorrow it
    2300 McPhillips Street, Winnipeg, MB, R2V 3M3, CA
    49.955177 -97.148865
  • Sister St. Odilon Library (Misericordia Health Centre)Borrow it
    99 Cornish Avenue, Winnipeg, MB, R3C 1A2, CA
    49.879592 -97.160425
  • St. John's College LibraryBorrow it
    92 Dysart Road, Winnipeg, MB, R3T 2M5, CA
    49.811242 -97.137156
  • Victoria General Hospital LibraryBorrow it
    2340 Pembina Highway, Winnipeg, MB, R3T 2E8, CA
    49.806755 -97.152739
  • William R Newman Library (Agriculture)Borrow it
    66 Dafoe Road, Winnipeg, MB, R3T 2R3, CA
    49.806936 -97.135525
Processing Feedback ...