1983 U.S. Clay Court Championships – Women's Doubles
Top-seeded pair Kathy Horvath and Virginia Ruzici claimed the title by defeating Gigi Fernández and Beth Herr in the final.
Women's Doubles | |
---|---|
1983 U.S. Clay Court Championships | |
Champions | ![]() ![]() |
Runners-up | ![]() ![]() |
Final score | 4–6, 7–6, 6–2 |
Seeds
A champion seed is indicated in bold text while text in italics indicates the round in which that seed was eliminated.
Kathy Horvath / Virginia Ruzici (Champions) Dianne Fromholtz / Ivanna Madruga (Quarterfinals) Elise Burgin / JoAnne Russell (Semifinals) Bonnie Gadusek / Helena Suková (Quarterfinals) Iva Budařová / Marcela Skuherská (Quarterfinals) Sandy Collins / Zina Garrison (Quarterfinals) Camille Benjamin / Mima Jaušovec (Semifinals) Patricia Medrado / Kateřina Skronská (First Round)
Draw
Key
- Q = Qualifier
- WC = Wild Card
- LL = Lucky Loser
- Alt = Alternate
- SE = Special Exempt
- PR = Protected Ranking
- ITF = ITF entry
- JE = Junior Exempt
- w/o = Walkover
- r = Retired
- d = Defaulted
Finals
Semifinals | Final | ||||||||||||
1 | ![]() ![]() | 6 | 3 | 6 | |||||||||
7 | ![]() ![]() | 1 | 6 | 2 | |||||||||
1 | ![]() ![]() | 4 | 7 | 6 | |||||||||
![]() ![]() | 6 | 6 | 2 | ||||||||||
3 | ![]() ![]() | 3 | 2 | ||||||||||
![]() ![]() | 6 | 6 | |||||||||||
Top Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||||
![]() ![]() | 1 | 2 | 1 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 6 | 2 | 7 | ![]() ![]() | 1 | 2 | |||||||||||||||||||||
![]() ![]() | 2 | 6 | 5 | 1 | ![]() ![]() | 7 | 0 | 6 | |||||||||||||||||||
![]() ![]() | 6 | 2 | 6 | 6 | ![]() ![]() | 6 | 6 | 3 | |||||||||||||||||||
![]() ![]() | 4 | 6 | 3 | ![]() ![]() | 6 | 3 | 1 | ||||||||||||||||||||
![]() ![]() | 7 | 5 | 1 | 6 | ![]() ![]() | 4 | 6 | 6 | |||||||||||||||||||
6 | ![]() ![]() | 5 | 7 | 6 | 1 | ![]() ![]() | 6 | 3 | 6 | ||||||||||||||||||
4 | ![]() ![]() | 6 | 6 | 7 | ![]() ![]() | 1 | 6 | 2 | |||||||||||||||||||
![]() ![]() | 2 | 2 | 4 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 6 | 7 | ![]() ![]() | 2 | 1 | ||||||||||||||||||||||
![]() ![]() | 4 | 6 | 4 | ![]() ![]() | 4 | 0 | |||||||||||||||||||||
![]() ![]() | 1 | 3 | 7 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 4 | 4 | ||||||||||||||||||||||
![]() ![]() | 6 | 4 | 7 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
7 | ![]() ![]() | 7 | 6 |
Bottom Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
5 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||||
![]() ![]() | 1 | 1 | 5 | ![]() ![]() | 4 | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 6 | 1 | 4 | ![]() ![]() | 6 | 4 | 2 | ||||||||||||||||||||
![]() ![]() | 2 | 6 | 6 | 5 | ![]() ![]() | 2 | 2 | ||||||||||||||||||||
![]() ![]() | 5 | 3 | 3 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 7 | 6 | ![]() ![]() | 7 | 5 | 4 | |||||||||||||||||||||
![]() ![]() | 2 | 3 | 3 | ![]() ![]() | 6 | 7 | 6 | ||||||||||||||||||||
3 | ![]() ![]() | 6 | 6 | 3 | ![]() ![]() | 3 | 2 | ||||||||||||||||||||
8 | ![]() ![]() | ![]() ![]() | 6 | 6 | |||||||||||||||||||||||
![]() ![]() | ![]() ![]() | 6 | 3 | ||||||||||||||||||||||||
![]() ![]() | 1 | 2 | ![]() ![]() | 7 | 6 | ||||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||
![]() ![]() | 2 | 6 | 6 | 2 | ![]() ![]() | 4 | 3 | ||||||||||||||||||||
![]() ![]() | 6 | 3 | 3 | ![]() ![]() | 1 | 4 | |||||||||||||||||||||
![]() ![]() | 3 | 2 | 2 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
2 | ![]() ![]() | 6 | 6 |
gollark: If I was confused like that it would only be between ones I wrote, and I only wrote 16.2 of them.
gollark: I think you're wrong.
gollark: Did I now.
gollark: I'm sure you'd like to think so.
gollark: It's simple. The initial python bit detects strings which are UTTERLY spacious, and then (in an oddly obfuscated way) ensures that each character in one string exists at least once in the other. Then, it calls the C bit with - due to odd pythonous scoping - the string without the index where they were found to match. The C bit actually does the same thing, calling back into Python afterward. If there is ever an *unmatched* character, it returns false.
External links
- "U.S. Clay Courts 1983". itftennis.com. ITF Licensing (UK) Ltd. Retrieved 2016-05-14.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.