Scholars' Bank will
be on a content freeze from 9/6  9/16 as we transition to a new & improved version. Minimal downtime expected
on 9/16. Stay tuned for more updates!
Browsing Department of Computer and Information Science by Title
Navigation
Display Options
Results

Lingas, Andrzej; Proskurowski, Andrzej
(University of Oregon, 19880406)
We consider the problems of subgraph homeomorphism with fixed pattern graph,
recognition, and subgraph isomorphism for some classes of planar graphs. Following
the results of Robertson and Seymour on forbidden minor ...

Ehrenkranz, Toby; Knickerbocker, Paul, 1980; Li, Jun; Stafford, Shad
(2006)
This work presents our GLOWS (Gateway Level Oregon Worm Simulator) simulator,
designed to produce realistic worm traffic over a broad range of scenarios.
GLOWS simulates the spread of a worm across the Internet and its ...

Clinger, William D.
(University of Oregon, 19900605)
Consider the problem of converting decimal scientific notation
for a number into the best binary floating point approximation
to that number, for some fixed precision. This
problem cannot be solved using arithmetic of ...

Ellis, Carla Schlatter
(University of Oregon, 198003)
Btrees are useful for supporting large ordered indexes in database systems. Several solutions have recently been proposed to deal with the problem of allowing concurrent operations in data structures related to Btrees. ...

Marti, Jed B.
(University of Oregon, 198105)
This manual describes the Little Big LISP system for the
Z80 microcomputer. The manual describes data structures,
defined functions, operating procedures, a compiler, an RLISP
parser, and support packages.

Clinger, William D.; Rees, Jonathan
(University of Oregon, 199101)
This paper describes a modified form of Kohlbecker's algorithm
for reliably hygienic (capturefree) macro expansion
in blockstructured languages, where macros are sourcetosource
transformations specified using a ...

Lo, V.; Rajopadhye, S. V.; Gupta, S.; Keldsen, D.; Mohamed, M.; Telle, Jan
(University of Oregon, 19900119)
In this paper, we identify the binomial tree as an ideal computation
structure for parallel divideandconquer algorithms. We show its superiority
to the classic full binary tree structure with respect to speedup
and ...

Robinson, Willam N.
(University of Oregon, 19890906)
Negotiation is part of specification. During specification acquisition, users negotiate amongst
themselves and with analysts. During specification design, designers negotiate amongst themselves
and with a project leader. ...

Lo, Virginia M.; Rajopadhye, Sanjay; Gupta, Samik; Keldsen, David; Mohamed, Moataz A.; Telle, Jan
(University of Oregon, 19900119)
The mapping problem in messagepassing parallel processors involves
the assignment of tasks in a parallel computation to processors and the
routing of intertask messages along the links of the interconnection network.
We ...

Conery, John S.
(University of Oregon, 19901207)
The Mayfly, a parallel processor being built at HP Labs in Palo Alto, has architectural
support for several import.ant. aspects of the OM virtual machine for parallel
logic programs. Each node has a coprocessor that is ...

Fickas, Stephen; Anderson, John
(University of Oregon, 19881117)
We argue that in certain problem domains, AI planning can be viewed as a foundation for
generation, critiquing, and elaboration of a specification. Two specification design projects in
our group are used as a focus of ...

Lo, Virginia M.; Pall, Gurdeep Singh
(University of Oregon, 199101)
We propose a simple extension to Gantt charts, called RAGA scores, for use in distributed
real time scheduling. RAGA scores use a small set of symbols borrowed from musical notation
to enrich the expressive power of the ...

MataMontero, Erick
(University of Oregon, 19900608)
Recent developments in graph theory have shown the importance of
the class of partial k trees. This large class of graphs admits several
algorithm design methodologies that render efficient solutions for a large
number ...

MataMontero, Erick
(University of Oregon, 19891020)
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 #Pcomplete problem for planar networks and to take
O(n)^2 time for ...

MataMontero, Erick
(University of Oregon, 19891020)
The resilience of a network is the expected number of pairs of nodes
that can communicate. Computing the resilience of a network is a #Pcomplete
problem even for planar networks with failsafe nodes. We generalize
an ...

Clinger, William D.; Rees, Jonathan
(University of Oregon, 200410)
The report gives a defining description of the programming
language Scheme. Scheme is a statically scoped and
properly tailrecursive dialect of the Lisp programming
language invented by Guy Lewis Steele Jr. and Gerald
Jay ...
Search Scholars' Bank
Browse

All of Scholars' Bank

This Community
My Account
Statistics