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 YEAR=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A fast approximation algorithm for computing the frequencies of subgraphs in a given graph
Richard A. Duke
,
Hanno Lefmann
,
Vojtȇch Rödl
SIAM Journal on Computing
24
(3), 1995, pp. 598-620
A variational method for analysing unit clause search
H.-M. Méjean
,
Henri Morel
,
Gérard Reynaud
SIAM Journal on Computing
24
(3), 1995, pp. 621-649
A general approach to removing degeneracies
Ioannis Z. Emiris
,
John F. Canny
SIAM Journal on Computing
24
(3), 1995, pp. 650-664
A priori bounds on the Euclidean traveling salesman
Timothy Law Snyder
,
J. Michael Steele
SIAM Journal on Computing
24
(3), 1995, pp. 665-671
On the generation of random binary search trees
Luc Devroye
,
John Michael Robson
SIAM Journal on Computing
24
(6), 1995, pp. 1141-1156
On the variance of the height of random binary search trees
Luc Devroye
,
Bruce Reed
SIAM Journal on Computing
24
(6), 1995, pp. 1157-1162
Constructing Huffman trees in parallel
Lawrence L. Larmore
,
Teresa M. Przytycka
SIAM Journal on Computing
24
(6), 1995, pp. 1163-1169
Weakly hard problems
Jack H. Lutz
SIAM Journal on Computing
24
(6), 1995, pp. 1170-1189
Data-structural bootstrapping, linear path compression, and catenable heap-ordered double-ended queues
Adam L. Buchsbaum
,
Rajamani Sundar
,
Robert E. Tarjan
SIAM Journal on Computing
24
(6), 1995, pp. 1190-1206
Adaptive pattern matching
R.C. Sekar
,
R. Ramesh
,
I.V. Ramakrishnan
SIAM Journal on Computing
24
(6), 1995, pp. 1207-1234
Finding regular simple paths in graph databases
Alberto O. Mendelzon
,
Peter T. Wood
SIAM Journal on Computing
24
(6), 1995, pp. 1235-1258
Identifying the minimal transversals of a hypergraph and related problems
Thomas Eiter
,
Georg Gottlob
SIAM Journal on Computing
24
(6), 1995, pp. 1278-1304
On the reuse of additions in matrix multiplication
K. Kalorkoti
SIAM Journal on Computing
24
(6), 1995, pp. 1305-1312
Scheduling parallel machines on-line
David B. Shmoys
,
Joel Wein
,
David P. Williamson
SIAM Journal on Computing
24
(6), 1995, pp. 1313-1331
Computing minimal spanning subgraphs in linear time
Xiaofeng Han
,
Pierre Kelsen
,
Yijaya Ramachandran
,
Robert Tarjan
SIAM Journal on Computing
24
(6), 1995, pp. 1322-1358
Seiten
<
1
2