Cantitate/Preț
Produs
Total produse
Vezi coșul
Automata, Languages and Programming: 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I de Susanne Albers

Automata, Languages and Programming: 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I: Lecture Notes in Computer Science, cartea 5555

Editat de Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas
en Limba Engleză Paperback – 24 iun 2009
ICALP 2009, the 36th edition of the International Colloquium on Automata, Languages and Programming, was held on the island of Rhodes, July 6–10, 2009. ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS) which ?rst took place in 1972. This year, the ICALP program consisted of the established track A (focusing on algorithms, complexity and games) and track B (focusing on logic, automata, semantics and theory of programming), and of the recently introduced track C (in 2009 focusing on foundations of networked computation). In response to the call for papers, the Program Committee received 370 s- missions: 223 for track A, 84 for track B and 63 for track C. Out of these, 108 papers were selected for inclusion in the scienti?c program: 62 papers for track A, 24 for track B and 22 for track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many dese- ing papers could not be selected. ICALP 2009 consisted of ?ve invited lectures and the contributed papers.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 63644 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 24 iun 2009 63644 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 24 iun 2009 64376 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 64376 lei

Preț vechi: 80469 lei
-20% Nou

Puncte Express: 966
Preț estimativ în valută:
12321€ • 12998$ • 10268£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642029264
ISBN-10: 3642029264
Pagini: 789
Ilustrații: XXII, 789 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 1.07 kg
Ediția:2009
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ă

Research

Cuprins

Invited Lectures.- Assigning Papers to Referees.- Algorithmic Game Theory: A Snapshot.- Contributed Papers.- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs.- Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems.- Sorting and Selection with Imprecise Comparisons.- Fast FAST.- Bounds on the Size of Small Depth Circuits for Approximating Majority.- Counting Subgraphs via Homomorphisms.- External Sampling.- Functional Monitoring without Monotonicity.- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results.- Towards a Study of Low-Complexity Graphs.- Decidability of Conjugacy of Tree-Shifts of Finite Type.- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule.- Competitive Analysis of Aggregate Max in Windowed Streaming.- Faster Regular Expression Matching.- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem.- Unconditional Lower Bounds against Advice.- Approximating Decision Trees with Multiway Branches.- Annotations in Data Streams.- The Tile Complexity of Linear Assemblies.- A Graph Reduction Step Preserving Element-Connectivity and Applications.- Approximating Matches Made in Heaven.- Strong and Pareto Price of Anarchy in Congestion Games.- A Better Algorithm for Random k-SAT.- Exact and Approximate Bandwidth.- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs.- On Cartesian Trees and Range Minimum Queries.- Applications of a Splitting Trick.- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness.- Incompressibility through Colors and IDs.- Partition Arguments in Multiparty Communication Complexity.- High Complexity Tilings with SparseErrors.- Tight Bounds for the Cover Time of Multiple Random Walks.- Online Computation with Advice.- Dynamic Succinct Ordered Trees.- Universal Succinct Representations of Trees?.- Distortion Is Fixed Parameter Tractable.- Towards Optimal Range Medians.- B-Treaps: A Uniquely Represented Alternative to B-Trees.- Testing Fourier Dimensionality and Sparsity.- Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams.- Wireless Communication Is in APX.- The Ehrenfeucht-Silberger Problem.- Applications of Effective Probability Theory to Martin-Löf Randomness.- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables.- Popular Mixed Matchings.- Factoring Groups Efficiently.- On Finding Dense Subgraphs.- Learning Halfspaces with Malicious Noise.- General Scheme for Perfect Quantum Network Coding with Free Classical Communication.- Greedy -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.- Limits and Applications of Group Algebras for Parameterized Problems.- Sleep with Guilt and Work Faster to Minimize Flow Plus Energy.- Improved Bounds for Flow Shop Scheduling.- A 3/2-Approximation Algorithm for General Stable Marriage.- Limiting Negations in Formulas.- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems.- Superhighness and Strong Jump Traceability.- Amortized Communication Complexity of Distributions.- The Number of Symbol Comparisons in QuickSort and QuickSelect.- Computing the Girth of a Planar Graph in O(n logn) Time.- Elimination Graphs.

Textul de pe ultima copertă

The two-volume set LNCS 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Greece, in July 2009.
The 126 revised full papers (62 papers for track A, 24 for track B, and 22 for track C) presented were carefully reviewed and selected from a total of 370 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games; on logic, semantics, theory of programming; as well as on foundations of networked computation: models, algorithms and information management.
LNCS 5555 contains 62 contributions of track A selected from 223 submissions as well as 2 invited lectures.
This two-volume set lauches the new subline of Lecture Notes in Computer Science, entitled LNCS Advanced Research in Computing and Software Science (ARCoSS).