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=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Relative to a random oracle,
P
/poly is not measurable in
EXP
Marius Zimand
Information Processing Letters
69
(2), 1999, pp. 83-86
Solving the all-pairs-shortest-length problem on chordal bipartite graphs
Chin-Wen Ho
,
Jou-Ming Chang
Information Processing Letters
69
(2), 1999, pp. 87-93
Comments on two group signatures
Chih-Hung Wang
,
Tzonelih Hwang
,
Narn-Yih Lee
Information Processing Letters
69
(2), 1999, pp. 95-97
On the covering of vertices for fault diagnosis in hypercubes
Mark G. Karpovsky
,
Krishnendu Chakrabarty
,
Lev B. Levitin
,
Dimiter R. Avresky
Information Processing Letters
69
(2), 1999, pp. 99-103
Progress properties for empty Unity programs
P. Crégut
,
B. Heyd
Information Processing Letters
69
(3), 1999, pp. 107-109
On the complexity of quality of service routing
Zheng Wang
Information Processing Letters
69
(3), 1999, pp. 111-114
A separation of two randomness concepts
Yongge Wang
Information Processing Letters
69
(3), 1999, pp. 115-118
A memory-efficient and fast Huffman decoding algorithm
Hong-Chung Chen
,
Yue-Li Wang
,
Yu-Feng Lan
Information Processing Letters
69
(3), 1999, pp. 119-122
A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
Dominique Roelants van Baronaigien
Information Processing Letters
69
(3), 1999, pp. 123-126
Computing the optimal bridge between two convex polygons
Leizhen Cai
,
Yinfeng Xu
,
Binhai Zhu
Information Processing Letters
69
(3), 1999, pp. 127-130
An application of ramp schemes to broadcast encryption
D.R. Stinson
,
R. Wei
Information Processing Letters
69
(3), 1999, pp. 131-135
Undecidability of partial order logics
Rajeev Alur
,
Doron Peled
Information Processing Letters
69
(3), 1999, pp. 137-143
Stream cipher encryption of random access files
J.Dj. Golić
Information Processing Letters
69
(3), 1999, pp. 145-148
Time efficient deadlock resolution algorithms
I. Terekhov
,
T. Camp
Information Processing Letters
69
(3), 1999, pp. 149-154
Independent spanning trees of chordal rings
Yukihiro Iwasaki
,
Yuka Kajiwara
,
Koji Obokata
,
Yoshihide Igarashi
Information Processing Letters
69
(3), 1999, pp. 155-160
Generating languages by a derivation procedure for elementary formal systems
Noriko Sugimoto
,
Hiroki Ishizaka
Information Processing Letters
69
(4), 1999, pp. 161-166
A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes
Jin-Yi Cai
Information Processing Letters
69
(4), 1999, pp. 167-174
Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
Carsten Damm
Information Processing Letters
69
(4), 1999, pp. 175-179
Sparse sets, approximable sets, and parallel queries to
NP
V. Arvind
,
Jacobo Torán
Information Processing Letters
69
(4), 1999, pp. 181-188
On detecting spatial regularity in noisy images
Gabriel Robins
,
Brian L. Robinson
,
Bhupinder S. Sethi
Information Processing Letters
69
(4), 1999, pp. 189-195
Symmetric Min-Max heap: A simpler data structure for double-ended priority queue
A. Arvind
,
C. Pandu Rangan
Information Processing Letters
69
(4), 1999, pp. 197-199
The graph clustering problem has a perfect zero-knowledge interactive proof
Alfredo de Santis
,
Giovanni di Crescenzo
,
Oded Goldreich
,
Giuseppe Persiano
Information Processing Letters
69
(4), 1999, pp. 201-206
Symbolic verification method for definite iteration over data structures
V.A. Nepomniaschy
Information Processing Letters
69
(4), 1999, pp. 207-213
New results on MWT subgraphs
Oswin Aichholzer
,
Franz Aurenhammer
,
Reinhard Hainz
Information Processing Letters
69
(5), 1999, pp. 215-219
The logic of ``initially'' and ``next'': Complete axiomatization and complexity
P.-Y. Schobbens
,
J.-F. Raskin
Information Processing Letters
69
(5), 1999, pp. 221-225
Seiten
<
1
2
3
4
5
6
7
>