Laurent Hyafil

According to our database, Laurent Hyafil authored at least 10 papers between 1974 and 1984.

Collaborative distances:

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

1984

New Algorithms for Selection.

Prakash V. Ramanan, Laurent Hyafil

J. Algorithms, 1984

1979

On the Parallel Evaluation of Multivariate Polynomials.

Laurent Hyafil

SIAM J. Comput., 1979

1977

The Complexity of Parallel Evaluation of Linear Recurrences.

Laurent Hyafil, H. T. Kung

J. ACM, 1977

The Power of Commutativity

Laurent Hyafil

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976

Bounds for Selection.

Laurent Hyafil

SIAM J. Comput., 1976

Constructing Optimal Binary Decision Trees is NP-Complete.

Laurent Hyafil, Ronald L. Rivest

Inf. Process. Lett., 1976

1975

On the Additive Complexity of Specific Polynomials.

Laurent Hyafil, Jean-Paul Van de Wiele

Inf. Process. Lett., 1975

The Complexity of Parallel Evaluation of Linear Recurrence

Laurent Hyafil, H. T. Kung

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974

An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract)

Laurent Hyafil, F. Prusker, Jean Vuillemin

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Design of Optimal Merge on Direct Access Devices.

Laurent Hyafil, F. Prusker, Jean Vuillemin

Proceedings of the Information Processing, 1974