1989 Virginia Slims of California – Doubles

Rosemary Casals and Martina Navratilova were the defending champions but lost in the semifinals to Larisa Savchenko and Natasha Zvereva.

Doubles
1989 Virginia Slims of California
1988 Champions Rosemary Casals
Martina Navratilova
Champions Patty Fendick
Jill Hetherington
Runners-up Larisa Savchenko
Natasha Zvereva
Final score7–5, 3–6, 6–2

Patty Fendick and Jill Hetherington won in the final 7–5, 3–6, 6–2 against Savchenko and Zvereva.

Seeds

Champion seeds are indicated in bold text while text in italics indicates the round in which those seeds were eliminated.

  1. Larisa Savchenko / Natasha Zvereva (Final)
  2. Patty Fendick / Jill Hetherington (Champions)
  3. Gigi Fernández / Eva Pfaff (First Round)
  4. Elise Burgin / Rosalyn Fairbank (First Round)

Draw

Key

First Round Quarterfinals Semifinals Final
1 L Savchenko
N Zvereva
6 6  
  J Byrne
R White
2 2   1 L Savchenko
N Zvereva
6 6  
  L Bartlett
A M Fernandez
4 3     G Magers
D van Rensburg
1 1  
  G Magers
D van Rensburg
6 6   1 L Savchenko
N Zvereva
3 6 6
4 E Burgin
R Fairbank
4 3     R Casals
M Navratilova
6 3 4
  R Casals
M Navratilova
6 6     R Casals
M Navratilova
6 6  
  A Henricksson
S Walsh-Pete
5 3     B Herr
C Reynolds
4 3  
  B Herr
C Reynolds
7 6   1 Larisa Savchenko
Natasha Zvereva
5 6 2
  L Antonoplis
J Smoller
7 1 6 2 Patty Fendick
Jill Hetherington
7 3 6
  Ca MacGregor
Cy MacGregor
6 6 7   Ca MacGregor
Cy MacGregor
5 6  
  Z Garrison
K Rinaldi
7 6     Z Garrison
K Rinaldi
7 7  
3 G Fernández
E Pfaff
5 4     Z Garrison
K Rinaldi
2 6 6
  C Benjamin
E Reinach
6 6   2 P Fendick
J Hetherington
6 4 7
  I Demongeot
N Tauziat
3 4     C Benjamin
E Reinach
6 1 6
  M Lindström
H Ludloff
4 7 4 2 P Fendick
J Hetherington
2 6 7
2 P Fendick
J Hetherington
6 6 6
gollark: Or implode.
gollark: Or explode.
gollark: There was already a qntm story on infinite computing, but not sinthorionized infinite processing finite memory computing.
gollark: Probably ways to use memory very efficiently, and tricks to stick as much as possible into read-only program memory?
gollark: Well, you can't emulate it very usefully since modern computers run finitely fast still. And I don't know what sort of features you'd need instead of just a generic normal instruction set.

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.