2009 Stuttgart Open – Singles
Juan Martín del Potro was the defending champion, but chose not to participate that year.
Singles | |
---|---|
2009 Stuttgart Open | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 1–6, 6–3, 6–4 |
Jérémy Chardy won in the final 1–6, 6–3, 6–4 against Victor Hănescu.
Seeds
Gilles Simon (Second Round) Nikolay Davydenko (Quarterfinals) Tomáš Berdych (First Round) Victor Hănescu (Final) Philipp Kohlschreiber (Second Round) Albert Montañés (withdrew) Fabrice Santoro (First Round) José Acasuso (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 | ||||||||||||
![]() | 6 | 7 | |||||||||||
![]() | 3 | 5 | |||||||||||
![]() | 1 | 6 | 6 | ||||||||||
4 | ![]() | 6 | 3 | 4 | |||||||||
4 | ![]() | 6 | 64 | 6 | |||||||||
![]() | 3 | 7 | 2 | ||||||||||
Top half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 6 | 6 | ||||||||||||||||||||||||
![]() | 3 | 4 | 1 | ![]() | 3 | 2 | |||||||||||||||||||||
![]() | 6 | 6 | ![]() | 6 | 6 | ||||||||||||||||||||||
![]() | 2 | 4 | ![]() | 64 | 1 | ||||||||||||||||||||||
![]() | 6 | 3 | 0 | ![]() | 7 | 6 | |||||||||||||||||||||
![]() | 3 | 6 | 6 | ![]() | 6 | 3 | 1 | ||||||||||||||||||||
![]() | 6 | 7 | ![]() | 2 | 6 | 6 | |||||||||||||||||||||
8 | ![]() | 2 | 64 | ![]() | 6 | 7 | |||||||||||||||||||||
3 | ![]() | 3 | 3 | ![]() | 3 | 5 | |||||||||||||||||||||
![]() | 6 | 6 | ![]() | 6 | 6 | ||||||||||||||||||||||
![]() | 64 | 65 | WC | ![]() | 3 | 4 | |||||||||||||||||||||
WC | ![]() | 7 | 7 | ![]() | 6 | 6 | |||||||||||||||||||||
Q | ![]() | 6 | 6 | Q | ![]() | 2 | 1 | ||||||||||||||||||||
Q | ![]() | 2 | 4 | Q | ![]() | 6 | 6 | ||||||||||||||||||||
![]() | 3 | 2 | 5 | ![]() | 2 | 4 | |||||||||||||||||||||
5 | ![]() | 6 | 6 |
Bottom half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
LL | ![]() | 7 | 1 | 6 | |||||||||||||||||||||||
Q | ![]() | 63 | 6 | 2 | LL | ![]() | 2 | 6 | 6 | ||||||||||||||||||
![]() | 4 | 4 | ![]() | 6 | 4 | 3 | |||||||||||||||||||||
![]() | 6 | 6 | LL | ![]() | 62 | 4 | |||||||||||||||||||||
![]() | 6 | 62 | 4 | 4 | ![]() | 7 | 6 | ||||||||||||||||||||
![]() | 2 | 7 | 6 | ![]() | 2 | 1 | |||||||||||||||||||||
Q | ![]() | 4 | 66 | 4 | ![]() | 6 | 6 | ||||||||||||||||||||
4 | ![]() | 6 | 7 | 4 | ![]() | 6 | 64 | 6 | |||||||||||||||||||
7 | ![]() | 7 | 63 | 1 | ![]() | 3 | 7 | 2 | |||||||||||||||||||
![]() | 5 | 7 | 6 | ![]() | 6 | 4 | |||||||||||||||||||||
![]() | 64 | 64 | ![]() | 4 | 1 | r | |||||||||||||||||||||
![]() | 7 | 7 | ![]() | 6 | 3 | 7 | |||||||||||||||||||||
WC | ![]() | 0 | 7 | 7 | 2 | ![]() | 1 | 6 | 5 | ||||||||||||||||||
WC | ![]() | 6 | 63 | 64 | WC | ![]() | 3 | 3 | |||||||||||||||||||
![]() | 6 | 5 | 3 | 2 | ![]() | 6 | 6 | ||||||||||||||||||||
2 | ![]() | 4 | 7 | 6 |
gollark: Shor's algorithm? Yes. HOWEVER, there are algorithms designed to not be attacked by quantum stuff, yes.
gollark: Public key crypto stuff?
gollark: Guess what? We can already basically do that with cryptographic primitives, but people use them wrong and the rest of the systems are terrible.
gollark: People also overhype it and talk about how you can get "unhackable" communication through fiddling with key exchange using fancy quantum whatever.
gollark: https://en.wikipedia.org/wiki/No-communication_theorem
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.