2008 SAP Open – Doubles
Eric Butorac and Jamie Murray were the defending champions. They were both present but did not compete together.
Butorac partnered with Todd Perry, but lost in the first round to Sanchai Ratiwatana and Sonchat Ratiwatana.
Murray partnered with Max Mirnyi, but lost in the quarterfinals to Steve Darcis and Kristof Vliegen.
Doubles | |
---|---|
2008 SAP Open | |
Champions | ![]() ![]() |
Runners-up | ![]() ![]() |
Final score | 7–6(4), 7–5 |
Scott Lipsky and David Martin won in the final 7–6(4), 7–5, against Bob Bryan and Mike Bryan.
Seeds
Bob Bryan / Mike Bryan (Final) Mahesh Bhupathi / Mark Knowles (Quarterfinals) Max Mirnyi / Jamie Murray (Quarterfinals) Eric Butorac / Todd Perry (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
Draw
First Round | Quarterfinals | Semifinals | Final | ||||||||||||||||||||||||
1 | ![]() ![]() | 6 | 77 | ||||||||||||||||||||||||
![]() ![]() | 3 | 64 | 1 | ![]() ![]() | 6 | 4 | [10] | ||||||||||||||||||||
WC | ![]() ![]() | 6 | 6 | WC | ![]() ![]() | 3 | 6 | [5] | |||||||||||||||||||
![]() ![]() | 4 | 4 | 1 | ![]() ![]() | 6 | 77 | |||||||||||||||||||||
3 | ![]() ![]() | 6 | 6 | ![]() ![]() | 2 | 62 | |||||||||||||||||||||
![]() ![]() | 4 | 4 | 3 | ![]() ![]() | 4 | 6 | [6] | ||||||||||||||||||||
WC | ![]() ![]() | 6 | 68 | [7] | ![]() ![]() | 6 | 3 | [10] | |||||||||||||||||||
![]() ![]() | 2 | 7 | [10] | 1 | ![]() ![]() | 64 | 5 | ||||||||||||||||||||
![]() ![]() | 68 | 4 | ![]() ![]() | 77 | 7 | ||||||||||||||||||||||
![]() ![]() | 710 | 6 | ![]() ![]() | 69 | 5 | ||||||||||||||||||||||
![]() ![]() | 77 | 6 | ![]() ![]() | 711 | 7 | ||||||||||||||||||||||
4 | ![]() ![]() | 64 | 4 | ![]() ![]() | 63 | 3 | |||||||||||||||||||||
![]() ![]() | 6 | 3 | [10] | ![]() ![]() | 77 | 6 | |||||||||||||||||||||
![]() ![]() | 4 | 6 | [12] | ![]() ![]() | 2 | 77 | [10] | ||||||||||||||||||||
![]() ![]() | 2 | 3 | 2 | ![]() ![]() | 6 | 65 | [8] | ||||||||||||||||||||
2 | ![]() ![]() | 6 | 6 |
gollark: But surely you can just ??? trampoline to give it arbitrary stack depth.
gollark: osmarkscalculator™ knows about associativity and commutativity, thus good.
gollark: Make it have an unboundedly apiolarge stack?
gollark: Destroy universe if list unsorted: O(1).
gollark: I know - in real life your stuff would just lie on the ground and vanish after 5 minutes - but we must make sacrifices for fun.
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.