default search action
Theoretical Computer Science, Volume 377
Volume 377, Numbers 1-3, May 2007
- Saeed Salehi
, Magnus Steinby:
Tree algebras and varieties of tree languages. 1-24
- Zhao Zhang, Hao Li:
Algorithms for long paths in graphs. 25-34 - Adi Avidor, Michael Langberg:
The multi-multiway cut problem. 35-42 - Jiro Uchida, Wei Chen, Koichi Wada:
Acknowledged broadcasting and gossiping in ad hoc radio networks. 43-54 - Leah Epstein, Yanir Kleiman, Jirí Sgall
Paging with connections: FIFO strikes again. 55-64 - Ana Marco, José-Javier Martínez:
Bernstein-Bezoutian matrices and curve implicitization. Theor. Comput. Sci. 377(1-3): 65-72 (2007) - 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 - Zhiyi Tan
Semi-online scheduling problems on two identical machines with inexact partial information. 110-125 - Verónica Becher
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 - Tien-Ching Lin, D. T. Lee:
Randomized algorithm for the sum selection problem. 151-156 - Hanna Uscka-Wehlou:
Digital lines with irrational slopes. 157-169 - Jung-Heum Park
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 - Fredrik Bengtsson, Jingsen Chen:
Ranking k maximum sums. 229-237 - Yung-Ling Lai, Chang-Sin Tian:
An extremal graph with given bandwidth. 238-242 - Alex Rogers, Rajdeep K. Dash, Sarvapali D. Ramchurn, Perukrishnen Vytelingum, Nicholas R. Jennings:
Coordinating team players within a noisy Iterated Prisoner's Dilemma tournament. Theor. Comput. Sci. 377(1-3): 243-259 (2007) - Michaël Rao:
MSOL partitioning problems on graphs of bounded treewidth and clique-width. 260-267
- Alexander N. Rybalov:
On the strongly generic undecidability of the Halting Problem. Theor. Comput. Sci. 377(1-3): 268-270 (2007) - Josep Díaz
MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. 271-276 - Sean Cleary
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 00:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: