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: Series=LNCS AND YEAR=2014
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Claw-free
t
-perfect graphs can be recognised in polynomial time
Henning Bruhn
,
Oliver Schaudt
Lecture Notes in Computer Science
8494
, 2014, pp. 404-415
Energy-utility analysis for resilient systems using probabilistic model checking
Christel Baier
,
Clemens Dubslaff
,
Sascha Klüppelholz
,
Linda Leuschner
Lecture Notes in Computer Science
8489
, 2014, pp. 20-39
Synthesis of persistent systems
Eike Best
,
Raymond Devillers
Lecture Notes in Computer Science
8489
, 2014, pp. 111-129
Learning transparent data automata
Normann Decker
,
Peter Habermehl
,
Martin Leucker
,
Daniel Thoma
Lecture Notes in Computer Science
8489
, 2014, pp. 130-149
Flow unfolding of multi-clock nets
Giovanni Casu
,
G. Michele Pinna
Lecture Notes in Computer Science
8489
, 2014, pp. 170-189
Non-interference by unfolding
Paolo Baldan
,
Alberto Carraro
Lecture Notes in Computer Science
8489
, 2014, pp. 190-209
Exhibition of a structural bug with wings
Florent Avellaneda
,
Rémi Morin
Lecture Notes in Computer Science
8489
, 2014, pp. 253-272
Analysis of Petri net models through stochastic differential equations
Marco Beccuti
,
Enrico Bibbona
,
Andras Horvath
,
Roberta Sirovich
,
Alessio Angius
,
Gianfranco Balbo
Lecture Notes in Computer Science
8489
, 2014, pp. 273-293
(Stochastic) model checking in GreatSPN
Elvio Gilberto Amparore
,
Marco Beccuti
,
Susanna Donatelli
Lecture Notes in Computer Science
8489
, 2014, pp. 354-363
Kaira: Development environment for MPI applications
Stanislav Böhm
,
Marek Bȇhálek
,
Ondȓej Meca
,
Martin S̑urkovský
Lecture Notes in Computer Science
8489
, 2014, pp. 385-394
On the efficiency of the Hamming C-centerstring problems
Amihood Amir
,
Jessica Ficler
,
Liam Roditty
,
Oren Sar Shalom
Lecture Notes in Computer Science
8486
, 2014, pp. 1-10
Dictionary matching with one gap
Amihood Amir
,
Avivit Levy
,
Ely Porat
,
B. Riva Shalom
Lecture Notes in Computer Science
8486
, 2014, pp. 11-20
Approximate on-line palindrome recognition, and applications
Amihood Amir
,
Benny Porat
Lecture Notes in Computer Science
8486
, 2014, pp. 21-29
Computing minimal and maximal suffixes of a substring revisited
Maxim Babenko
,
Paweƚ Gawrychowski
,
Tomasz Kociumaka
,
Tatiana Starikovskaya
Lecture Notes in Computer Science
8486
, 2014, pp. 30-39
Compressed subsequence matching and packed tree coloring
Philip Bille
,
Patrick Hagge Cording
,
Inge Li Grtz
Lecture Notes in Computer Science
8486
, 2014, pp. 40-49
Reversal distances for strings with few blocks or small alphabets
Laurent Bulteau
,
Guillaume Fertin
,
Christian Komusiewicz
Lecture Notes in Computer Science
8486
, 2014, pp. 50-59
On combinatorial generation of prefix normal words
Péter Burcsi
,
Gabriele Fici
,
Zsuzsanna Lipták
,
Frank Ruskey
,
Joe Sawada
Lecture Notes in Computer Science
8486
, 2014, pp. 60-69
Permuted scaled matching
Ayelet Butman
,
Noa Lewenstein
,
J. Ian Munro
Lecture Notes in Computer Science
8486
, 2014, pp. 70-78
The worst case complexity of maximum parsimony
Amir Carmel
,
Noa Musa-Lempel
,
Dekel Tsur
,
Michal Ziv-Ukelson
Lecture Notes in Computer Science
8486
, 2014, pp. 79-88
From indexing data structures to de Bruijn graphs
Bastien Cazaux
,
Thierry Lecroq
,
Eric Rivals
Lecture Notes in Computer Science
8486
, 2014, pp. 89-99
Randomized and parameterized algorithms for the closest string problem
Zhi-Zhong Chen
,
Bin Ma
,
Lusheng Wang
Lecture Notes in Computer Science
8486
, 2014, pp. 100-109
Indexed geometric jumbled pattern matching
Stephane Durocher
,
Robert Fraser
,
Travis Gagie
,
Debajyoti Mondal
,
Matthew Skala
,
Sharma V. Thankachan
Lecture Notes in Computer Science
8486
, 2014, pp. 110-119
An improved query time for succinct dynamic dictionary matching
Guy Feigenblat
,
Ely Porat
,
Ariel Shiftan
Lecture Notes in Computer Science
8486
, 2014, pp. 120-129
Order-preserving pattern matching with
k
mismatches
Paweƚ Gawrychowski
,
Przemysƚaw Uznański
Lecture Notes in Computer Science
8486
, 2014, pp. 130-139
Compactness-preserving mapping on trees
Jan Baumbach
,
Jiong Guo
,
Rashid Ibragimov
Lecture Notes in Computer Science
8486
, 2014, pp. 162-171
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12