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=15
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Integration in finite terms with special functions: The logarithmic integral
G.W. Cherry
SIAM Journal on Computing
15
(1), 1986, February, pp. 1-21
An amortized analysis of insertions into AVL-trees
K. Mehlhorn
,
A. Tsakalidis
SIAM Journal on Computing
15
(1), 1986, February, pp. 22-33
The signature of a plane curve
J. O'Rourke
SIAM Journal on Computing
15
(1), 1986, February, pp. 34-51
Self-adjusting heaps
D.D. Sleator
,
R.E. Tarjan
SIAM Journal on Computing
15
(1), 1986, February, pp. 52-69
The complexity of languages generated by attribute grammars
J. Engelfriet
SIAM Journal on Computing
15
(1), 1986, February, pp. 70-86
Upper and lower time bounds for parallel random access machines without simultaneous writes
S. Cook
,
C. Dwork
,
R. Reischuk
SIAM Journal on Computing
15
(1), 1986, February, pp. 87-97
The Boyer-Moore-Galil string searching strategies revisited
A. Apostolico
,
R. Giancarlo
SIAM Journal on Computing
15
(1), 1986, February, pp. 98-105
Efficient simulations among several models of parallel computers
F. Meyer auf der Heide
SIAM Journal on Computing
15
(1), 1986, February, pp. 106-119
An
O(EV\log V)
algorithm for finding a maximal weighted matching in general graphs
Z. Galil
,
S. Micali
,
H. Gabow
SIAM Journal on Computing
15
(1), 1986, February, pp. 120-130
Optimal termination protocols for network partitioning
F. Chin
,
K.V.S. Ramarao
SIAM Journal on Computing
15
(1), 1986, February, pp. 131-144
Computational complexity: on the geometry of polynomials and a theory of cost: II
M. Shub
,
S. Smale
SIAM Journal on Computing
15
(1), 1986, February, pp. 145-161
A provably good algorithm for the two module routing problem
B.S. Baker
SIAM Journal on Computing
15
(1), 1986, February, pp. 162-188
Alphabetic minimax trees of degree at most
t
D. Coppersmith
,
M.M. Klawe
,
N.J. Pippenger
SIAM Journal on Computing
15
(1), 1986, February, pp. 189-192
On shortest paths in polyhedral spaces
M. Sharir
,
A. Schorr
SIAM Journal on Computing
15
(1), 1986, February, pp. 193-215
An efficient algorithm for generating linear transformations in a shuffle-exchange network
T. Etzion
,
A. Lempel
SIAM Journal on Computing
15
(1), 1986, February, pp. 216-221
Variable sized bin packing
D.K. Friesen
,
M.A. Langston
SIAM Journal on Computing
15
(1), 1986, February, pp. 222-230
Logarithmic depth circuits for algebraic functions
J.H. Reif
SIAM Journal on Computing
15
(1), 1986, February, pp. 231-242
Algebraic computations of scaled Pade fractions
Stanley Cabey
,
Dong-Koo Choi
SIAM Journal on Computing
15
(1), 1986, February, pp. 243-270
Constructing belts in two-dimensional arrangements with applications
H. Edelsbrunner
,
E. Welzl
SIAM Journal on Computing
15
(1), 1986, February, pp. 271-284
Average case complete problems
L.A. Levin
SIAM Journal on Computing
15
(1), 1986, February, pp. 285-286
Computing the largest empty rectangle
B. Chazelle
,
R.L. Drysdale
,
D.T. Lee
SIAM Journal on Computing
15
(1), 1986, February, pp. 300-315
Optimal point location in a monotone subdivision
H. Edelsbrunner
,
L.J. Guibas
,
J. Stolfi
SIAM Journal on Computing
15
(2), 1986, May, pp. 317-340
Constructing arrangements of lines and hyperplanes with applications
H. Edelsbrunner
,
J. O'Rourke
,
R. Seidel
SIAM Journal on Computing
15
(2), 1986, May, pp. 341-363
A simple unpredictable pseudo-random number generator
L. Blum
,
M. Blum
,
M. Shub
SIAM Journal on Computing
15
(2), 1986, May, pp. 364-383
Evaluating rational functions: infinite precision is finite cost and tractable on average
L. Blum
,
M. Shub
SIAM Journal on Computing
15
(2), 1986, May, pp. 384-398
Seiten 1
2
3
4
>