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=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lexicographically least words in the orbit closure of the Rudin-Shapiro word
James Currie
Theoretical Computer Science
412
(35), 2011, pp. 4742-4746
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
Ruo-Wei Hung
Theoretical Computer Science
412
(35), 2011, pp. 4747-4753
Affine connections, midpoint formation, and point reflection
Kock Anders
Theoretical Computer Science
412
(36), 2011, pp. 4770-4777
Two infinite families of polyominoes that tile the plane by translation in two distinct ways
A. Blondin Massé
,
S. Brlek
,
A. Garon
,
S. Labbé
Theoretical Computer Science
412
(36), 2011, pp. 4778-4786
Distances on rhombus tilings
Olivier Bodini
,
Thomas Fernique
,
Michael Rao
,
Éric Rémila
Theoretical Computer Science
412
(36), 2011, pp. 4787-4794
A reconstruction algorithm for a subclass of instances of the 2-color problem
S. Brocchi
,
A. Frosini
,
S. Rinaldi
Theoretical Computer Science
412
(36), 2011, pp. 4795-4804
Convergence of binomial-based derivative estimation for
C^2
noisy discretized curves
Henri-Alex Esbelin
,
Rémy Malgouyres
,
Colin Cartade
Theoretical Computer Science
412
(36), 2011, pp. 4805-4813
Computing efficiently the lattice width in any dimension
Émilie Charrier
,
Fabien Feschet
,
Lilian Buzer
Theoretical Computer Science
412
(36), 2011, pp. 4814-4823
A linear time and space algorithm for detecting path intersection in
\mathbb Z^d
Srec̑ko Brlek
,
Michel Koskas
,
Xavier Provençal
Theoretical Computer Science
412
(36), 2011, pp. 4841-4850
Recursive definitions and fixed-points on well-founded structures
Francicleber Martins Ferreira
,
Ana Teresa Martins
Theoretical Computer Science
412
(37), 2011, pp. 4893-4904
Representing model theory in a type-theoretical logical framework
Fulya Horozal
,
Florian Rabe
Theoretical Computer Science
412
(37), 2011, pp. 4919-4945
A study on multi-dimensional products of graphs and hybrid logics
Mario R.F. Benevides
,
L. Menasché Schechter
Theoretical Computer Science
412
(37), 2011, pp. 4946-4966
On second-order iterative monads
Jiȓí Adámek
,
Stefan Milius
,
Jiȓí Velebil
Theoretical Computer Science
412
(38), 2011, pp. 4969-4988
On coalgebras over algebras
A. Balan
,
A. Kurz
Theoretical Computer Science
412
(38), 2011, pp. 4989-5005
Coalgebras in functional programming and type theory
Venanzio Capretta
Theoretical Computer Science
412
(38), 2011, pp. 5006-5024
Maximal traces and path-based coalgebraic temporal logics
Corina Cîrstea
Theoretical Computer Science
412
(38), 2011, pp. 5025-5042
Probabilistic systems coalgebraically: A survey
Sokolova Ana
Theoretical Computer Science
412
(38), 2011, pp. 5095-5110
Randomized competitive algorithms for online buffer management in the adaptive adversary model
Marcin Bienkowski
,
Marek Chrobak
,
Łukasz Jeż
Theoretical Computer Science
412
(39), 2011, pp. 5121-5131
Expressive power of LL(
k
) Boolean grammars
Okhotin Alexander
Theoretical Computer Science
412
(39), 2011, pp. 5132-5155
Drawing graphs with right angle crossings
Walter Didimo
,
Peter Eades
,
Giuseppe Liotta
Theoretical Computer Science
412
(39), 2011, pp. 5156-5166
Succinct data structures for Searchable Partial Sums with optimal worst-case performance
Wing-Kai Hon
,
Kunihiko Sadakane
,
Wing-Kin Sung
Theoretical Computer Science
412
(39), 2011, pp. 5176-5186
Boolean-width of graphs
Binh-Minh Bui-Xuan
,
Jan Arne Telle
,
Martin Vatshelle
Theoretical Computer Science
412
(39), 2011, pp. 5187-5204
On z-factorization and c-factorization of standard episturmian words
N. Ghareghani
,
M. Mohammad-Noori
,
P. Sharifani
Theoretical Computer Science
412
(39), 2011, pp. 5232-5238
Efficient algorithms for consensus string problems minimizing both distance sum and radius
Amihood Amir
,
Gad M. Landau
,
Joong Chae Na
,
Heejin Park
,
Kunsoo Park
,
Jeong Seop Sim
Theoretical Computer Science
412
(39), 2011, pp. 5239-5246
On the number of frames in binary words
Tero Harju
,
Tomi Kärki
Theoretical Computer Science
412
(39), 2011, pp. 5276-5284
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>