Laurent Hyafil

1984
11		Prakash V. Ramanan, Laurent Hyafil: New Algorithms for Selection. J. Algorithms 5(4): 557-578 (1984)
1979
10		Laurent Hyafil: On the Parallel Evaluation of Multivariate Polynomials. SIAM J. Comput. 8(2): 120-123 (1979)
1978
9		Laurent Hyafil: On the Parallel Evaluation of Multivariate Polynomials STOC 1978: 193-195
1977
8		Laurent Hyafil: The Power of Commutativity FOCS 1977: 171-174
7	EE	Laurent Hyafil, H. T. Kung: The Complexity of Parallel Evaluation of Linear Recurrences. J. ACM 24(3): 513-521 (1977)
1976
6		Laurent Hyafil, Ronald L. Rivest: Constructing Optimal Binary Decision Trees is NP-Complete. Inf. Process. Lett. 5(1): 15-17 (1976)
5		Laurent Hyafil: Bounds for Selection. SIAM J. Comput. 5(1): 109-114 (1976)
1975
4		Laurent Hyafil, H. T. Kung: The Complexity of Parallel Evaluation of Linear Recurrence STOC 1975: 12-22
3		Laurent Hyafil, Jean-Paul Van de Wiele: On the Additive Complexity of Specific Polynomials. Inf. Process. Lett. 4(2): 45-47 (1975)
1974
2		Laurent Hyafil, F. Prusker, Jean Vuillemin: Design of Optimal Merge on Direct Access Devices. IFIP Congress 1974: 979-982
1		Laurent Hyafil, F. Prusker, Jean Vuillemin: An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract) STOC 1974: 216-229

Coauthor Index

1	H. T. Kung	[4] [7]
2	F. Prusker	[1] [2]
3	Prakash V. Ramanan	[11]
4	Ronald L. Rivest	[6]
5	Jean Vuillemin	[1] [2]
6	Jean-Paul Van de Wiele	[3]

Colors in the list of coauthors