Stable husbands

Authors:
Donald E. Knuth;Rajeev Motwani;Boris Pittel
Affiliations:
Department of Computer Science, Stanford University, Stanford, CA;Department of Computer Science, Stanford University, Stanford, CA;Department of Computer Science, Stanford University, Stanford, CA
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

Citing 5
Cited 1

The complexity of counting stable marriages

SIAM Journal on Computing
Three fast algorithms for four problems in stable marriage

SIAM Journal on Computing
The stable marriage problem

Communications of the ACM
Concrete Math

Concrete Math
Rounding Errors in Algebraic Processes

Rounding Errors in Algebraic Processes

Marriage, honesty, and stability

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract