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.
A counterexample for the proof of implication conjecture on independent spanning trees
Abishek Gopalan
,
Srinivasan Ramasubramanian
Information Processing Letters
113
(14-16), 2013, pp. 522-526
Single-source three-disjoint path covers in cubes of connected graphs
Jung-Heum Park
,
Insung Ihm
Information Processing Letters
113
(14-16), 2013, pp. 527-532
Generalized measures of fault tolerance in exchanged hypercubes
Xiang-Jun Li
,
Jun-Ming Xu
Information Processing Letters
113
(14-16), 2013, pp. 533-537
New algorithms for binary jumbled pattern matching
Emanuele Giaquinta
,
Szymon Grabowski
Information Processing Letters
113
(14-16), 2013, pp. 538-542
A note on the hardness of sparse approximation
A. Çivril
Information Processing Letters
113
(14-16), 2013, pp. 543-545
Base invariance of feasible dimension
John M. Hitchcock
,
Elvira Mayordomo
Information Processing Letters
113
(14-16), 2013, pp. 546-551
Computing a minimum outer-connected dominating set for the class of chordal graphs
J. Mark Keil
,
D. Pradhan
Information Processing Letters
113
(14-16), 2013, pp. 552-561
Solving the learning parity with noise's open question
Vasin Suttichaya
,
Pattarasinee Bhattarakosol
Information Processing Letters
113
(14-16), 2013, pp. 562-566
A new method to construct Boolean functions with good cryptographic properties
Qichun Wang
,
Chik How Tan
Information Processing Letters
113
(14-16), 2013, pp. 567-571
Sharing many secrets with computational provable security
Javier Herranz
,
Alexandre Ruiz
,
Germán Sáez
Information Processing Letters
113
(14-16), 2013, pp. 572-579
On the security of a modified Beth identity-based identification scheme
Ji-Jian Chin
,
Syh-Yuan Tan
,
Swee-Huay Heng
,
Raphael C.-W. Phan
Information Processing Letters
113
(14-16), 2013, pp. 580-583
Priority functions for the approximation of the metric TSP
Beate Bollig
,
Michael Capelle
Information Processing Letters
113
(14-16), 2013, pp. 584-591
Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
Ran Ma
,
Jinjiang Yuan
Information Processing Letters
113
(17), 2013, pp. 593-598
Intuitionistic fuzzy shortest hyperpath in a network
Parvathi Rangasamy
,
Muhammad Akram
,
S. Thilagavathi
Information Processing Letters
113
(17), 2013, pp. 599-603
Binary jumbled string matching for highly run-length compressible texts
Golnaz Badkobeh
,
Gabriele Fici
,
Steve Kroon
,
Zsuzsanna Lipták
Information Processing Letters
113
(17), 2013, pp. 604-608
The complexity of two supply chain scheduling problems
Jianfeng Ren
,
Donglei Du
,
Dachuan Xu
Information Processing Letters
113
(17), 2013, pp. 609-612
Efficient generation of restricted growth words
Toufik Mansour
,
Vincent Vajnovszki
Information Processing Letters
113
(17), 2013, pp. 613-616
On the connection between Hamming codes, Heapsort and other methods
Shmuel T. Klein
Information Processing Letters
113
(17), 2013, pp. 617-620
Efficient integer span program for hierarchical threshold access structure
Qi Chen
,
Dingyi Pei
,
Chunming Tang
,
Gansen Zhao
Information Processing Letters
113
(17), 2013, pp. 621-627
Universal homophonic coding scheme using differential encoding and interleaving
D.R. Simões
,
J. Portugheis
,
V.C., Jr. da Rocha
Information Processing Letters
113
(17), 2013, pp. 628-633
A compress slide attack on the full GOST block cipher
Linzhen Lu
,
Shaozhen Chen
Information Processing Letters
113
(17), 2013, pp. 634-639
On the inequivalence of bilinear algorithms for
3\times 3
matrix multiplication
Jinsoo Oh
,
Jin Kim
,
Byung-Ro Moon
Information Processing Letters
113
(17), 2013, pp. 640-645
Revisit of Erdŏs-Gallai's theorem on the circumference of a graph
Shinya Fujita
,
Linda Lesniak
Information Processing Letters
113
(17), 2013, pp. 646-648
A note on the Cornaz-Jost transformation to solve the graph coloring problem
Flavia Bonomo
,
Monia Giandomenico
,
Fabrizio Rossi
Information Processing Letters
113
(18), 2013, pp. 649-652
Independent spanning trees in crossed cubes
Yan-Hong Zhang
,
Wei Hao
,
Tao Xiang
Information Processing Letters
113
(18), 2013, pp. 653-658
Seiten
<
1
2
3
4
5
6
7
8
>