JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing Department of Computer and Information Science by Title
Navigation
Display Options
Results
Now showing items 25-27 of 27
-
(University of Oregon, 1989-10-20)The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network has been shown to be a #P-complete problem for planar networks and to take O(n)^2 time for ...
-
(University of Oregon, 1989-10-20)The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network is a #P-complete problem even for planar networks with fail-safe nodes. We generalize an ...
-
(University of Oregon, 2004-10)The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay ...
Now showing items 25-27 of 27