scientific article; zbMATH DE number 1163093

MaRDI QIDQ4394581zbMATH OpenFDO

Authors Martin Fürer

Publication date 1 October 1998

zbMATH Keywords

efficient parallel algorithmsmassive parallelism

Mathematics Subject Classification ID

Theory of software (68N99)

Cited in

(18)

• Guide to graph algorithms. Sequential, parallel and distributed
• Parallel algorithms reconsidered (invited talk)
• scientific article; zbMATH DE number 4147533 (Why is no real title available?)
• scientific article; zbMATH DE number 4024789 (Why is no real title available?)
• scientific article; zbMATH DE number 4064461 (Why is no real title available?)
• scientific article; zbMATH DE number 4074482 (Why is no real title available?)
• The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
• scientific article; zbMATH DE number 176748 (Why is no real title available?)
• Expressibility and Parallel Complexity
• scientific article; zbMATH DE number 1235239 (Why is no real title available?)
• Paradigms for Fast Parallel Approximability
• scientific article; zbMATH DE number 1151367 (Why is no real title available?)
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• scientific article; zbMATH DE number 2090609 (Why is no real title available?)
• Parallel Algorithms with Processor Failures and Delays
• On the sublinear processor gap for parallel architectures
• scientific article; zbMATH DE number 2227382 (Why is no real title available?)
• Computing functions with parallel queries to NP

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394581)