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=374
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast algorithms for computing Jones polynomials of certain links
M. Murakami
,
M. Hara
,
M. Yamamoto
,
S. Tani
Theoretical Computer Science
374
(1-3), 2007, pp. 1-24
About frequencies of letters in generalized automatic sequences
S. Nicolay
,
M. Rigo
Theoretical Computer Science
374
(1-3), 2007, pp. 25-40
k
-partitioning problems with partition matroid constraint
Biao Wu
,
Enyue Yao
Theoretical Computer Science
374
(1-3), 2007, pp. 41-48
On-line scheduling with delivery time on a single batch machine
Ji Tian
,
Ruyan Fu
,
Jinjiang Yuan
Theoretical Computer Science
374
(1-3), 2007, pp. 49-57
Intersecting periodic words
Jamie Simpson
Theoretical Computer Science
374
(1-3), 2007, pp. 58-65
Lattice grids and prisms are antimagic
Yongxi Cheng
Theoretical Computer Science
374
(1-3), 2007, pp. 66-73
Self-assembly of strings and languages
Erzsébet Csuhaj-Varjú
,
Ion Petre
,
György Vaszil
Theoretical Computer Science
374
(1-3), 2007, pp. 74-81
On the
(n, t)
-antipodal Gray codes
Gerard J. Chang
,
Sen-Peng Eu
,
Chung-Heng Yeh
Theoretical Computer Science
374
(1-3), 2007, pp. 82-90
The maximum agreement forest problem: Approximation algorithms and computational experiments
Estela M. Rodrigues
,
Marie-France Sagot
,
Yoshiko Wakabayashi
Theoretical Computer Science
374
(1-3), 2007, pp. 91-110
Reversal and transposition medians
Niklas Eriksen
Theoretical Computer Science
374
(1-3), 2007, pp. 111-126
Weighted asynchronous cellular automata
Dietrich Kuske
Theoretical Computer Science
374
(1-3), 2007, pp. 127-148
Approximating the maximum clique minor and some subgraph homeomorphism problems
Noga Alon
,
Andrzej Lingas
,
Martin Wahlen
Theoretical Computer Science
374
(1-3), 2007, pp. 149-158
Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
L.L. Liu
,
C.T. Ng
,
T.C.E. Cheng
Theoretical Computer Science
374
(1-3), 2007, pp. 159-169
An external-memory depth-first search algorithm for general grid graphs
Jun-Ho Her
,
R.S. Ramakrishna
Theoretical Computer Science
374
(1-3), 2007, pp. 170-180
Classifying regular languages by a split game
Qiqi Yan
Theoretical Computer Science
374
(1-3), 2007, pp. 181-190
Hardness of approximating the Minimum Solutions of Linear Diophantine Equations
Wenbin Chen
,
Jiangtao Meng
Theoretical Computer Science
374
(1-3), 2007, pp. 191-195
Online scheduling in a parallel batch processing system to minimize makespan using restarts
Ruyan Fu
,
Ji Tian
,
Jinjiang Yuan
,
Yixun Lin
Theoretical Computer Science
374
(1-3), 2007, pp. 196-202
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
R. Královic̑
,
P. Ruz̑ic̑ka
Theoretical Computer Science
374
(1-3), 2007, pp. 203-213
Characterizations of recognizable picture series
Ina Mäurer
Theoretical Computer Science
374
(1-3), 2007, pp. 214-228
Hybrid commitments and their applications to zero-knowledge proof systems
Dario Catalano
,
Ivan Visconti
Theoretical Computer Science
374
(1-3), 2007, pp. 229-260
Colored visual cryptography without color darkening
S. Cimato
,
R. De Prisco
,
A. De Santis
Theoretical Computer Science
374
(1-3), 2007, pp. 261-276
A new conceptual framework for analog computation
Jerzy Mycka
,
José Félix Costa
Theoretical Computer Science
374
(1-3), 2007, pp. 277-290