McVitie DG, Wilson LB (1971) The stable marriage problem. Commun ACM 14(7):486--492 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Partial Order Reduction in Directed Model Checking - Lluch-Lafuente, Edelkamp, Leue (2002) (Correct)
.... protocol [4] leader) the CORBA GIOP protocol [12] giop) the tele Available at www.informatik.uni freiburg.de lafuente hsf spin Available at netlib.bell labs.com netlib spin phony model POTS [13] pots) and a model of a concurrent program that solves the stable marriage problem [17] (marriers) The considered versions of these protocols violate certain safety properties. 4.1 Exhaustive exploration The objective of the first set of experiments is to showhow the differentvariants of the C3 condition perform. We expect that stronger C3 conditions according to hierarchy in ....
D. McVitie and L. Wilson. The stable marriage problem. Communications of the ACM, 14(7):486--492, 1971.
Partial Order Reduction in Directed Model Checking - Lluch-Lafuente, Edelkamp, Leue (2002) (Correct)
....3 Available at netlib.bell labs.com netlib spin :p :p ff fi ff fi p p :p ff fi p p Fig. 4. Example of a full state space (left) and a reduction (right) phony model 4 [14] pots) and a model of a concurrent program that solves the stable marriage problem [18] (marriers) The considered versions of these protocols violate certain safety properties. 4.1 Exhaustive Exploration The objective of the first set of experiments is to show how the different variants of the C3 condition perform. We expect that stronger C3 conditions according to hierarchy in ....
D. McVitie and L. Wilson. The stable marriage problem. Communications of the ACM, 14(7):486--492, 1971.
Directed Explicit-State Model Checking in the.. - Edelkamp, Leue.. (2001) (3 citations) (Correct)
.... performed using the CORBA GIOP protocol [19] with a configuration of 2 clients and 1 server, an 8 philosophers configuration of the dining philosophers problem, a model of an optical telegraph protocol [17] with 6 stations and a model of a concurrent program that solves the stable marriage problem [25] with a configuration of 3 suitors. Assertion violation detection experiments are carried out with Lynch protocol, with a model of a relay circuit and with a faulty solution for the mutual exclusion problem (mutex) 6 . Invariant violation is evaluated using the POTS telephony model [20]7 ....
D.G. McVitie and L.B. Wilson. The stable marriage problem. Communications of the ACM,1971.
Partial Order Reduction in Directed Model Checking - Lluch-Lafuente, Edelkamp, Leue (Correct)
....for some of the experiments. We use a set of Promela models as benchmarks including a model of a leader election protocol 5 [4] leader) the CORBA GIOP protocol [13] giop) the telephony model POTS 6 [14] pots) and a model of a concurrent program that solves the stable marriage problem [18] (marriers) The considered versions of these protocols violate certain safety properties. 4.1 Exhaustive exploration The objective of the first set of experiments is to show how the different variants of the C3 condition perform. We expect that stronger C3 conditions according to hierarchy in ....
D. McVitie and L. Wilson. The stable marriage problem. Communications of the ACM, 14(7):486--492, 1971.
Directed Explicit Model Checking with HSF-SPIN - Edelkamp, Lafuente, Leue (2001) (16 citations) (Correct)
.... bit protocol, Barlett s protocol, an erroneous solution for mutual exclusion (mutex) 3 ,theoptical telegraph protocol [17] an elevator model 4 , a deadlock solution to Dijkstra s dining philosopher problem, and a model of a concurrent program that solves the stable marriage problem [23]. Real World examples that we use include the Basic Call processing protocol [24] a model of a relay circuit [27] the Group Address Registration Protocol GARP [25] the CORBA GIOP protocol [18] and the telephony model POTS [19] 5 . Precursory Work. The precursor [10] to this paper considers ....
D. McVitie and L. Wilson. The stable marriage problem. Communications of the ACM, 1971.
Directed Explicit Model Checking with HSF-SPIN - Edelkamp, Lluch-Lafuente, Leue (2001) (16 citations) (Correct)
.... bit protocol, Barlett s protocol, an erroneous solution for mutual exclusion (mutex) 2 ,theoptical telegraph protocol [17] an elevator model 3 , a deadlock solution to Dijkstra s dining philosopher problem, and a model of a concurrent program that solves the stable marriage problem [22]. Real World examples that we use include the Basic Call processing protocol [23] a model of a relay circuit [28] the Group Address Registration Protocol GARP [24] the CORBA GIOP protocol [18] and the telephony model POTS [19] 4 . Precursory Work. The precursor [10] to this paper considers ....
D. McVitie and L. Wilson. The stable marriage problem. Communications of the ACM, 1971.
On Finding a Stable Roommate, Job, or Spouse: A Case Study.. - Astrachan (Correct)
....data structures and algorithms texts shows that only a few cover the stable marriage problem [Kor86] Sed90] Wir76] Sedgewick briefly mentions the relationship to the Hospitals Residents problem, but none of the books either gives or discusses solutions to this version of the problem. McVitie [MW71] discusses the stable marriage problem and gives code for generating all stable matches procedure MakeMatch(var hospitalList : HospitalListType; var residentList : ResidentListType) var currentHospital, resident : integer; begin while PositionsExist(hospitalList) do begin fstill unfilled ....
D.G. McVitie and L.B. Wilson. The stable marriage problem. Communciations of the ACM, 14(7):486--492, 1971.
Three-dimensional Stable Matching Problems - Ng, Hirschberg (1991) (2 citations) (Correct)
....which we name the 3 gender stable marriage problem (or 3GSM for short) and define in the next section. The stable roommate and stable marriage problems have been studied extensively [3] 4] 5] 9] There exist efficient algorithms for both problems that run in 3 O(n 2 ) time [1] 6] [10]. Ng and Hirschberg have obtained lower bound results proving that these algorithms are asymptotically optimal [12] Since no significant improvement is possible on the original problems, it is then natural to consider their three dimensional generalizations, 3GSM and 3PSA. This is one of twelve ....
McVitie, D. G. and L. B. Wilson. The stable marriage problem. Comm. ACM 14 (1971), 486--492.
Partial-Order Reduction and Trail Improvement in.. - Edelkamp.. (2004) (2 citations) (Correct)
No context found.
McVitie DG, Wilson LB (1971) The stable marriage problem. Commun ACM 14(7):486--492
Directed Explicit-State Model Checking in the.. - Edelkamp, Leue.. (2002) (3 citations) (Correct)
No context found.
D.G. McVitie and L.B. Wilson. The stable marriage problem. Communications of the ACM, 14(7):486--492, 1971.
Directed Explicit-State Model Checking in the.. - Edelkamp, Leue.. (2004) (3 citations) (Correct)
No context found.
McVitie, D.G., Wilson, L.B.: The stable marriage problem. Communications of the ACM, 14(7): 486--492, 1971
Partial Order Reduction in Directed Model Checking - Lluch-Lafuente, Edelkamp, Leue (2001) (Correct)
No context found.
D. McVitie and L. Wilson. The stable marriage problem. Communications of the ACM, 14(7):486--492, 1971.
Trail-Directed Model Checking - Edelkamp, Lluch-Lafuente, Leue (2001) (6 citations) (Correct)
No context found.
D. McVitie and L. Wilson. The stable marriage problem. Communications of the ACM, 14(7):486--492, 1971.
Directed Search for the Verification of Communication Protocols - Lafuente (2003) (Correct)
No context found.
D. G. McVitie and L. B. Wilson. The stable marriage problem. Communications of the ACM, 14(7):486--492, 1971.
The Stable Marriage Problem With Restricted Pairs - Ania Dias Guilherme (Correct)
No context found.
D. McVitie and L. Wilson, The stable marriage problem, Comm. ACM, (July 1971), pp. 486-490.
Directed Explicit Model Checking with HSF-SPIN - Edelkamp, Lafuente, Leue (2001) (16 citations) (Correct)
No context found.
D. McVitie and L. Wilson. The stable marriage problem. Communications of the ACM, 1971.
Gale-Shapley Stable Marriage Problem Revisited: Strategic.. - Teo, Sethuraman, Tan (2000) (Correct)
No context found.
McVitie, D. G., L. B. Wilson (1971). The Stable Marriage Problem. Communications of the A.C.M. 10 486-490 .
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC