| |
 |
|
|
Colbourn, Charles
University of Vermont
Burlington, Vermont
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 10
reviews
|
|
|
|
|
|
|
|
The geometry of fractal sets
Falconer K., Cambridge University Press, New York, NY, 1986. Type: Book (9789780521337052)
Sets of fractional dimension have been studied by mathematicians for the past hundred years and have recently found numerous applications. Most computer scientists are familiar with Mandelbrot’s use of fractals in modeling na...
|
Dec 1 1988 |
|
|
|
|
|
|
Adjacency detection using quadcodes
Li S., Loew M. Communications of the ACM 30(7): 627-631, 1987. Type: Article
The authors exploit a representation of square regions of the plane by quadcodes in order to develop fast algorithms for detecting the adjacency of square regions and to find all the neighboring regions of a specified one. The s...
|
Apr 1 1988 |
|
|
|
|
|
|
Electing a leader in a synchronous ring
Frederickson G. (ed), Lynch N. Journal of the ACM 34(1): 98-115, 1987. Type: Article
The problem of electing a leader in a ring network has attracted much attention. Burns [1] showed that if communication is asynchronous, &OHgr;(n log n) messages are required to elect a leader in a ring of n no...
|
Oct 1 1987 |
|
|
|
|
|
|
Gaining efficiency in transport services by appropriate design and implementation choices
Watson R., Mamrak S. ACM Transactions on Computer Systems 5(2): 97-120, 1987. Type: Article
A very detailed argument is given in support of the thesis that general-purpose transport protocols can be designed and implemented to be competitive with special-purpose ones. Three main arguments are advanced. First, the authors argu...
|
Sep 1 1987 |
|
|
|
|
|
|
Networking and data communications
Marney-Petix V., Reston Publishing Co., Reston, VA, 1986. Type: Book (9789780835948746)
This book is an introduction to computer networking for business computer users, to enable them to make essential decisions concerning acquisition of appropriate networking resources. It introduces technical jargon but is remarkably fr...
|
Feb 1 1987 |
|
|
|
|
|
|
Dynamic Huffman coding
Knuth D. Journal of Algorithms 6(2): 163-180, 1985. Type: Article
A representation for a Huffman tree is developed which enables the increase or decrease of any weight at level :6J by one in time O(:6J), preserving minimality of weighted path length. A real-time, one-pass compression scheme ca...
|
Oct 1 1986 |
|
|
|
|
|
|
Concurrent broadcast for information dissemination
Topkis D. IEEE Transactions on Software Engineering SE-11(10): 1107-1112, 1985. Type: Article
Strategies for concurrent broadcast are examined. The goal is to communicate information distributed among the network sites so that all of the sites receive all of the information. The two efficiency measures employed are time complex...
|
Apr 1 1986 |
|
|
|
|
|
|
Applied discrete structures for computer science
Doerr A., Levasseur K., 1985. Type: Book (9789780574217554)
The authors have written an ambitious textbook for use in an introductory discrete mathematics course for computer scientists. Topics covered in substantial detail include basic set theory and combinatorics, basic logic, matrix algebra...
|
Feb 1 1986 |
|
|
|
|
|
|
An efficient formula for linear recurrences
Fiduccia C. SIAM Journal on Computing 14(1): 106-112, 1985. Type: Article
Given a K-term constant-coefficient linear recurrence for F i, the nth solution F n can be computed in any ring supporting a fast Fourier...
|
Oct 1 1985 |
|
|
|
|
|
|
Network design with non simultaneous flows
Lucertini M. (ed), Paletta G., Springer-Verlag New York, Inc., New York, NY, 1984. Type: Book (9780387818160)
A basic problem in network design is capacity assignment, in which one must determine the minimum total edge capacity required to support a flow from a source node to a set of specified sinks. A demand vector specifies the requi...
|
Jun 1 1985 |
|
|
|
|
|
| |
|
|
| |
|
|
