Marta Fraga
Marta Fraga Pérez (born 4 February 1985) is a Spanish former professional tennis player.
Full name | Marta Fraga Pérez |
---|---|
Country (sports) | ![]() |
Born | Zaragoza, Spain | 4 February 1985
Turned pro | 2000 |
Plays | Right-handed (double-handed backhand) |
Prize money | $41,250 |
Singles | |
Career record | 138–57 |
Career titles | 0 WTA, 9 ITF |
Highest ranking | No. 270 (11 October 2004) |
Doubles | |
Career record | 61–29 |
Career titles | 9 ITF |
Highest ranking | No. 342 (29 November 2004) |
She won the French Open girls’ doubles championship in 2003 with her compatriot Adriana González Peñas.
As a professional, her highest career singles ranking is world No. 270, achieved on 11 October 2004. In November 2004, she peaked at No. 342 in the doubles rankings.
In her career, Fraga won nine singles and nine doubles titles on the ITF circuit.
Junior Grand Slam finals
Doubles (1–0)
Outcome | Year | Tournament | Surface | Partner | Opponents | Score |
Winner | 2003 | French Open | Clay | ![]() |
![]() ![]() |
6–0, 6–3 |
ITF finals
$100,000 tournaments |
$75,000 tournaments |
$50,000 tournaments |
$25,000 tournaments |
$10,000 tournaments |
Singles: 13 (9–4)
Outcome | No. | Date | Tournament | Surface | Opponent | Score |
---|---|---|---|---|---|---|
Winner | 1. | 25 November 2001 | Mallorca, Spain | Clay | ![]() |
0–6, 6–2, 6–3 |
Runner-up | 2. | 17 February 2002 | Vilamoura, Portugal | Hard | ![]() |
7–6(7–5), 4–6, 2–6 |
Winner | 3. | 27 October 2002 | Seville, Spain | Clay | ![]() |
7–5, 6–4 |
Winner | 4. | 2 March 2003 | Grand Canary, Spain | Clay | ![]() |
6–3, 7–5 |
Runner-up | 5. | 11 May 2003 | Tortosa, Spain | Clay | ![]() |
2–6, 6–4, 3–6 |
Winner | 6. | 13 July 2003 | Getxo, Spain | Clay | ![]() |
w/o |
Runner-up | 7. | 31 August 2003 | Coimbra, Portugal | Hard | ![]() |
4–6, 3–6 |
Winner | 8. | 28 September 2003 | Murcia, Spain | Clay | ![]() |
1–6, 6–2, 6–2 |
Winner | 9. | 23 November 2003 | Barcelona, Spain | Clay | ![]() |
6–4, 5–7, 6–4 |
Runner-up | 10. | 21 March 2004 | Rome, Italy | Clay | ![]() |
1–6, 2–6 |
Winner | 11. | 3 May 2004 | Tortosa, Spain | Clay | ![]() |
6–4, 6–4 |
Winner | 12. | 10 May 2004 | Monzón, Spain | Hard | ![]() |
6–0, 6–4 |
Winner | 13. | 23 May 2004 | Santa Cruz de Tenerife, Spain | Hard | ![]() |
7–5, 6–2 |
Doubles: 14 (9–5)
Outcome | No. | Date | Tournament | Surface | Partner | Opponents | Score |
---|---|---|---|---|---|---|---|
Runner-up | 1. | 17 February 2002 | Vilamoura, Portugal | Hard | ![]() |
![]() ![]() |
2–6, 5–7 |
Winner | 2. | 12 May 2002 | Tortosa, Spain | Clay | ![]() |
![]() ![]() |
7–5, 6–1 |
Winner | 3. | 14 July 2002 | Getxo, Spain | Clay | ![]() |
![]() ![]() |
6–3, 6–4 |
Winner | 4. | 15 September 2002 | Madrid, Spain | Clay | ![]() |
![]() ![]() |
6–3, 6–0 |
Runner-up | 5. | 22 September 2002 | Barcelona, Spain | Clay | ![]() |
![]() ![]() |
4–6, 4–6 |
Winner | 6. | 2 March 2003 | Grand Canary, Spain | Clay | ![]() |
![]() ![]() |
2–6, 7–5, 6–3 |
Runner-up | 7. | 13 July 2003 | Getxo, Spain | Clay | ![]() |
![]() ![]() |
w/o |
Winner | 8. | 10 August 2003 | Vigo, Spain | Hard | ![]() |
![]() ![]() |
w/o |
Winner | 9. | 26 October 2003 | Seville, Spain | Clay | ![]() |
![]() ![]() |
5–7, 6–3, 6–1 |
Winner | 10. | 23 November 2003 | Barcelona, Spain | Clay | ![]() |
![]() ![]() |
6–3, 6–3 |
Winner | 11. | 3 May 2004 | Tortosa, Spain | Clay | ![]() |
![]() ![]() |
4–6, 6–4, 6–4 |
Runner-up | 12. | 6 September 2004 | Madrid, Spain | Hard | ![]() |
![]() ![]() |
3–6, 6–7(3–7) |
Winner | 13. | 18 February 2006 | Mallorca, Spain | Clay | ![]() |
![]() ![]() |
6–4, 7–5 |
Runner-up | 14. | 26 March 2006 | Sabadell, Spain | Hard | ![]() |
![]() ![]() |
1–6, 1–6 |
gollark: Yes.
gollark: No idea, perhaps something where the majority of data is immutable or something like that, with hardware GC.
gollark: A functional language would probably allow things to be mapped to SIMD instructions neatly as you generally do explicit high-level operations like map on immutable data.
gollark: No idea.
gollark: Erlang uses an "actor model", as I mentioned, where you have threads communicating through message queues, which is probably good for server-type applications.
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.