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=14
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An optimal simulation of counter machines
P.M.B. Vitányi
SIAM Journal on Computing
14
(1), 1985, February, pp. 1-33
An optimal simulation of counter machines: The ACM case
P.M.B. Vitányi
SIAM Journal on Computing
14
(1), 1985, February, pp. 34-40
On circuit-size complexity and the low hierarchy in NP
Ker-I Ko
,
U. Schöning
SIAM Journal on Computing
14
(1), 1985, February, pp. 41-51
The complexity of distributed concurrency control
P.C. Kanellakis
,
C.H. Papadimitriou
SIAM Journal on Computing
14
(1), 1985, February, pp. 52-74
Unbounded speed variability in distributed communications systems
J.H. Reif
,
P.G. Spirakis
SIAM Journal on Computing
14
(1), 1985, February, pp. 75-92
Voronoi diagram in the Laguerre geometry and its applications
H. Imai
,
M. Iri
,
K. Murota
SIAM Journal on Computing
14
(1), 1985, February, pp. 93-105
An efficient formula for linear recurrences
C.M. Fiduccia
SIAM Journal on Computing
14
(1), 1985, February, pp. 106-112
Sparse sets in
NP-P
: Relativizations
S.A. Kurtz
SIAM Journal on Computing
14
(1), 1985, February, pp. 113-119
On fault-tolerant networks for sorting
A.C.-C. Yao
,
F.F. Yao
SIAM Journal on Computing
14
(1), 1985, February, pp. 120-128
On the expected performance of path compression algorithms
A.C.-C. Yao
SIAM Journal on Computing
14
(1), 1985, February, pp. 129-133
Finding extremal polygons
J.E. Boyce
,
D.P. Dobkin
,
R.L. Drysdale III
,
L.J. Guibas
SIAM Journal on Computing
14
(1), 1985, February, pp. 134-147
Simplicity, relativizations and nondeterminism
J.L. Balcázar
SIAM Journal on Computing
14
(1), 1985, February, pp. 148-157
Polynomial time algorithms for the min cut problem on degree restricted trees
Moon-Jung Chung
,
F. Makedon
,
I.H. Sudborough
,
J. Turner
SIAM Journal on Computing
14
(1), 1985, February, pp. 158-177
Additive complexity and zeros of real polynomials
J.J. Risler
SIAM Journal on Computing
14
(1), 1985, February, pp. 178-183
Factoring polynomials over algebraic number fields
S. Landau
SIAM Journal on Computing
14
(1), 1985, February, pp. 184-195
The computational complexity of simultaneous Diophantine approximation problems
J.C. Lagarias
SIAM Journal on Computing
14
(1), 1985, February, pp. 196-209
Arboricity and subgraph listing algorithms
N. Chiba
,
T. Nishizeki
SIAM Journal on Computing
14
(1), 1985, February, pp. 210-223
Maximum weight clique algorithms for circular-arc graphs and circle graphs
W.-L. Hsu
SIAM Journal on Computing
14
(1), 1985, February, pp. 224-231
New data structures for orthogonal range queries
D.E. Willard
SIAM Journal on Computing
14
(1), 1985, February, pp. 232-253
Addendum: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
R.E. Tarjan
,
M. Yannakakis
SIAM Journal on Computing
14
, 1985, pp. 254-256
Priority search trees
E.M. McCreight
SIAM Journal on Computing
14
(2), 1985, May, pp. 257-276
On the complexity of maintaining partial sums
A.C.-C. Yao
SIAM Journal on Computing
14
(2), 1985, May, pp. 277-288
An efficient algorithm for finding multicommodity flows in planar networks
K. Matsumoto
,
T. Nishizeki
,
N. Saito
SIAM Journal on Computing
14
(2), 1985, May, pp. 289-302
Trade-offs between depth and width in parallel computation
U. Vishkin
,
A. Wigderson
SIAM Journal on Computing
14
(2), 1985, May, pp. 303-314
On the movement of robot arms in 2-dimensional bounded regions
J. Hopcroft
,
D. Joseph
,
S. Whitesides
SIAM Journal on Computing
14
(2), 1985, May, pp. 315-333
Seiten 1
2
3
>