Publisher: Elsevier

Related content
Volume 56, Number 2, 27 October 1995

< previous issue | all issues | next issue >

Favourites:Add to Favourites

On a generalization of the p-Center Problem
pp. 67-71(5)
Author: Krumke, S.O.

Favourites:Add to Favourites
Favourites:Add to Favourites

A simpler derivation of schema hazard in genetic algorithms
pp. 77-78(2)
Author: Chakraborty, U.K.

Favourites:Add to Favourites

The worst-case running time of the random simplex algorithm is exponential in the height
pp. 79-81(3)
Authors: Broder, A.Z.; Dyer, M.E.; Frieze, A.M.; Raghavan, P.; Upfal, E.

Favourites:Add to Favourites

An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
pp. 83-87(5)
Authors: Yue-Li, W.; Hon-Chan, C.; Chen-Yu, L.

Favourites:Add to Favourites

An algorithm for ''Ulam's Game'' and its application to error correcting codes
pp. 89-93(5)
Authors: Lawler, E.L.; Sarkissian, S.

Favourites:Add to Favourites

A note on the Horton-Strahler number for random trees
pp. 95-99(5)
Authors: devroye, L.; Kruszewski, P.

Favourites:Add to Favourites
Favourites:Add to Favourites

On reductions to sets that avoid EXPSPACE
pp. 109-114(6)
Authors: Arvind, V.; Kobler, J.; Mundhenk, M.

Favourites:Add to Favourites
Favourites:Add to Favourites

A fully parallel algorithm for residue to binary conversion
pp. 121-121(1)
Authors: Barsi, F.; Pinotti, M.C.

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more