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=112
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Routing and wavelength assignment for 3-ary
n
-cube in array-based optical network
Cui Yu
,
Xiaofan Yang
,
LuXing Yang
,
Jing Zhang
Information Processing Letters
112
(6), 2012, pp. 252-256
On the rectangle method in proofs of robustness of tensor products
Or Meir
Information Processing Letters
112
(6), 2012, pp. 257-260
A note on randomized streaming space bounds for the longest increasing subsequence problem
Amit Chakrabarti
Information Processing Letters
112
(7), 2012, pp. 261-263
Automorphism groups of the Pancake graphs
Yun-Ping Deng
,
Xiao-Dong Zhang
Information Processing Letters
112
(7), 2012, pp. 264-266
Exponential lower bound for bounded depth circuits with few threshold gates
Vladimir V. Podolskii
Information Processing Letters
112
(7), 2012, pp. 267-271
On the parameterized complexity of the repetition free longest common subsequence problem
Guillaume Blin
,
Paola Bonizzoni
,
Riccardo Dondi
,
Florian Sikora
Information Processing Letters
112
(7), 2012, pp. 272-276
Colorful triangle counting and a
MapReduce
implementation
Rasmus Pagh
,
Charalampos E. Tsourakakis
Information Processing Letters
112
(7), 2012, pp. 277-281
An improved security-aware packet scheduling algorithm in real-time wireless networks
Xiaomin Zhu
,
Hao Guo
,
Shaoshuai Liang
,
Xiaoling Yang
Information Processing Letters
112
(7), 2012, pp. 282-288
Superiority of exact quantum automata for promise problems
Andris Ambainis
,
Abuzer Yakaryılmaz
Information Processing Letters
112
(7), 2012, pp. 289-291
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
Wenhua Li
,
Zhenkun Zhang
,
Sufang Yang
Information Processing Letters
112
(7), 2012, pp. 292-297
Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs
Iksoon Hwang
,
Nina Yevtushenko
,
Ana Cavalli
Information Processing Letters
112
(7), 2012, pp. 298-301
TrCBC: Another look at CBC-MAC
Liting Zhang
,
Wenling Wu
,
Peng Wang
,
Bo Liang
Information Processing Letters
112
(7), 2012, pp. 302-307
Randomized load balancing by joining and splitting bins
James Aspnes
,
Yitong Yin
Information Processing Letters
112
(8-9), 2012, pp. 309-313
Cores of random
r
-partite hypergraphs
Fabiano C. Botelho
,
Nicholas Wormald
,
Nivio Ziviani
Information Processing Letters
112
(8-9), 2012, pp. 314-319
Model checking probabilistic systems against pushdown specifications
Clemens Dubslaff
,
Christel Baier
,
Manuela Berg
Information Processing Letters
112
(8-9), 2012, pp. 320-328
Bicolored independent sets and bicliques
Jean-François Couturier
,
Dieter Kratsch
Information Processing Letters
112
(8-9), 2012, pp. 329-334
Squeeziness: An information theoretic measure for avoiding fault masking
David Clark
,
Robert M. Hierons
Information Processing Letters
112
(8-9), 2012, pp. 335-340
Fast equality test for straight-line compressed strings
Manfred Schmidt-Schauß
,
Georg Schnitger
Information Processing Letters
112
(8-9), 2012, pp. 341-345
Universal point sets for 2-coloured trees
Mereke van Garderen
,
Giuseppe Liotta
,
Henk Meijer
Information Processing Letters
112
(8-9), 2012, pp. 346-350
The tensor product of two good codes is not necessarily robustly testable
Oded Goldreich
,
Or Meir
Information Processing Letters
112
(8-9), 2012, pp. 351-355
Highly connected molecular graphs are rigid in three dimensions
Tibor Jordán
Information Processing Letters
112
(8-9), 2012, pp. 356-359
Improved approximation algorithms for the robust fault-tolerant facility location problem
Yu Li
,
Dachuan Xu
,
Donglei Du
,
Naihua Xiu
Information Processing Letters
112
(10), 2012, pp. 361-364
Optimal distortion embedding of complete binary trees into lines
Masao Kumamoto
,
Eiji Miyano
Information Processing Letters
112
(10), 2012, pp. 365-370
Finite satisfiability for guarded fixpoint logic
Vince Bárány
,
Mikoƚaj Bojańczyk
Information Processing Letters
112
(10), 2012, pp. 371-375
On-line scheduling of equal-length intervals on parallel machines
Stanley P.Y. Fung
,
Chung Keung Poon
,
Duncan K.W. Yung
Information Processing Letters
112
(10), 2012, pp. 376-379
Seiten
<
1
2
3
4
5
6
7
8
>