Theoretical Computer Science, Volume 377
Volume 377, Numbers 1-3, May 2007
- Jiro Uchida, Wei Chen, Koichi Wada: Acknowledged broadcasting and gossiping in ad hoc radio networks. 43-54
- Leah Epstein, Yanir Kleiman, Jiri Sgall, Rob van Stee: Paging with connections: FIFO strikes again. 55-64
- Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio: Well quasi-orders generated by a word-shuffle rewriting. 73-92
- Olaf Beyersdorff: Classes of representable disjoint NP-pairs. 93-109
- Verónica Becher, Santiago Figueira, Rafael Picchi: Turing's unpublished algorithm for normal numbers. 126-138
- Richard Nock, Frank Nielsen: Self-improved gaps almost everywhere for the agnostic approximation of monomials. 139-150
- Hanna Uscka-Wehlou: Digital lines with irrational slopes. 157-169
- Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim: Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements. 170-180
- Florian Diedrich, Klaus Jansen: Faster and simpler approximation algorithms for mixed packing and covering problems. 181-204
- Marcus Pivato: Defect particle kinematics in one-dimensional cellular automata. 205-228
- Alex Rogers, Rajdeep K. Dash, Sarvapali D. Ramchurn, Perukrishnen Vytelingum, Nicholas R. Jennings: Coordinating team players within a noisy Iterated Prisoner's Dilemma tournament. 243-259
- Michaël Rao: MSOL partitioning problems on graphs of bounded treewidth and clique-width. 260-267
- Alexander Rybalov: On the strongly generic undecidability of the Halting Problem. 268-270
- Sean Cleary, Fabrizio Luccio, Linda Pagli: Refined upper bounds for right-arm rotation distances. 277-281
- Takashi Yokomori: Erratum to "Polynomial-time identification of very simple grammars from positive data" [Theoret. Comput. Science 298 (2003) 179-206]. 282-283
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team