| |
 |
|
|
Stewart, Iain
University of Newcastle upon Tyne
Newcastle upon Tyne, United Kingdom
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 5 of 5
reviews
|
|
|
|
|
|
|
|
On Necˇiporuk’s theorem for branching programs
Alon N., Zwick U. Theoretical Computer Science 64(3): 331-342, 1989. Type: Article
This paper essentially refines a result of Necˇiporuk’s concerning lower bounds on the size of branching programs that compute an arbitrary Boolean function. It shows that the largest monotone nondecreasing function...
|
Aug 1 1990 |
|
|
|
|
|
|
Communication aspects of networks based on geometric incidence relations
Shamir E., Schuster A. Theoretical Computer Science 64(1): 83-96, 1989. Type: Article
In this paper, the authors use projective spaces to define a network, called the projective network, that has many properties that are often essential in the design of interconnection networks. In particular, the network has rea...
|
Jul 1 1990 |
|
|
|
|
|
|
Probabilistic inductive inference
Pitt L. Journal of the ACM 36(2): 383-433, 1989. Type: Article
This lengthy paper considers inductive inference, especially by probabilistic machines. An inductive inference machine is an algorithmic device that attempts to infer rules from examples, where a rule is any recursive function f...
|
Sep 1 1989 |
|
|
|
|
|
|
Optimal node ranking of trees
Ananth V., Ratliff H., Vijayan G. Information Processing Letters 28(5): 225-229, 1988. Type: Article
An O(n log n) algorithm is presented that optimally ranks the nodes of a tree (a graph is ranked if each node is assigned an integer rank such that any path between two nodes of the same rank passes through a node ...
|
Apr 1 1989 |
|
|
|
|
|
|
Edge-connectivity augmentation problems
Watanabe T., Nakamura A. Journal of Computer and System Sciences 35(1): 96-144, 1987. Type: Article
This paper provides researchers in graph theory with a characterization, in terms of the demand of a graph G , of the minimum number of edges that must be added to G so that G is...
|
Feb 1 1989 |
|
|
|
|
|
| |
|
|
| |
|
|
