◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Schaller

123 papers hereh-index 5311.6k citations243 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author1
  • middle author83
  • last author18

Across the 103 of 123 papers where every author was matched, so the position is known.

fields
  • astro-ph.GA69
  • astro-ph.CO48
  • cs.DC3
  • astro-ph.IM2
  • cs.PF1
same name
  • M. Schaller — 40 papers, h 18
  • M. Schaller — 20 papers, h 2
  • M. Schaller — 6 papers, h 2
  • M. Schaller — 3 papers, h 1
  • M. Schaller — 1 paper, h 40

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20152026
most citedEnergy equipartition between stellar and dark matter particles in cosmological simulations results in spurious growth of galaxy sizes

99 citations · 614 across the 62 of their papers we have counts for

collaborators
Showing cs.DCShow all

3 papers · 1 filter

cs.DC2020

A Hybrid MPI+Threads Approach to Particle Group Finding Using Union-Find

James S. Willis, Matthieu Schaller, Pedro Gonnet +1

The Friends-of-Friends (FoF) algorithm is a standard technique used in cosmological N-body simulations to identify structures. Its goal is to find clusters of particles (called g…

cs.DC2018

SWIFT: Maintaining weak-scalability with a dynamic range of 104 in time-step size to harness extreme adaptivity

Josh Borrow, Richard G. Bower, Peter W. Draper +2

Cosmological simulations require the use of a multiple time-stepping scheme. Without such a scheme, cosmological simulations would be impossible due to their high level of dynamic…

cs.DC2018

An Efficient SIMD Implementation of Pseudo-Verlet Lists for Neighbour Interactions in Particle-Based Codes

James S. Willis, Matthieu Schaller, Pedro Gonnet +2

In particle-based simulations, neighbour finding (i.e finding pairs of particles to interact within a given range) is the most time consuming part of the computation. One of the be…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.