Lars Eilstrup Rasmussen

According to our database, Lars Eilstrup Rasmussen authored at least 5 papers between 1994 and 2002.

Collaborative distances:

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

2002

Clifford algebras and approximating the permanent.

Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

1998

Parallel randomized load balancing.

Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen

Random Struct. Algorithms, 1998

1997

Approximately counting cliques.

Lars Eilstrup Rasmussen

Random Struct. Algorithms, 1997

1995

Parallel randomized load balancing (Preliminary Version).

Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

Approximating the Permanent: A Simple Approach.

Lars Eilstrup Rasmussen

Random Struct. Algorithms, 1994