Jonathan Aronson

According to our database, Jonathan Aronson authored at least 4 papers between 1984 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1998

Maximum matchings in sparse random graphs: Karp-Sipser revisited.

Jonathan Aronson, Alan M. Frieze, Boris G. Pittel

Random Struct. Algorithms, 1998

1995

Randomized Greedy Matching II.

Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen

Random Struct. Algorithms, 1995

1994

On the Greedy Heuristic for Matchings.

Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1984

Restrictions on trade in communication and information services.

Geza Feketekuty, Jonathan Aronson

Inf. Soc., 1984