1991 Athens Open – Doubles

Doubles
	1991 Athens Open
Champions	Jacco Eltingh; Mark Koevermans
Runners-up	Menno Oosting; Olli Rahnasto
Final score	5–7, 7–6, 7–5

Sergio Casal and Javier Sánchez were the defending champions, but Casal did not participate this year. Sánchez partnered Goran Prpić, losing in the first round.

Jacco Eltingh and Mark Koevermans won in the final 5–7, 7–6, 7–5, against Menno Oosting and Olli Rahnasto.

Seeds

Goran Prpić / Javier Sánchez (First Round)
Jacco Eltingh / Mark Koevermans (Champions)
Menno Oosting / Olli Rahnasto (Final)
Per Henricsson / Ola Jonsson (Semifinals)

Draw

Key

Draw

First Round					Quarterfinals					Semifinals					Final

1	G Prpić J Sánchez	6	2	3
	JC Báguena M Jaite	1	6	6		JC Báguena M Jaite	5	1
	T Kempers M Mortensen	6	7	6		T Kempers M Mortensen	7	6
	J Wöhrmann M Zoecke	7	6	1							T Kempers M Mortensen	6	2	5
3	M Oosting O Rahnasto	6	7							3	M Oosting O Rahnasto	3	6	7
	W Kowalski Jacco Van Duyn	2	5		3	M Oosting O Rahnasto	3	6	6
WC	Andreas Fikas G Kalovelonis	4	2			G Markus F Yunis	6	0	3
	G Markus F Yunis	6	6												3	M Oosting O Rahnasto	7	6	5
	R Furlan J Gisbert-Schultze	3	6	2											2	J Eltingh M Koevermans	5	7	7
	G Martínez TJ Middleton	6	2	6		G Martínez TJ Middleton	2	1
	J Arrese E Masso	1	4		4	P Henricsson O Jonsson	6	6
4	P Henricsson O Jonsson	6	6							4	P Henricsson O Jonsson	6	6	4
	A Gaudenzi T Muster	6	6							2	J Eltingh M Koevermans	2	7	6
Q	Talito Corrales A Kitinov	1	2			A Gaudenzi T Muster	1	3
	F Clavet M Filippini	5	6		2	J Eltingh M Koevermans	6	6
2	J Eltingh M Koevermans	7	7

gollark: Writing a bare metal microkernel in Haskell is not very practical.

gollark: > I never tried it. It's nice that it has these safety features but I prefer C++ still. > If I want to be sure that my program is free of bugs, I can write a formal specification and do a > correctness proof with the hoare calculus in some theorem proofer (People did that for the seL4 microkernel, which is free from bugs under some assumptions and used in satellites, nuclear power plants and such)Didn't doing that for seL4 require several hundred thousand lines of proof code?

gollark: Most countries have insanely convoluted tax law so I assume it's possible.

gollark: Hmm, so you need to obtain a hypercomputer of some sort to write your tax forms such that they cannot plausibly be checked?

gollark: What if it's somehow really easy to find *a* solution to something, but not specific ones, and hard to check the validity of a specific maybe-solution? Is that possible?

References

Draw

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.