Donald B. Johnson
- 1 AHO, A V, HOPCROFT, J E, AND ULLMAN, J D The Destgn andAnalvsls of ComputerAlgortthms Addison- Wesley, Reading, Mass, 1974 Google Scholar
- 2 BLUM, M, FLOYD, R W, PRATT, V R, RIVEST, R L, AND TAR JAN, R E Time bounds for selecuon J Comptr Syst Sct 7, 4 (Aug 1973), 448-461Google Scholar
- 3 DANTZIG, G.B, BLATTNER, W O, AND RAO, M R All shortest ioutes from a fixed ongm in a graph Theory of Graphs, Int Symp, Rome, July 1966, Gordon and Breach, New York, 1967, pp 85-90Google Scholar
- 4 DOBKIN, D.P, AND LIPTON, R J On the complexity of computations under varying sets of primitives J Comptr Syst Scl. To appear.Google Scholar
- 5 FLOYD, R.W. Algorithm 97 Shortest path Comm ACM 5, 6 (June 1962), 345. Google Scholar
- 6 FREDMAN, M L. How good IS the reformation theory bound m sorting`) Theoret. Comptr Sct I (1976), 355-361.Google Scholar
- 7 GABOW, H N Two algorithms for generating weighted spanning trees in order SIAM J Comptng 6, 1 (March 1977), 139-150Google Scholar
- 8 HARPER, L H, PAYNE, T H, SAVAGE, J E, AND STRALJS, E Sorting X + Y Comm A CM 18, 6 (June 1975), 347-349 Google Scholar
- 9 JosNsot4, D B Finding all the elementary circuits of a directed graph SlAM J Comptng 4, I (March 1975), 77-84Google Scholar
- 10 JOHNSON, D B Priority queues with update and finding minimum spanning trees Inform Proc Letters 4, 3 (Dec 1975), 53-57Google Scholar
- 11 JOHNSON, D B Effioent algorithms for shortest paths m sparse networks d ACM 21, 1 (Jan 1977), 1-13 Google Scholar
- 12 JOHNSON, D B, AND MIZOGUCHI, T Selecting the Kth element m X + Y and X~ + X2 + + Xm SlAM J Comping. 7, 2 (May 1978), 147-153Google Scholar
- 13 KARP, R M Reduclbdlty among combinatorial problems Complexay of Computer Computations, R E Miller and J W Thatcher, Eds, Plenum Press, New York, 1972, pp. 85-103Google Scholar
- 14 LAWLER, E L A procedure for computing the K best solutions to discrete opumlzatlon problems and its apphcatlon to the shortest path problem Manage Sct 18, 7 (March 1972), 401-405Google Scholar
- 15 PRATT, V R, AND YAO, F F On lower bounds for computmg the l-th largest element Conf Rec 14th Annual IEEE Symp on Switching and Automation Theory, Oct 1973, pp 70-81Google Scholar
- 16 RABIN, M O Proving simultaneous posmvlty of linear forms J Comptr Syst Sct 6, 6 (Dec 1972), 639-650Google Scholar
- 17 READ, R C, AND TARJAN, R E Bounds on backtrack algorithms for hstlng cycles, paths, and spanning trees Networks 5, 3 (July 1975), 237-252Google Scholar
- 18 REINGOLD, E M On the optimality of some set algorithms J ACM 19, 4 (Oct 1972), 649-659 Google Scholar
- 19 SCHONHAGE, A, PATERSON, M, AND PIPPENGER, N Fmdmg the median J Comptr Syst Sct 13, 2 (Oct 1976), 184-199.Google Scholar
- 20 SHAMOS, M i, AND HOEY, D J Closest-point problems Conf Rec 16th Annual IEEE Symp Foundations ofComptr Scl, Oct 1975, pp 151-162Google Scholar
- 21 TARJAN, R E Effioency of a good but not linear set umon algorithm J ACM 22, 2 (April 1975), 215-225 Google Scholar
- 22 WARSHALL, S A theorem on Boolean matrices J ACM 9, 1 (Jan 1962), I 1-12 Google Scholar
- 23 YAO, A C On the complexity of comparison problems using linear functions Conf Rec 16th Annual 1EEE Syrup on Foundations of Comptr Scl, Oct 1975, pp 85-89Google Scholar
Index Terms
- Lower Bounds for Selection in X + Y and Other Multisets
Recommendations
Statistics on quasi-Stirling permutations of multisets
AbstractA permutation of a multiset is said to be a quasi-Stirling permutation if there do not exist four indices such that , and . Define
where denotes the set of quasi-Stirling ...Quasi-Stirling polynomials on multisets
AbstractA permutation π of a multiset is said to be a quasi-Stirling permutation if there do not exist four indices i < j < k < ℓ such that π i = π k, π j = π ℓ and π i ≠ π j. For a multiset M, denote by Q ‾ M the set of quasi-Stirling ...
Enumerating submultisets of multisets
We consider the problem of enumerating the submultisets of a multiset, in which each element has equal multiplicity. The crucial property is that consecutive submultisets in this listing differ one in the cardinality of exactly one of the elements. This ...
Comments