|
Search the dblp DataBase
Laurent Hyafil:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Laurent Hyafil, Ronald L. Rivest
Constructing Optimal Binary Decision Trees is NP-Complete. [Citation Graph (4, 0)][DBLP] Inf. Process. Lett., 1976, v:5, n:1, pp:15-17 [Journal]
- Laurent Hyafil, F. Prusker, Jean Vuillemin
Design of Optimal Merge on Direct Access Devices. [Citation Graph (1, 0)][DBLP] IFIP Congress, 1974, pp:979-982 [Conf]
- Laurent Hyafil
The Power of Commutativity [Citation Graph (0, 0)][DBLP] FOCS, 1977, pp:171-174 [Conf]
- Laurent Hyafil
On the Parallel Evaluation of Multivariate Polynomials [Citation Graph (0, 0)][DBLP] STOC, 1978, pp:193-195 [Conf]
- Laurent Hyafil, H. T. Kung
The Complexity of Parallel Evaluation of Linear Recurrence [Citation Graph (0, 0)][DBLP] STOC, 1975, pp:12-22 [Conf]
- Laurent Hyafil, F. Prusker, Jean Vuillemin
An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract) [Citation Graph (0, 0)][DBLP] STOC, 1974, pp:216-229 [Conf]
- Laurent Hyafil, Jean-Paul Van de Wiele
On the Additive Complexity of Specific Polynomials. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1975, v:4, n:2, pp:45-47 [Journal]
- Laurent Hyafil, H. T. Kung
The Complexity of Parallel Evaluation of Linear Recurrences. [Citation Graph (0, 0)][DBLP] J. ACM, 1977, v:24, n:3, pp:513-521 [Journal]
- Prakash V. Ramanan, Laurent Hyafil
New Algorithms for Selection. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1984, v:5, n:4, pp:557-578 [Journal]
- Laurent Hyafil
Bounds for Selection. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1976, v:5, n:1, pp:109-114 [Journal]
- Laurent Hyafil
On the Parallel Evaluation of Multivariate Polynomials. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1979, v:8, n:2, pp:120-123 [Journal]
Search in 0.003secs, Finished in 0.003secs
|