Amanote Research

Amanote Research

    RegisterSign In

A Memory Efficient Version of Satoh’s Algorithm

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-44987-6_1
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2001

Authors
Frederik VercauterenBart PreneelJoos Vandewalle
Publisher

Springer Berlin Heidelberg


Related search

A Memory Efficient Algorithm for Adaptive Multidimensional Integration With Multiple GPUs

2013English

A Space-Efficient Parallel Algorithm for Computing Betweenness Centrality in Distributed Memory

2010English

A MEMORY EFFICIENT ALGORITHM FOR STRUCTURAL ALIGNMENT OF RNAs WITH EMBEDDED SIMPLE PSEUDOKNOTS

2007English

A Modified Version of the Waxman Algorithm

Journal of Physics A: Mathematical and Theoretical
StatisticsProbabilityNonlinear PhysicsSimulationMathematical PhysicsStatisticalModelingAstronomyPhysics
2007English

A Weak Version of Bivariate Lack of Memory Property

Brazilian Journal of Probability and Statistics
StatisticsProbability
2018English

An Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems

2006English

A Deflated Version of the Conjugate Gradient Algorithm

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2000English

A Parallel Version for the Propagation Algorithm

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

An Efficient Tasks Scheduling Algorithm for Distributed Memory Machines With Communication Delays

Information Technology Journal
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy