Algorithms: An Undergraduate Course with Programming

Algorithms: An Undergraduate Course with Programming

Cached

Download Links

[www.unf.edu]

by William F. Klostermeyer

BibTeX

@MISC{Klostermeyer_algorithms:an,
    author = {William F. Klostermeyer},
    title = {Algorithms: An Undergraduate Course with Programming},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
773	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming - Goemans, Williamson - 1995
682	Amortized Efficiency of List Update and Paging Rules - Sleator, Tarjan - 1985
493	Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987
240	An Introduction to the Analysis of Algorithms - Sedgewick, Flajolet - 1996
217	Efficiency of a good but not linear set union algorithm - Tarjan - 1975
181	Riemann’s hypothesis and tests for primality - Miller - 1976
163	Probabilistic algorithm for testing primality - Rabin - 1980
131	D.D.: Competitive algorithms for server problems - Manasse, McGeoch, et al. - 1990
115	The Algorithm Design Manual - Skiena - 2008
90	On the k-server conjecture - Papadimitriou - 1994
86	Fixed-parameter tractability and completeness i: Basic results - Downey, Fellows - 1995
57	Approximating the minimum-degree spanning tree to with one from the optimal degree - Furer, Raghavachari - 1992
41	Comparison of polynomial-time reducibilities - Ladner, Lynch, et al. - 1975
37	The four-color theorem - Robertson, Sanders, et al. - 1997
14	The Analysis of Heapsort - Schaffer, Sedgewick - 1993
12	Algorithms from P to NP - Moret, Shapiro - 1991
7	Weak-heap sort - Dutton - 1993
2	A Faster Algorithm for Least Deviant Path - Dutton, Klostermeyer - 1998
2	Efficient Planarity - Hopcroft, Tarjan - 1974
2	Techniques for the Algorithm Design and Analysis: Case Study of a Greedy Algorithm - Klostermeyer, Muslea - 1996
2	A new planarity test - Wei-Kuan, Wen-Lian - 1999
1	Instructor’s Manual to Accompany Introduction to Algorithms - Sussman - 1991