8 papers:
TAP-2014-KanigCCGMR #verification- Explicit Assumptions — A Prenup for Marrying Static and Dynamic Program Verification (JK, RC, CC, JG, YM, ER), pp. 142–157.
FASE-2012-MahouachiKG #classification #design #detection #fault- A New Design Defects Classification: Marrying Detection and Correction (RM, MK, KG), pp. 455–470.
PODS-2007-Alur #word- Marrying words and trees (RA), pp. 233–242.
ESEC-FSE-2007-ParreirasSW #metamodelling #on the #ontology #technological space- On marrying ontological and metamodeling technical spaces (FSP, SS, AW), pp. 439–448.
VLDB-2005-BonifatiCHLP #database #named #xml- HePToX: Marrying XML and Heterogeneity in Your P2P Databases (AB, EQC, TH, LVSL, RP), pp. 1267–1270.
ICSE-2000-Rifkin #diagrams #precedence- When the project absolutely must get done: marrying the organization chart with the precedence diagram (SR), pp. 588–596.
STOC-1988-Broder #approximate #how #random- Errata to “How hard is to marry at random? (On the approximation of the permanent)” (AZB), p. 551.
- STOC-1986-Broder #approximate #how #random
- How hard is to marry at random? (On the approximation of the permanent) (AZB), pp. 50–58.
