Ann Grossman

Ann Grossman-Wunderlich (born October 13, 1970) is an American former professional tennis player.

Ann Grossman
Full nameAnn Grossman-Wunderlich
Country (sports) United States
Born (1970-10-13) October 13, 1970
Prize money$1,138,377
Singles
Career record223–201
Career titles0
Highest rankingNo. 29 (August 16, 1993)
Grand Slam Singles results
Australian Open3R (1994)
French Open4R (1989, 1990)
Wimbledon3R (1994)
US Open4R (1994)
Doubles
Career record88–155
Career titles1 WTA
Highest rankingNo. 31 (November 15, 1993)
Grand Slam Doubles results
Australian OpenQF (1994)
French Open2R (1990, 1993, 1994)
Wimbledon2R (1996)
US Open2R (1990)
Team competitions
Fed Cup2–0

Grossman was born in the United States. She competed on the WTA Tour for over a decade from 1987 to 1998. She twice reached the fourth round of the French Open and once at the US Open and was ranked as high as 29 in singles and 31 in doubles. She recorded wins over Martina Navratilova, Mary Jo Fernandez and Zina Garrison.

After Grossman retired, she has served on the USTA Olympic and Federation Cup committees.

WTA career finals

Singles (7 runner-ups)

Outcome No. Year Tournament Surface Opponent Score
Runner-up 1. 1988 San Diego, United States Hard Stephanie Rehe 1–6, 1–6
Runner-up 2. 1990 Strasbourg, France Clay Mercedes Paz 2–6, 3–6
Runner-up 3. 1992 Taipei, Taiwan Hard Shaun Stafford 1–6, 3–6
Runner-up 4. 1993 Kuala Lumpur, Malaysia Hard Nicole Bradtke 3–6, 2–6
Runner-up 5. 1993 Jakarta, Indonesia Hard Yayuk Basuki 4–6, 4–6
Runner-up 6. 1993 San Juan, Puerto Rico Hard Linda Harvey-Wild 3–6, 7–5, 3–6
Runner-up 7. 1994 Los Angeles, United States Hard Amy Frazier 1–6, 3–6

Doubles (1 title, 2 runner-ups)

Outcome No. Year Tournament Surface Partner Opponents Score
Runner-up 1. 1991 Taranto, Italy Clay Laura Golarsa Florencia Labat
Alexia Dechaume
2–6, 5–7
Runner-up 2. 1993 Indian Wells, United States Hard Patricia Hy-Boulais Helena Suková
Rennae Stubbs
3–6, 4–6
Winner 1. 1993 San Juan, Puerto Rico Hard Debbie Graham Gigi Fernández
Rennae Stubbs
5–7, 7–5, 7–5
gollark: I see.
gollark: I actually just copypastaized that from a thing I'm reading on Y combinators.
gollark: Of course it is.
gollark: Now, here's the puzzle: what if you were asked to define the factorial function in Scheme, but were told that you could not use recursive function calls in the definition (for instance, in the factorial function given above you cannot use the word factorial anywhere in the body of the function). However, you are allowed to use first-class functions and higher-order functions any way you see fit. With this knowledge, can you define the factorial function?
gollark: 2013, after Incident 2971.

References


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