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=J. ACM AND Volume=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An on-line edge-deletion problem
S. Even
,
Y. Shiloach
Journal of the ACM
28
(1), 1981, pp. 1-4
Max-min tree partitioning
Y. Perl
,
S.R. Schach
Journal of the ACM
28
(1), 1981, pp. 5-15
Linear algorithm for data compression via string matching
M. Rodeh
,
V.R. Pratt
,
S. Even
Journal of the ACM
28
(1), 1981, pp. 16-24
Using semi-joins to solve relational queries
P.A. Bernstein
,
D.-M.W. Chiu
Journal of the ACM
28
(1), 1981, pp. 25-40
On databases with incomplete information
W., Jr. Lipski
Journal of the ACM
28
(1), 1981, pp. 41-70
n
-evaluation conjecture for multipoint iterations for the solution of scalar nonlinear equations
G.W. Wasilkowski
Journal of the ACM
28
(1), 1981, pp. 71-80
Bounds on schedules for independent tasks with similar execution times
J.O. Achugbue
,
F.Y. Chin
Journal of the ACM
28
(1), 1981, pp. 81-99
Sequencing tasks with exponential service times to minimize the expected flow time or makespan
J. Bruno
,
P. Downey
,
G.N. Frederickson
Journal of the ACM
28
(1), 1981, pp. 100-113
Alternation
A.K. Chandra
,
D.C. Kozen
,
L.J. Stockmeyer
Journal of the ACM
28
(1), 1981, pp. 114-133
String matching in real time
Z. Galil
Journal of the ACM
28
(1), 1981, pp. 134-149
A unified lower bound for selection and set partitioning problems
D.G. Kirkpatrick
Journal of the ACM
28
(1), 1981, pp. 150-165
New real-time simulations of multihead tape units
Benton L. Leong
,
Joel I. Seiferas
Journal of the ACM
28
(1), 1981, pp. 166-180
On the use of transcendentals for program testing
J.H. Rowland
,
P.J. Davis
Journal of the ACM
28
(1), 1981, pp. 181-190
Theorem proving via general matings
P.B. Andrews
Journal of the ACM
28
(2), 1981, pp. 193-214
A decision procedure for the correctness of a class of programs
P. Mateti
Journal of the ACM
28
(2), 1981, pp. 215-232
Complete sets of reductions for some equational theories
G.E. Peterson
,
M.E. Stickel
Journal of the ACM
28
(2), 1981, pp. 233-264
A note on multiple error detection in ASCII numeric data communication
C.K. Chu
Journal of the ACM
28
(2), 1981, pp. 265-269
Optimal design of linear storage hierarchies
K.S. Trivedi
,
T.M. Sigmon
Journal of the ACM
28
(2), 1981, pp. 270-288
Expected length of the longest probe sequence in hash code searching
G.H. Gonnet
Journal of the ACM
28
(2), 1981, pp. 289-304
Summation in finite terms
M. Karr
Journal of the ACM
28
(2), 1981, pp. 305-350
Measurement bias in feedback queues
R.M. Feldman
,
G.W. Adkins
,
G.L. Curry
,
U.W. Pooch
Journal of the ACM
28
(2), 1981, pp. 351-357
The distribution of queuing network states at input and output instants
K.C. Sevcik
,
I. Mitrani
Journal of the ACM
28
(2), 1981, pp. 358-371
Derivation of logic programs
C.J. Hogger
Journal of the ACM
28
(2), 1981, pp. 372-392
The closure statement: A programming language construct allowing ultraconcurrent execution
M. Rem
Journal of the ACM
28
(2), 1981, pp. 393-410
Complexity of partial satisfaction
K.J. Lieberherr
,
E. Specker
Journal of the ACM
28
(2), 1981, pp. 411-421
Seiten 1
2
>