Yen-Chun Lin

Available identifiers

zbMath Open lin.yen-chunMaRDI QIDQ673340

List of research outcomes

Publication	Date of Publication	Type
Faster optimal parallel prefix circuits: new algorithmic construction	2006-11-15	Paper
A new approach to constructing optimal parallel prefix circuits with small depth	2004-09-08	Paper
https://portal.mardi4nfdi.de/entity/Q4460399	2004-05-18	Paper
Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit	2003-08-20	Paper
DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM	2002-12-04	Paper
Finding optimal parallel prefix circuits with fan-out 2 in constant time	2002-07-25	Paper
Efficient parallel prefix algorithms on multiport message-passing systems	2002-07-25	Paper
A new class of depth-size optimal parallel prefix circuits	2000-08-03	Paper
https://portal.mardi4nfdi.de/entity/Q4252850	1999-06-22	Paper
An efficient systolic algorithm for the longest common subsequence problem	1999-01-17	Paper
Perfectly overlapped merging and sorting on a two-way linear array	1997-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4893463	1996-11-20	Paper
Array size anomaly of problem-size independent systolic arrays for matrix-vector multiplication	1992-06-26	Paper
Parallel sorting with cooperating heaps in a linear array of processors	1990-01-01	Paper

Research outcomes over time

This page was built for person: Yen-Chun Lin