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
[2]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=410
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation of the
k
-batch consolidation problem
Sung-Pil Hong
,
Myoung-Ju Park
,
Soo Y. Chang
Theoretical Computer Science
410
(8-10), 2009, pp. 963-967
Testing avoidability on sets of partial words is hard
F. Blanchet-Sadri
,
Raphaël M. Jungers
,
Justin Palumbo
Theoretical Computer Science
410
(8-10), 2009, pp. 968-972
On the simplification of infinite morphic words
Juha Honkala
Theoretical Computer Science
410
(8-10), 2009, pp. 997-1000
How liquid is biological signalling?
Vincent Danos
,
Linus J. Schumacher
Theoretical Computer Science
410
(11), 2009, pp. 1003-1012
Approximation algorithm for maximum edge coloring
Wangsen Feng
,
Li'ang Zhang
,
Hanpin Wang
Theoretical Computer Science
410
(11), 2009, pp. 1022-1029
Improving the average delay of sorting
Andreas Jakoby
,
Maciej Liśkiewicz
,
Rüdiger Reischuk
,
Christian Schindelhauer
Theoretical Computer Science
410
(11), 2009, pp. 1030-1041
Drawing slicing graphs with face areas
Akifumi Kawaguchi
,
Hiroshi Nagamochi
Theoretical Computer Science
410
(11), 2009, pp. 1061-1072
Copower functors
H. Peter Gumm
Theoretical Computer Science
410
(12-13), 2009, pp. 1129-1142
The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete
Simone Bova
,
Franco Montagna
Theoretical Computer Science
410
(12-13), 2009, pp. 1143-1158
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
Murdoch J. Gabbay
Theoretical Computer Science
410
(12-13), 2009, pp. 1159-1189
Meadows and the equational specification of division
J.A. Bergstra
,
Y. Hirshfeld
,
J.V. Tucker
Theoretical Computer Science
410
(12-13), 2009, pp. 1261-1271
Probabilistic Mobile Ambients
Marta Kwiatkowska
,
Gethin Norman
,
David Parker
,
Maria Grazia Vigliotti
Theoretical Computer Science
410
(12-13), 2009, pp. 1272-1303
Upper bounds and algorithms for parallel knock-out numbers
Hajo Broersma
,
Matthew Johnson
,
Daniël Paulusma
Theoretical Computer Science
410
(14), 2009, pp. 1319-1327
From adaptive renaming to set agreement
Eli Gafni
,
Achour Mostéfaoui
,
Michel Raynal
,
Corentin Travers
Theoretical Computer Science
410
(14), 2009, pp. 1328-1335
Data aggregation in sensor networks: Balancing communication and delay costs
Peter Korteweg
,
Alberto Marchetti-Spaccamela
,
Leen Stougie
,
Andrea Vitaletti
Theoretical Computer Science
410
(14), 2009, pp. 1346-1354
Distributed algorithms for partitioning a swarm of autonomous mobile robots
Asaf Efrima
,
David Peleg
Theoretical Computer Science
410
(14), 2009, pp. 1355-1368
Optimal conclusive sets for comparator networks
Guy Even
,
Tamir Levi
,
Ami Litman
Theoretical Computer Science
410
(14), 2009, pp. 1369-1376
Rapid almost-complete broadcasting in faulty networks
Rastislav Královic̑
,
Richard Královic̑
Theoretical Computer Science
410
(14), 2009, pp. 1377-1387
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs
J. Czyzowicz
,
S. Dobrev
,
E. Kranakis
,
J. Opatrny
,
J. Urrutia
Theoretical Computer Science
410
(14), 2009, pp. 1388-1400
A note on models for graph representations
Amos Korman
,
Shay Kutten
Theoretical Computer Science
410
(14), 2009, pp. 1401-1412
Convergence rates of Markov chains for some self-assembly and non-saturated Ising models
Sam Greenberg
,
Dana Randall
Theoretical Computer Science
410
(15), 2009, pp. 1417-1427
DNA duplex cage structures with icosahedral symmetry
N.E. Grayson
,
A. Taormina
,
R. Twarock
Theoretical Computer Science
410
(15), 2009, pp. 1440-1447
On existence of reporter strands in DNA-based graph structures
Natas̑a Jonoska
,
Nadrian C. Seeman
,
Gang Wu
Theoretical Computer Science
410
(15), 2009, pp. 1448-1460
Path finding in the tile assembly model
Yuriy Brun
,
Dustin Reishus
Theoretical Computer Science
410
(15), 2009, pp. 1461-1472
Deterministic and unambiguous two-dimensional languages over one-letter alphabet
Marcella Anselmo
,
Maria Madonia
Theoretical Computer Science
410
(16), 2009, pp. 1477-1485
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>