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=111
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient approach to cyclic reference counting based on a coarse-grained search
Chin-Yang Lin
,
Ting-Wei Hou
Information Processing Letters
111
(1), 2010, pp. 1-10
Connecting face hitting sets in planar graphs
Pascal Schweitzer
,
Patrick Schweitzer
Information Processing Letters
111
(1), 2010, pp. 11-15
Learning parities in the mistake-bound model
Harry Buhrman
,
David García-Soriano
,
Arie Matsliah
Information Processing Letters
111
(1), 2010, pp. 16-21
Super-connected but not super edge-connected graphs
Jin-Xin Zhou
,
Yan-Quan Feng
Information Processing Letters
111
(1), 2010, pp. 22-25
E-passport EAC scheme based on Identity-Based Cryptography
C.H. Li
,
X.F. Zhang
,
H. Jin
,
W. Xiang
Information Processing Letters
111
(1), 2010, pp. 26-30
Online malleable job scheduling for
m\le 3
Jessen T. Havill
Information Processing Letters
111
(1), 2010, pp. 31-35
Domination number of Cartesian products of directed cycles
Xindong Zhang
,
Juan Liu
,
Xing Chen
,
Jixiang Meng
Information Processing Letters
111
(1), 2010, pp. 36-39
An improved lower bound on query complexity for quantum PAC learning
Chi Zhang
Information Processing Letters
111
(1), 2010, pp. 40-45
Root-restricted Kleenean rotations
Jean Marcel Pallo
Information Processing Letters
111
(1), 2010, pp. 46-50
Public-key encryption based on Chebyshev polynomials over GF
(q)
J.B. Lima
,
D. Panario
,
R.M. Campello de Souza
Information Processing Letters
111
(2), 2010, pp. 51-56
Reference count analysis with shallow aliasing
Akash Lal
,
G. Ramalingam
Information Processing Letters
111
(2), 2010, pp. 57-63
Exact exponential-time algorithms for finding bicliques
Daniel Binkele-Raible
,
Henning Fernau
,
Serge Gaspers
,
Mathieu Liedloff
Information Processing Letters
111
(2), 2010, pp. 64-67
Resource bisimilarity and graded bisimilarity coincide
Luca Aceto
,
Anna Ingolfsdottir
,
Joshua Sack
Information Processing Letters
111
(2), 2010, pp. 68-76
A note on makespan minimization in proportionate flow shops
Byung-Cheon Choi
,
Joseph Y.-T. Leung
,
Michael L. Pinedo
Information Processing Letters
111
(2), 2010, pp. 77-81
Non-interactive multisignatures in the plain public-key model with efficient verification
Haifeng Qian
,
Shouhuai Xu
Information Processing Letters
111
(2), 2010, pp. 82-89
Pseudorandomness analysis of the (extended) Lai-Massey scheme
Yiyuan Luo
,
Xuejia Lai
,
Zheng Gong
Information Processing Letters
111
(2), 2010, pp. 90-96
Developing fault-tolerant distributed loops
A.A. Farrag
Information Processing Letters
111
(2), 2010, pp. 97-101
Settling the bound on the rectilinear link radius of a simple rectilinear polygon
Matthew J. Katz
,
Gila Morgenstern
Information Processing Letters
111
(3), 2011, pp. 103-106
An undecidable property of context-free linear orders
Z. Ésik
Information Processing Letters
111
(3), 2011, pp. 107-109
Improved approximation bounds for the minimum rainbow subgraph problem
Ján Katrenic̑
,
Ingo Schiermeyer
Information Processing Letters
111
(3), 2011, pp. 110-114
A tighter upper bound for random MAX 2-SAT
XueLin Xu
,
ZongSheng Gao
,
Ke Xu
Information Processing Letters
111
(3), 2011, pp. 115-119
A good characterization of squares of strongly chordal split graphs
Van Bang Le
,
Ngoc Tuy Nguyen
Information Processing Letters
111
(3), 2011, pp. 120-123
On edge colorings of 1-planar graphs
Xin Zhang
,
Jian-Liang Wu
Information Processing Letters
111
(3), 2011, pp. 124-128
Introducing concurrency in sequential Java via laws
Rafael Duarte
,
Alexandre Mota
,
Augusto Sampaio
Information Processing Letters
111
(3), 2011, pp. 129-134
An entropy-based uncertainty measure of process models
Jae-Yoon Jung
,
Chang-Ho Chin
,
Jorge Cardoso
Information Processing Letters
111
(3), 2011, pp. 135-141
Seiten 1
2
3
4
5
6
7
8
9
>