Fast Detection of Stable and Count Predicates in Parallel Computations

DOI10.4230/LIPIcs.OPODIS.2017.20zbMath1487.68115OpenAlexW2795121527MaRDI QIDQ3300821

Himanshu Chauhan, Vijay K. Garg

Publication date: 30 July 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/opodis/opodis2017.html#ChauhanG17

zbMATH Keywords

parallel programspredicate detection

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• QuickLex
• jPredictor
• FastTrack
• AVIO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
• An algorithm to generate the ideals of a partial order
• Gray codes from antimatroids
• An optimal algorithm to find the jump number of partially ordered sets
• Techniques and applications of computation slicing
• Two Basic Algorithms in Concept Analysis
• The Jump Number of Dags and Posets: An Introduction
• Time, clocks, and the ordering of events in a distributed system
• College Admissions and the Stability of Marriage
• Efficient algorithms on distributive lattices

This page was built for publication: Fast Detection of Stable and Count Predicates in Parallel Computations