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=SIAM J. Comput. AND YEAR=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A randomized algorithm for closest-point queries
Kenneth L. Clarkson
SIAM Journal on Computing
17
, 1988, pp. 830-847
Efficient solutions to some transportation problems with applications to minimizing robot arm travel
Mikhail J. Atallah
,
S. Rao Kosaraju
SIAM Journal on Computing
17
, 1988, pp. 849-869
Probing convex polygons with X-rays
Herbert Edelsbrunner
,
Steven S. Skiena
SIAM Journal on Computing
17
, 1988, pp. 870-882
Deferred data structuring
Richard M. Karp
,
Rajeev Motwani
,
Prabhakar Raghavan
SIAM Journal on Computing
17
, 1988, pp. 883-902
On sets truth-table reducible to sparse sets
Ronald V. Book
,
Ker-I Ko
SIAM Journal on Computing
17
, 1988, pp. 903-919
An approximation scheme for finding Steiner trees with obstacles
J. Scott Provan
SIAM Journal on Computing
17
, 1988, pp. 920-934
Nondeterministic space is closed under complementation
Neil Immerman
SIAM Journal on Computing
17
, 1988, pp. 935-938
Varieties of iteration theories
Stephen L. Bloom
,
Zoltan Esik
SIAM Journal on Computing
17
, 1988, pp. 939-966
On the complexity of computing the volume of a polyhedron
M.E. Dyer
,
A.M. Frieze
SIAM Journal on Computing
17
, 1988, pp. 967-974
Fault tolerance in networks of bounded degree
Cynthia Dwork
,
David Peleg
,
Nicholas Pippenger
,
Eli Upfal
SIAM Journal on Computing
17
, 1988, pp. 975-988
Natural self-reducible sets
Alan L. Selman
SIAM Journal on Computing
17
, 1988, pp. 989-996
Axiomatising finite concurrent processes
Matthew Hennessy
SIAM Journal on Computing
17
, 1988, pp. 997-1017
A linear algorithm for topological bandwidth in degree-three trees
Zevi Miller
SIAM Journal on Computing
17
, 1988, pp. 1018-1035
Optimal bounds for solving tridiagonal systems with preconditioning
Paolo Zellini
SIAM Journal on Computing
17
, 1988, pp. 1036-1043
Average-case lower bounds for searching
Colin McDiarmid
SIAM Journal on Computing
17
, 1988, pp. 1044-1060
Efficient solution of connectivity problems on hierarchically defined graphs
Thomas Lengauer
,
Egon Wanke
SIAM Journal on Computing
17
, 1988, pp. 1063-1080
A fast parallel algorithm for determining all roots of a polynomial with real roots
Michael Ben-Or
,
Ephraim Feig
,
Dexter Kozen
,
Prasoon Tiwari
SIAM Journal on Computing
17
, 1988, pp. 1081-1092
A lower bound on the complexity of the union-split-find problem
Kurt Mehlhorn
,
Stefan Näher
,
Helmut Alt
SIAM Journal on Computing
17
, 1988, pp. 1093-1102
A short-term neural network memory
Robert J.T. Morris
,
Wing Swing Wong
SIAM Journal on Computing
17
, 1988, pp. 1103-1118
Transitive orientations of graph
Béla Bollobás
,
Graham Brightwell
SIAM Journal on Computing
17
, 1988, pp. 1119-1133
Readies and failures in the algebra of communicating processes
J.A. Bergstra
,
J.W. Klop
,
E.-R. Olderog
SIAM Journal on Computing
17
, 1988, pp. 1134-1177
The average complexity of deterministic and randomized parallel comparison-sorting algorithms
N. Alon
,
Y. Azar
SIAM Journal on Computing
17
, 1988, pp. 1178-1192
P-printable sets
Eric W. Allender
,
Roy S. Rubinstein
SIAM Journal on Computing
17
, 1988, pp. 1193-1202
Search in an ordered array having variable probe cost
William J. Knight
SIAM Journal on Computing
17
, 1988, pp. 1203-1214
The decomposition of a rectangle into rectangles of minimal perimeter
T.Y. Kong
,
David M. Mount
,
A.W. Roscoe
SIAM Journal on Computing
17
, 1988, pp. 1215-1231
Seiten
<
1
2
3
>