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 YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
Camil Demetrescu
,
Bruno Escoffier
,
Gabriel Moruz
,
Andrea Ribichini
Theoretical Computer Science
411
(44-46), 2010, pp. 3994-4004
A parameterized algorithm for the hyperplane-cover problem
Jianxin Wang
,
Wenjun Li
,
Jianer Chen
Theoretical Computer Science
411
(44-46), 2010, pp. 4005-4009
The periodic domino problem revisited
Emmanuel Jeandel
Theoretical Computer Science
411
(44-46), 2010, pp. 4010-4016
Combinatorial model and bounds for target set selection
Eyal Ackerman
,
Oren Ben-Zwi
,
Guy Wolfovitz
Theoretical Computer Science
411
(44-46), 2010, pp. 4017-4022
A decidability result for the dominating set problem
Vadim V. Lozin
Theoretical Computer Science
411
(44-46), 2010, pp. 4023-4027
Learning of event-recording automata
Olga Grinchtein
,
Bengt Jonsson
,
Martin Leucker
Theoretical Computer Science
411
(47), 2010, pp. 4029-4054
An integrated framework for the diagnosis and correction of rule-based programs
M. Alpuente
,
D. Ballis
,
F. Correa
,
M. Falaschi
Theoretical Computer Science
411
(47), 2010, pp. 4055-4101
The category-theoretic solution of recursive metric-space equations
Lars Birkedal
,
Kristian Stvring
,
Jacob Thamsborg
Theoretical Computer Science
411
(47), 2010, pp. 4102-4122
A characterization of (regular) circular languages generated by monotone complete splicing systems
Paola Bonizzoni
,
Clelia De Felice
,
Rosalba Zizza
Theoretical Computer Science
411
(48), 2010, pp. 4149-4161
A series of algorithmic results related to the iterated hairpin completion
Florin Manea
Theoretical Computer Science
411
(48), 2010, pp. 4162-4178
On the physical implementation of logical transformations: Generalized
L
-machines
Neal G. Anderson
Theoretical Computer Science
411
(48), 2010, pp. 4179-4199
Adaptive multiple minor directions extraction in parallel using a PCA neural network
Kok Kiong Tan
,
Jian Cheng Lv
,
Zhang Yi
,
Sunan Huang
Theoretical Computer Science
411
(48), 2010, pp. 4200-4215
Resource allocation with time intervals
Andreas Darmann
,
Ulrich Pferschy
,
Joachim Schauer
Theoretical Computer Science
411
(49), 2010, pp. 4217-4234
Distinct squares in run-length encoded strings
J.J. Liu
Theoretical Computer Science
411
(49), 2010, pp. 4235-4241
On the parameterized complexity of some optimization problems related to multiple-interval graphs
Minghui Jiang
Theoretical Computer Science
411
(49), 2010, pp. 4253-4262
On the complexity of deciding avoidability of sets of partial words
Brandon Blakeley
,
F. Blanchet-Sadri
,
Josh Gunter
,
Narad Rampersad
Theoretical Computer Science
411
(49), 2010, pp. 4263-4271
On the
\mu
-calculus over transitive and finite transitive frames
Giovanna D'Agostino
,
Giacomo Lenzi
Theoretical Computer Science
411
(50), 2010, pp. 4273-4290
Weak bisimulation for Probabilistic Timed Automata
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
,
Angelo Troina
Theoretical Computer Science
411
(50), 2010, pp. 4291-4322
Rules admissible in transitive temporal logic
T_{S4}
, sufficient condition
Vladimir Rybakov
Theoretical Computer Science
411
(50), 2010, pp. 4323-4332
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
Filip Marić
Theoretical Computer Science
411
(50), 2010, pp. 4333-4356
A bisimulation-like proof method for contextual properties in untyped
\lambda
-calculus with references and deallocation
Eijiro Sumii
Theoretical Computer Science
411
(51-52), 2010, pp. 4358-4378
Abstraction for concurrent objects
Ivana Filipović
,
Peter O'Hearn
,
Noam Rinetzky
,
Hongseok Yang
Theoretical Computer Science
411
(51-52), 2010, pp. 4379-4398
Conversation types
Luís Caires
,
Hugo Torres Vieira
Theoretical Computer Science
411
(51-52), 2010, pp. 4399-4440
Monad transformers as monoid transformers
Mauro Jaskelioff
,
Eugenio Moggi
Theoretical Computer Science
411
(51-52), 2010, pp. 4441-4466
A sufficient condition for a planar graph to be class 1
Weifan Wang
,
Yongzhu Chen
Theoretical Computer Science
385
(1-3), 2007, pp. 71-77
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12