Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I: Lecture Notes in Computer Science, cartea 9134
Editat de Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmannen Limba Engleză Paperback – 6 iul 2015
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (2) | 341.79 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – iul 2015 | 341.79 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 6 iul 2015 | 661.21 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 661.21 lei
Preț vechi: 826.51 lei
-20% Nou
Puncte Express: 992
Preț estimativ în valută:
126.54€ • 133.48$ • 105.76£
126.54€ • 133.48$ • 105.76£
Carte tipărită la comandă
Livrare economică 31 decembrie 24 - 14 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662476710
ISBN-10: 3662476711
Pagini: 1073
Ilustrații: XXXI, 1111 p. 78 illus.
Dimensiuni: 155 x 235 x 63 mm
Greutate: 1.57 kg
Ediția:2015
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662476711
Pagini: 1073
Ilustrații: XXXI, 1111 p. 78 illus.
Dimensiuni: 155 x 235 x 63 mm
Greutate: 1.57 kg
Ediția:2015
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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-FreeStructures 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.