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=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Making a fair roulette from a possibly biased coin
Edsger W. Dijkstra
Information Processing Letters
36
, 1990, pp. 193
A note on Graham's bound
Zhen Liu
Information Processing Letters
36
, 1990, pp. 1-5
An optimization technique for protocol conformance testing using multiple UIO sequences
Wen-Huei Chen
,
Ching-Sung Lu
,
Elben R. Brozovsky
,
Jin-Tuu Wang
Information Processing Letters
36
, 1990, pp. 7-11
Infinite hierarchy of shuffle expressions over a finite alphabet
Joanna Jȩdrzejowicz
Information Processing Letters
36
, 1990, pp. 13-17
Finding a maximum independent set in a permutation graph
Haklin Kim
Information Processing Letters
36
, 1990, pp. 19-23
Safety and liveness from a methodological point of view
Frank Dederichs
,
Rainer Weber
Information Processing Letters
36
, 1990, pp. 25-30
Two-dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model
Biing-Feng Wang
,
Gen-Huey Chen
Information Processing Letters
36
, 1990, pp. 31-36
Unification in commutative rings is not finitary
Stanley Burris
,
John Lawrence
Information Processing Letters
36
, 1990, pp. 37-38
A faster algorithm for the maximum weighted tardiness problem
Malcolm C. Fields
,
Greg N. Frederickson
Information Processing Letters
36
, 1990, pp. 39-44
The best of both worlds: Guaranteeing termination in fast randomized byzantine agreement protocols
Oded Goldreich
,
Erez Petrank
Information Processing Letters
36
, 1990, pp. 45-49
A note on diameter of acyclic directed hypercubes
Ke Qiu
,
Henk Meijer
Information Processing Letters
36
, 1990, pp. 51-52
Bit-optimal election in synchronous rings
Hans L. Bodlaender
,
Gerard Tel
Information Processing Letters
36
, 1990, pp. 53-56
Improved nonconservative sequential and parallel integer sorting
Torben Hagerup
,
Hong Shen
Information Processing Letters
36
, 1990, pp. 57-63
Object-oriented interaction in resource constrained scheduling
Miklós Biró
Information Processing Letters
36
, 1990, pp. 65-67
One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages
Anna Slobodová
Information Processing Letters
36
, 1990, pp. 69-72
Quadratic programming is in
NP
Stephen A. Vavasis
Information Processing Letters
36
, 1990, pp. 73-77
Lower bounds for constant-depth circuits in the presence of help bits
Jin-yi Cai
Information Processing Letters
36
, 1990, pp. 79-83
An upper bound on buffer size for join operation using nonclustered indexes
Jae Moon Lee
,
Jong Soo Park
,
Myunghwan Kim
Information Processing Letters
36
, 1990, pp. 85-90
The processor identity problem
Richard J. Lipton
,
Arvin Park
Information Processing Letters
36
, 1990, pp. 91-94
Oracle complexities for computational geometry of semi-algebraic sets and Voronoi diagrams
Chandan Haldar
,
L.M. Patnaik
Information Processing Letters
36
, 1990, pp. 95-102
Improved matrix triangularisation using a double pipeline systolic array
G.M. Megson
,
F.M.F. Gaston
Information Processing Letters
36
, 1990, pp. 103-109
Efficient address generation in a parallel processor
De-Lei Lee
Information Processing Letters
36
, 1990, pp. 111-116
An algebraic semantics of notional entailment logic
Cn
Jingde Cheng
Information Processing Letters
36
, 1990, pp. 117-121
Modelling and animating information systems dynamics
Aphrodite Tsalgatidou
Information Processing Letters
36
, 1990, pp. 123-127
On full utilization of multi-channel capacity with priority protocol
Shuo-Yen Robert Li
Information Processing Letters
36
, 1990, pp. 129-133
Seiten 1
2
3
>