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
[4]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the co
NP
hardness of computing certain answers over locally specified incomplete DOM-trees
Shun'ichi Amano
Information Processing Letters
110
(17), 2010, pp. 753-756
Game chromatic number of graphs with locally bounded number of cycles
Konstanty Junosza-Szaniawski
,
Łukasz Rożej
Information Processing Letters
110
(17), 2010, pp. 757-760
Block-wise 2D kernel PCA/LDA for face recognition
Armin Eftekhari
,
Mohamad Forouzanfar
,
Hamid Abrishami Moghaddam
,
Javad Alirezaie
Information Processing Letters
110
(17), 2010, pp. 761-766
Power and performance control of soft real-time web server clusters
Luciano Bertini
,
Julius C.B. Leite
,
Daniel Mossé
Information Processing Letters
110
(17), 2010, pp. 767-773
Multicasting in the hypercube, chord and binomial graphs
Christopher C. Cipriano
,
Teofilo F. Gonzalez
Information Processing Letters
110
(17), 2010, pp. 774-777
Reliability of wireless sensors with code attestation for intrusion detection
Ing-Ray Chen
,
Yating Wang
,
Ding-Chau Wang
Information Processing Letters
110
(17), 2010, pp. 778-786
Self-generating program specializers
Robert Glück
Information Processing Letters
110
(17), 2010, pp. 787-793
Indexing permutations for binary strings
Tanaeem M. Moosa
,
M. Sohel Rahman
Information Processing Letters
110
(18-19), 2010, pp. 795-798
On the bit security of the weak Diffie-Hellman problem
Dongyoung Roh
,
Sang Geun Hahn
Information Processing Letters
110
(18-19), 2010, pp. 799-802
A compact encoding of plane triangulations with efficient query supports
Katsuhisa Yamanaka
,
Shin-ichi Nakano
Information Processing Letters
110
(18-19), 2010, pp. 803-809
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Masahiko Sakai
,
Mizuhito Ogawa
Information Processing Letters
110
(18-19), 2010, pp. 810-814
A bisection algorithm for grammar-based compression of ordered trees
Tatsuya Akutsu
Information Processing Letters
110
(18-19), 2010, pp. 815-820
KCube: A novel architecture for interconnection networks
Deke Guo
,
Hanhua Chen
,
Yuan He
,
Hai Jin
,
Chao Chen
,
Honghui Chen
,
Zhen Shu
,
Guangqi Huang
Information Processing Letters
110
(18-19), 2010, pp. 821-825
A polylogarithmic approximation for computing non-metric terminal Steiner trees
Iftah Gamzu
,
Danny Segev
Information Processing Letters
110
(18-19), 2010, pp. 826-829
(\Delta+1)
-total-colorability of plane graphs with maximum degree
\Delta
at least 6 and without adjacent short cycles
Jingwen Zhang
,
Yingqian Wang
Information Processing Letters
110
(18-19), 2010, pp. 830-834
A note about weak
\epsilon
-nets for axis-parallel boxes in
d
-space
Esther Ezra
Information Processing Letters
110
(18-19), 2010, pp. 835-840
Generically globally rigid zeolites in the plane
Tibor Jordán
Information Processing Letters
110
(18-19), 2010, pp. 841-844
An improved algorithm for the red-blue hitting set problem with the consecutive ones property
Maw-Shang Chang
,
Hsiao-Han Chung
,
Chuang-Chieh Lin
Information Processing Letters
110
(20), 2010, pp. 845-848
On the total choosability of planar graphs and of sparse graphs
Gerard Jennhwa Chang
,
Jianfeng Hou
,
Nicolas Roussel
Information Processing Letters
110
(20), 2010, pp. 849-853
Routing automorphisms of the hypercube
Paulin Melatagia Yonta
,
Maurice Tchuente
,
René Ndoundam
Information Processing Letters
110
(20), 2010, pp. 854-860
On the differential and linear efficiency of balanced Feistel networks
Andrey Bogdanov
Information Processing Letters
110
(20), 2010, pp. 861-866
Evaluation of permanents in rings and semirings
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Koivisto
Information Processing Letters
110
(20), 2010, pp. 867-870
Evolving choice structures for genetic programming
Shuaiqiang Wang
,
Jun Ma
,
Jiming Liu
,
Xiaofei Niu
Information Processing Letters
110
(20), 2010, pp. 871-876
Variants of constrained longest common subsequence
Paola Bonizzoni
,
Gianluca Della Vedova
,
Riccardo Dondi
,
Yuri Pirola
Information Processing Letters
110
(20), 2010, pp. 877-881
New fault attacks using Jacobi symbol and application to regular right-to-left algorithms
Chong Hee Kim
Information Processing Letters
110
(20), 2010, pp. 882-886
Seiten
<
1
2
3
4
5
6
7
8
9
>