scientific article; zbMATH DE number 4117855

zbMATH Open0682.68052MaRDI QIDQ4732113

Philip Klein

Publication date: 1989

Title of this publication is not available (Why is that?)

zbMATH Keywords

reachabilitydirected graphsparse graphspreprocessing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Interdefinability of parallel operations in PCF ⋮ Fast Detection of Stable and Count Predicates in Parallel Computations ⋮ Non-speculative and upward invocation of continuations in a parallel language ⋮ Parallel Repetition of Computationally Sound Protocols Revisited ⋮ Expressibility and Parallel Complexity ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Parallel algorithms and correctness in parallel programs 👍 👎
• Structural synthesis of parallel programs (methodology and tools) 👍 👎
• Theory and practice of parallelism detection in sequential programs 👍 👎
• Theoretical and applied aspects of structured parallel programming 👍 👎
• Foundations of Parallel Programming 👍 👎

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 Q4732113)