Kim Grajdek
Kim-Alice Grajdek (born 30 March 1991) is a German tennis player.
Grajdek at the 2016 Engie Open de Cagnes-sur-Mer Alpes-Maritimes | |
Full name | Kim-Alice Grajdek |
---|---|
Country (sports) | |
Born | Langenhagen, Germany | 30 March 1991
Height | 1.75 m (5 ft 9 in) |
Plays | Right-handed (double-handed backhand) |
Prize money | $64,182 |
Singles | |
Career record | 144–217 |
Career titles | 1 ITF |
Highest ranking | 405 (21 November 2011) |
Current ranking | 1113 (27 June 2016) |
Doubles | |
Career record | 131–130 |
Career titles | 8 ITF |
Highest ranking | 332 (5 August 2013) |
Current ranking | 486 (27 June 2016) |
Last updated on: 27 June 2016. |
Grajdek has won one singles and eight doubles titles on the ITF tour in her career. On 21 November 2011, she reached her best singles ranking of world number 405. On 5 August 2013, she peaked at world number 332 in the doubles rankings.
ITF finals (9–16)
Singles (1–1)
|
|
Result | No. | Date | Category | Tournament | Surface | Opponent | Score |
---|---|---|---|---|---|---|---|
Runner-up | 1. | 31 January 2011 | $10,000 | Coimbra, Portugal | Hard | 5–7, 0–4, ret. | |
Winner | 1. | 8 September 2014 | $10,000 | Antalya, Turkey | Hard | 6–3, 6–4 |
Doubles (8–15)
|
|
Result | No. | Date | Category | Tournament | Surface | Partner | Opponents | Score |
---|---|---|---|---|---|---|---|---|
Runner-up | 1. | 25 January 2010 | $10,000 | Kaarst, Germany | Carpet (i) | 4–6, 4–6 | ||
Runner-up | 2. | 14 June 2010 | $10,000 | Montemor-o-Novo, Portugal | Hard | 6–7(3–7), 1–6 | ||
Runner-up | 3. | 12 July 2010 | $10,000 | Cáceres, Spain | Hard | 5–7, 4–6 | ||
Winner | 1. | 20 September 2010 | $10,000 | Thessaloniki, Greece | Clay | 6–2, 6–3 | ||
Winner | 2. | 31 January 2011 | $10,000 | Coimbra, Portugal | Hard | 7–6(7–1), 6–3 | ||
Winner | 3. | 2 May 2011 | $10,000 | Petroupoli, Greece | Hard | 3–6, 6–3, [10–6] | ||
Runner-up | 4. | 23 May 2011 | $10,000 | Paros, Greece | Carpet | 6–3, 0–6, [9–11] | ||
Winner | 4. | 3 October 2011 | $10,000 | Madrid, Spain | Hard | 6–3, 6–3 | ||
Runner-up | 5. | 13 August 2012 | $10,000 | Ratingen, Germany | Clay | 3–6, 4–6 | ||
Runner-up | 6. | 20 August 2012 | $10,000 | Braunschweig, Germany | Clay | 1–6, 3–6 | ||
Winner | 5. | 3 December 2012 | $10,000 | Potchefstroom, South Africa | Hard | 2–6, 6–4, [10–8] | ||
Runner-up | 7. | 10 December 2012 | $10,000 | Potchefstroom, South Africa | Hard | w/o | ||
Winner | 6. | 18 March 2013 | $10,000 | Sharm el-Sheikh, Egypt | Hard | 6–2, 6–1 | ||
Runner-up | 8. | 24 February 2014 | $10,000 | Palma Nova, Spain | Clay | 2–6, 6–7(3–7) | ||
Runner-up | 9. | 10 March 2014 | $10,000 | Santa Margherita di Pula, Italy | Clay | 3–6, 7–5, [8–10] | ||
Winner | 7. | 5 May 2014 | $10,000 | Båstad, Sweden | Clay | 7–5, 6–4 | ||
Runner-up | 10. | 23 February 2015 | $10,000 | Palma Nova, Spain | Clay | 2–6, 4–6 | ||
Runner-up | 11. | 2 March 2015 | $10,000 | Antalya, Turkey | Clay | 6–7(0–7), 5–7 | ||
Runner-up | 12. | 9 March 2015 | $10,000 | Antalya, Turkey | Clay | 6–7(6–8), 4–6 | ||
Runner-up | 13. | 6 April 2015 | $15,000 | León, Mexico | Hard | 7–5, 6–7(5–7), [4–10] | ||
Runner-up | 14. | 24 August 2015 | $10,000 | Antalya, Turkey | Hard | 3–6, 3–6 | ||
Winner | 8. | 2 November 2015 | $10,000 | Oslo, Norway | Hard (i) | 6–2, 6–3 | ||
Runner-up | 15. | 16 November 2015 | $25,000 | Zawada, Poland | Carpet (i) | 2–6, 3–6 |
gollark: You could, but hash functions are designed not to exhibit any patterns.
gollark: This sort of thing is very good at the particular task it's optimized for, but expensive (initial-cost-wise, it's easy to churn out more of them) and entirely unable to do anything else, unlike general-purpose CPUs/GPUs, which are also hilariously expensive in initial investment but can do basically anything and are reusable all over the place.
gollark: Fortunately, we have good cryptography now as export controls were stupid and didn't actually work.
gollark: Well, "very good" varies.
gollark: Also, you shouldn't avoid asking questions, but remember that AI things are hard, don't work like humans, and aren't magic but very good pattern-matchy algorithms.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.