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=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simulation relations for pattern matching in directed graphs
Johanna Björklund
,
Lars-Daniel Öhman
Theoretical Computer Science
485
, 2013, pp. 1-15
Abelian-primitive partial words
F. Blanchet-Sadri
,
Nathan Fox
Theoretical Computer Science
485
, 2013, pp. 16-37
Weighted finite automata over hemirings
Manfred Droste
,
Werner Kuich
Theoretical Computer Science
485
, 2013, pp. 38-48
Impartial coloring games
G. Beaulieu
,
K. Burke
,
E. Duchêne
Theoretical Computer Science
485
, 2013, pp. 49-60
Fast balanced partitioning is hard even on grids and trees
Andreas Emil Feldmann
Theoretical Computer Science
485
, 2013, pp. 61-68
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
Hajo Broersma
,
Petr A. Golovach
,
Viresh Patel
Theoretical Computer Science
485
, 2013, pp. 69-84
Four one-shot learners for regular tree languages and their polynomial characterizability
Anna Kasprzik
Theoretical Computer Science
485
, 2013, pp. 85-106
Compatibility in a multi-component environment
Josep Carmona
,
Jetty Kleijn
Theoretical Computer Science
484
, 2013, pp. 1-15
Graphs of plural cuts
Kosta Dos̑en
,
Zoran Petrić
Theoretical Computer Science
484
, 2013, pp. 41-55
Simple real-time constant-space string matching
Dany Breslauer
,
Roberto Grossi
,
Filippo Mignosi
Theoretical Computer Science
483
, 2013, pp. 2-9
Finding approximate and constrained motifs in graphs
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Theoretical Computer Science
483
, 2013, pp. 10-21
Colored range queries and document retrieval
Travis Gagie
,
Juha Kärkkäinen
,
Gonzalo Navarro
,
Simon J. Puglisi
Theoretical Computer Science
483
, 2013, pp. 36-50
Space lower bounds for online pattern matching
Raphaël Clifford
,
Markus Jalsenius
,
Ely Porat
,
Benjamin Sach
Theoretical Computer Science
483
, 2013, pp. 68-74
On the weak prefix-search problem
Paolo Ferragina
Theoretical Computer Science
483
, 2013, pp. 75-84
Efficient string-matching allowing for non-overlapping inversions
Domenico Cantone
,
Salvatore Cristofaro
,
Simone Faro
Theoretical Computer Science
483
, 2013, pp. 85-95
Approximation algorithms for orienting mixed graphs
Michael Elberfeld
,
Danny Segev
,
Colin R. Davidson
,
Dana Silverbush
,
Roded Sharan
Theoretical Computer Science
483
, 2013, pp. 96-103
Fast error-tolerant quartet phylogeny algorithms
Daniel G. Brown
,
Jakub Truszkowski
Theoretical Computer Science
483
, 2013, pp. 104-114
On compressing and indexing repetitive sequences
Sebastian Kreft
,
Gonzalo Navarro
Theoretical Computer Science
483
, 2013, pp. 115-133
Lightweight algorithms for constructing and inverting the BWT of string collections
Markus J. Bauer
,
Anthony J. Cox
,
Giovanna Rosone
Theoretical Computer Science
483
, 2013, pp. 134-148
A linear partitioning algorithm for Hybrid Lyndons using
v
-order
David E. Daykin
,
Jacqueline W. Daykin
,
W.F. Smyth
Theoretical Computer Science
483
, 2013, pp. 149-161
Palindrome pattern matching
Tomohiro I
,
Shunsuke Inenaga
,
Masayuki Takeda
Theoretical Computer Science
483
, 2013, pp. 162-170
Efficient seed computation revisited
M. Christou
,
M. Crochemore
,
C.S. Iliopoulos
,
M. Kubica
,
S.P. Pissis
,
J. Radoszewski
,
W. Rytter
,
B. Szreder
,
T. Waleń
Theoretical Computer Science
483
, 2013, pp. 171-181
Infinite ternary square-free words concatenated from permutations of a single word
James Currie
Theoretical Computer Science
482
, 2013, pp. 1-8
Maximizing the minimum load: The cost of selfishness
Xujin Chen
,
Leah Epstein
,
Elena Kleiman
,
Rob van Stee
Theoretical Computer Science
482
, 2013, pp. 9-19
Detecting induced minors in AT-free graphs
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
Theoretical Computer Science
482
, 2013, pp. 20-32
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>