| |
 |
|
|
Bongiovanni, Giancarlo
University of Rome
Rome, Italy
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 18
reviews
|
|
|
|
|
|
|
|
Generating Hamiltonian circuits without backtracking from errors
Shufelt J., Berliner H. Theoretical Computer Science 132(1-2): 347-375, 1994. Type: Article
The knight’s tour problem is as follows: starting with a knight on a square of a chessboard, find a sequence of legal moves that will cause the knight to visit each square exactly once, finally returning to the initial square...
|
Apr 1 1996 |
|
|
|
|
|
|
On the orbits of the product of two permutations
Bergey A. Theoretical Computer Science 131(2): 449-461, 1994. Type: Article
It is well known that any permutation p of the elements of a finite set X can be decomposed into a number of disjoint cycles. The elements in each cycle form an equivalence class, and constitute wh...
|
May 1 1995 |
|
|
|
|
|
|
Scheduling algorithms for multihop radio networks
Ramanathan S., Lloyd E. IEEE/ACM Transactions on Networking 1(2): 166-177, 1993. Type: Article
A radio network is a network of processors that communicate by means of broadcast radio. Examples of radio networks are cellular phone networks and satellite networks. In such networks, the transmitting and receiving stations communica...
|
Sep 1 1994 |
|
|
|
|
|
|
An O(log N) deterministic packet-routing scheme
Upfal E. Journal of the ACM 39(1): 55-70, 1992. Type: Article
Routing of packets is a fundamental problem in communication and parallel computation: N processors are connected by a bounded-degree interconnection network. Each processor contains one packet and a fixed number of ...
|
Nov 1 1993 |
|
|
|
|
|
|
Unbalanced multiway trees improved by partial expansions
Baeza-Yates R., Cunto W. Acta Informatica 29(5): 443-460, 1992. Type: Article
Multiway+ trees (M+-trees) are generally used to hold ordered data in secondary storage and consist of two parts: the index (the internal nodes of the M+-tree, organized as an
|
Oct 1 1993 |
|
|
|
|
|
|
Discrete mathematics for computer science
Rajagopal P., Mason J., Harcourt Brace & Co. Canada, Toronto, Ont., Canada, 1992. Type: Book (9780039228538)
A wide range of topics in discrete mathematics that are important for computer science are presented. The book also gives the necessary background for advanced study of several areas of computer science. In order to maintain the balanc...
|
Aug 1 1993 |
|
|
|
|
|
|
Parallel transitive closure and point location in planar structures
Tamassia R., Vitter J. (ed) SIAM Journal on Computing 20(4): 708-725, 1991. Type: Article
Planar st-graphs (which include series-parallel graphs) have been widely used in many applications, including graph planarization, planar point location, motion planning, and VLSI layout compaction....
|
Sep 1 1992 |
|
|
|
|
|
|
Fundamentals of matrix computations
Watkins D., John Wiley & Sons, Inc., New York, NY, 1991. Type: Book (9780471614142)
The purpose of this detailed introduction to the fundamental ideas of numerical linear algebra is to clarify how to perform computations using numerical methods efficiently and accurately. It is aimed at anyone (advanced undergraduate,...
|
Jun 1 1992 |
|
|
|
|
|
|
Unbounded searching algorithms
Beigel R. (ed) SIAM Journal on Computing 19(3): 522-537, 1990. Type: Article
Consider the following two-player game: player A chooses an arbitrary positive integer n and player B has to determine n by asking questions of the type “Is x less th...
|
Jul 1 1991 |
|
|
|
|
|
|
Digital systems design with programmable logic
Bolton M., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990. Type: Book (9780201145458)
Bolton presents a modern and structured approach to digital system design by means of programmable logic, a semi-custom technology that is widely used today. The book is aimed at anyone who has attended at least a first course on logic...
|
Feb 1 1991 |
|
|
|
|
|
| |
|
|
| |
|
|
