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 YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Notions of hyperbolicity in monoids
Michael Hoffmann
,
Richard M. Thomas
Theoretical Computer Science
411
(4-5), 2010, pp. 799-811
Real-time reversible iterative arrays
Martin Kutrib
,
Andreas Malcher
Theoretical Computer Science
411
(4-5), 2010, pp. 812-822
Some complexity results for prefix Gröbner bases in free monoid rings
Andrea Sattler-Klein
Theoretical Computer Science
411
(4-5), 2010, pp. 823-833
Masking traveling beams: Optical solutions for
NP
-complete problems, trading space for time
Shlomi Dolev
,
Hen Fitoussi
Theoretical Computer Science
411
(6), 2010, pp. 837-853
Plateaus can be harder in multi-objective optimization
Tobias Friedrich
,
Nils Hebbinghaus
,
Frank Neumann
Theoretical Computer Science
411
(6), 2010, pp. 854-864
Constants and label-equivalence: A decision procedure for reflexive regular splicing languages
Paola Bonizzoni
Theoretical Computer Science
411
(6), 2010, pp. 865-877
Non-confluence in divisionless
P
systems with active membranes
Antonio E. Porreca
,
Giancarlo Mauri
,
Claudio Zandron
Theoretical Computer Science
411
(6), 2010, pp. 878-887
Solving the minimum bisection problem using a biologically inspired computational model
Xingchang Liu
,
Xiaofan Yang
,
Shenglin Li
,
Yong Ding
Theoretical Computer Science
411
(6), 2010, pp. 888-896
Combining overlap and containment for gene assembly in ciliates
Robert Brijder
,
Hendrik Jan Hoogeboom
Theoretical Computer Science
411
(6), 2010, pp. 897-905
Spiking neural
P
systems: An improved normal form
Linqiang Pan
,
Gheorghe Păun
Theoretical Computer Science
411
(6), 2010, pp. 906-918
Algorithmic properties of ciliate sequence alignment
J. Mark Keil
,
Jing Liu
,
Ian McQuillan
Theoretical Computer Science
411
(6), 2010, pp. 919-925
Choosing selection pressure for wide-gap problems
Tianshi Chen
,
Jun He
,
Guoliang Chen
,
Xin Yao
Theoretical Computer Science
411
(6), 2010, pp. 926-934
Towards practical feasibility of core computation in data exchange
Reinhard Pichler
,
Vadim Savenkov
Theoretical Computer Science
411
(7-9), 2010, pp. 935-957
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
Mauro Mezzini
,
Marina Moscarini
Theoretical Computer Science
411
(7-9), 2010, pp. 958-966
A polynomial solution to the
k
-fixed-endpoint path cover problem on proper interval graphs
Katerina Asdre
,
Stavros D. Nikolopoulos
Theoretical Computer Science
411
(7-9), 2010, pp. 967-975
Efficient algorithms for the sum selection problem and
k
maximum sums problem
Tien-Ching Lin
,
D.T. Lee
Theoretical Computer Science
411
(7-9), 2010, pp. 986-994
NP
-completeness of
st
-orientations for plane graphs
Sadish Sadasivam
,
Huaming Zhang
Theoretical Computer Science
411
(7-9), 2010, pp. 995-1003
Semigroup automata with rational initial and terminal sets
Elaine Render
,
Mark Kambites
Theoretical Computer Science
411
(7-9), 2010, pp. 1004-1012
Partially dynamic efficient algorithms for distributed shortest paths
Serafino Cicerone
,
Gianlorenzo D'Angelo
,
Gabriele Di Stefano
,
Daniele Frigioni
Theoretical Computer Science
411
(7-9), 2010, pp. 1013-1037
The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
Yukun Cheng
,
Liying Kang
,
Changhong Lu
Theoretical Computer Science
411
(7-9), 2010, pp. 1038-1044
Iterative compression and exact algorithms
Fedor V. Fomin
,
Serge Gaspers
,
Dieter Kratsch
,
Mathieu Liedloff
,
Saket Saurabh
Theoretical Computer Science
411
(7-9), 2010, pp. 1045-1053
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation
Petra Berenbrink
,
Oliver Schulte
Theoretical Computer Science
411
(7-9), 2010, pp. 1054-1074
On the undecidability of the limit behavior of Cellular Automata
P. Di Lena
,
L. Margara
Theoretical Computer Science
411
(7-9), 2010, pp. 1075-1084
A hierarchical strongly aperiodic set of tiles in the hyperbolic plane
C. Goodman-Strauss
Theoretical Computer Science
411
(7-9), 2010, pp. 1085-1093
Two-group knapsack game
Zhenbo Wang
,
Wenxun Xing
,
Shu-Cherng Fang
Theoretical Computer Science
411
(7-9), 2010, pp. 1094-1103
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>