human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "The topology of shared-memory adversaries"
  Abstract: Failure patterns in modern parallel and distributed system are not necessarily uniform. The notion of an  adversary scheduler  is a natural way to extend the classical wait-free and  t -faulty models of computation. A well-established way to characterize an adversary is by its set of cores, where a  core  is any minimal set of processes that cannot all fail in any execution. We show that the protocol complex associated with an adversary is ( c -2)-connected, where  c  is the size of the adversary's smallest core. This implies, among other results, that such an adversary can solve  c -set agreement, but not ( c -1)-set agreement. The proofs are combinatorial, relying on a novel application of the Nerve Theorem of modern combinatorial topology.

Connected through hyperedge HE-1 (induced by source paper "Distributed programming with tasks"):
  with members:
    (none)

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Computer science