default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDonald K. Friesen
Person information
- affiliation: Texas A&M University, College Station, Texas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j20]Liliana Grigoriu, Donald K. Friesen:
Approximation for scheduling on uniform nonsimultaneous parallel machines. J. Sched. 20(6): 593-600 (2017)- 2016
- [c13]Liliana Grigoriu
, Donald K. Friesen:
Scheduling on Uniform Nonsimultaneous Parallel Machines. OR 2016: 467-473 - 2015
- [j19]Liliana Grigoriu, Donald K. Friesen:
Scheduling on uniform processors with at most one downtime on each machine. Discret. Optim. 17: 14-24 (2015) - 2010
- [j18]Liliana Grigoriu, Donald K. Friesen:
Scheduling on same-speed processors with at most one downtime on each machine. Discret. Optim. 7(4): 212-221 (2010)
2000 – 2009
- 2007
- [j17]Tomohiro Harayama, Donald K. Friesen:
Weil sum for birthday attack in multivariate quadratic cryptosystem. J. Math. Cryptol. 1(1): 79-104 (2007) - 2004
- [j16]Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj:
Using Nondeterminism to Design Efficient Deterministic Algorithms. Algorithmica 40(2): 83-97 (2004) - 2001
- [c12]Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj:
Using Nondeterminism to Design Deterministic Algorithms. FSTTCS 2001: 120-131 - [c11]Donald K. Friesen, Suely Oliveira, Jingyu Zhang:
A New Efficient Parallel Algorithm for Computing Eigenvalues of Symmetric Tridiagonal Matrices. PP 2001
1990 – 1999
- 1999
- [j15]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
- [c10]Jianer Chen, Donald K. Friesen, Hao Zheng:
Tight Bound on Johnson's Algoritihm for Max-SAT. CCC 1997: 274-281 - [c9]Yueh-O Wang, Nancy M. Amato, Donald K. Friesen:
Hindsight Helps: Deterministic Task Scheduling with Backtracking. ICPP 1997: 170-173 - [c8]Jingyu Zhang, Donald K. Friesen:
Parallelizing the Computation of One Eigenvalue For a Large Symmetric Tridiagonal Matrix. PP 1997 - 1994
- [c7]Ronald Fernandes, Donald K. Friesen, Arkady Kanevsky:
Efficient Routing and Broadcasting in Recursive Interconnection Networks. ICPP (1) 1994: 51-58 - [c6]Ronald Fernandes, Donald K. Friesen, Arkady Kanevsky:
Embedding rings in recursive networks. SPDP 1994: 273-280 - 1993
- [j14]Ip-Wang Chan, Donald K. Friesen:
Parallel algorithms for some dominance problems based on the PRAM model. Int. J. Comput. Geom. Appl. 3(4): 367-382 (1993) - [j13]Ip-Wang Chan, Donald K. Friesen:
Parallel Algorithm for Segment Visibility Reporting. Parallel Comput. 19(9): 973-978 (1993) - 1991
- [j12]Donald K. Friesen, Michael A. Langston:
Analysis of a Compound bin Packing Algorithm. SIAM J. Discret. Math. 4(1): 61-79 (1991) - [c5]Ip-Wang Chan, Donald K. Friesen:
An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem. ICCI 1991: 323-334 - [c4]Ip-Wang Chan, Donald K. Friesen:
Parallel Algorithms for Some Dominance Problems Based on a CREW PRAM. ISA 1991: 375-384 - 1990
- [c3]William H. Clingman, Donald K. Friesen:
Topological analysis of infinite learning automata I: classification of neural network behavior. IJCNN 1990: 119-124
1980 – 1989
- 1988
- [j11]Michael R. Fellows, Donald K. Friesen, Michael A. Langston:
On Finding Optimal and Near-Optimal Lineal Spanning Trees. Algorithmica 3: 549-560 (1988) - [j10]Donald K. Friesen, Frederick S. Kuhl:
Analysis of a Hybrid Algorithm for Packing Unequal Bins. SIAM J. Comput. 17(1): 23-40 (1988) - [c2]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 - 1987
- [j9]Donald K. Friesen, Michael A. Langston:
Bin Packing: On Optimizing the Number of Pieces Packed. BIT 27(2): 148-156 (1987) - [j8]Donald K. Friesen:
Tighter Bounds for LPT Scheduling on Uniform Processors. SIAM J. Comput. 16(3): 554-560 (1987) - [c1]Donald J. Bagert, Donald K. Friesen:
A multi-language syntax-directed editor. ACM Conference on Computer Science 1987: 300-302 - 1986
- [j7]Donald K. Friesen, Michael A. Langston:
Evaluation of a MULTIFIT-Based Scheduling Algorithm. J. Algorithms 7(1): 35-59 (1986) - [j6]Donald K. Friesen, Michael A. Langston:
Variable Sized Bin Packing. SIAM J. Comput. 15(1): 222-230 (1986) - 1984
- [j5]Donald K. Friesen, Michael A. Langston:
A Storage-Size Selection Problem. Inf. Process. Lett. 18(5): 295-296 (1984) - [j4]Alberto Garcia-Diaz, Donald K. Friesen, Donald J. Bagert:
Sorting algorithms for the implementation of a generalized vector product. Networks 14(2): 269-273 (1984) - [j3]Donald K. Friesen:
Tighter Bounds for the Multifit Processor Scheduling Algorithm. SIAM J. Comput. 13(1): 170-181 (1984) - 1983
- [j2]Donald K. Friesen, Michael A. Langston:
Bounds for Multifit Scheduling on Uniform Processors. SIAM J. Comput. 12(1): 60-70 (1983) - 1981
- [j1]Donald K. Friesen, Bryan L. Deuermeyer:
Analysis of Greedy Solutions for a Replacement Part Sequencing Problem. Math. Oper. Res. 6(1): 74-87 (1981)
1970 – 1979
- 1978
- [b1]Donald K. Friesen:
Sensitivity Analysis for Heuristic Algorithms. University of Illinois Urbana-Champaign, USA, 1978
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
