scientific article; zbMATH DE number 4092750
From MaRDI portal
Publication:3819986
zbMATH Open0667.68035MaRDI QIDQ3819986FDOQ3819986
Authors: Prakash Panangaden, Vasant Shanbhogue 
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
- The merger-paradox: a tournament-based solution
- scientific article; zbMATH DE number 3890714
- On the inefficiency of merger control
- scientific article; zbMATH DE number 4001497
- An impossibility theorem for allocation aggregation
- Strategy-proof and fair assignment is wasteful
- Weak and strong fairness in CCS
- scientific article; zbMATH DE number 3878339
- Impossibility of stable and nonbossy matching mechanisms
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Cited In (5)
- The expressive power of indeterminate primitives in asynchronous computation
- On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
- Title not available (Why is that?)
- Nonexpressibility of fairness and signaling
- Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog
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 Q3819986)
