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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=110
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
Enno Ohlebusch
,
Simon Gog
Information Processing Letters
110
(3), 2010, pp. 123-128
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words
Nathan Keller
,
Stephen D. Miller
Information Processing Letters
110
(4), 2010, pp. 129-132
Hard problems in max-algebra, control theory, hypergraphs and other areas
Marc Bezem
,
Robert Nieuwenhuis
,
Enric Rodríguez-Carbonell
Information Processing Letters
110
(4), 2010, pp. 133-138
Alphabetic coding with exponential costs
Michael B. Baer
Information Processing Letters
110
(4), 2010, pp. 139-142
Disjoint pattern matching and implication in strings
Leonid Libkin
,
Cristina Sirangelo
Information Processing Letters
110
(4), 2010, pp. 143-147
Improving practical exact string matching
Branislav D̑urian
,
Jan Holub
,
Hannu Peltola
,
Jorma Tarhio
Information Processing Letters
110
(4), 2010, pp. 148-152
A simple proof of the necessity of the failure detector
\Sigma
to implement an atomic register in asynchronous message-passing systems
François Bonnet
,
Michel Raynal
Information Processing Letters
110
(4), 2010, pp. 153-157
A set coverage problem
Guo-Qiang Zhang
,
Licong Cui
Information Processing Letters
110
(4), 2010, pp. 158-159
A general compiler for password-authenticated group key exchange protocol
Hui Li
,
Chuan-Kun Wu
,
Jun Sun
Information Processing Letters
110
(4), 2010, pp. 160-167
On finding fundamental cut sets
Sanjeev Saxena
Information Processing Letters
110
(4), 2010, pp. 168-170
On domination number of Cartesian product of directed cycles
Juan Liu
,
Xindong Zhang
,
Xing Chen
,
Jixiang Meng
Information Processing Letters
110
(5), 2010, pp. 171-173
Finding bipartite subgraphs efficiently
Dhruv Mubayi
,
György Turán
Information Processing Letters
110
(5), 2010, pp. 174-177
Cryptanalysis of RSA with two decryption exponents
Santanu Sarkar
,
Subhamoy Maitra
Information Processing Letters
110
(5), 2010, pp. 178-181
Dependency mining-based causal message logging
Yi-Wei Ci
,
Zhan Zhang
,
De-Cheng Zuo
,
Zhi-Bo Wu
,
Xiao-Zong Yang
Information Processing Letters
110
(5), 2010, pp. 182-187
An improved kernelization for
P_2
-packing
Jianxin Wang
,
Dan Ning
,
Qilong Feng
,
Jianer Chen
Information Processing Letters
110
(5), 2010, pp. 188-192
On the bi-enhancement of chordal-bipartite probe graphs
Elad Cohen
,
Martin Charles Golumbic
,
Marina Lipshteyn
,
Michal Stern
Information Processing Letters
110
(5), 2010, pp. 193-197
A randomized sublinear time parallel GCD algorithm for the EREW PRAM
Jonathan P. Sorenson
Information Processing Letters
110
(5), 2010, pp. 198-201
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Xie-Bin Chen
Information Processing Letters
110
(6), 2010, pp. 203-205
Strong orientations of complete
k
-partite graphs achieving the strong diameter
Huifang Miao
,
Guoping Lin
Information Processing Letters
110
(6), 2010, pp. 206-210
Fully symmetric swapped networks based on bipartite cluster connectivity
Wenjun Xiao
,
Behrooz Parhami
,
Weidong Chen
,
Mingxin He
,
Wenhong Wei
Information Processing Letters
110
(6), 2010, pp. 211-215
A faster algorithm for matching a set of patterns with variable length don't cares
Meng Zhang
,
Yi Zhang
,
Liang Hu
Information Processing Letters
110
(6), 2010, pp. 216-220
A note on competitive diffusion through social networks
Noga Alon
,
Michal Feldman
,
Ariel D. Procaccia
,
Moshe Tennenholtz
Information Processing Letters
110
(6), 2010, pp. 221-225
Rate monotonic scheduling re-analysed
Qiwen Xu
,
Naijun Zhan
Information Processing Letters
110
(6), 2010, pp. 226-231
Closures of may-, should- and must-convergences for contextual equivalence
Manfred Schmidt-Schauß
,
David Sabel
Information Processing Letters
110
(6), 2010, pp. 232-235
Improving the usability of the source code quality index with interchangeable metrics sets
Ales̑ Z̑ivkovic̑
,
Uros̑ Goljat
,
Marjan Heric̑ko
Information Processing Letters
110
(6), 2010, pp. 236-240
Seiten
<
1
2
3
4
5
6
7
8
9
>