Erdös Number

My Erdös number (shortest academic path to Paul Erdös) is four, thanks to Oded Maler who has Erdös number three.
The following is one chain of collaborations.

Erdös Number Project

P.Niebert, M. Mahfoudh, Eugene Asarin, Marius Bozga, Navendu Jain and Oded Maler
Verification of Timed Automata via Satisfiability Checking
In proceedings of 7th International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems FTRTFT '02
pages 225-244, Oldenburg, Germany, September 2002.

Oded Maler and Amir Pnueli.
Tight Bounds on the Complexity of Cascaded Decomposition of Automata.
In IEEE Foundations of Computer Science FOCS '90
pages 672-682, 1990.

Dov M. Gabbay, Amir Pnueli, Saharon Shelah, and Jonathan Stavi.
On the Temporal Basis of Fairness.
In Seventh Annual ACM Symposium on Principles of Programming Languages POPL'90
pages 163-173, Las Vegas, Nevada, January 1980.

Paul Erdös and Saharon Shelah.
Separability properties of almost-disjoint families of sets.
Israel J Math 12
pages 207-214, 1972.