Theory and applications of models of computation : 7th annual conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010 ; proceedings / Jan Kratochvil [and others] (eds.).
Annotation
Saved in:
| Corporate Author: | |
|---|---|
| Other Authors: | |
| Format: | Ebook |
| Language: | English |
| Published: |
Berlin :
Springer,
[2010]
|
| Series: | Lecture notes in computer science ;
6108. |
| Subjects: | |
| Online Access: | Springer eBooks |
Table of Contents:
- Plenary talks. New research directions in the information age / John E. Hopcroft
- The laplacian paradigm : emerging algorithms for massive graphs / Shang-Hua Teng
- Special sessions. Proof complexity of non-classical logics / Olaf Beyersdorff
- Optimal acceptors and optimal proof systems / Edward A. Hirsch
- The complexity of geometric problems in high dimension / Christian Knauer
- Different approaches to proof systems / Olaf Beyersdorff and Sebastian Müller
- Algebraic proofs over noncommutative formulas / Iddo Tzameret
- Contributed papers. Nonlocal quantum XOR games for large number of players / Andris Ambainis, Dmitry Kravchenko, Nikolajs Nahimovs, and Alexander Rivosh
- Nontriviality for exponential time w.r.t. weak reducibilities / Klaus Ambos-Spies and Timur Bakibayev
- Streaming algorithms for some problems in log-space / Ajesh Babu, Nutan Limaye, and Girish Varma
- Temperature aware online scheduling with a low cooling factor / Martin Birks and Stanley P.Y. Fung
- On solution concepts for matching games / Péter Biró, Walter Kern, and Daniël Paulusma
- Binary de Bruijn partial words with one hole / Francine Blanchet-Sadri, Jarett Schwartz, Slater Stich, and Benjamin J. Wyatt
- Complexity invariance of real interpretations / Guillaume Bonfante and Florian Deloup
- Pivot and loop complementation on graphs and set systems / Robert Brijder and Hendrik Jan Hoogeboom
- Revisiting the minimum breakpoint linearization problem / Laurent Bulteau, Guillaume Fertin, and Irena Rusu
- An O(n²)-time algorithm for the minimal interval completion problem / Christophe Crespelle and Ioan Todinca
- Centdian computation for sensor networks / Boaz Ben-Moshe, Amit Dvir, Michael Segal, and Arie Tamir
- Twisted Jacobi intersections curves / Rongquan Feng, Menglong Nie, and Hongfeng Wu
- L(2, 1, 1)-labeling is NP-complete for trees / Petr A. Golovach, Bernard Lidický, and Daniël Paulusma
- Complexity of paths, trails and circuits in arc-colored digraphs / Laurent Gourvès, Adria Lyra, Carlos Martinhon, and Jérôme Monnot
- The max k-cut game and its strong equilibria / Laurent Gourvès and Jérôme Monnot
- Kernel and fast algorithm for dense triplet inconsistency / Sylvain Guillemot and Matthias Mnich
- Incremental list coloring of graphs, parameterized by conservation / Sepp Hartung and Rolf Niedermeier
- Schnyder greedy routing algorithm / Xin He and Huaming Zhang
- Exploiting restricted linear structure to cope with the hardness of clique-width / Pinar Heggernes, Daniel Meister, and Udi Rotics
- A note on the testability of Ramsey's class / Charles Jordan and Thomas Zeugmann
- Deterministic polynomial-time algorithms for designing short DNA words / Ming-Yang Kao, Henry C.M. Leung, He Sun, and Yong Zhang
- Hamiltonian cycles in subcubic graphs : what makes the problem difficult / Nicholas Korpelainen, Vadim V. Lozin, and Alexander Tiskin
- A dichotomy for k-regular graphs with {0, 1}-vertex assignments and real edge functions / Jin-Yi Cai and Michael Kowalczyk
- Graph sharing games : complexity and connectivity / Josef Cibulka, Jan Kynčl, Viola Mészáros, Rudolf Stolař, and Pavel Valtr
- A visual model of computation / Ian Mackie
- An automata-theoretic characterization of the Chomsky-Hierarchy / Benedek Nagy
- Maximum independent set in graphs of average degree at most three in O(1.08537n) / Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, and Johan M.M. van Rooij
- Simultaneity in event structures / G. Michele Pinna and Andrea Saba
- Safety verification of non-linear hybrid systems is quasi-semidecidable / Stefan Ratschan
- Closed rectangle-of-influence drawings for irreducible triangulations / Sadish Sadasivam and Huaming Zhang
- Recovering social networks from contagion information / Sucheta Soundarajan and John E. Hopcroft
- Two-layer planarization parameterized by feedback edge set / Johannes Uhlmann and Mathias Weller
- A categorical view of timed weak bisimulation / Natalya Gribovskaya and Irina Virbitskaite
- Community structure in large complex networks / Liaoruo Wang and John E. Hopcroft
- Generating internally triconnected rooted plane graphs / Bingbing Zhuang and Hiroshi Nagamochi.