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 Volume=12
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The computational complexity of continued fractions
V. Strassen
SIAM Journal on Computing
12
(1), 1983, February, pp. 1-27
Optimal search in planar subdivisions
D. Kirkpatrick
SIAM Journal on Computing
12
(1), 1983, February, pp. 28-35
Tools for template dependencies
R. Fagin
,
D. Maier
,
J.D. Ullman
,
M. Yannakakis
SIAM Journal on Computing
12
(1), 1983, February, pp. 36-59
Bounds for multifit scheduling on uniform processors
D.K. Friesen
,
M.A. Langston
SIAM Journal on Computing
12
(1), 1983, February, pp. 60-70
Minimum
s-t
cut of a planar undirected network in
O(n\log^2(n))
time
J.H. Reif
SIAM Journal on Computing
12
(1), 1983, February, pp. 71-81
A technique for establishing completeness results in theorem proving with equality
G.E. Peterson
SIAM Journal on Computing
12
(1), 1983, February, pp. 82-100
Characterization of division algebras of minimal rank and the structure of their algorithm varieties
H.F. de Groote
SIAM Journal on Computing
12
(1), 1983, February, pp. 101-117
Divide and conquer heuristics for minimum weighted Euclidean matching
K.J. Supowit
,
E.M. Reingold
SIAM Journal on Computing
12
(1), 1983, February, pp. 118-143
The traveling salesman problem and minimum matching in the unit square
K.J. Supowit
,
E.M. Reingold
,
D.A. Plaisted
SIAM Journal on Computing
12
(1), 1983, February, pp. 144-156
Simple constructions for multi-terminal network flow synthesis
D. Gusfield
SIAM Journal on Computing
12
(1), 1983, February, pp. 157-165
Formal semantics and abstract properties of string pattern operations and extended formal language description mechanisms
A.C. Fleck
,
R.S. Limaye
SIAM Journal on Computing
12
(1), 1983, February, pp. 166-188
On proving uniform termination and restricted termination of rewriting systems
J.V. Guttag
,
D. Kapur
,
D.R. Musser
SIAM Journal on Computing
12
, 1983, pp. 189-214
Concurrency control by locking
C.H. Papadimitriou
SIAM Journal on Computing
12
, 1983, pp. 215-226
Dynamic bin packing
E.G., Jr. Coffman
,
M.R. Garey
,
D.S. Johnson
SIAM Journal on Computing
12
(2), 1983, May, pp. 227-258
Whether a set of multivalued dependencies implies a join dependency is
NP
-hard
P.C. Fischer
,
D.-M. Tsou
SIAM Journal on Computing
12
(2), 1983, May, pp. 259-266
The equivalence of two semantic definitions: a case study in LCF
A. Cohn
SIAM Journal on Computing
12
(2), 1983, May, pp. 267-285
Computing rational zeros of integral polynomials by p-adic expansion
R. Loos
SIAM Journal on Computing
12
(2), 1983, May, pp. 286-293
Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines
B. Simons
SIAM Journal on Computing
12
(2), 1983, May, pp. 294-299
Properties of finite and pushdown transducers
C. Choffrut
,
K. Culik II
SIAM Journal on Computing
12
(2), 1983, May, pp. 300-315
Quadratic algorithms for minimizing joins in restricted relational expressions
Y. Sagiv
SIAM Journal on Computing
12
(2), 1983, May, pp. 316-328
The worst and the most probable performance of a class of set-covering algorithms
V. Lifschitz
,
B. Pittel
SIAM Journal on Computing
12
(2), 1983, May, pp. 329-346
Towards a genuinely polynomial algorithm for linear programming
N. Megiddo
SIAM Journal on Computing
12
(2), 1983, May, pp. 347-353
VLSI algorithms for the connected component problem
S.E. Hambrusch
SIAM Journal on Computing
12
(2), 1983, May, pp. 354-365
Initial and final algebra semantics for data type specifications: two characterization theorems
J.A. Bergstra
,
J.V. Tucker
SIAM Journal on Computing
12
(2), 1983, May, pp. 366-387
Some time-space tradeoff results concerning single-tape and offline TM's
O.H. Ibarra
,
S. Moran
SIAM Journal on Computing
12
(2), 1983, May, pp. 388-394
Seiten 1
2
3
>