Rumen Andonov
Rumen Andonov
professeur d'informatique, Université de Rennes 1
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Unbounded knapsack problem: Dynamic programming revisited
R Andonov, V Poirriez, S Rajopadhye
European Journal of Operational Research 123 (2), 394-407, 2000
Unbounded knapsack problem: Dynamic programming revisited
R Andonov, V Poirriez, S Rajopadhye
European Journal of Operational Research 123 (2), 394-407, 2000
A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem
S Balev, N Yanev, A Fréville, R Andonov
European journal of operational research 186 (1), 63-76, 2008
Optimal orthogonal tiling of 2-D iterations
R Andonov, S Rajopadhye
Journal of Parallel and Distributed computing 45 (2), 159-165, 1997
Optimal semi-oblique tiling
R Andonov, S Balev, S Rajopadhye, N Yanev
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001
A hybrid algorithm for the unbounded knapsack problem
V Poirriez, N Yanev, R Andonov
Discrete Optimization 6 (1), 110-124, 2009
Maximum contact map overlap revisited
R Andonov, N Malod-Dognin, N Yanev
Journal of Computational Biology 18 (1), 27-41, 2011
Efficient multi-GPU computation of all-pairs shortest paths
H Djidjev, S Thulasidasan, G Chapuis, R Andonov, D Lavenier
2014 IEEE 28th International Parallel and Distributed Processing Symposium …, 2014
Maximum cliques in protein structure comparison
N Malod-Dognin, R Andonov, N Yanev
Experimental Algorithms: 9th International Symposium, SEA 2010, Ischia …, 2010
Protein threading: From mathematical models to parallel implementations
R Andonov, S Balev, N Yanev
INFORMS Journal on Computing 16 (4), 393-405, 2004
All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters
H Djidjev, G Chapuis, R Andonov, S Thulasidasan, D Lavenier
Journal of Parallel and Distributed Computing 85, 91-103, 2015
Dynamic programming parallel implementations for the knapsack problem
R Andonov, F Raimbault, P Quinton
INRIA, 1993
GenoFrag: software to design primers optimized for whole genome scanning by long‐range PCR amplification
N Ben Zakour, M Gautier, R Andonov, D Lavenier, MF Cochet, P Veber, ...
Nucleic Acids Research 32 (1), 17-24, 2004
Optimal orthogonal tiling
R Andonov, S Rajopadhye, N Yanev
Euro-Par’98 Parallel Processing: 4th International Euro-Par Conference …, 1998
Two-dimensional orthogonal tiling: from theory to practice
R Andonov, H Bourzoufi, S Rajopadhye
Proceedings of 3rd International Conference on High Performance Computing …, 1996
An efficient lagrangian relaxation for the contact map overlap problem
R Andonov, N Yanev, N Malod-Dognin
Algorithms in Bioinformatics: 8th International Workshop, WABI 2008 …, 2008
CSA: comprehensive comparison of pairwise protein structure alignments
I Wohlers, N Malod-Dognin, R Andonov, GW Klau
Nucleic acids research 40 (W1), W303-W309, 2012
Simple, accurate, analytical time modeling and optimal tile size selection for GPGPU stencils
N Prajapati, W Ranasinghe, S Rajopadhye, R Andonov, H Djidjev, ...
Proceedings of the 22Nd ACM SIGPLAN Symposium on Principles and Practice of …, 2017
A sparse knapsack algo-tech-cuit and its synthesis
R Andonov, S Rajopadhye
Proceedings of IEEE International Conference on Application Specific Array …, 1994
DALIX: optimal DALI protein structure alignment
I Wohlers, R Andonov, GW Klau
IEEE/ACM Transactions on Computational Biology and Bioinformatics 10 (1), 26-36, 2012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20