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 Volume=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Searching for a mobile intruder in a polygonal region
Ichiro Suzuki
,
Masafumi Yamashita
SIAM Journal on Computing
21
(5), 1992, October, pp. 863-888
Determinism vs.\ nondeterminism in multiparty communication complexity
Danny Dolev
,
Tomás Feder
SIAM Journal on Computing
21
(5), 1992, October, pp. 889-895
On threshold circuits and polynomial computation
John H. Reif
,
Stephen R. Tate
SIAM Journal on Computing
21
(5), 1992, October, pp. 896-908
Generalizing the continued fraction algorithm to arbitrary dimensions
Bettina Just
SIAM Journal on Computing
21
(5), 1992, October, pp. 909-926
Laying out graphs using queues
Lenwood S. Heath
,
Arnold L. Rosenberg
SIAM Journal on Computing
21
(5), 1992, October, pp. 927-958
Optimal on-line simulations of tree machines by random access machines
Michael C. Loui
,
David R. Luginbuhl
SIAM Journal on Computing
21
(5), 1992, October, pp. 959-971
New results on dynamic planar point location
Siu Wing Cheng
,
Ravi Janardan
SIAM Journal on Computing
21
(5), 1992, October, pp. 972-999
Reducing the Steiner problem in a normed space
D.Z. Du
,
F.K. Hwang
SIAM Journal on Computing
21
(6), 1992, December, pp. 1001-1007
On the computational complexity of approximating solutions for real algebraic formulae
James Renegar
SIAM Journal on Computing
21
(6), 1992, December, pp. 1008-1025
An
O(n^2\log n)
algorithm for the Hamiltonian cycle problem on circular-arc graphs
Wei-Kuan Shih
,
T.C. Chern
,
Wen-Lian Hsu
SIAM Journal on Computing
21
(6), 1992, December, pp. 1026-1046
Fully dynamic algorithms for 2-edge connectivity
Zvi Galil
,
Giuseppe F. Italiano
SIAM Journal on Computing
21
(6), 1992, December, pp. 1047-1069
Work-optimal asynchronous algorithms for shared memory parallel computers
Charles Martel
,
Arvin Park
,
Ramesh Subramonian
SIAM Journal on Computing
21
(6), 1992, December, pp. 1070-1099
Polynomial time productivity, approximations, and levelability
Jie Wang
SIAM Journal on Computing
21
(6), 1992, December, pp. 1100-1111
Optimal reduction of two-terminal directed acyclic graphs
Wolfgang W. Bein
,
Jerzy Kamburowski
,
Matthias F.M. Stallmann
SIAM Journal on Computing
21
(6), 1992, December, pp. 1112-1129
Preemptive ensemble motion planning on a tree
Greg N. Frederickson
,
D.J. Guan
SIAM Journal on Computing
21
(6), 1992, December, pp. 1130-1152
Lower bounds on universal traversal sequences for cycles and other low degree graphs
Martin Tompa
SIAM Journal on Computing
21
(6), 1992, December, pp. 1153-1160
Approximation and small-depth Frege proofs
Stephen Bellantoni
,
Toniann Pitassi
,
Alasdair Urquhart
SIAM Journal on Computing
21
(6), 1992, December, pp. 1161-1179
External internal nodes in digital search trees via Mellin transforms
Helmut Prodinger
SIAM Journal on Computing
21
(6), 1992, December, pp. 1180-1183
Verification and sensitivity analysis of minimum spanning trees in linear time
Brandon Dixon
,
Monika Rauch
,
Robert E. Tarjan
SIAM Journal on Computing
21
(6), 1992, December, pp. 1184-1192
Optimal algorithms for multiplication in certain finite fields using elliptic curves
Mohammed Amin Shokrollahi
SIAM Journal on Computing
21
(6), 1992, December, pp. 1193-1198
Seiten
<
1
2
3