Laurent Hyafil

11 papers A* 4Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
1984 J jnl
New Algorithms for Selection.
J. Algorithms
Prakash V. Ramanan, Laurent Hyafil
1979 J jnl
On the Parallel Evaluation of Multivariate Polynomials.
SIAM J. Comput.
Laurent Hyafil
1978 A* conf
On the Parallel Evaluation of Multivariate Polynomials
STOC
Laurent Hyafil
1977 J jnl
The Complexity of Parallel Evaluation of Linear Recurrences.
J. ACM
Laurent Hyafil, H. T. Kung
1977 A* conf
The Power of Commutativity
FOCS
Laurent Hyafil
1976 J jnl
Bounds for Selection.
SIAM J. Comput.
Laurent Hyafil
1976 J jnl
Constructing Optimal Binary Decision Trees is NP-Complete.
Inf. Process. Lett.
Laurent Hyafil, Ronald L. Rivest
1975 J jnl
On the Additive Complexity of Specific Polynomials.
Inf. Process. Lett.
Laurent Hyafil, Jean-Paul Van de Wiele
1975 A* conf
The Complexity of Parallel Evaluation of Linear Recurrence
STOC
Laurent Hyafil, H. T. Kung
1974 A* conf
An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract)
STOC
Laurent Hyafil, F. Prusker, Jean Vuillemin
1974 — conf
Design of Optimal Merge on Direct Access Devices.
IFIP Congress
Laurent Hyafil, F. Prusker, Jean Vuillemin
2025 Best paper conf
Assessing the Effectiveness of the Tigress Obfuscator Against MOPSA and BinaryNinja.
CheckMATE
Nicolò Altamura, Enrico Bragastini, Marco Campion, Mila Dalla Preda
2026 Best paper preprint
ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage.
arXiv
Chang Liu, Noah Fleischmann, Nicolò Altamura, Edward Raff, James Holt, Kristopher Micinski