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=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate counting of regular hypergraphs
Andrzej Dudek
,
Alan Frieze
,
Andrzej Ruciński
,
Matas S̑ileikis
Information Processing Letters
113
(19-21), 2013, pp. 785-788
Improvement on Meshram et al.'s ID-based cryptographic mechanism
Liaojun Pang
,
Huixian Li
,
Qingqi Pei
,
Yumin Wang
Information Processing Letters
113
(19-21), 2013, pp. 789-792
P2P-FISM: Mining (recently) frequent item sets from distributed data streams over P2P network
Zahra Farzanyar
,
Mohammadreza Kangavari
,
Nick Cercone
Information Processing Letters
113
(19-21), 2013, pp. 793-798
The complexity of the proper orientation number
A. Ahadi
,
A. Dehghan
Information Processing Letters
113
(19-21), 2013, pp. 799-803
The largest matching root of unicyclic graphs
Hailiang Zhang
,
Rongfei Lin
,
Guanglong Yu
Information Processing Letters
113
(19-21), 2013, pp. 804-806
Shape ellipticity based on the first Hu moment invariant
Dragis̑a Z̑unić
,
Jovis̑a Z̑unić
Information Processing Letters
113
(19-21), 2013, pp. 807-810
A note on binary sequence pairs with two-level correlation
Pinhui Ke
,
Wanghong Yu
,
Zuling Chang
Information Processing Letters
113
(19-21), 2013, pp. 811-814
A linear time algorithm for liar's domination problem in proper interval graphs
B.S. Panda
,
S. Paul
Information Processing Letters
113
(19-21), 2013, pp. 815-822
Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
Bo Ning
Information Processing Letters
113
(19-21), 2013, pp. 823-826
Square reflection cryptanalysis of 5-round Feistel networks with permutations
Orhun Kara
Information Processing Letters
113
(19-21), 2013, pp. 827-831
The linked list representation of
n
LIFO-stacks and/or FIFO-queues in the single-level memory
A.V. Sokolov
,
A.V. Drac
Information Processing Letters
113
(19-21), 2013, pp. 832-835
Strong edge-colouring and induced matchings
Hervé Hocquard
,
Pascal Ochem
,
Petru Valicov
Information Processing Letters
113
(19-21), 2013, pp. 836-843
How to guard a graph against tree moves
Toshihiro Fujito
,
Takayoshi Sakamaki
Information Processing Letters
113
(19-21), 2013, pp. 844-847
Another disjoint compression algorithm for odd cycle transversal
R. Krithika
,
N.S. Narayanaswamy
Information Processing Letters
113
(22-24), 2013, pp. 849-851
Testing consistency of quartet topologies: A parameterized approach
Maw-Shang Chang
,
Chuang-Chieh Lin
,
Peter Rossmanith
Information Processing Letters
113
(22-24), 2013, pp. 852-857
Hamiltonicity in connected regular graphs
Daniel W. Cranston
,
Suil O
Information Processing Letters
113
(22-24), 2013, pp. 858-860
Algorithmic aspect of stratified domination in graphs
Gerard Jennhwa Chang
,
Chan-Wei Chang
,
David Kuo
,
Sheung-Hung Poon
Information Processing Letters
113
(22-24), 2013, pp. 861-865
A note on vectorial bent functions
Deshuai Dong
,
Xue Zhang
,
Longjiang Qu
,
Shaojing Fu
Information Processing Letters
113
(22-24), 2013, pp. 866-870
A note on minimum-sum coverage by aligned disks
Chan-Su Shin
Information Processing Letters
113
(22-24), 2013, pp. 871-875
Improved neural solution for the Lyapunov matrix equation based on gradient search
Yuhuan Chen
,
Chenfu Yi
,
Dengyu Qiao
Information Processing Letters
113
(22-24), 2013, pp. 876-881
On fixed size projection of simplicial polyhedra
Masud Hasan
Information Processing Letters
113
(22-24), 2013, pp. 882-887
Incremental Beam search
S.G. Vadlamudi
,
Sandip Aine
,
P.P. Chakrabarti
Information Processing Letters
113
(22-24), 2013, pp. 888-893
Comorphisms of structured institutions
Ionuţ Ţuţu
Information Processing Letters
113
(22-24), 2013, pp. 894-900
When does abstraction help?
Guy Avni
,
Orna Kupferman
Information Processing Letters
113
(22-24), 2013, pp. 901-905
A faster FPT algorithm for Bipartite Contraction
Sylvain Guillemot
,
Dániel Marx
Information Processing Letters
113
(22-24), 2013, pp. 906-912
Seiten
<
1
2
3
4
5
6
7
8
>