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
[1]
Hilfe
Suche: Journal=J. ACM AND Volume=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On equivalence and containment problems for formal languages
H.B. Hunt III
,
D.J. Rosenkrantz
Journal of the ACM
24
, 1977, pp. 387-396
Local feedback in full-text retrieval systems
R. Attar
,
S. Fraenkel
Journal of the ACM
24
, 1977, pp. 397-417
Operations research applied to document indexing and retrieval decisions
A. Bookstein
,
D. Kraft
Journal of the ACM
24
, 1977, pp. 418-427
The complexity of trie index construction
D. Comer
,
R. Sethi
Journal of the ACM
24
, 1977, pp. 428-440
Optimal batched searching of tree structured files in multiprocessor computer systems
K. Hwang
,
S.B. Yao
Journal of the ACM
24
, 1977, pp. 441-454
A linear time algorithm for deciding subject security
R.J. Lipton
,
L. Snyder
Journal of the ACM
24
, 1977, pp. 455-464
Development of a parametric generating procedure for integer programming test problems
B.W.Y. Lin
,
R.L. Rardin
Journal of the ACM
24
, 1977, pp. 465-472
On live-dead analysis for global data flow problems
L.T. Kou
Journal of the ACM
24
, 1977, pp. 473-483
Semantics of the domain of flow diagrams
J.C. Reynolds
Journal of the ACM
24
, 1977, pp. 484-503
Complexity of synthesizing inductive assertions
B. Wegbreit
Journal of the ACM
24
, 1977, pp. 504-512
The complexity of parallel evaluation of linear recurrences
L. Hyafil
,
H.T. Kung
Journal of the ACM
24
, 1977, pp. 513-521
Word problems solvable in logspace
R.J. Lipton
,
Y. Zalcstein
Journal of the ACM
24
, 1977, pp. 522-526
On the SUP-INF method for proving Presburger formulas
R.E. Shostak
Journal of the ACM
24
, 1977, pp. 529-543
A study of schedules as models of synchronous parallel computation
R.A. DeMillo
,
K. Vairavan
,
E. Sycara-Cyranski
Journal of the ACM
24
, 1977, pp. 544-565
Queueing models for computer systems connected by a communication line
M. Maekawa
Journal of the ACM
24
, 1977, pp. 566-582
Log space recognition and translation of parenthesis languages
N. Lynch
Journal of the ACM
24
, 1977, pp. 583-590
Analysis of effectiveness of retrieval in clustered files
C.T. Yu
,
W.S. Luk
Journal of the ACM
24
, 1977, pp. 607-622
On solving Fredholm integral equations of the first kind
S.E. Sahasrabudhe
,
A.D. Kulkarni
Journal of the ACM
24
, 1977, pp. 624-629
Flow switching approach to the maximum flow problem: I
B. Kinariwala
,
A.G. Rao
Journal of the ACM
24
, 1977, pp. 630-645
Capacity bounds for multiresource queues
K.J. Omahen
Journal of the ACM
24
, 1977, pp. 646-663
Algorithms for the longest common subsequence problem
D.S. Hirschberg
Journal of the ACM
24
, 1977, pp. 664-675
A machine representation of finite
T_0
topologies
S. Kumar Das
Journal of the ACM
24
, 1977, pp. 676-692
Optimization among provably equivalent programs
P. Young
Journal of the ACM
24
, 1977, pp. 693-700
Seiten
<
1
2