Donald K. Friesen

J. Sched., 2017

2016

Scheduling on Uniform Nonsimultaneous Parallel Machines.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2015

Scheduling on uniform processors with at most one downtime on each machine.

[BibT_eX]

[DOI]

Discret. Optim., 2015

2010

Scheduling on same-speed processors with at most one downtime on each machine.

[BibT_eX]

[DOI]

Discret. Optim., 2010

2007

Weil sum for birthday attack in multivariate quadratic cryptosystem.

[BibT_eX]

[DOI]

Tomohiro Harayama

J. Math. Cryptol., 2007

2004

Using Nondeterminism to Design Efficient Deterministic Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2004

2001

A New Efficient Parallel Algorithm for Computing Eigenvalues of Symmetric Tridiagonal Matrices.

[BibT_eX]

Suely Oliveira

Jingyu Zhang

Proceedings of the Tenth SIAM Conference on Parallel Processing for Scientific Computing, 2001

Using Nondeterminism to Design Deterministic Algorithms.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

1999

Tight Bound on Johnson's Algorithm for Maximum Satisfiability.

[BibT_eX]

[DOI]

Jianer Chen

Hao Zheng

J. Comput. Syst. Sci., 1999

1997

Parallelizing the Computation of One Eigenvalue For a Large Symmetric Tridiagonal Matrix.

[BibT_eX]

Jingyu Zhang

Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

Hindsight Helps: Deterministic Task Scheduling with Backtracking.

[BibT_eX]

[DOI]

Yueh-O Wang

Nancy M. Amato

Proceedings of the 1997 International Conference on Parallel Processing (ICPP '97), 1997

Tight Bound on Johnson's Algoritihm for Max-SAT.

[BibT_eX]

[DOI]

Jianer Chen

Hao Zheng

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1994

Embedding rings in recursive networks.

[BibT_eX]

[DOI]

Ronald Fernandes

Arkady Kanevsky

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Efficient Routing and Broadcasting in Recursive Interconnection Networks.

[BibT_eX]

[DOI]

Ronald Fernandes

Arkady Kanevsky

Proceedings of the 1994 International Conference on Parallel Processing, 1994

1993

Parallel Algorithm for Segment Visibility Reporting.

[BibT_eX]

[DOI]

Parallel Comput., 1993

Parallel algorithms for some dominance problems based on the PRAM model.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1993

1991

Analysis of a Compound bin Packing Algorithm.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

Parallel Algorithms for Some Dominance Problems Based on a CREW PRAM.

[BibT_eX]

[DOI]

Proceedings of the ISA '91 Algorithms, 1991

An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing and Information, 1991

1990

Topological analysis of infinite learning automata I: classification of neural network behavior.

[BibT_eX]

[DOI]

William H. Clingman

Proceedings of the IJCNN 1990, 1990

1988

Analysis of a Hybrid Algorithm for Packing Unequal Bins.

[BibT_eX]

[DOI]

Frederick S. Kuhl

SIAM J. Comput., 1988

On Finding Optimal and Near-Optimal Lineal Spanning Trees.

[BibT_eX]

[DOI]

Michael R. Fellows

Algorithmica, 1988

The increasing role of computer theory in undergraduate curricula.

[BibT_eX]

[DOI]

Proceedings of the 19th SIGCSE Technical Symposium on Computer Science Education, 1988

1987

Tighter Bounds for LPT Scheduling on Uniform Processors.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

Bin Packing: On Optimizing the Number of Pieces Packed.

[BibT_eX]

[DOI]

BIT, 1987

A multi-language syntax-directed editor.

[BibT_eX]

[DOI]

Donald J. Bagert

Proceedings of the 15th ACM Annual Conference on Computer Science, 1987

1986

Variable Sized Bin Packing.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

Evaluation of a MULTIFIT-Based Scheduling Algorithm.

[BibT_eX]

[DOI]

J. Algorithms, 1986

1984

Tighter Bounds for the Multifit Processor Scheduling Algorithm.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

Sorting algorithms for the implementation of a generalized vector product.

[BibT_eX]

[DOI]

Alberto Garcia-Diaz

Donald J. Bagert

Networks, 1984

A Storage-Size Selection Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

1983

Bounds for Multifit Scheduling on Uniform Processors.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

1981

Analysis of Greedy Solutions for a Replacement Part Sequencing Problem.

[BibT_eX]

[DOI]

Bryan L. Deuermeyer

Math. Oper. Res., 1981

1978

Sensitivity Analysis for Heuristic Algorithms

[BibT_eX]

[DOI]