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=SIAM J. Comput. AND YEAR=1972
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimization of straight line programs
A.V. Aho
,
J.D. Ullman
SIAM Journal on Computing
1
, 1972, pp. 1-19
Terminal context in context-sensitive grammars
R.V. Book
SIAM Journal on Computing
1
, 1972, pp. 20-30
A simple algorithm for merging two disjoint linearly-ordered sets
F.K. Hwang
,
S. Lin
SIAM Journal on Computing
1
, 1972, pp. 31-39
Symmetries in data graphs
A. Rosenberg
SIAM Journal on Computing
1
, 1972, pp. 40-65
On classes of program schemata
R.L. Constable
,
D. Gries
SIAM Journal on Computing
1
, 1972, pp. 66-118
Some undecidability results for parallel program schemata
R.E. Miller
SIAM Journal on Computing
1
, 1972, pp. 119-130
The transitive reduction of a directed graph
A.V. Aho
,
M.R. Garey
,
J.D. Ullman
SIAM Journal on Computing
1
, 1972, pp. 131-137
Asymptotic service system output, with application to multiprogramming
D.P. Gaver
SIAM Journal on Computing
1
, 1972, pp. 138-145
Depth-first search and linear graph algorithms
R.E. Tarjan
SIAM Journal on Computing
1
, 1972, pp. 146-160
A note on merging
A.G. Konheim
SIAM Journal on Computing
1
, 1972, pp. 161-166
Computational complexity of iterative process
J.F. Traub
SIAM Journal on Computing
1
, 1972, pp. 167-179
Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph
Fȃnicȃ Gavril
SIAM Journal on Computing
1
, 1972, pp. 180-187
Flow graph reducibility
M.S. Hecht
,
J.D. Ullman
SIAM Journal on Computing
1
, 1972, pp. 188-202
Expectations of functions of sequences over finite alphabets with given transition probabilities by methods independent of sequence length
D.M. Jackson
SIAM Journal on Computing
1
, 1972, pp. 203-217
Locality in page reference strings
G.S. Shedler
,
C. Tung
SIAM Journal on Computing
1
, 1972, pp. 218-241
Program schemes with pushdown stores
S. Brown
,
D. Gries
,
T. Szymanski
SIAM Journal on Computing
1
, 1972, pp. 242-268
Analysis of scanning policies for reducing disk seek times
E.G. Coffman
,
L.A. Klimko
,
B. Ryan
SIAM Journal on Computing
1
, 1972, pp. 269-280
On languages accepted in polynomial time
R.V. Book
SIAM Journal on Computing
1
, 1972, pp. 281-287
A note on the intersection of complexity classes of functions
L.J. Bass
SIAM Journal on Computing
1
, 1972, pp. 288-289
Analysis and synthesis of sorting algorithms
C.L. Liu
SIAM Journal on Computing
1
, 1972, pp. 290-304
A minimum distance error-correcting parser for context-free languages
A.V. Aho
,
T.G. Peterson
SIAM Journal on Computing
1
, 1972, pp. 305-312
Compatibility and complexity of refinements of the resolution principle
R.B. Kieburtz
,
D. Luckham
SIAM Journal on Computing
1
, 1972, pp. 313-332
Real-time strict deterministic languages
M.A. Harrison
,
I.M. Havel
SIAM Journal on Computing
1
, 1972, pp. 333-349
Infix to prefix translation: The insufficiency of a pushdown stack
E.M. Reingold
SIAM Journal on Computing
1
, 1972, pp. 350-353