Theory and Applications of Models of Computation

7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings
Herausgegeben:Kratochvil, Jan; Li, Angsheng; Fiala, Jiri; Kolman, Petr

• Broschiertes Buch

Produktbeschreibung

The 7th Annual Conference on Theory and Applications of Models of Compu- tion was held during June 7 11, 2010 in Prague. After six successful conferences held in 2004 2009 in China (Beijing, Kunming, Beijing, Shanghai, Xi an, and ChangSha) TAMC left Asia for the ?rst time, aiming at the heart of Europe. Changingthegeographicallocationdidnotbringanychangestothescopeofthe conference. Its three main themes continued to be Computability, Complexity, and Algorithms. The conference aims to bring together researchersfrom all over the world with interests in theoretical computer science, algorithmic mathem- ics,andapplicationsto thephysicalsciences. Thisyearwesawmoreparticipants from Europe and the Americas, but we were very happy that we could also w- come to Prague traditional participants from Asia (China, Japan, and India) to continue enhancing the collaboration among the theoretical computer science communities of these continents. After hard work the Program Committee decided to accept 35 papers out of 76 submitted to TAMC 2010. Each submission was reviewed by at least three, Program Committee members. All actions of the Program Committee were - ordinated via ?awlessly and e?ciently running EasyChair. We congratulate the authors of accepted contributions and thank all authors who submitted their papers. They all contributed to a successful event. We extend our thanks to the distinguished plenary speakers who accepted our invitation to deliver plenary talks John Hopcroft from Cornell University and Shang-Hua Teng from University of Southern California. Their talks New Research Directions in the Information Age and The Laplacian Paradigm: Emerging Algorithms for Massive Graph were highlights of the conference.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Theoretical Computer Science and General Issues 6108
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 80015794, 978-3-642-13561-3
• 2010
• Seitenzahl: 496
• Erscheinungstermin: 20. Mai 2010
• Englisch
• Abmessung: 235mm x 155mm x 27mm
• Gewicht: 744g
• ISBN-13: 9783642135613
• ISBN-10: 3642135617
• Artikelnr.: 29841487

Inhaltsangabe

Plenary Talks.- New Research Directions in the Information Age.- The Laplacian Paradigm: Emerging Algorithms for Massive Graphs.- Special Sessions.- Proof Complexity of Non-classical Logics.- Optimal Acceptors and Optimal Proof Systems.- The Complexity of Geometric Problems in High Dimension.- Different Approaches to Proof Systems.- Algebraic Proofs over Noncommutative Formulas.- Contributed Papers.- Nonlocal Quantum XOR Games for Large Number of Players.- Nontriviality for Exponential Time w.r.t. Weak Reducibilities.- Streaming Algorithms for Some Problems in Log-Space.- Temperature Aware Online Scheduling with a Low Cooling Factor.- On Solution Concepts for Matching Games.- Binary De Bruijn Partial Words with One Hole.- Complexity Invariance of Real Interpretations.- Pivot and Loop Complementation on Graphs and Set Systems.- Revisiting the Minimum Breakpoint Linearization Problem.- An -time Algorithm for the Minimal Interval Completion Problem.- Centdian Computation for Sensor Networks.- Twisted Jacobi Intersections Curves.- L(2,1,1)-Labeling Is NP-Complete for Trees.- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.- The Max k-Cut Game and Its Strong Equilibria.- Kernel and Fast Algorithm for Dense Triplet Inconsistency.- Incremental List Coloring of Graphs, Parameterized by Conservation.- Schnyder Greedy Routing Algorithm.- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width.- A Note on the Testability of Ramsey's Class.- Deterministic Polynomial-Time Algorithms for Designing Short DNA Words.- Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult.- A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions.- Graph Sharing Games: Complexity and Connectivity.- A VisualModel of Computation.- An Automata-Theoretic Characterization of the Chomsky-Hierarchy.- Maximum Independent Set in Graphs of Average Degree at Most Three in .- Simultaneity in Event Structures.- Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable.- Closed Rectangle-of-Influence Drawings for Irreducible Triangulations.- Recovering Social Networks from Contagion Information.- Two-Layer Planarization Parameterized by Feedback Edge Set.- A Categorical View of Timed Weak Bisimulation.- Community Structure in Large Complex Networks.- Generating Internally Triconnected Rooted Plane Graphs.