Automata, Languages, and Programming
42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I
AvMagnús M. Halldórsson,Kazuo Iwama
Del i serien Lecture Notes in Computer Science
1 127 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Fler format och utgåvor
Beskrivning
Produktinformation
- Utgivningsdatum:2015-07-06
- Mått:155 x 235 x 61 mm
- Vikt:1 691 g
- Format:Häftad
- Språk:Engelska
- Serie:Lecture Notes in Computer Science
- Antal sidor:1 111
- Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN:9783662476710
Utforska kategorier
Innehållsförteckning
- 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.
Mer från samma författare
Structural Information and Communication Complexity
Guy Even, Magnús M. Halldórsson
Häftad, 2012
549 kr
Mer från samma serie
Agent Mediated Electronic Commerce II
Alexandros Moukas, Carles Sierra, Fredrik Ygge
Häftad, 2000
567 kr
Multiobjective Optimization
Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński
Häftad, 2008
551 kr
Knowledge Graphs
Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang
Häftad, 2026
926 kr
Electronic Government
Ida Lindgren, Marijn Janssen, Habin Lee, Andrea Polini, Manuel Pedro Rodríguez Bolívar, Hans Jochen Scholl, Efthimios Tambouris
Häftad, 2019
822 kr
Chromatic Visions
Irina Mihaela Ciortan, Daniele Ferdani, Jon Yngve Hardeberg, Sophia Sotiropoulou, Manuele Veggi
Häftad, 2026
455 kr
Data Quality and Trust in Big Data
Hakim Hacid, Quan Z. Sheng, Tetsuya Yoshida, Azadeh Sarkheyli, Rui Zhou
Häftad, 2019
567 kr
Energy Informatics
Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin
Häftad, 2025
832 kr
Biomimetic and Biohybrid Systems
Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott
Häftad, 2025
1 010 kr
Du kanske också är intresserad av
Automata, Languages, and Programming
Bettina Speckmann, Naoki Kobayashi, Kazuo Iwama, Magnus M. Halldorsson
1 459 kr
Automata, Languages, and Programming
Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
Häftad, 2015
567 kr
Automata, Languages, and Programming
Bettina Speckmann, Naoki Kobayashi, Kazuo Iwama, Magnus M. Halldorsson
718 kr
Theory of Quantum Computation, Communication, and Cryptography
Mio Murao, Yasuhito Kawano, Kazuo Iwama
652 kr
Theory of Quantum Computation, Communication, and Cryptography
Kazuo Iwama, Yasuhito Kawano, Mio Murao
Häftad, 2013
517 kr
Algorithms and Computation
Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
Häftad, 1992
567 kr