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 YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the connectivity threshold for general uniform metric spaces
Gady Kozma
,
Zvi Lotker
,
Gideon Stupp
Information Processing Letters
110
(10), 2010, pp. 356-359
Query containment under bag and bag-set semantics
Foto N. Afrati
,
Matthew Damigos
,
Manolis Gergatsoulis
Information Processing Letters
110
(10), 2010, pp. 360-369
Online coloring of hypergraphs
Magnús M. Halldórsson
Information Processing Letters
110
(10), 2010, pp. 370-372
Resource efficient implementation of T-Boxes in AES on Virtex-5 FPGA
Dur-e-Shahwar Kundi
,
Arshad Aziz
,
Nasar Ikram
Information Processing Letters
110
(10), 2010, pp. 373-377
On toughness and fractional
(g,f,n)
-critical graphs
Shuli Liu
Information Processing Letters
110
(10), 2010, pp. 378-382
Parameterized complexity of control problems in Maximin election
Hong Liu
,
Daming Zhu
Information Processing Letters
110
(10), 2010, pp. 383-388
Fault-tolerant strategies in the Iterated Prisoner's Dilemma
Andrzej Pelc
Information Processing Letters
110
(10), 2010, pp. 389-395
Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal
Marcin Balcerzak
,
Damian Niwiński
Information Processing Letters
110
(10), 2010, pp. 396-398
Predictability of Fixed-Job Priority schedulers on heterogeneous multiprocessor real-time systems
Liliana Cucu-Grosjean
,
Joël Goossens
Information Processing Letters
110
(10), 2010, pp. 399-402
Conditional diagnosability of alternating group networks
Shuming Zhou
,
Wenjun Xiao
Information Processing Letters
110
(10), 2010, pp. 403-409
A new family of nonstochastic languages
Rūsiņs̑ Freivalds
,
Abuzer Yakaryılmaz
,
A.C. Cem Say
Information Processing Letters
110
(10), 2010, pp. 410-413
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Jia-Cian Lin
,
Jinn-Shyong Yang
,
Chiun-Chieh Hsu
,
Jou-Ming Chang
Information Processing Letters
110
(10), 2010, pp. 414-419
Reducing non-determinism of
k
-NN searching in non-ordered discrete data spaces
Dashiell Kolbe
,
Qiang Zhu
,
Sakti Pramanik
Information Processing Letters
110
(10), 2010, pp. 420-423
Complexity of semi-stable and stage semantics in argumentation frameworks
Wolfgang Dvoȓák
,
Stefan Woltran
Information Processing Letters
110
(11), 2010, pp. 425-430
The cost of probabilistic agreement in oblivious robot networks
Julien Clement
,
Xavier Défago
,
Maria Gradinariu Potop-Butucaru
,
Taisuke Izumi
,
Stephane Messika
Information Processing Letters
110
(11), 2010, pp. 431-438
Edge-fault-tolerant vertex-pancyclicity of augmented cubes
Jung-Sheng Fu
Information Processing Letters
110
(11), 2010, pp. 439-443
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
Ruyan Fu
,
T.C.E. Cheng
,
C.T. Ng
,
Jinjiang Yuan
Information Processing Letters
110
(11), 2010, pp. 444-450
Note on Max Lin-2 above Average
Robert Crowston
,
Gregory Gutin
,
Mark Jones
Information Processing Letters
110
(11), 2010, pp. 451-454
Single-machine scheduling with a nonlinear deterioration function
Peng-Jen Lai
,
Wen-Chiung Lee
Information Processing Letters
110
(11), 2010, pp. 455-459
Scheduling with job-dependent learning effects and multiple rate-modifying activities
Min Ji
,
T.C.E. Cheng
Information Processing Letters
110
(11), 2010, pp. 460-463
Embedding a long fault-free cycle in a crossed cube with more faulty nodes
Qiang Dong
,
Xiaofan Yang
Information Processing Letters
110
(11), 2010, pp. 464-468
Two models of two-dimensional bandwidth problems
Lan Lin
,
Yixun Lin
Information Processing Letters
110
(11), 2010, pp. 469-473
Whole mirror duplication-random loss model and pattern avoiding permutations
Jean-Luc Baril
,
Rémi Vernay
Information Processing Letters
110
(11), 2010, pp. 474-480
An improved kernel size for rotation distance in binary trees
Joan M. Lucas
Information Processing Letters
110
(12-13), 2010, pp. 481-484
A note on the Chen-Morrissey-Smart DAA scheme
Liqun Chen
,
Jiangtao Li
Information Processing Letters
110
(12-13), 2010, pp. 485-488
Seiten
<
1
2
3
4
5
6
7
8
9
>