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=Inf.~Process.~Lett. AND Volume=113
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting closed trails
Andreas Björklund
,
Petteri Kaski
Information Processing Letters
113
(1-2), 2013, pp. 1-3
Physarum can compute shortest paths: A short proof
Vincenzo Bonifaci
Information Processing Letters
113
(1-2), 2013, pp. 4-7
Dynamics of a mean-shift-like algorithm and its applications on clustering
Yiguang Liu
,
Stan Z. Li
,
Wei Wu
,
Ronggang Huang
Information Processing Letters
113
(1-2), 2013, pp. 8-16
Statistics-preserving bijections between classical and cyclic permutations
Jean-Luc Baril
Information Processing Letters
113
(1-2), 2013, pp. 17-22
Approximating the min-max (regret) selecting items problem
Adam Kasperski
,
Adam Kurpisz
,
Paweƚ Zieliński
Information Processing Letters
113
(1-2), 2013, pp. 23-29
Every lobster is odd-elegant
Xiangqian Zhou
,
Bing Yao
,
Xiang'en Chen
Information Processing Letters
113
(1-2), 2013, pp. 30-33
Satisfiability problem for modal logic with global counting operators coded in binary is NE
xp
TIME-complete
Michaƚ Zawidzki
,
Renate A. Schmidt
,
Dmitry Tishkovsky
Information Processing Letters
113
(1-2), 2013, pp. 34-38
The 2-valued case of makespan minimization with assignment constraints
Stavros G. Kolliopoulos
,
Yannis Moysoglou
Information Processing Letters
113
(1-2), 2013, pp. 39-43
Model checking conditional CSL for continuous-time Markov chains
Yang Gao
,
Ming Xu
,
Naijun Zhan
,
Lijun Zhang
Information Processing Letters
113
(1-2), 2013, pp. 44-50
A deterministic algorithm for fitting a step function to a weighted point-set
Hervé Fournier
,
Antoine Vigneron
Information Processing Letters
113
(3), 2013, pp. 51-54
An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles
Panagiotis D. Alevizos
Information Processing Letters
113
(3), 2013, pp. 55-59
Memoryless near-collisions, revisited
Mario Lamberger
,
Elmar Teufl
Information Processing Letters
113
(3), 2013, pp. 60-66
Sponsored search, market equilibria, and the Hungarian Method
Paul Dütting
,
Monika Henzinger
,
Ingmar Weber
Information Processing Letters
113
(3), 2013, pp. 67-73
A note on efficient computation of all Abelian periods in a string
M. Crochemore
,
C.S. Iliopoulos
,
T. Kociumaka
,
M. Kubica
,
J. Pachocki
,
J. Radoszewski
,
W. Rytter
,
W. Tyczyński
,
T. Waleń
Information Processing Letters
113
(3), 2013, pp. 74-77
On multiset of factors of a word
Kalpesh Kapoor
,
Himadri Nayak
Information Processing Letters
113
(3), 2013, pp. 78-80
Online constrained optimization with recourse
T. Avitabile
,
C. Mathieu
,
L. Parkinson
Information Processing Letters
113
(3), 2013, pp. 81-86
An improvement on Vizing's conjecture
Yunjian Wu
Information Processing Letters
113
(3), 2013, pp. 87-88
Maximum weight independent sets in (
P_6,
co-banner)-free graphs
Raffaele Mosca
Information Processing Letters
113
(3), 2013, pp. 89-93
A linear algorithm for 3-letter longest common weakly increasing subsequence
Lech Duraj
Information Processing Letters
113
(3), 2013, pp. 94-99
BPA bisimilarity is EXPTIME-hard
Stefan Kiefer
Information Processing Letters
113
(4), 2013, pp. 101-106
Choosability on
H
-free graphs
Petr A. Golovach
,
Pinar Heggernes
,
Pim van 't Hof
,
Daniël Paulusma
Information Processing Letters
113
(4), 2013, pp. 107-110
Parallel
GF(3^m)
multiplier for trinomials
Sun-Mi Park
,
Ku-Young Chang
,
Dowon Hong
Information Processing Letters
113
(4), 2013, pp. 111-115
The dissecting power of regular languages
Tomoyuki Yamakami
,
Yuichi Kato
Information Processing Letters
113
(4), 2013, pp. 116-122
(Non-)existence of polynomial kernels for the Test Cover problem
G. Gutin
,
G. Muciaccia
,
A. Yeo
Information Processing Letters
113
(4), 2013, pp. 123-126
Semi-online hierarchical scheduling problems with buffer or rearrangements
Xin Chen
,
Zhenzhen Xu
,
György Dósa
,
Xin Han
,
He Jiang
Information Processing Letters
113
(4), 2013, pp. 127-131
Seiten 1
2
3
4
5
6
7
8
>