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=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Scheduling real-time computations with separation constraints
Ching-Chih Han
,
Kwei-Jay Lin
Information Processing Letters
42
, 1992, pp. 61-66
Additive weights of a special class of nonuniformly distributed backtrack trees
Uwe Trier
Information Processing Letters
42
, 1992, pp. 67-76
Batch checking with applications to linear functions
Ronitt Rubinfeld
Information Processing Letters
42
, 1992, pp. 77-80
An almost-constant round interactive zero-knowledge proof
Mike Burmester
Information Processing Letters
42
, 1992, pp. 81-87
The parallel complexity of coarsest set partition problems
Sang Cho
,
Dung T. Huynh
Information Processing Letters
42
, 1992, pp. 89-94
Optimal total exchange for a 3-D torus of processors
Brigitte Plateau
,
Denis Trystam
Information Processing Letters
42
, 1992, pp. 95-102
A LISP programming exercise
Jan L.A. van de Snepscheut
Information Processing Letters
42
, 1992, pp. 103-108
Detecting embedded Horn structure in propositional logic
V. Chandru
,
J.N. Hooker
Information Processing Letters
42
, 1992, pp. 109-111
An optimal algorithm for reconstructing a binary tree
V. Kamakoti
,
C. Pandu Rangan
Information Processing Letters
42
, 1992, pp. 113-115
A note on the reconstruction of a binary tree from its traversals
Naveen Gabrani
,
Priti Shankar
Information Processing Letters
42
, 1992, pp. 117-119
Complexity of the closest vector problem in a lattice generated by
(0,1)
-matrix
Boleslaw K. Szymanski
,
Balaram Sinharoy
Information Processing Letters
42
, 1992, pp. 121-126
Which finite monoids are syntactic monoids of rational
\omega
-languages
Phan Trung Huy
,
Igor Livotsky
,
Do Long Van
Information Processing Letters
42
, 1992, pp. 127-132
On the editing distance between unordered labeled trees
Kaizhong Zhang
,
Rick Statman
,
Dennis Shasha
Information Processing Letters
42
, 1992, pp. 133-139
Optimal value for the Newton-Raphson division algorithm
A. Parker
,
J.O. Hamblen
Information Processing Letters
42
, 1992, pp. 141-144
Average case complexity under the universal distribution equals worst-case complexity
Ming Li
,
Paul M.B. Vitányi
Information Processing Letters
42
, 1992, pp. 145-149
A note on lower bounds for rectilinear Steiner trees
J.S. Salowe
Information Processing Letters
42
, 1992, pp. 151-152
Finding good approximate vertex and edge partitions in NP-hard
Thang Nguyen Bui
,
Curt Jones
Information Processing Letters
42
, 1992, pp. 153-159
Finitary logics for some CCS observational bisimulations
Miranda Mowbray
Information Processing Letters
42
, 1992, pp. 161-165
A short proof of the decidability of bisimulation for normed BPA-processes
Jan Friso Groote
Information Processing Letters
42
, 1992, pp. 167-171
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem
U.K. Sarkar
,
P.P. Chakrabarti
,
S. Ghose
,
S.C. De Sarkar
Information Processing Letters
42
, 1992, pp. 173-177
Protocols for group oriented secret sharing
Tzonelih Hwang
Information Processing Letters
42
, 1992, pp. 179-182
Rank-
r
decision trees are a subclass of
r
-decision lists
Avrim Blum
Information Processing Letters
42
, 1992, pp. 183-185
A fault-tolerant hexagonal systolic array
C. Aykanat
,
F. özgüner
Information Processing Letters
42
, 1992, pp. 187-196
Optimal parallel time bounds for the maximum clique problem on intervals
Lin Chen
Information Processing Letters
42
, 1992, pp. 197-201
Sorting on PRAMs with reconfigurable buses
Ramachandran Vaidyanathan
Information Processing Letters
42
, 1992, pp. 203-208
Seiten
<
1
2
3
4
5
6
7
8
9
10
>