Koumoutsakos, Petros
Harvard University · ETH Zurich
7 papers on CoChatORCID 0000-0001-8337-2122
Most cited papers
- Verified
Machine Learning for Fluid Mechanics
Brunton, S. L., Noack, B. R., & Koumoutsakos, P. (2020) · Annual Review of Fluid Mechanics
Model Reduction and Neural NetworksMachine Learning in Materials Science
Cited by 3,063
- Verified
Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES)
Hansen, N., Müller, S. D., & Koumoutsakos, P. (2003) · Evolutionary Computation
Metaheuristic Optimization Algorithms ResearchEvolutionary Algorithms and Applications
Cited by 2,601
- Verified
Synchronisation through learning for two self-propelled swimmers
Novati, G., Verma, S., Alexeev, D., Rossinelli, D., van Rees, W. M., & Koumoutsakos, P. (2017) · Bioinspiration & Biomimetics
Biomimetic flight and propulsion mechanismsMicro and Nano Robotics
Cited by 157
- Verified · note
The Fluid Mechanics of Cancer and Its Therapy
Koumoutsakos, P., Pivkin, I., & Milde, F. (2013) · Annual Review of Fluid Mechanics
Mathematical Biology Tumor GrowthCellular Mechanics and Interactions
Cited by 129
- Verified
Learning efficient navigation in vortical flow fields
Gunnarson, P., Mandralis, I., Novati, G., Koumoutsakos, P., & Dabiri, J. O. (2021) · Nature Communications
Reinforcement Learning in RoboticsBiomimetic flight and propulsion mechanisms
Cited by 108
- Verified
Structure and Response to Flow of the Glycocalyx Layer
Cruz-Chu, E. R., Malafeev, A., Pajarskas, T., Pivkin, I. V., & Koumoutsakos, P. (2014) · Biophysical Journal
Proteoglycans and glycosaminoglycans researchLipid Membrane Structure and Behavior
Cited by 87
- Verified
Efficient collective swimming by harnessing vortices through deep reinforcement learning
Verma, S., Novati, G., & Koumoutsakos, P. (2018) · Proceedings of the National Academy of Sciences
Biomimetic flight and propulsion mechanismsFluid Dynamics and Turbulent Flows
Cited by 10
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free