Laurent Hyafil

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

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

Coauthor Index

Last update Tue May 21 08:40:24 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page