Searching for "On Multiset Orderings." – sorted by Relevance.
-
Multiset Ordering Constraints
- Multiset Ordering Constraints* Alan Frisch and Ian Miguel Dept of Computer Science University
- Cited by 6 (2 self) – Add To MetaCart
-
PROVING TERMINATION WITH MULTISET ORDERINGS by
- PROVING TERMINATION WITH MULTISET ORDERINGS by Nachum Dershowitz I and Zohar Manna 2 Stanford
- Add To MetaCart
-
An Inductive Proof of the Wellfoundedness of the Multiset Order
- An Inductive Proof of the Wellfoundedness of the Multiset Order October 12, 1998 The following note
- Cited by 4 (0 self) – Add To MetaCart
-
Algebraic System Nets for Modelling Distributed Algorithms
- is denoted by IN A . In order to indicate syntactically that m is a multiset we write m[a] instead of m
- Cited by 12 (6 self) – Add To MetaCart
-
Paper presented at the International Seminar on Income Distribution System
- show how to use our theorem to prove the well-foundedness of the lexicographic ordering, the multiset
- Cited by 1 (0 self) – Add To MetaCart
-
Privacy-preserving set operations
- computation over multisets. Each party’s input to the function is his private input multiset. In order
- Cited by 26 (0 self) – Add To MetaCart
-
Privacy-Preserving Set Operations
- computation over multisets. Each party’s input to the function is his private input multiset. In order
- Add To MetaCart
-
Analysing the Implicit Complexity of Programs
- construct a termination ordering, called light multiset path ordering (LMPO), which is a restriction
- Cited by 8 (5 self) – Add To MetaCart
-
The Calculus of Algebraic and Inductive Constructions
- rules, recursive calls can be compared through a combination of multi-set and lexicographic orderings
- Cited by 1 (0 self) – Add To MetaCart
-
Generosity Helps, or an 11-Competitive Algorithm for Three Servers
- of an initial configuration S 0 2 k M , (where k X = the set of all multisets of order k within a set X
- Cited by 15 (3 self) – Add To MetaCart

