| |
 |
|
|
Garzon, Max
Memphis State University
Memphis, Tennessee
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 9 of 9
reviews
|
|
|
|
|
|
|
|
Identities in search of identity
Zeilberger D. (ed) Theoretical Computer Science 117(1-2): 23-38, 1993. Type: Article
The author announces that the time is ripe to start a new “identity science” (IS) for its own sake, without paying lip service to highbrow mathematics. In fact, the time is ripe for forgetting advanced mathematics, ...
|
Feb 1 1995 |
|
|
|
|
|
|
Automatic generation of PLA from ASM charts
Akkouche A. Microprocessors & Microsystems 15(2): 91-96, 1991. Type: Article
Finite-state machines are easily implemented as hardware PLAs (programmable logic arrays). They are usually given by implementation-independent ASMs (algorithmic state machines). Hand conversion is tedious and unsupported by workstatio...
|
Feb 1 1992 |
|
|
|
|
|
|
Reversing is not inherent in lexicographical permutation generation
Rohl J. The Computer Journal 33(3): 274-278, 1990. Type: Article
Permutation generation has been a classroom exercise that can be used to illustrate a number of techniques in the design, testing, and analysis of algorithms (such as brute force, iteration, recursion, and backtracking). This note show...
|
Aug 1 1991 |
|
|
|
|
|
|
Finding minimum-cost circulations by canceling negative cycles
Goldberg A., Tarjan R. (ed) Journal of the ACM 36(4): 873-886, 1989. Type: Article
Several elaborate strongly polytime algorithms are known for minimum-cost circulation on a network with flow capacities and cost-per-unit flows. The authors show here that a simple cycle-canceling greedy algorithm following the classic...
|
Jan 1 1991 |
|
|
|
|
|
|
Applications of combinatorial designs in computer science
Colbourn C., van Oorschot P. ACM Computing Surveys 21(2): 223-250, 1989. Type: Article
The authors of this paper point out that graphs are not the only important combinatorial objects in computer science. They set out to survey known applications of another such object, combinatorial designs; their aim is to provide a fr...
|
Jun 1 1990 |
|
|
|
|
|
|
On the Design of Fault-Tolerant Two-Dimensional Systolic Arrays for Yield Enhancement
Kim J., Reddy S. IEEE Transactions on Computers 38(4): 515-525, 1989. Type: Article
Existing methods for testing and reconfiguring systolic arrays assume fault-free alternate paths or registers and only address testing or easy reconfiguration of one processing element (PE) at a time. The authors describe algorithms th...
|
Oct 1 1989 |
|
|
|
|
|
|
A note on the two-variable pattern-finding problem
Ko K. (ed), Hua C. Journal of Computer and System Sciences 34(1): 75-86, 1987. Type: Article
This paper deals with an inductive inference problem: Given a sequence of strings over an alphabet &Sgr;, find a single (short) formula p of symbols in &Sgr; and additional variables x, y, z, . . . that generates ...
|
Apr 1 1989 |
|
|
|
|
|
|
Digital image processing (2nd ed.)
Gonzales R., Wintz P., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1987. Type: Book (9789780201110265)
This is a revision and expansion of the 1977 edition of the textbook by the same authors [1]. A comparison of the tables of contents reveals essentially the same (standard) range of topics (image modeling and quantization; image transf...
|
Jul 1 1988 |
|
|
|
|
|
|
A logarithmic time sort for linear size networks
Reif J., Valiant L. Journal of the ACM 34(1): 60-76, 1987. Type: Article
Fast communication is one of the fundamental problems of parallel computing on a fixed-connection network architecture, especially if physical limitations are imposed that the networks be wire- (edge-)sparse, have constant (or logarith...
|
Aug 1 1987 |
|
|
|
|
|
| |
|
|
| |
|
|
