#### Filter Results:

- Full text PDF available (95)

#### Publication Year

1972

2018

- This year (6)
- Last 5 years (59)
- Last 10 years (99)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Brad Karp, H. T. Kung
- MobiCom
- 2000

We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwardingâ€¦ (More)

- Richard P. Brent, H. T. Kung
- IEEE Transactions on Computers
- 1982

With VLSI architecture, the chip area and design regularity represent a better measure of cost than the conventional gate count. We show that addition of n-bit binary numbers can be performed on aâ€¦ (More)

- Jia-Wei Hong, H. T. Kung
- STOC
- 1981

In this paper, the red-blue pebble game is proposed to model the input-output complexity of algorithms. Using the pebble game formulation, a number of lower bound results for the I/O requirement areâ€¦ (More)

- H. T. Kung, Joseph F. Traub
- J. ACM
- 1974

The problem is to calculate a simple zero of a nonlinear function Æ’ by iteration. There is exhibited a family of iterations of order 2<supscrpt><italic>n</italic>-1</supscrpt> which useâ€¦ (More)

- H. T. Kung, Fabrizio Luccio, Franco P. Preparata
- J. ACM
- 1975

ASSTRACT. Let U1 , U2, . . . , Ud be totally ordered sets and let V be a set of n d-dimensional vectors In U~ X Us. . X Ud . A partial ordering is defined on V in a natural way The problem of findingâ€¦ (More)

- H. T. Kung
- Computer
- 1982

f High-performance, special-purpose computer systems are typically used to meet specific application requirements or to off-load computations that are especially taxing to general-purpose computers.â€¦ (More)

- H. T. Kung, Dario Vlah
- WCNC
- 2003

- Clark D. Thomborson, H. T. Kung
- STOC
- 1976

Two algorithms for sorting n2 elements on an nÃ—n mesh-connected processor array that require 0(n) routing and comparison steps are presented. The best previous algorithms take time 0(n log n). Ourâ€¦ (More)

- Jon Louis Bentley, H. T. Kung, Mario Schkolnick, Clark D. Thomborson
- J. ACM
- 1978

A maximal vector of a set ~s one which is not less than any other vector m all components We derive a recurrence relation for computing the average number of maxunal vectors m a set of n vectors mâ€¦ (More)

- Richard P. Brent, H. T. Kung
- J. ACM
- 1978

The classical algorithms require order n ~ operations to compute the first n terms in the reversion of a power series or the composition of two series, and order nelog n operations if the fast Founerâ€¦ (More)