1994 Qatar Open – Doubles
Boris Becker and Patrik Kühnen were the defending champions, but did not participate this year.
Doubles | |
---|---|
1994 Qatar Open | |
Champions | |
Runners-up | |
Final score | 6–3, 6–3 |
Olivier Delaître and Stéphane Simian won in the final 6–3, 6–3, against Shelby Cannon and Byron Talbot.
Seeds
Jacco Eltingh / Paul Haarhuis (First Round) Luke Jensen / Murphy Jensen (First Round) Scott Melville / Gary Muller (First Round) Henrik Holm / Anders Järryd (Quarterfinals)
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 | 3 | 2 | |||||||||||||||||||||||||
6 | 6 | 6 | 6 | 6 | |||||||||||||||||||||||
6 | 6 | 3 | 7 | 4 | |||||||||||||||||||||||
4 | 3 | 6 | 6 | 2 | |||||||||||||||||||||||
3 | 4 | 2 | 7 | 4 | 6 | ||||||||||||||||||||||
6 | 6 | 6 | 6 | 2 | |||||||||||||||||||||||
5 | 6 | 2 | 4 | 7 | 6 | ||||||||||||||||||||||
7 | 1 | 6 | 3 | 3 | |||||||||||||||||||||||
Q | 7 | 6 | Q | 6 | 6 | ||||||||||||||||||||||
5 | 2 | Q | 7 | 2 | 6 | ||||||||||||||||||||||
WC | 3 | 4 | 4 | 6 | 6 | 3 | |||||||||||||||||||||
4 | 6 | 6 | Q | 6 | 2 | 6 | |||||||||||||||||||||
5 | 3 | WC | 4 | 6 | 4 | ||||||||||||||||||||||
7 | 6 | 3 | 6 | 6 | |||||||||||||||||||||||
WC | 6 | 7 | WC | 6 | 4 | 7 | |||||||||||||||||||||
2 | 3 | 6 |
gollark: I have a "great" way to do this which I think takes O(n²) space-time-beeite.
gollark: Perhaps it is also possible to construct some sort of regex/deterministic finite automaton to match things matching anagramatically.
gollark: Bogothings run in O(n!) time mostly. So just make `giveup`'s maximum be `math.factorial(len(remove_whitespace(s)))`.
gollark: Hmm, your pseudocode is almost valid python.
gollark: You COULD limit it to valid dictionary words, which could be used for purposes.
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.