BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
approxim (2)
perman (2)
random (2)
hard (2)
space (1)

Stem marri$ (all stems)

8 papers:

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

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.