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=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms of placing recovery points
Moon Jung Chung
,
M.S. Krishnamoorthy
Information Processing Letters
28
, 1988, pp. 177-181
Scheduling tree-structured tasks with restricted execution times
Jianzhong Du
,
Joseph Y.-T. Leung
Information Processing Letters
28
, 1988, pp. 183-188
Matrix multiplication for finite algebraic systems
Daniel J. Rosenkrantz
,
Harry B. Hunt III
Information Processing Letters
28
, 1988, pp. 189-192
Grammatical inference for even linear languages based on control sets
Yuji Takada
Information Processing Letters
28
, 1988, pp. 193-199
Preemptive scheduling of independent jobs on a hypercube
Guan-Ing Chen
,
Ten-Hwang Lai
Information Processing Letters
28
, 1988, pp. 201-206
The generation of random permutations on the fly
Gilles Brassard
,
Sampath Kannan
Information Processing Letters
28
, 1988, pp. 207-212
Proving properties of a ring of finite-state machines
Ichiro Suzuki
Information Processing Letters
28
, 1988, pp. 213-214
Some considerations about Npriority (1) without ROM
Katsushi Inoue
,
Itsuo Takanami
Information Processing Letters
28
, 1988, pp. 215-219
Solvability of the asynchronous ranking problem
Antoni Mazurkiewicz
Information Processing Letters
28
, 1988, pp. 221-224
Optimal node ranking of trees
Ananth V. Iyer
,
H. Donald Ratliff
,
G. Vijayan
Information Processing Letters
28
, 1988, pp. 225-229
Adaptive control using switched capacitor filters
Don Platt
,
Moneeb A. Magdy
Information Processing Letters
28
, 1988, pp. 231-234
Reconstruction of polygons from projections
Robert Li Shuo-Yen
Information Processing Letters
28
, 1988, pp. 235-240
Universal traversal sequences of length
n^{O(\log n)}
for cliques
Howard J. Karloff
,
Ramamohan Paturi
,
Janos Simon
Information Processing Letters
28
, 1988, pp. 241-243
Shortest path under rational constraint
Jean-François Romeuf
Information Processing Letters
28
, 1988, pp. 245-248
A unifying approach to evaluating block accesses in database organizations
Paolo Ciaccia
,
Dario Maio
,
Paolo Tiberio
Information Processing Letters
28
, 1988, pp. 253-257
Fault-tolerant and flexible interconnection of multiple processors
P.K. Das
,
D.Q.M. Fay
Information Processing Letters
28
, 1988, pp. 259-268
Completeness issues for join dependencies derived from the universal relation join dependency
Leslie L. Miller
,
S.K. Gadia
,
S. Kothari
,
K.C. Liu
Information Processing Letters
28
, 1988, pp. 269-274
On the domatic number of interval graphs
Alain A. Bertossi
Information Processing Letters
28
, 1988, pp. 275-280
A study on two geometric location problems
D.W. Wang
,
Yue-Sun Kuo
Information Processing Letters
28
, 1988, pp. 281-286
Converting Lamport's regular register to atomic register
K. Vidyasankar
Information Processing Letters
28
, 1988, pp. 287-290
On sparse oracles separating feasible complexity classes
Juris Hartmanis
,
Lane Hemachandra
Information Processing Letters
28
, 1988, pp. 291-295
Two algorithms for constructing a binary tree from its traversals
Gen-Huey Chen
,
M.S. Yu
,
L.T. Liu
Information Processing Letters
28
, 1988, pp. 297-299
Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
Chin-Wen Ho
,
Richard C.T. Lee
Information Processing Letters
28
, 1988, pp. 301-309
Alternating real-time computations
Maciej Liśkiewicz
,
Krzysztof Loryś
Information Processing Letters
28
, 1988, pp. 311-316
Testing unboundedness of database schemes and functional dependencies
Edward P.F. Chan
,
Héctor J. Hernández
Information Processing Letters
28
, 1988, pp. 317-326
Seiten
<
1
2
3
4