Donald M. Topkis - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

1995

Repeated uncoordinated information dissemination by floodingDonald M. Topkis. networks, 26(1):13-23, 1995. [doi]

1992

Paths on polymatroidsDonald M. Topkis. mp, 54:335-351, 1992.

1989

Acyclic k-connected subgraphs for distributed alternate routing in communications networksMoshe Segal, Donald M. Topkis. DAM, 22(2):181-189, 1989. [doi]

All-to-All Broadcast by Flooding in Communications NetworksDonald M. Topkis. TC, 38(9):1330-1333, 1989.

Performance analysis of information dissemination by floodingDonald M. Topkis. jsac, 7(3):335-340, 1989. [doi]

1988

A k shortest path algorithm for adaptive routing in communications networksDonald M. Topkis. tcom, 36(7):855-859, 1988. [doi]

1986

A K-Shortest Path Algorithm for Adaptive Routing in Communication NetworksDonald M. Topkis. icc 1986: 108-113

1985

The Partial Order of a Polymatroid Extreme PointRobert E. Bixby, William H. Cunningham, Donald M. Topkis. mor, 10(3):367-378, 1985. [doi]

Concurrent Broadcast for Information DisseminationDonald M. Topkis. TSE, 11(10):1107-1112, 1985.

1984

Adjacency on polymatroidsDonald M. Topkis. mp, 30(2):229-237, 1984. [doi]

1983

Activity selection games and the minimum-cut problemDonald M. Topkis. networks, 13(1):93-105, 1983. [doi]

1978

Minimizing a Submodular Function on a LatticeDonald M. Topkis. ior, 26(2):305-321, 1978. [doi]

1976

Rates of Stability in Nonlinear ProgrammingMichael H. Stern, Donald M. Topkis. ior, 24(3):462-476, 1976. [doi]

1970

Letter to the Editor - A Note on Cutting-Plane Methods Without Nested Constraint SetsDonald M. Topkis. ior, 18(6):1216-1220, 1970. [doi]

Cutting-Plane Methods without Nested Constraint SetsDonald M. Topkis. ior, 18(3):404-413, 1970. [doi]

Sign in or sign up to see more results.

runs on WebDSL