Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=377
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tree algebras and varieties of tree languages
Saeed Salehi
,
Magnus Steinby
Theoretical Computer Science
377
(1-3), 2007, pp. 1-24
Algorithms for long paths in graphs
Zhao Zhang
,
Hao Li
Theoretical Computer Science
377
(1-3), 2007, pp. 25-34
The multi-multiway cut problem
Adi Avidor
,
Michael Langberg
Theoretical Computer Science
377
(1-3), 2007, pp. 35-42
Acknowledged broadcasting and gossiping in ad hoc radio networks
Jiro Uchida
,
Wei Chen
,
Koichi Wada
Theoretical Computer Science
377
(1-3), 2007, pp. 43-54
Paging with connections: FIFO strikes again
Leah Epstein
,
Yanir Kleiman
,
Jiȓí Sgall
,
Rob van Stee
Theoretical Computer Science
377
(1-3), 2007, pp. 55-64
Bernstein-Bezoutian matrices and curve implicitization
Ana Marco
,
José-Javier Martínez
Theoretical Computer Science
377
(1-3), 2007, pp. 65-72
Well quasi-orders generated by a word-shuffle rewriting
Flavio D'Alessandro
,
Gwénaël Richomme
,
Stefano Varricchio
Theoretical Computer Science
377
(1-3), 2007, pp. 73-92
Classes of representable disjoint
NP
-pairs
Olaf Beyersdorff
Theoretical Computer Science
377
(1-3), 2007, pp. 93-109
Semi-online scheduling problems on two identical machines with inexact partial information
Zhiyi Tan
,
Yong He
Theoretical Computer Science
377
(1-3), 2007, pp. 110-125
Turing's unpublished algorithm for normal numbers
Véronica Becher
,
Santiago Figueira
,
Rafael Picchi
Theoretical Computer Science
377
(1-3), 2007, pp. 126-138
Self-improved gaps almost everywhere for the agnostic approximation of monomials
Richard Nock
,
Frank Nielsen
Theoretical Computer Science
377
(1-3), 2007, pp. 139-150
Randomized algorithm for the sum selection problem
Tien-Ching Lin
,
D.T. Lee
Theoretical Computer Science
377
(1-3), 2007, pp. 151-156
Digital lines with irrational slopes
Hanna Uscka-Wehlou
Theoretical Computer Science
377
(1-3), 2007, pp. 157-169
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Jung-Heum Park
,
Hyeong-Seok Lim
,
Hee-Chul Kim
Theoretical Computer Science
377
(1-3), 2007, pp. 170-180
Faster and simpler approximation algorithms for mixed packing and covering problems
Florian Diedrich
,
Klaus Jansen
Theoretical Computer Science
377
(1-3), 2007, pp. 181-204
Defect particle kinematics in one-dimensional cellular automata
Marcus Pivato
Theoretical Computer Science
377
(1-3), 2007, pp. 205-228
Ranking
k
maximum sums
Fredrik Bengtsson
,
Jingsen Chen
Theoretical Computer Science
377
(1-3), 2007, pp. 229-237
An extremal graph with given bandwidth
Yung-Ling Lai
,
Chang-Sin Tian
Theoretical Computer Science
377
(1-3), 2007, pp. 238-242
Coordinating team players within a noisy Iterated Prisoner's Dilemma tournament
A. Rogers
,
R.K. Dash
,
S.D. Ramchurn
,
P. Vytelingum
,
N.R. Jennings
Theoretical Computer Science
377
(1-3), 2007, pp. 243-259
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Michaël Rao
Theoretical Computer Science
377
(1-3), 2007, pp. 260-267
On the strongly generic undecidability of the Halting Problem
Alexander Rybalov
Theoretical Computer Science
377
(1-3), 2007, pp. 268-270
MAX-CUT and MAX-BISECTION are
NP
-hard on unit disk graphs
Josep Díaz
,
Marcin Kamiński
Theoretical Computer Science
377
(1-3), 2007, pp. 271-276
Refined upper bounds for right-arm rotation distances
Sean Cleary
,
Fabrizio Luccio
,
Linda Pagli
Theoretical Computer Science
377
(1-3), 2007, pp. 277-281
Erratum to ''Polynomial-time identification of very simple grammars from positive data''
Takashi Yokomori
Theoretical Computer Science
377
(1-3), 2007, pp. 282-283