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=362
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fully asynchronous behavior of double-quiescent elementary cellular automata
Nazim Fatès
,
Éric Thierry
,
Michel Morvan
,
Nicolas Schabanel
Theoretical Computer Science
362
(1-3), 2006, pp. 1-16
Progressive solutions to a parallel automata equation
Khaled El-Fakih
,
Nina Yevtushenko
,
Sergey Buffalov
,
Gregor von Bochmann
Theoretical Computer Science
362
(1-3), 2006, pp. 17-32
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Francesc Rosselló
,
Gabriel Valiente
Theoretical Computer Science
362
(1-3), 2006, pp. 33-53
If
P \neq NP
then some strongly noninvertible functions are invertible
Lane A. Hemaspaandra
,
Kari Pasanen
,
Jörg Rothe
Theoretical Computer Science
362
(1-3), 2006, pp. 54-62
Computational aspects of mining maximal frequent patterns
Guizhen Yang
Theoretical Computer Science
362
(1-3), 2006, pp. 63-85
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Beate Bollig
,
Stephan Waack
,
Philipp Woelfel
Theoretical Computer Science
362
(1-3), 2006, pp. 86-99
Learning in varieties of the form V*LI from positive data
Pedro Garcíia
,
Jose Ruiz
Theoretical Computer Science
362
(1-3), 2006, pp. 100-114
Scheduling linear deteriorating jobs with an availability constraint on a single machine
Min Ji
,
Yong He
,
T.C.E. Cheng
Theoretical Computer Science
362
(1-3), 2006, pp. 115-126
The maximum resource bin packing problem
Joan Boyar
,
Leah Epstein
,
Lene M. Favrholdt
,
Jens S. Kohrt
,
Kim S. Larsen
,
Morten M. Pedersen
,
Sanne Whlk
Theoretical Computer Science
362
(1-3), 2006, pp. 127-139
Minimal invariant sets in a vertex-weighted graph
Francesco M. Malvestuto
,
Mauro Mezzini
,
Marina Moscarini
Theoretical Computer Science
362
(1-3), 2006, pp. 140-161
Improved algorithms for the
k
maximum-sums problems
Chih-Huai Cheng
,
Kuan-Yu Chen
,
Wen-Chin Tien
,
Kun-Mao Chao
Theoretical Computer Science
362
(1-3), 2006, pp. 162-170
Small fast universal Turing machines
Turlough Neary
,
Damien Woods
Theoretical Computer Science
362
(1-3), 2006, pp. 171-195
Deterministic M2M multicast in radio networks
Leszek Ga̧sieniec
,
Evangelos Kranakis
,
Andrzej Pelc
,
Qin Xin
Theoretical Computer Science
362
(1-3), 2006, pp. 196-206
Finite transducers for divisibility monoids
Matthieu Picantin
Theoretical Computer Science
362
(1-3), 2006, pp. 207-221
Independence of certain quantities indicating subword occurrences
Arto Salomaa
Theoretical Computer Science
362
(1-3), 2006, pp. 222-231
Word problems recognisable by deterministic blind monoid automata
Mark Kambites
Theoretical Computer Science
362
(1-3), 2006, pp. 232-237
Utilization of nonclairvoyant online schedules
Mohamed Eid Hussein
,
Uwe Schwiegelshohn
Theoretical Computer Science
362
(1-3), 2006, pp. 238-247
Longest repeats with a block of
k
don't cares
Maxime Crochemore
,
Costas S. Iliopoulos
,
Manal Mohamed
,
Marie-France Sagot
Theoretical Computer Science
362
(1-3), 2006, pp. 248-254
Compatible topologies on graphs: An application to graph isomorphism problem complexity
Alain Bretto
,
Alain Faisant
,
Thierry Vallée
Theoretical Computer Science
362
(1-3), 2006, pp. 255-272
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
T.C.E. Cheng
,
C.T. Ng
,
J.J. Yuan
Theoretical Computer Science
362
(1-3), 2006, pp. 273-281
Pseudopalindrome closure operators in free monoids
Aldo de Luca
,
Alessandro De Luca
Theoretical Computer Science
362
(1-3), 2006, pp. 282-300