| 2004 |
| 24 | EE | Jianer Chen,
Donald K. Friesen,
Weijia Jia,
Iyad A. Kanj:
Using Nondeterminism to Design Efficient Deterministic Algorithms.
Algorithmica 40(2): 83-97 (2004) |
| 2001 |
| 23 | EE | Jianer Chen,
Donald K. Friesen,
Weijia Jia,
Iyad A. Kanj:
Using Nondeterminism to Design Deterministic Algorithms.
FSTTCS 2001: 120-131 |
| 22 | | Donald K. Friesen,
Suely Oliveira,
Jingyu Zhang:
A New Efficient Parallel Algorithm for Computing Eigenvalues of Symmetric Tridiagonal Matrices.
PPSC 2001 |
| 1999 |
| 21 | | Jianer Chen,
Donald K. Friesen,
Hao Zheng:
Tight Bound on Johnson's Algorithm for Maximum Satisfiability.
J. Comput. Syst. Sci. 58(3): 622-640 (1999) |
| 1997 |
| 20 | EE | Yueh-O Wang,
Nancy M. Amato,
Donald K. Friesen:
Hindsight Helps: Deterministic Task Scheduling with Backtracking.
ICPP 1997: 170-173 |
| 19 | EE | Jianer Chen,
Donald K. Friesen,
Hao Zheng:
Tight Bound on Johnson's Algoritihm for Max-SAT.
IEEE Conference on Computational Complexity 1997: 274-281 |
| 18 | | Jingyu Zhang,
Donald K. Friesen:
Parallelizing the Computation of One Eigenvalue For a Large Symmetric Tridiagonal Matrix.
PPSC 1997 |
| 1994 |
| 17 | | Ronald Fernandes,
Donald K. Friesen,
Arkady Kanevsky:
Efficient Routing and Broadcasting in Recursive Interconnection Networks.
ICPP (1) 1994: 51-58 |
| 1993 |
| 16 | | Ip-Wang Chan,
Donald K. Friesen:
Parallel algorithms for some dominance problems based on the PRAM model.
Int. J. Comput. Geometry Appl. 3(4): 367-382 (1993) |
| 15 | | Ip-Wang Chan,
Donald K. Friesen:
Parallel Algorithm for Segment Visibility Reporting.
Parallel Computing 19(9): 973-978 (1993) |
| 1991 |
| 14 | | Ip-Wang Chan,
Donald K. Friesen:
An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem.
ICCI 1991: 323-334 |
| 13 | | Ip-Wang Chan,
Donald K. Friesen:
Parallel Algorithms for Some Dominance Problems Based on a CREW PRAM.
ISA 1991: 375-384 |
| 12 | | Donald K. Friesen,
Michael A. Langston:
Analysis of a Compound bin Packing Algorithm.
SIAM J. Discrete Math. 4(1): 61-79 (1991) |
| 1988 |
| 11 | EE | Donald J. Bagert,
Daniel I. A. Cohen,
Gary Ford,
Donald K. Friesen,
Daniel D. McCracken,
Derick Wood:
The increasing role of computer theory in undergraduate curricula.
SIGCSE 1988: 223 |
| 10 | | Michael R. Fellows,
Donald K. Friesen,
Michael A. Langston:
On Finding Optimal and Near-Optimal Lineal Spanning Trees.
Algorithmica 3: 549-560 (1988) |
| 9 | | Donald K. Friesen,
Frederick S. Kuhl:
Analysis of a Hybrid Algorithm for Packing Unequal Bins.
SIAM J. Comput. 17(1): 23-40 (1988) |
| 1987 |
| 8 | EE | Donald J. Bagert,
Donald K. Friesen:
A multi-language syntax-directed editor.
ACM Conference on Computer Science 1987: 300-302 |
| 7 | | Donald K. Friesen,
Michael A. Langston:
Bin Packing: On Optimizing the Number of Pieces Packed.
BIT 27(2): 148-156 (1987) |
| 6 | | Donald K. Friesen:
Tighter Bounds for LPT Scheduling on Uniform Processors.
SIAM J. Comput. 16(3): 554-560 (1987) |
| 1986 |
| 5 | | Donald K. Friesen,
Michael A. Langston:
Evaluation of a MULTIFIT-Based Scheduling Algorithm.
J. Algorithms 7(1): 35-59 (1986) |
| 4 | | Donald K. Friesen,
Michael A. Langston:
Variable Sized Bin Packing.
SIAM J. Comput. 15(1): 222-230 (1986) |
| 1984 |
| 3 | | Donald K. Friesen,
Michael A. Langston:
A Storage-Size Selection Problem.
Inf. Process. Lett. 18(5): 295-296 (1984) |
| 2 | | Donald K. Friesen:
Tighter Bounds for the Multifit Processor Scheduling Algorithm.
SIAM J. Comput. 13(1): 170-181 (1984) |
| 1983 |
| 1 | | Donald K. Friesen,
Michael A. Langston:
Bounds for Multifit Scheduling on Uniform Processors.
SIAM J. Comput. 12(1): 60-70 (1983) |