Donald K. Friesen Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2004
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj: Using Nondeterminism to Design Efficient Deterministic Algorithms. Algorithmica 40(2): 83-97 (2004)
2001
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj: Using Nondeterminism to Design Deterministic Algorithms. FSTTCS 2001: 120-131
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald K. Friesen, Suely Oliveira, Jingyu Zhang: A New Efficient Parallel Algorithm for Computing Eigenvalues of Symmetric Tridiagonal Matrices. PPSC 2001
1999
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJianer 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
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYueh-O Wang, Nancy M. Amato, Donald K. Friesen: Hindsight Helps: Deterministic Task Scheduling with Backtracking. ICPP 1997: 170-173
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJianer Chen, Donald K. Friesen, Hao Zheng: Tight Bound on Johnson's Algoritihm for Max-SAT. IEEE Conference on Computational Complexity 1997: 274-281
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJingyu Zhang, Donald K. Friesen: Parallelizing the Computation of One Eigenvalue For a Large Symmetric Tridiagonal Matrix. PPSC 1997
1994
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRonald Fernandes, Donald K. Friesen, Arkady Kanevsky: Efficient Routing and Broadcasting in Recursive Interconnection Networks. ICPP (1) 1994: 51-58
1993
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIp-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)
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIp-Wang Chan, Donald K. Friesen: Parallel Algorithm for Segment Visibility Reporting. Parallel Computing 19(9): 973-978 (1993)
1991
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIp-Wang Chan, Donald K. Friesen: An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem. ICCI 1991: 323-334
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIp-Wang Chan, Donald K. Friesen: Parallel Algorithms for Some Dominance Problems Based on a CREW PRAM. ISA 1991: 375-384
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald K. Friesen, Michael A. Langston: Analysis of a Compound bin Packing Algorithm. SIAM J. Discrete Math. 4(1): 61-79 (1991)
1988
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald 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
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Donald K. Friesen, Michael A. Langston: On Finding Optimal and Near-Optimal Lineal Spanning Trees. Algorithmica 3: 549-560 (1988)
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald K. Friesen, Frederick S. Kuhl: Analysis of a Hybrid Algorithm for Packing Unequal Bins. SIAM J. Comput. 17(1): 23-40 (1988)
1987
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald J. Bagert, Donald K. Friesen: A multi-language syntax-directed editor. ACM Conference on Computer Science 1987: 300-302
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald K. Friesen, Michael A. Langston: Bin Packing: On Optimizing the Number of Pieces Packed. BIT 27(2): 148-156 (1987)
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald K. Friesen: Tighter Bounds for LPT Scheduling on Uniform Processors. SIAM J. Comput. 16(3): 554-560 (1987)
1986
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald K. Friesen, Michael A. Langston: Evaluation of a MULTIFIT-Based Scheduling Algorithm. J. Algorithms 7(1): 35-59 (1986)
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald K. Friesen, Michael A. Langston: Variable Sized Bin Packing. SIAM J. Comput. 15(1): 222-230 (1986)
1984
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald K. Friesen, Michael A. Langston: A Storage-Size Selection Problem. Inf. Process. Lett. 18(5): 295-296 (1984)
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald K. Friesen: Tighter Bounds for the Multifit Processor Scheduling Algorithm. SIAM J. Comput. 13(1): 170-181 (1984)
1983
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald K. Friesen, Michael A. Langston: Bounds for Multifit Scheduling on Uniform Processors. SIAM J. Comput. 12(1): 60-70 (1983)

Coauthor Index

1Nancy M. Amato [20]
2Donald J. Bagert [8] [11]
3Ip-Wang Chan [13] [14] [15] [16]
4Jianer Chen [19] [21] [23] [24]
5Daniel I. A. Cohen [11]
6Michael R. Fellows (Mike Fellows) [10]
7Ronald Fernandes [17]
8Gary Ford [11]
9Weijia Jia [23] [24]
10Arkady Kanevsky [17]
11Iyad A. Kanj [23] [24]
12Frederick S. Kuhl [9]
13Michael A. Langston [1] [3] [4] [5] [7] [10] [12]
14Daniel D. McCracken [11]
15Suely Oliveira [22]
16Yueh-O Wang [20]
17Derick Wood [11]
18Jingyu Zhang [18] [22]
19Hao Zheng [19] [21]

Colors in the list of coauthors

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)