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=Algorithmica AND YEAR=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate option pricing
P. Chalasani
,
S. Jha
,
I. Saias
Algorithmica
25
(1), 1999, pp. 2-21
On capital investment
Y. Azar
,
Y. Bartal
,
E. Feuerstein
,
A. Fiat
,
S. Leonardi
,
A. Rosén
Algorithmica
25
(1), 1999, pp. 22-36
Efficient on-line nonparametric kernel density estimation
C.G. Lambert
,
S.E. Harrington
,
C.R. Harvey
,
A. Glodjo
Algorithmica
25
(1), 1999, pp. 37-57
Parallel strategies for computing the orthogonal factorizations used in the estimation of econometric models
E.J. Kontoghiorghes
Algorithmica
25
(1), 1999, pp. 58-74
Analysis of the SSAP method for the numerical valuation of high-dimensional multivariate American securities
L.N. Coyle
,
J.J. Yang
Algorithmica
25
(1), 1999, pp. 75-98
A risk-reward framework for the competitive analysis of financial games
S. Al-Binali
Algorithmica
25
(1), 1999, pp. 99-115
Competitive optimal on-line leasing
R. El-Yaniv
,
R. Kaniel
,
N. Linial
Algorithmica
25
(1), 1999, pp. 116-140
Parallel biomolecular computation: Models and simulations
J.H. Reif
Algorithmica
25
(2-3), 1999, pp. 142-175
On the linear-cost subtree-transfer distance between phylogenetic trees
B. DasGupta
,
X. He
,
T. Jiang
,
M. Li
,
J. Tromp
Algorithmica
25
(2-3), 1999, pp. 176-195
Evolutionary trees and ordinal assertions
P.E. Kearney
,
R.B. Hayward
,
H. Meijer
Algorithmica
25
(2-3), 1999, pp. 196-221
Molecular computing, bounded nondeterminism, and effcient recursion
R. Beigel
,
B. Fu
Algorithmica
25
(2-3), 1999, pp. 222-238
Simulating Boolean circuits on a DNA computer
M. Ogihara
,
A. Ray
Algorithmica
25
(2-3), 1999, pp. 239-250
The performance of neighbor-joining methods of phylogenetic reconstruction
K. Atteson
Algorithmica
25
(2-3), 1999, pp. 251-278
On the intractability of protein folding with a finite alphabet of amino acids
J. Atkins
,
W.E. Hart
Algorithmica
25
(2-3), 1999, pp. 279-294
Mass estimation of DNA molecules and extraction of ordered restriction maps in optical mapping imagery
L. Parida
,
D. Geiger
Algorithmica
25
(2-3), 1999, pp. 295-310
Approximation algorithms for the fixed-topology phylogenetic number problem
M. Cryan
,
L.A. Goldberg
,
C.A. Phillips
Algorithmica
25
(2-3), 1999, pp. 311-329
An algorithm for identifying similar amino acid clusters among different alpha-helical coiled-coil proteins using their secondary structure
T.C. Ip
,
V.A. Fischetti
,
J.P. Schmidt
Algorithmica
25
(2-3), 1999, pp. 330-346
Computational approaches to drug design
P.W. Finn
,
L.E. Kavraki
Algorithmica
25
(2-3), 1999, pp. 347-371
Computer algebra methods for studying and computing molecular conformations
I.Z. Emiris
,
B. Mourrain
Algorithmica
25
(2-3), 1999, pp. 372-402
The seat reservation problem
J. Boyar
,
K.S. Larsen
Algorithmica
25
(4), 1999, pp. 403-417
Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
M. Zachariasen
,
P. Winter
Algorithmica
25
(4), 1999, pp. 418-437
Optimal deterministic sorting and routing on grids and tori with diagonals
M. Kunde
,
R. Niedermeier
,
K. Reinhardt
,
P. Rossmanith
Algorithmica
25
(4), 1999, pp. 438-458
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
M.R. Henzinger
,
V. King
,
T. Warnow
Algorithmica
24
(1), 1999, pp. 1-13
Efficiency of randomized parallel backtrack search
Yanjun Zhang
,
A. Ortynski
Algorithmica
24
(1), 1999, pp. 14-28
On-line resource management with application to routing and scheduling
S. Leonardi
,
A. Marchetti-Spaccamela
Algorithmica
24
(1), 1999, pp. 29-49
Seiten 1
2
3
>