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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Unavoidable sets
Peter M. Higgins
,
Christopher J. Saker
Theoretical Computer Science
359
(1-3), 2006, pp. 231-238
Asymptotic analysis of a leader election algorithm
Christian Lavault
,
Guy Louchard
Theoretical Computer Science
359
(1-3), 2006, pp. 239-254
Averages of automatic sequences
A. Barbé
,
F. von Haeseler
Theoretical Computer Science
359
(1-3), 2006, pp. 255-281
Rationality of the Möbius function of a composition poset
Anders Björner
,
Bruce E. Sagan
Theoretical Computer Science
359
(1-3), 2006, pp. 282-298
Completeness in approximation classes beyond APX
Bruno Escoffier
,
Vangelis Th. Paschos
Theoretical Computer Science
359
(1-3), 2006, pp. 369-377
DLS-trees: A model of evolutionary scenarios
Paweƚ Górecki
,
Jerzy Tiuryn
Theoretical Computer Science
359
(1-3), 2006, pp. 378-399
Approximation schemes for scheduling and covering on unrelated machines
Pavlos S. Efraimidis
,
Paul G. Spirakis
Theoretical Computer Science
359
(1-3), 2006, pp. 400-417
The conference call search problem in wireless networks
Leah Epstein
,
Asaf Levin
Theoretical Computer Science
359
(1-3), 2006, pp. 418-429
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Wun-Tat Chan
,
Tak-Wah Lam
,
Kin-Shing Liu
,
Prudence W.H. Wong
Theoretical Computer Science
359
(1-3), 2006, pp. 430-439
An efficient approach for the rank aggregation problem
Liviu P. Dinu
,
Florin Manea
Theoretical Computer Science
359
(1-3), 2006, pp. 455-461
On the power of non-local boxes
Anne Broadbent
,
Andre Allan Méthot
Theoretical Computer Science
358
(1), 2006, pp. 3-14
A 3D graphical representation of DNA sequences and its application
Bo Liao
,
Kequan Ding
Theoretical Computer Science
358
(1), 2006, pp. 56-64
Determination of equivalence between quantum sequential machines
Lvzhou Li
,
Daowen Qiu
Theoretical Computer Science
358
(1), 2006, pp. 65-74
An alternative definition of splicing
Remco Loos
Theoretical Computer Science
358
(1), 2006, pp. 75-87
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport
P
systems
Oscar H. Ibarra
,
Gheorghe Păun
Theoretical Computer Science
358
(1), 2006, pp. 88-103
Analysis of a Multiobjective Evolutionary Algorithm on the 0-1 knapsack problem
Rajeev Kumar
,
Nilanjan Banerjee
Theoretical Computer Science
358
(1), 2006, pp. 104-120
On the power of parallel communicating Watson-Crick automata systems
Elena Czeizler
,
Eugen Czeizler
Theoretical Computer Science
358
(1), 2006, pp. 142-147
Message-passing automata are expressively equivalent to EMSO logic
Benedikt Bollig
,
Martin Leucker
Theoretical Computer Science
358
(2-3), 2006, pp. 150-172
Resource control for synchronous cooperative threads
Roberto M. Amadio
,
Silvano Dal Zilio
Theoretical Computer Science
358
(2-3), 2006, pp. 229-254
Characterizing EF and EX tree logics
Mikolaj Bojańczyk
,
Igor Walukiewicz
Theoretical Computer Science
358
(2-3), 2006, pp. 255-272
Elimination of quantifiers and undecidability in spatial logics for concurrency
Luís Caires
,
Etienne Lozes
Theoretical Computer Science
358
(2-3), 2006, pp. 293-314
A general approach to comparing infinite-state systems with their finite-state specifications
Antonín Kuc̑era
,
Philippe Schnoebelen
Theoretical Computer Science
358
(2-3), 2006, pp. 315-333
Justified common knowledge
Sergei Artemov
Theoretical Computer Science
357
(1-3), 2006, pp. 4-22
Making knowledge explicit: How hard it is
Vladimir Brezhnev
,
Roman Kuznets
Theoretical Computer Science
357
(1-3), 2006, pp. 23-34
Polynomial-size Frege and resolution proofs of
st
-connectivity and Hex tautologies
Samuel R. Buss
Theoretical Computer Science
357
(1-3), 2006, pp. 35-52
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>