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=71
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Attacks on threshold signature schemes with traceable signers
Yuh-Min Tseng
,
Jinn-Ke Jan
Information Processing Letters
71
(1), 1999, pp. 1-4
A note on quantum black-box complexity of almost all Boolean functions
Andris Ambainis
Information Processing Letters
71
(1), 1999, pp. 5-7
An efficient scheme to solve two problems for two-terminal series parallel graphs
Alak Kumar Datta
,
Ranjan Kumar Sen
Information Processing Letters
71
(1), 1999, pp. 9-15
A tight lower bound for the best-
\alpha
algorithm
Eric Torng
,
Patchrawat Uthaisombut
Information Processing Letters
71
(1), 1999, pp. 17-22
Rearrangeable graphs
Qing Hu
,
Yixin Zhang
,
Xiaojun Shen
Information Processing Letters
71
(1), 1999, pp. 23-27
Verbs are not cases: Applying case grammar to document retrieval
P.C. Chu
Information Processing Letters
71
(1), 1999, pp. 29-34
Constructing Byzantine quorum systems from combinatorial designs
Tatsuhiro Tsuchiya
,
Nobuhiko Ido
,
Tohru Kikuno
Information Processing Letters
71
(1), 1999, pp. 35-42
Rearranging scattered information on BSR
Limin Xiang
,
Kazuo Ushijima
Information Processing Letters
71
(1), 1999, pp. 43-47
Two-machine flowshop scheduling with consecutive availability constraints
T.C. Edwin Cheng
,
Guoqing Wang
Information Processing Letters
71
(2), 1999, pp. 49-54
Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
O. Goldreich
,
D. Micciancio
,
S. Safra
,
J.-P. Seifert
Information Processing Letters
71
(2), 1999, pp. 55-61
NQP_{C}=co-C_=P
Tomoyuki Yamakami
,
Andrew C. Yao
Information Processing Letters
71
(2), 1999, pp. 63-69
A theorem on the relation between BSR
_k
amd BSR
^+
Limin Xiang
,
Kazuo Ushijima
Information Processing Letters
71
(2), 1999, pp. 71-73
A constraint-based approach to narrow search trees for satisfiability
Chu Min Li
Information Processing Letters
71
(2), 1999, pp. 75-80
Optimal broadcasting in hypercubes with dynamic faults
Stefan Dobrev
,
Imrich Vrt̆o
Information Processing Letters
71
(2), 1999, pp. 81-85
Graphs which locally mirror the hypercube structure
Sandi Klavz̑ar
,
Jack Koolen
,
Henry Martyn Mulder
Information Processing Letters
71
(2), 1999, pp. 87-90
Efficient parallel prefix algorithms on multiport message-passing systems
Yen-Chun Lin
,
Ching-Sung Yeh
Information Processing Letters
71
(2), 1999, pp. 91-95
A one-to-one correspondence between a class of leftist trees and binary trees
Rainer Kemp
Information Processing Letters
71
(3-4), 1999, pp. 97-105
Fast practical multi-pattern matching
Maxime Crochmore
,
A. Czumaj
,
L. Ga̧sieniec
,
T. Lecroq
,
W. Plandowski
,
W. Rytter
Information Processing Letters
71
(3-4), 1999, pp. 107-113
How to prevent interaction of functional and inclusion dependencies
Mark Levene
,
George Loizou
Information Processing Letters
71
(3-4), 1999, pp. 115-125
Tree precedence in scheduling: The strong-weak distinction
M. Dror
,
W. Kubiak
,
J.Y.-T. Leung
Information Processing Letters
71
(3-4), 1999, pp. 127-134
A matched approximation bound for the sum of a greedy coloring
Amotz Bar-Noy
,
Magnús M. Halldórsson
,
Guy Kortsarz
Information Processing Letters
71
(3-4), 1999, pp. 135-140
An interesting way to partition a number
P.C.P. Bhatt
Information Processing Letters
71
(3-4), 1999, pp. 141-148
Hamming weights of correlation immune Boolean functions
Subhamoy Maitra
,
Palash Sarkar
Information Processing Letters
71
(3-4), 1999, pp. 149-153
A simple bivalency proof that
t
-resilient consensus requires
t+1
rounds
Marcos Kawazoe Aguilera
,
Sam Toueg
Information Processing Letters
71
(3-4), 1999, pp. 155-158
The complexity of some complementation problems
David A. Plaisted
,
Gregory Kucherov
Information Processing Letters
71
(3-4), 1999, pp. 159-165
Seiten 1
2
>