🚀 go-pugleaf

This is a list of tech reports kept online at Stanford and other
places.

AN = 101723;
  A = Chazelle, B.;
  A = Cole, R.;
  A = Preparata, F.;
  A = Yap, C.;
  T = New upper bounds for neighbor searching.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-11.;
  D = 1984.;

AN = 101724;
  A = Chazelle, B.;
  A = Lee, D. T.;
  T = On a circle placement problem.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-12.;
  D = 1984.;

AN = 101725;
  A = Chazelle, B.;
  T = Fast searching in a real algebraic manifold with applications to
geometric complexity.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-13.;
  D = 1984.;

AN = 101726;
  A = Vitter, Jeffrey Scott.;
  T = An efficient I/O interface for optical disks.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-15.;
  D = 1985.;
  K = B-trees.;
  K = Input/output.;
  K = Magnetic disks.;
  K = Optical digital disks.;
  K = Updates.;

AN = 101727;
  A = Chazelle, B.;
  A = Edelsbrunner, H.;
  T = Optimal solutions for a class of point retrieval problems.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-16.;
  D = 1984.;

AN = 101728;
  A = Giacalone, Alessandro.;
  T = Algebraic definitions in programming environments.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-17.;
  D = 1984.;
  K = Thesis (Ph.D.).;
  K = CCS.;
  K = Concurrent systems.;
  K = Distributed systems.;
  K = Formal definitions.;
  K = Integrated programming environments.;
  K = Milner's calculus of communicating systems.;
  K = Program verification.;

AN = 101729;
  A = Smith, Karen E.;
  A = Waymire, Elisabeth A.;
  T = Brown University's computerized classroom: an experiment in the
principles of courseware design.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-18.;
  D = 1984.;

AN = 101730;
  A = Savage, John E.;
  A = Vitter, Jeffrey Scott.;
  T = Parallelism in space-time tradeoffs.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-19.;
  D = 1984.;

AN = 101731;
  A = Chen, Wen-Chin.;
  A = Vitter, Jeffrey Scott.;
  T = Deletion algorithms for coalesced hashing.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-20.;
  D = 1984.;
  K = Analysis of algorithms.;
  K = Data structures.;
  K = Information retrieval.;
  K = Preserve randomness.;
  K = Searching.;

AN = 101732;
  A = Sedgewick, Robert.;
  A = Vitter, Jeffrey Scott.;
  T = Shortest paths in Euclidean graphs.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-21.;
  D = 1984.;

AN = 101733;
  A = Chen, Wen-Chin.;
  T = The design and analysis of coalesced hashing.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-84-22.;
  D = 1985.;
  K = Thesis (Ph.D.).;
  K = Deletion algorithms.;
  K = Direct chaining.;
  K = Early-insertion coalesced hashing.;
  K = Late-insertion coalesced hashing.;
  K = Preserve randomness.;
  K = Searching.;
  K = Varied-insertion coalesced hashing.;

AN = 101734;
  A = Charniak, Eugene.;
  T = Knowledge representation and the 1/plan-recognition-as-planning
theory.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-85-01.;
  D = 1985.;

AN = 101735;
  A = Sommer, Mark E.;
  A = Savage, John E.;
  T = SAS - a systolic array simulator.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-85-02.;
  D = 1985.;

AN = 101736;
  A = Smith, Karen E.;
  T = Developing and evaluating a computer-assisted instruction dialogue
on
parameters.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-85-04.;
  D = 1985.;

AN = 101737;
  A = Van Wyk, Christopher J.;
  A = Vitter, Jeffrey Scott.;
  T = The complexity of hashing with lazy deletion.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-85-05.;
  D = 1985.;

AN = 101738;
  A = Ellsworth, Russell Lee.;
  T = An ideographic system build and execute facility.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-85-06.;
  D = 1985.;

AN = 101739;
  A = Hendler, James A.;
  T = Integrating marker-passing and problem-solving.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-85-08.;
  D = 1985.;

AN = 101740;
  A = Kim, Grace Meejoong.;
  T = A three dimensional graphics system for the stereotactic placement
of
heavy-ion beams.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-85-09.;
  D = 1985.;

AN = 101741;
  A = Zdonik, Stanley B.;
  A = Wegner, Peter.;
  T = A database approach to languages, libraries and environments.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-85-10.;
  D = 1985.;

AN = 101742;
  T = Research requirement summaries for the comprehensive exam (1985).;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-85-11.;
  D = 1985.;

AN = 101743;
  A = Lipsker, George.;
  T = DEXEC - a distributed exec system.;
  I = Brown University. Computer Science Department.;
  R = Technical report CS-85-12.;
  D = 1985.;

AN = 101744;
  A = Fisher, Allan L.;
  T = Implementation issues for algorithmic VLSI processor arrays.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  D = 1984.;
  K = Thesis (Ph.D.).;
  K = Dictionary machines.;
  K = Information retrieval.;
  K = Massively parallel architectures.;
  K = PSC.;
  K = Radix machines.;
  K = Special-purpose architectures.;
  K = Synchronization.;
  K = Systolic algorithms.;
  K = Systolic arrays.;
  K = Tree machines.;

AN = 101745;
  A = Hinton, Geoffrey E.;
  T = Distributed representations.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-84-157.;
  D = 1984.;
  K = Distributed memory.;
  K = Knowledge representation.;

AN = 101746;
  A = Lehman, Philip L.;
  T = Systolic arrays for rapid processing of simple database
transactions.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-84-160.;
  D = 1984.;
  K = Thesis (Ph.D.).;
  K = Database consistency.;
  K = Relational databases.;
  K = Simple query pipeline scheduling.;
  K = Transaction processing.;

AN = 101747;
  A = Sha, Lui.;
  T = Modular concurrency control and failure recovery - consistency,
correctness and optimality.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-114.;
  D = 1985.;
  K = Thesis (Ph.D.).;
  K = Distributed systems.;
  K = Scheduling rules.;

AN = 101748;
  A = Carbonell, Jaime G.;
  T = Derivational analogy: a theory of reconstructive problem solving
and
expertise acquisition.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-115.;
  D = 1985.;
  K = Case-based reasoning.;

AN = 101749;
  A = Kahn, Gary.;
  A = McDermott, John.;
  T = MUD: a drilling fluids consultant.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-116.;
  D = 1985.;
  K = Diagnostic systems.;
  K = Knowledge acquisition.;

AN = 101750;
  A = Iwasaki, Yumi.;
  A = Simon, Herbert A.;
  T = Causality in device behavior.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-118.;
  D = 1985.;
  K = Causal ordering.;
  K = Causal relation.;
  K = Comparative statics.;
  K = Qualitative physics.;

AN = 101751;
  A = Herlihy, Maurice.;
  T = Using type information to enhance the availability of partitioned
data.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-119.;
  D = 1985.;
  K = Concurrency control.;
  K = Consistency.;
  K = Distributed systems.;
  K = Layered consensus locking.;
  K = Partitioned networks.;
  K = Quorum assignment.;
  K = Replicated data.;

AN = 101752;
  A = Bryant, Randal E.;
  T = Symbolic verification of MOS circuits.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-120.;
  D = 1985.;
  K = Circuit design.;
  K = Logic simulation.;
  K = MOSSYM.;
  K = Switch-level simulation.;

AN = 101753;
  A = Doyle, Jon.;
  T = Reasoned assumptions and Pareto optimality.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-121.;
  D = 1985.;
  K = Artificial intelligence.;
  K = Economic theory.;
  K = Group decision making.;
  K = Inference rules.;
  K = Non-monotonic reasoning.;

AN = 101754;
  A = McKeown, David M., Jr.;
  A = Pane, John F.;
  T = Alignment and connection of fragmented linear features in aerial
imagery.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-122.;
  D = 1985.;
  K = Cultural features.;
  K = Feature extraction.;
  K = Image segmentation.;
  K = Region interpolation.;
  K = Spline approximation.;

AN = 101755;
  A = Herlihy, Maurice.;
  T = Comparing how atomicity mechanisms support replication.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-123.;
  D = 1985.;
  K = Concurrency control.;
  K = Distributed systems.;
  K = Locking.;
  K = Quorum assignment.;
  K = Timestamps.;

AN = 101756;
  A = Dill, David L.;
  A = Clarke, Edmund M.;
  T = Automatic verification of asynchronous circuits using temporal
logic.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-125.;
  D = 1985.;
  K = Circuit design.;
  K = Timing constraints.;

AN = 101757;
  A = Lehr, Theodore F.;
  T = The implementation of a production system machine.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-126.;
  D = 1985.;
  K = Computer architecture.;
  K = OPS5.;
  K = Performance improvement.;
  K = Production systems.;
  K = RISCF.;
  K = Rete algorithm.;

AN = 101758;
  A = Bruegge, Bernd.;
  T = Debugging Ada.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-127.;
  D = 1985.;
  K = Debuggers.;

AN = 101759;
  A = Segall, Zary.;
  A = Rudolph, Larry.;
  T = PIE - a programming and instrumentation environment for parallel
processing.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-128.;
  D = 1985.;
  K = Program development.;
  K = Program efficiency.;
  K = Programming environments.;

AN = 101760;
  A = Garlan, David.;
  T = Flexible unparsing in a structure editing environment.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-129.;
  D = 1985.;
  K = Programming environments.;
  K = UAL.;
  K = Unparse specification languages.;
  K = VIZ.;
  K = Views.;

AN = 101761;
  A = Minton, Steven.;
  T = A game-playing program that learns by analyzing examples.;
  I = Carnegie-Mellon University. Department of Computer Science.;
  R = CMU-CS-85-130.;
  D = 1985.;
  K = Concept acquisition.;
  K = Constraint based generalization.;
  K = Forcing configurations.;
  K = Learning from examples.;
  K = Machine learning.;
  K = Tactical combinations.;
  K = Winning combinations.;

AN = 101762;
  A = Peshkin, M. A.;
  A = Sanderson, A. C.;
  T = A modeless convex hull algorithm for simple polygons.;
  I = Carnegie-Mellon University. Robotics Institute.;
  R = CMU-RI-TR-85-8.;
  D = 1985.;

AN = 101763;
  A = Fox, Mark S.;
  A = Wright, J. Mark.;
  A = Adam, David.;
  T = Experiences with SRL: an analysis of a frame-based knowledge
representation.;
  I = Carnegie-Mellon University. Robotics Institute.;
  R = CMU-RI-TR-85-10.;
  D = 1985.;
  K = Knowledge representation languages.;

AN = 101764;
  A = Smith, Stephen F.;
  A = Ow, Peng Si.;
  T = The use of multiple problem decompositions in time constrained
planning
tasks.;
  I = Carnegie-Mellon University. Robotics Institute.;
  R = CMU-RI-TR-85-11.;
  D = 1985.;
  K = Job shop scheduling.;
  K = Multi-agent planning systems.;
  K = Resource allocation.;

AN = 101765;
  A = Brost, Randy C.;
  T = Planning robot grasping motions in the presence of uncertainty.;
  I = Carnegie-Mellon University. Robotics Institute.;
  R = CMU-RI-TR-85-12.;
  D = 1985.;
  K = Manipulators.;

AN = 101766;
  A = Ramakrishnan, K. K.;
  T = Analysis of the dynamic window congestion control protocol in
heterogeneous environments including satellite links.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-284.;
  D = 1984.;

AN = 101767;
  A = Costa, Manuel.;
  T = Electromagnetic radiation from a system of interconnected computer
equipment in the presence of a ground plane.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-292.;
  D = 1984.;

AN = 101768;
  A = Jain, Rajendra.;
  A = Chlamtac, Imrich.;
  T = The P(square) algorithm for dynamic calculation of quantiles and
histograms without storing observations.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-300.;
  D = 1985.;

AN = 101769;
  A = Jain, Rajendra.;
  A = Chiu, Dah-Ming.;
  A = Hawe, William R.;
  T = A quantitative measure of fairness and discrimination for resource
allocation in shared computer system.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-301.;
  D = 1984.;

AN = 101770;
  A = Costa, Manuel.;
  T = EMI CAD tools-I: computer code for the inside fields problem.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-312.;
  D = 1984.;
  K = Electromagnetic interference.;

AN = 101771;
  A = Costa, Manuel.;
  T = EMI CAD tools-II: computer code for the outside fields problem.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-313.;
  D = 1984.;
  K = Electromagnetic interference.;

AN = 101772;
  A = Chiu, Dah-Ming.;
  A = Hawe, William R.;
  A = Jain, Rajendra.;
  A = Loui, Ronald.;
  A = Ting, Dennis.;
  T = The impact, design and use of ETHERBRIDGE.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-316.;
  D = 1983.;
  N = "This report contains three reports that address the impact,
design and
use of bridges.";

AN = 101772;
  A = Chiu, Dah-Ming.;
  A = Hawe, William R.;
  A = Jain, Rajendra.;
  T = Bridges and the interconnection of local area networks.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-316.;
  D = 1983.;
  N = One of three papers on "bridges" published together as Eastern
Research
Laboratory report DEC-TR-316.;

AN = 101772;
  A = Ting, Dennis.;
  T = The implementation and performance of an Etherbridge.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-316.;
  D = 1983.;
  N = One of three papers on "bridges" published together as Eastern
Research
Laboratory report DEC-TR-316.;

AN = 101772;
  A = Loui, Ronald.;
  A = Chiu, Dah-Ming.;
  T = On bridge location and design.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-316.;
  D = 1983.;
  N = One of three papers on "bridges" published together as Eastern
Research
Laboratory report DEC-TR-316.;

AN = 101773;
  A = Hawe, William R.;
  A = Kirby, Alan.;
  A = Lauck, Anthony.;
  T = An architecture for transparently interconnecting IEEE 802 local
area
networks.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-322.;
  D = 1984.;

AN = 101774;
  A = Hawe, William R.;
  A = Varghese, George.;
  T = Extended local area network management principles.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-324.;
  D = 1984.;

AN = 101775;
  A = Chiu, Dah-Ming.;
  T = Simple models of packet arrival control.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-326.;
  D = 1984.;

AN = 101776;
  A = Jain, Rajendra.;
  T = Divergence of timeout algorithms for packet retransmissions.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-329.;
  D = 1984.;

AN = 101777;
  A = Jain, Rajendra.;
  T = On catching out-of-order packets in window flow controlled
network.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-342.;
  D = 1985.;

AN = 101778;
  A = Ramakrishnan, K. K. ;
  A = Hawe, William R.;
  T = Performance of an extended local area network for image
applications.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-343.;
  D = 1985.;

AN = 101779;
  A = Jain, Rajendra.;
  T = CUTE: a timeout based congestion control scheme for digital
network
architecture.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-353.;
  D = 1985.;

AN = 101780;
  A = Jain, Rajendra.;
  T = Using simulation to design a computer network congestion control
protocol.;
  I = Digital Equipment Corporation (DEC). Eastern Research Laboratory.;
  R = DEC-TR-358.;
  D = 1985.;
  K = Computer networks.;
  K = DECnet.;
  K = Digital network architecture.;

AN = 101781;
  A = Rovner, Paul.;
  A = Levin, Roy.;
  A = Wick, John.;
  T = On extending Modula-2 for building large, integrated systems.;
  I = Digital Equipment Corporation (DEC). Systems Research Center.;
  R = Report no. 3.;
  D = 1985.;

AN = 101782;
  A = Ramshaw, Lyle.;
  T = Eliminating go to's while proserving program structure.;
  I = Digital Equipment Corporation (DEC). Systems Research Center.;
  R = Report no. 4.;
  D = 1985.;

AN = 101783;
  A = Darlington, J.;
  A = Field, A. J.;
  A = Pull, H.;
  T = The unification of functional and logic languages.;
  I = Imperial College of Science and Technology. Department of
Computing.;
  R = Research report DOC 85/3.;
  D = 1985.;
  K = Functional programming.;
  K = Logic programming.;
  K = Reduction.;
  K = Resolution.;

AN = 101784;
  A = Holenderski, Leszek.;
  T = An approach to mechanised verification of behaviours of concurrent
systems.;
  I = Imperial College of Science and Technology. Department of
Computing.;
  R = Research report DOC 85/5.;
  D = 1984.;
  K = Deadlock.;
  K = Experiments on processes.;
  K = Regular expressions.;

AN = 101785;
  A = Gregory, Steve.;
  A = Neely, Rob.;
  A = Ringwood, Graem.;
  T = Parlog for specification, verification and simulation.;
  I = Imperial College of Science and Technology. Department of
Computing.;
  R = Research report DOC 85/7.;
  D = 1985.;
  K = Logic programming.;
  K = Parallel programming.;
  K = PARLOG.;

AN = 101786;
  A = Andriopoulos, X.;
  A = Sloman, M.;
  T = A database model for distributed realtime systems.;
  I = Imperial College of Science and Technology. Department of
Computing.;
  R = Research report DOC 85/8.;
  D = 1985.;
  K = Data configuration language.;
  K = Database definition language.;

AN = 101787;
  A = Vignard, Philippe.;
  T = Criquet version 2: un outil de base pour construire des systemes
experts.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 380.;
  D = 1985.;
  K = Expert systems.;

AN = 101788;
  A = Saint-Dizier, Patrick.;
  T = On syntax and semantics of adjective phrases in logic
programming.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 381.;
  D = 1985.;

AN = 101789;
  A = Erhel, Jocelyne.;
  A = Lichnewsky, Alain.;
  A = Thomasset, Francois.;
  T = Vectorizing finite element methods.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 383.;
  D = 1985.;

AN = 101790;
  A = Bamberger, Alain.;
  A = Joly, Patrick.;
  A = Roberts, Jean Elizabeth.;
  A = Teron, Jean Luc.;
  T = Absorbing boundary conditions for Rayleigh waves.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 384.;
  D = 1985.;
  K = Elastodynamics.;

AN = 101791;
  A = Hennart, Jean-Pierre.;
  T = Nodal schemes, mixed-hybrid finite elements and block-centered
finite
differences.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 386.;
  D = 1985.;

AN = 101792;
  A = Thonnat, Monique.;
  T = Automatic morphological description of galaxies and classification
by an
expert system.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 387.;
  D = 1985.;

AN = 101793;
  A = Saint-Dizier, Patrick.;
  T = An approach to natural language semantics in logic programming.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 389.;
  D = 1985.;

AN = 101794;
  A = Le Boudec, Jean-Yves.;
  T = A BCMP extension to multiserver stations with concurrent classes
of
customers.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 390.;
  D = 1985.;
  K = Queueing networks.;

AN = 101795;
  A = Deransart, Pierre.;
  A = Maluszynski, Jan.;
  T = Relating logic programs and attribute grammars.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 393.;
  D = 1985.;
  K = Attribute dependency scheme.;
  K = Data flow analysis.;
  K = Logic programming.;

AN = 101796;
  A = Baccelli, Francois.;
  A = Makowski, Armand M.;
  T = Simple computable bounds for the fork-join queue.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 394.;
  D = 1985.;

AN = 101797;
  A = Boudol, Gerard.;
  T = Notes on algebraic calculi of processes.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 395.;
  D = 1985.;

AN = 101798;
  A = Le Chenadec, Philippe.;
  T = A completion of some Coxeter groups.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 396.;
  D = 1985.;
  K = Confluence.;
  K = Finitely presented groups.;
  K = Knuth-Bendix procedures.;
  K = Noetherianity.;
  K = Word problem.;

AN = 101799;
  A = Flajolet, Philippe.;
  T = Ambiguity and transcendence.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 397.;
  D = 1985.;
  K = Context free languages.;

AN = 101800;
  A = Flajolet, Philippe.;
  A = Regnier, Mireille.;
  A = Sedgewick, Robert.;
  T = Some uses of the Mellin integral transform in the analysis of
algorithms.;
  I = Institut National de Recherche en Informatique et en Automatique
(INRIA).;
  R = Rapport de recherche 398.;
  D = 1985.;

AN = 052024;
  A = Gazdar, Gerald.;
  A = Pullum, Geoffrey K.;
  T = Computationally relevant properties of natural languages and their
grammars.;
  I = Stanford University. Center for the Study of Language and
Information.;
  R = CSLI-85-24.;
  D = 1985.;
  P = 45p.;

AN = 052025;
  A = Fagin, Ronald.;
  A = Vardi, Moshe.;
  T = An internal semantics for modal logic: preliminary report.;
  I = Stanford University. Center for the Study of Language and
Information.;
  R = CSLI-85-25.;
  D = 1985.;
  P = 24p.;

AN = 052026;
  A = Barwise, Jon.;
  T = The situation in logic - III: simulation, sets and the axiom of
foundation.;
  I = Stanford University. Center for the Study of Language and
Information.;
  R = CSLI-85-26.;
  D = 1985.;
  P = 24p.;

AN = 052027;
  A = van Benthem, Johan.;
  T = Semantic automata.;
  I = Stanford University. Center for the Study of Language and
Information.;
  R = CSLI-85-27.;
  D = 1985.;
  P = 31p.;

AN = 052028;
  A = Sells, Peter.;
  T = Restrictive and non-restrictive modification.;
  I = Stanford University. Center for the Study of Language and
Information.;
  R = CSLI-85-28.;
  D = 1985.;
  P = 33p.;

AN = 025055;
  A = Haddad, Ramsey W.;
  A = Knuth, Donald E.;
  T = A programming and problem-solving seminar.;
  I = Stanford University. Department of Computer Science.;
  R = STAN-CS-85-1055.;
  D = 1985.;
  P = 103p.;
  N = "This report contains edited transcripts of the discussions held
in
Stanford's course, CS204, Problem Seminar, during Winter Quarter 1985.";
  K = CS204.;
  K = Code breaking.;
  K = Distributed stability.;
  K = Hardware fault detection.;
  K = High-tech art.;
  K = Monotonic squares.;

AN = 025056;
  A = Abadi, Martin.;
  A = Manna, Zohar.;
  T = Nonclausal temporal deduction.;
  I = Stanford University. Department of Computer Science.;
  R = STAN-CS-85-1056.;
  D = 1985.;
  P = 17p.;
  K = Nonclausal resolution.;
  K = Propositional temporal logic.;
  K = Theorem proving.;

AN = 025057;
  A = Mason, Ian A.;
  A = Talcott, Carolyn L.;
  T = Memories of S-expressions: proving properties of Lisp-like
programs that
destructively alter memory.;
  I = Stanford University. Department of Computer Science.;
  R = STAN-CS-85-1057.;
  D = 1985.;
  P = 46p.;
  K = Computations over memory structures.;
  K = Correctness proofs.;
  K = Robson copying algorithm.;

AN = 101801;
  A = Kaul, R. N.;
  A = Kaur, S.;
  T = Generalized convex functions -- properties, optimality and
duality.;
  I = Stanford University. Department of Operations Research. Systems
Optimization Laboratory.;
  R = Technical report SOL 84-4.;
  D = 1984.;
  P = 24p.;
  K = Locally star-shaped set.;
  K = Semilocally convex function.;

AN = 101802;
  A = Chadee, Floyd F.;
  T = Direct secant updates of sparse matrix factors.;
  I = Stanford University. Department of Operations Research. Systems
Optimization Laboratory.;
  R = Technical report SOL 84-5.;
  D = 1984.;
  P = 56p.;
  K = Newton's method.;
  K = Quasi-Newton methods.;
  K = Sparsity.;

AN = 101803;
  A = Gill, Philip E.;
  A = Murray, Walter.;
  A = Saunders, Michael A.;
  A = Wright, Margaret H.;
  T = Software and its relationship to methods.;
  I = Stanford University. Department of Operations Research. Systems
Optimization Laboratory.;
  R = Technical report SOL 84-10.;
  D = 1984.;
  P = 15p.;
  K = Numerical analysis.;
  K = Numerical software.;
  K = Optimization.;

AN = 101804;
  A = Gill, Philip E.;
  A = Murray, Walter.;
  A = Saunders, Michael A.;
  A = Stewart, G. W.;
  A = Wright, Margaret H.;
  T = Properties of a representation of a basis for the null space.;
  I = Stanford University. Department of Operations Research. Systems
Optimization Laboratory.;
  R = Technical report SOL 85-1.;
  D = 1985.;
  P = 14p.;
  K = Constrained optimization.;
  K = QR factorization.;
  K = Regularized Householder transformations.;

AN = 101805;
  A = Gill, Philip E.;
  A = Murray, Walter.;
  A = Saunders, Michael A.;
  A = Wright, Margaret H.;
  T = Model building and practical aspects of nonlinear programming.;
  I = Stanford University. Department of Operations Research. Systems
Optimization Laboratory.;
  R = Technical report SOL 85-2.;
  D = 1985.;
  P = 39p.;
  K = Numerical methods.;
  K = Optimization.;
  K = Quasi-Newton methods.;
  K = Sequential quadratic programming.;

AN = 101806;
  A = Scott, Dan A.;
  T = A dynamic programming approach to time-staged convex programs.;
  I = Stanford University. Department of Operations Research. Systems
Optimization Laboratory.;
  R = Technical report SOL 85-3.;
  D = 1985.;
  P = 75p.;
  K = Approximation in function space.;
  K = Nested decomposition.;
  K = Staircase linear programs.;

AN = 101807;
  A = Lustig, Irvin J.;
  T = A practical approach to Karmarkar's algorithm.;
  I = Stanford University. Department of Operations Research. Systems
Optimization Laboratory.;
  R = Technical report SOL 85-5.;
  D = 1985.;
  P = 20p.;
  K = Least squares problems.;
  K = Linear programming.;
  K = Projective method.;
  K = Simplex method.;

AN = 101808;
  A = Dantzig, George B.;
  T = Impact of linear programming on computer development.;
  I = Stanford University. Department of Operations Research. Systems
Optimization Laboratory.;
  R = Technical report SOL 85-7.;
  D = 1985.;
  P = 20p.;
  K = Duality theorem.;
  K = Electronic computers.;
  K = History of computing.;
  K = Simplex method.;
  K = Triangular models.;
  K = USAF Project SCOOP.;

AN = 101809;
  A = Chadee, Floyd F.;
  T = Sparse quasi-Newton methods and the continuation problem.;
  I = Stanford University. Department of Operations Research. Systems
Optimization Laboratory.;
  R = Technical report SOL 85-8.;
  D = 1985.;
  P = 127p.;
  K = Thesis (Ph.D.).;
  K = Homotopy.;
  K = Predictor-corrector.;

AN = 035255;
  A = Gross, Thomas R.;
  T = Code optimization of pipeline constraints.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 83-255.;
  D = 1983.;
  P = 112p.;
  K = Thesis (Ph.D.).;
  K = Code generation.;
  K = Instruction reordering.;
  K = Interlocks.;
  K = Microprogramming.;
  K = Pipelining.;
  K = Register allocation.;

AN = 035256;
  A = Ganapathi, Mahadevan.;
  A = Fischer, Charles N.;
  T = Instruction selection by attributed parsing.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 84-256.;
  D = 1984.;
  P = 31p.;
  K = Code generation.;
  K = Code generator generator.;
  K = Code optimization.;
  K = Compiler compiler.;
  K = Intermediate representation.;
  K = Machine dependent optimization.;
  K = Machine description.;

AN = 035257;
  A = Ganapathi, Mahadevan.;
  A = Hennessy, John L.;
  A = Sarkar, Vivek.;
  T = Reverse synthesis compilation for architectural research.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 84-257.;
  D = 1984.;
  P = 77p.;
  K = Code generation.;
  K = Code generator generator.;
  K = Code optimization.;
  K = Compiler design.;
  K = Intermediate representation.;
  K = Retargetability.;

AN = 035258;
  A = von Henke, Friedrich W.;
  T = A strongly typed language for specifying programs.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 84-258.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Program Analysis and Verification Group.;
  R = Report no. 23.;
  D = 1984.;
  P = 29p.;
  K = Generic data types.;
  K = Program specification.;
  K = Specification languages.;
  K = Type checking.;

AN = 035259;
  A = Przybylski, Steven A.;
  A = Gross, Thomas R.;
  A = Hennessy, John L.;
  A = Jouppi, Norman P.;
  A = Rowen, Christopher.;
  T = Organization and VSLI implementation of MIPS.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 84-259.;
  D = 1984.;
  P = 36p.;

AN = 035260;
  A = Alpert, Donald.;
  T = Memory hierarchies for directly executed language
microprocessors.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 84-260.;
  D = 1984.;
  P = 147p.;
  K = Thesis (Ph.D.).;
  K = DEL.;
  K = Memory hierarchy.;
  K = Microprocessor design.;

AN = 035261;
  A = Luckham, David C.;
  A = von Henke, Friedrich W.;
  A = Krieg-Brueckner, Bernd.;
  A = Owe, Olaf.;
  T = Anna: a language for annotating Ada programs. Preliminary
reference
manual.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 84-261.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Program Analysis and Verification Group.;
  R = Report no. 24.;
  D = 1984.;
  P = 140p.;
  K = Formal requirements.;
  K = Program annotation.;
  K = Program testing.;
  K = Program verification.;
  K = Software methodology.;
  K = Software validation.;
  K = Specification languages.;

AN = 035262;
  A = Helmbold, David.;
  A = Luckham, David C.;
  T = Debugging Ada tasking programs.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 84-262.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Program Analysis and Verification Group.;
  R = Report no. 25.;
  D = 1984.;
  P = 18p.;
  K = Concurrent programming.;
  K = Concurrent specifications.;
  K = Deadness errors.;
  K = Program testing.;

AN = 035265;
  A = Luckham, David C.;
  A = von Henke, Friedrich W.;
  T = An overview of Anna: a specification language for Ada.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 84-265.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Program Analysis and Verification Group.;
  R = Report no. 26.;
  D = 1984.;
  P = 22p.;
  K = Formal requirements.;
  K = Program annotation.;
  K = Program testing.;
  K = Program verification.;
  K = Software methodology.;
  K = Software validation.;
  K = Specification languages.;

AN = 035266;
  A = Jouppi, Norman P.;
  T = Timing verification and performance improvement of MOS VLSI
designs.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 84-266.;
  D = 1984.;
  P = 126p.;
  K = Thesis (Ph.D.).;
  K = Electrical rules checking.;
  K = Timing analysis.;

AN = 035267;
  A = Mitchell, Chad Leland.;
  T = The instruction bandwidth of direct correspondence architectures.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 84-267.;
  D = 1984.;
  P = 39p.;
  K = DCA.;
  K = DEL.;
  K = Direct Execution Architecture.;
  K = Instruction encoding.;
  K = Interpreters.;
  K = Operand encoding.;
  K = Processor architecture.;
  K = Simulation.;

AN = 035268;
  A = Linton, Mark A.;
  T = FABRIC: a package for managing interwoven data.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 85-268.;
  D = 1985.;
  P = 14p.;
  K = Database systems.;
  K = Interactive programming environments.;

AN = 035269;
  A = Rosenblum, David S.;
  T = A methodology for the design of Ada transformation tools in a
DIANA
environment.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 85-269.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Program Analysis and Verification Group.;
  R = Report no. 27.;
  D = 1985.;
  P = 21p.;
  K = Preprocessor.;
  K = Software design.;
  K = Tasking.;

AN = 035271;
  A = Nassehi, M. Mehdi.;
  A = Tobagi, Fouad A.;
  A = Marhic, Michel E.;
  T = Topological design of fiber optics local area networks with
application
to Expressnet.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 85-271.;
  D = 1985.;
  P = 76p.;

AN = 035272;
  A = Schulman, Naomi.;
  T = Bibliography of the Computer Systems Laboratory, 1968-1985. Edited
by
Naomi Schulman.;
  I = Stanford University. Department of Computer Science.;
  R = Technical report 85-272.;
  D = 1985.;
  P = 45p.;
  K = Bibliographies.;
  K = Stanford University Digital Systems Laboratory.;

AN = 035273;
  A = Kanakia, Hemant.;
  A = Tobagi, Fouad A.;
  T = Theoretical results on distributed processing with limited
computing
resources.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 85-273.;
  D = 1985.;
  P = 40p.;
  K = Centralized processing.;
  K = Execution time.;

AN = 035274;
  A = Brazio, Jose M.;
  A = Tobagi, Fouad A.;
  T = Conditions for product form solutions in multihop packet radio
network
models.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 85-274.;
  D = 1985.;
  P = 33p.;
  K = Channel access protocols.;
  K = Throughput analysis.;

AN = 035275;
  A = Fine, Michael.;
  A = Tobagi, Fouad A.;
  T = Packet voice on a local area network with round robin service.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical report 85-275.;
  D = 1985.;
  P = 48p.;
  K = Multiple access broadcast networks.;
  K = Packet switching networks.;
  K = Speech transmission.;
  K = Voice/data access protocol.;

AN = 038238;
  A = Hassan, Syed Zahoor.;
  A = McCluskey, Edward J.;
  T = Increased fault coverage through multiple signatures.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 83-238.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 83-17.;
  D = 1983.;
  P = 33p.;
  K = Built-in-test.;
  K = Compact testing.;
  K = Exhaustive testing.;
  K = Signature analysis.;

AN = 038243;
  A = McCluskey, Edward J.;
  A = Lu, David Jun.;
  A = Bozorgui-Nesbat, Saied.;
  A = Mahmood, Aamer.;
  T = Testing VHSIC devices.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-243.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-1.;
  D = 1984.;
  P = 65p.;
  N = "This report is composed of visual aids presented in a video tape
titled
'Testing VHSIC Devices.'";

AN = 038244;
  T = Preprints of the Fourteenth IEEE International Conference on
Fault-Tolerant Computing.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-2.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-244.;
  D = 1984.;
  P = 29p.;
  N = "Contains preprints of [five] papers accepted for presentation at
the
Fourteenth IEEE International Conference on Fault-Tolerant Computing,
Orlando,
Florida, June 20-22, 1984.";

AN = 038244;
  A = Archambeau, Eric C.;
  A = McCluskey, Edward J.;
  T = Fault coverage of psuedo-exhaustive testing.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-2.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-244.;
  D = 1984.;
  P = 5p.;
  N = One of five FTCS-14 preprints issued together as CRC report no.
84-2.;

AN = 038244;
  A = Cortes, Matio L.;
  A = Iyer, Ravishankar K.;
  T = Device failures and system activity: a thermal effects model.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-2.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-244.;
  D = 1984.;
  P = 6p.;
  N = One of five FTCS-14 preprints issued together as CRC report no.
84-2.;

AN = 038244;
  A = Hassan, Syed Zahoor.;
  A = McCluskey, Edward J.;
  T = Increased fault coverage through multiple signatures.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-2.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-244.;
  D = 1984.;
  P = 6p.;
  N = One of five FTCS-14 preprints issued together as CRC report no.
84-2.;

AN = 038244;
  A = Iyer, Ravishankar K.;
  A = Velardi, Paola.;
  T = A statistical study of hardware-related software errors in MVS.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-2.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-244.;
  D = 1984.;
  P = 6p.;
  N = One of five FTCS-14 preprints issued together as CRC report no.
84-2.;

AN = 038244;
  A = Wang, Laung-Terng.;
  A = McCluskey, Edward J.;
  T = A new condenced linear feedback shift register design for
VLSI/systems
Testing.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-2.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-244.;
  D = 1984.;
  P = 6p.;
  N = One of five FTCS-14 preprints issued together as CRC report no.
84-2.;

AN = 038245;
  A = Hassan, Syed Zahoor.;
  A = McCluskey, Edward J.;
  T = Increasing effective fault coverage of parallel signature
analyzers.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-245.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-3.;
  D = 1984.;
  P = 42p.;
  K = Aliasing.;
  K = Built-in-test.;
  K = Compact testing.;
  K = Exhaustive testing.;
  K = Fault masking.;
  K = Signature analyis.;

AN = 038246;
  A = McCluskey, Edward J.;
  T = VSLI design for testability.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-246.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-4.;
  D = 1984.;
  P = 4p.;
  N = "This report is a preprint of a paper to be presented at the 1984
Symposium on VLSI Technology, San Diego, California, September 10-12,
1984.";
  K = DFT.;

AN = 038247;
  A = Wagner, Kenneth D.;
  A = McCluskey, Edward J.;
  T = Tuning, clock distribution and communication in VLSI high-speed
chips.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-247.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-5.;
  D = 1984.;
  P = 31p.;
  K = Clock skew.;
  K = Gate skew.;
  K = Integrated circuits.;
  K = Lasar trim.;
  K = Long path.;
  K = Pipeline.;
  K = Scaling.;
  K = Short path.;
  K = Synchronous systems.;

AN = 038248;
  A = McCluskey, Edward J.;
  T = Pseudo-exhaustive testing for VLSI devices.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-248.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-6.;
  D = 1984.;
  P = 17p.;
  K = Built-in self-test.;
  K = Concurrent test pattern generation.;
  K = Signature analysis.;

AN = 038249;
  A = Chin, Gary K.;
  A = McCluskey, Edward J.;
  T = Weighted pattern generation for built-in self-test.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-249.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-7.;
  D = 1984.;
  P = 14p.;
  K = Linear feedback shift register.;
  K = Pseudo random pattern generation.;
  K = Random pattern testability.;

AN = 038250;
  T = Preprints of the International Test Conference 1984.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-8.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-250.;
  D = 1984.;
  P = 37p.;
  N = "Contains preprints of [six] papers presented at the International
Test
Conference 1984, Philadelphia, Pennsylvania, October 15-18, 1984.";

AN = 038250;
  A = Bozorgui-Nesbat, Saied.;
  A = McCluskey, Edward J.;
  T = Lower overhead design for testability of programmable logic
arrays.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-8.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-250.;
  D = 1984.;
  P = 10p.;
  N = One of six 1984 International Test Conference preprints issued
together
as CRC report no. 84-8.;

AN = 038250;
  A = Hassan, Syed Zahoor.;
  A = McCluskey, Edward J.;
  T = Psuedo-exhaustive testing of sequential machines using signature
analysis.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-8.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-250.;
  D = 1984.;
  P = 7p.;
  N = One of six 1984 International Test Conference preprints issued
together
as CRC report no. 84-8.;

AN = 038250;
  A = Hughes, Joseph L. A.;
  A = McCluskey, Edward J.;
  T = An analysis of the multiple fault detection capabilities of single
stuck-at fault test sets.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-8.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-250.;
  D = 1984.;
  P = 7p.;
  N = One of six 1984 International Test Conference preprints issued
together as
CRC report no. 84-8.;

AN = 038250;
  A = Sun, Zuxi.;
  A = Wang, Laung-Terng.;
  T = Self-testing of embedded RAMS.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-8.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-250.;
  D = 1984.;
  P = 9p.;
  N = One of six 1984 International Test Conference preprints issued
together
as CRC report no. 84-8.;

AN = 038250;
  A = McCluskey, Edward J.;
  T = Errors in education.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-8.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-250.;
  D = 1984.;
  P = 1p.;
  N = One of six 1984 International Test Conference preprints issued
together
as CRC report no. 84-8.;
  N = "This paper is a panal statement from the 'Academic Curriculum
Forum for
Test Technology.'";

AN = 038250;
  A = McCluskey, Edward J.;
  T = Built-in self test architectures.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-8.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-250.;
  D = 1984.;
  P = 3p.;
  N = One of six 1984 International Test Conference preprints issued
together
as CRC report no. 84-8.;
  N = "This paper is from the 'Academic Curriculum Forum for Test
Technology.'";

AN = 038251;
  A = McCluskey, Edward J.;
  T = Testing semi-custom logic.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-251.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-9.;
  D = 1984.;
  P = 7p.;
  K = Design-for-testability techniques.;
  K = DFT.;

AN = 038252;
  T = Preprints of the 1984 IEEE International Conference on
Computer-Aided
Design.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-10.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-252.;
  D = 1984.;
  P = 9p.;
  N = "Contains preprints of [three] papers accepted for presentation at
the
1984 IEEE International Conference on Computer-Aided Design, Santa
Clara,
California, November 12-15, 1984.";

AN = 038252;
  A = Bozorgui-Nesbat, Saied.;
  A = McCluskey, Edward J.;
  T = Design for delay testing of programmable logic arrays.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-10.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-252.;
  D = 1984.;
  P = 3p.;
  N = One of three ICCAD-84 preprints issued together as CRC report no.
84-10.;

AN = 038252;
  A = Hassan, Syed Zahoor.;
  A = McCluskey, Edward J.;
  T = Enhancing the effectiveness of parallel signature analyzers.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-10.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-252.;
  D = 1984.;
  P = 3p.;
  N = One of three ICCAD-84 preprints issued together as CRC report no.
84-10.;

AN = 038252;
  A = Wang, Laung-Terng.;
  A = Edwin, Law.;
  T = DTA: Daisy Testability Analyzer.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-10.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-252.;
  D = 1984.;
  P = 3p.;
  N = One of three ICCAD-84 preprints issued together as CRC report no.
84-10.;

AN = 038253;
  T = Preprints of the AIAA/IEEE Digital Avionics Systems Conference.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-11.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-253.;
  D = 1984.;
  P = 14p.;
  N = "Contains preprints of [two] papers accepted for presentation at
the
AIAA/IEEE Digital Avionics Systems Conference, Baltimore, Maryland,
December
3-6, 1984.";

AN = 038253;
  A = Mahmood, Aamer.;
  A = Andrews, Dorothy M.;
  A = McCluskey, Edward J.;
  T = Executable assertions and flight software.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-11.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-253.;
  D = 1984.;
  P = 6p.;
  N = One of two 1984 AIAA/IEEE Digital Avionics Systems Conference
preprints
issued together as CRC report no. 84-11.;

AN = 038253;
  A = McCluskey, Edward J.;
  T = VSLI design for testability.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-11.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-253.;
  D = 1984.;
  P = 8p.;
  N = One of two 1984 AIAA/IEEE Digital Avionics Systems Conference
preprints
issued together as CRC report no. 84-11.;

AN = 038254;
  T = Preprints of the Eighteenth Annual Hawaii International Conference
on
System Sciences.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-12.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-254.;
  D = 1984.;
  P = 20p.;
  N = "Contains preprints of [two] papers accepted to presentation at
the
Eighteenth Annual Hawaii International Conference on System Sciences,
Honolulu,
Hawaii, January 2-4, 1985.";

AN = 038254;
  A = Andrews, Dorothy M.;
  T = Automation of assertion testing.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-12.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-254.;
  D = 1984.;
  P = 8p.;
  N = One of two HICSS-18 preprints issued together as CRC report no
84-12.;

AN = 038254;
  A = McCluskey, Edward J.;
  T = Synchronous digital logic.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-12.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-254.;
  D = 1984.;
  P = 12p.;
  N = One of two HICSS-18 preprints issued together as CRC report no.
84-12.;

AN = 038255;
  T = Spring COMPCON 85 preprints.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-13.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-255.;
  D = 1984.;
  P = 8p.;
  N = "Contains preprints of [two] papers accepted for presentation at
Spring
COMPCON 85, San Francisco, CA, February 25-29, 1985.";

AN = 038255;
  A = Hughes, Joseph L. A.;
  A = Mourad, Samiha.;
  A = McCluskey, Edward J.;
  T = An experimental study comparing 74LS181 test sets.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-13.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-255.;
  D = 1984.;
  P = 4p.;
  N = One of two COMPCON 85 preprints issued together as CRC report no.
84-13.;

AN = 038255;
  A = McCluskey, Edward J.;
  T = Hardware fault tolerance.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-13.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-255.;
  D = 1984.;
  P = 4p.;
  N = One of two COMPCON 85 preprints issued together as CRC report no.
84-13.;

AN = 038256;
  A = Mahmood, Aamer.;
  A = Andrews, Dorothy M.;
  A = McCluskey, Edward J.;
  T = Writing executable assertions to test flight software.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-256.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-14.;
  D = 1984.;
  P = 5p.;
  K = Digital flight control systems.;
  K = Software testing.;

AN = 038257;
  A = Mahmood, Aamer.;
  A = McCluskey, Edward J.;
  T = Watchdog processors: error coverage and overhead.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-257.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-15.;
  D = 1984.;
  P = 38p.;
  K = Concurrent checking.;
  K = Control flow checking.;
  K = Microprogramming.;
  K = Signature analysis.;
  K = System level fault detection.;

AN = 038258;
  A = Mahmood, Aamer.;
  A = Andrews, Dorothy M.;
  A = McCluskey, Edward J.;
  T = Executable assertions and flight software.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 84-258.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 84-16.;
  D = 1984.;
  P = 31p.;
  K = Digital flight control systems.;
  K = Software testing.;

AN = 038260;
  A = McCluskey, Joseph.;
  T = Bibliography of 1976-1984 CRC publications.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 85-260.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 85-0.;
  D = 1985.;
  P = 23p.;
  K = Bibliographies.;
  K = Stanford University Center for Reliable Computing.;

AN = 038262;
  T = Preprints of the IEEE International Conference on Fault-Tolerant
Computing.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 85-3.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 85-262.;
  D = 1985.;
  P = 12p.;
  N = "Contains preprints of [two] papers accepted for presentation at
the
[Fifteenth] IEEE International Conference on Fault-Tolerant Computing,
Ann
Arbor, Michigan, June 19-21, 1985.";

AN = 038262;
  A = Mahmood, Aamer.;
  A = McCluskey, Edward J.;
  T = Watchdog processors: error coverage and overhead.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 85-3.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 85-262.;
  D = 1985.;
  P = 6p.;
  N = One of two FTCS-15 preprints issued together as CRC report no.
85-3.;

AN = 038262;
  A = Mourad, Samiha.;
  A = Andrews, Dorothy M.;
  T = The reliabilty of the IBM MVS/XA operating system.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 85-3.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 85-262.;
  D = 1985.;
  P = 6p.;
  N = One of two FTCS-15 preprints issued together as CRC report no.
85-3.;

AN = 038263;
  A = Nassar, Fares A.;
  A = Andrews, Dorothy M.;
  T = A methodology for analysis of failure prediction data.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 85-263.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 85-4.;
  D = 1985.;
  P = 48p.;
  K = Failure/load relationship.;

AN = 038264;
  A = Wang, Laung-Terng.;
  A = McCluskey, Edward J.;
  T = Built-in test for random logic.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory.;
  R = Technical note 85-264.;
  I = Stanford University. Stanford Electronics Laboratories. Computer
Systems
Laboratory. Center for Reliable Computing.;
  R = Report no. 85-5.;
  D = 1985.;
  P = 4p.;
  K = BIST.;
  K = Design-for-testability techniques.;
  K = DFT.;
  K = Test pattern generation.;

AN = 101810;
  A = Goldreich, O.;
  T = Sending certified mail using oblivious transfer and a threshold
scheme.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 325.;
  D = 1984.;

AN = 101811;
  A = Makowsky, J. A.;
  A = Vardi, M. Y.;
  T = On the expressive power of data dependencies.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 326.;
  D = 1984.;

AN = 101812;
  A = Katz, S.;
  A = Shmueli, O.;
  T = Cooperative distributed algorithms for dynamic cycle prevention.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 330.;
  D = 1984.;
  K = Cooperation among operations.;
  K = Distributed invariants.;
  K = Graph searching.;
  K = Program development.;

AN = 101813;
  A = Even, S.;
  A = Goldreich, O.;
  A = Lempel, A.;
  T = A randomized protocol for signing contracts.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 331.;
  D = 1984.;
  K = Certified electronic mail.;
  K = Cryptographic protocols.;
  K = Flipping a coin.;
  K = Oblivious transfer.;
  K = Public key cryptosystems.;

AN = 101814;
  A = Taubenfeld, G.;
  A = Francez, N.;
  T = Proof rules for communication abstractions.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 332.;
  D = 1984.;
  K = Concurrent programming.;
  K = Deadlock.;
  K = Invariants.;
  K = Program verification.;
  K = Scripts.;

AN = 101815;
  A = Israeli, A.;
  A = Shiloach, Y.;
  T = An improved maximal matching parallel algorithm.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 333.;
  D = 1984.;

AN = 101816;
  A = Korach, E.;
  A = Moran, S.;
  A = Zaks, S.;
  T = The optimality of distributed constructions of minimum weight and
degree
restricted spanning trees in a complete network of processors.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 334.;
  D = 1984.;

AN = 101817;
  A = Israeli, A.;
  A = Itai, A.;
  T = A fast and simple randomized parallel algorithm for maximal
matching.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 335.;
  D = 1984.;

AN = 101818;
  A = Shmueli, O.;
  A = Tsur, S.;
  A = Zfira, H.;
  T = Rule supporting in PROLOG.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 337.;
  D = 1984.;

AN = 101819;
  A = Moran, S.;
  T = An improvement of an algorithm for construction of edge disjoint
branchings.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 341.;
  D = 1984.;

AN = 101820;
  A = Moran, S.;
  A = Snir, M.;
  A = Manber, U.;
  T = Applications of Ramsey's theorem to decision trees complexity.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 345.;
  D = 1984.;
  K = Computational complexity.;
  K = Lower bounds.;

AN = 101821;
  A = Erdos, P.;
  A = Linial, N.;
  A = Moran, S.;
  T = Extremal problems on permutations under cyclic equivalence.;
  I = TECHNION - Israel Institute of Technology. Department of Computer
Science.;
  R = Technical report 349.;
  D = 1984.;

AN = 101822;
  A = Harel, David.;
  A = Sherman, R.;
  T = Looping vs. repeating in dynamic logic.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-02.;
  D = 1983.;

AN = 101823;
  A = Harel, David.;
  A = Sherman, R.;
  T = Propositional dynamic logic of flowcharts.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-03.;
  D = 1983.;

AN = 101824;
  A = Peleg, David.;
  T = A generalized closure and complement phenomenon.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-04.;
  D = 1983.;

AN = 101825;
  A = Harel, David.;
  T = Recurring dominoes: making the highly undecidable highly
understandable.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-05.;
  D = 1983.;

AN = 101826;
  A = Shapiro, Ehud Y.;
  T = A subset of Concurrent Prolog and its interpreter.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-06.;
  D = 1983.;
  N = "This is a revised version of technical report TR-003,
ICOT-Institute
for New Generation Computing Technology.";

AN = 101827;
  A = Shapiro, Ehud Y.;
  A = Takeuchi, Akikazu.;
  T = Object oriented programming in Concurrent Prolog.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-08.;
  D = 1983.;

AN = 101828;
  A = Schmidt-Pruzan, Jeanette.;
  A = Shamir, Eli.;
  A = Upfal, Eli.;
  T = Random hypergraph coloring algorithms and the weak chromatic
number.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-09.;
  D = 1983.;

AN = 101829;
  A = Schmidt-Pruzan, Jeanette.;
  T = Probabilistic analysis of strong hypergraph coloring algorithms
and the
strong chromatic number.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-10.;
  D = 1983.;

AN = 101830;
  A = Harel, David.;
  A = Peleg, David.;
  T = Process logic with regular formulas.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-11.;
  D = 1983.;

AN = 101831;
  A = Hellerstein, L.;
  A = Shapiro, Ehud Y.;
  T = Implementing parallel algorithms in Concurrent Prolog.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-12.;
  D = 1983.;
  N = Summary/draft, August 1983.;

AN = 101832;
  A = Manna, Zohar.;
  A = Pnueli, Amir.;
  T = How to cook a temporal proof system for your pet language.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-13.;
  D = 1983.;

AN = 101833;
  A = Harel, David.;
  T = A simple highly undecidable domino problem (or, a lemma on
infinite
trees, with applications).;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-14.;
  D = 1983.;

AN = 101834;
  A = Harel, David.;
  A = Peleg, David.;
  T = On static logics, dynamic logics and complexity classes.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-15.;
  D = 1983.;

AN = 101835;
  A = Brandt, Achi.;
  A = Ophir, Dan.;
  T = Gridpack: toward unification of general grid programming.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-17.;
  D = 1983.;

AN = 101836;
  A = Feldman, Yishai A.;
  T = A decidable propositional probabilistic dynamic logic.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-18.;
  D = 1983.;

AN = 101837;
  A = Schmidt-Pruzan, Jeanette.;
  A = Shamir, Eli.;
  T = Component structure of random hypergraphs.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-19.;
  D = 1984.;

AN = 101838;
  A = Shamir, A.;
  A = Schnorr, C. P.;
  T = Cryptanalysis of certain variants of Rabin's signature scheme.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS83-20.;
  D = 1983.;
  K = Cryptography.;
  K = Digital signatures.;

AN = 101839;
  A = Manna, Zohar.;
  A = Pnueli, Amir.;
  T = Proving precedence properties: the temporal way.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-04.;
  D = 1984.;

AN = 101840;
  A = Harel, David.;
  T = Statecharts: a visual approach to complex systems.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-05.;
  D = 1984.;

AN = 101841;
  A = Shapiro, Ehud Y.;
  A = Mierowsky, Colin.;
  T = Fair, biased, and self-balancing merge operators: their
specification and
implementation in Concurrent Prolog.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-07.;
  D = 1984.;

AN = 101842;
  A = Fiat, A.;
  A = Shamir, A.;
  A = Tulpan, Y.;
  T = How to control the use of software.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-08.;
  D = 1984.;

AN = 101843;
  A = Barringer, Howard.;
  A = Kuiper, Ruurd.;
  A = Pnueli, Amir.;
  T = Now you may compose temporal logic specifications.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-09.;
  D = 1984.;

AN = 101844;
  A = Shapiro, Ehud Y.;
  T = The Bagel: a systolic Concurrent Prolog machine (lecture notes).;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-10.;
  D = 1984.;

AN = 101845;
  A = Ron, Dorit.;
  A = Rosemberg, Flavia.;
  A = Pnueli, Amir.;
  T = A hardware implementation of the CSP primitives and its
verification.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-11.;
  D = 1984.;

AN = 101846;
  A = Fraenkel, Aviezri S.;
  A = Goldschmidt, Elisheva.;
  T = Pspace-hardness of some combinatorial games.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-12.;
  D = 1984.;

AN = 101847;
  A = Cohen, Irit.;
  A = Fraenkel, Aviezri S.;
  T = LIRSORT - linked radix sort.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-13.;
  D = 1984.;

AN = 101848;
  A = Peleg, David.;
  T = Concurrent dynamic logic.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-14.;
  D = 1984.;

AN = 101849;
  A = Pnueli, Amir.;
  A = Zuck, Lenore.;
  T = Verification of multiprocess probabilistic protocols.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-18.;
  D = 1984.;

AN = 101850;
  A = Mierowsky, Colin.;
  T = Design and implementation of flat Concurrent Prolog.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-21.;
  D = 1984.;
  K = Thesis (M.S.).;

AN = 101851;
  A = Bloch, Charlene.;
  T = Source-to-source transformations of logic programs.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-22.;
  D = 1984.;
  K = Thesis (M.S.).;

AN = 101852;
  A = Viner, Omri.;
  T = Distributed constraint propagation.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-24.;
  D = 1984.;
  K = Thesis.;

AN = 101853;
  A = Peleg, David.;
  T = Concurrent program schemes and their logics.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-25.;
  D = 1984.;

AN = 101854;
  A = Lichtenstein, Orna.;
  A = Pnueli, Amir.;
  T = Checking that finite state concurrent programs satisfy their
linear
specification.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-26.;
  D = 1984.;

AN = 101855;
  A = Nygate, Yossi.;
  T = Python: a bridge expert on squeezes.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS84-27.;
  D = 1984.;

AN = 101856;
  A = Shapiro, Ehud Y.;
  A = Safra, Muli.;
  T = Fast multiway merge using destructive operations.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS85-01.;
  D = 1985.;

AN = 101857;
  A = Harel, David.;
  A = Pnueli, Amir.;
  T = On the development of reactive systems.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS85-02.;
  D = 1985.;

AN = 101858;
  A = Lichtenstein, Orna.;
  A = Pnueli, Amir.;
  A = Zuck, Lenore.;
  T = The glory of the past.;
  I = Weizmann Institute of Science. Department of Applied Mathematics.;
  R = CS85-04.;
  D = 1985.;
  K = Propositional temporal logic.;

AN = 101859;
  A = Cole, Murray I.;
  T = Partitioning programmable logic arrays.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-166-84.;
  D = 1984.;

AN = 101860;
  A = Costa, Gerardo.;
  A = Stirling, Colin.;
  T = Weak and strong fairness in CCS.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-167-85.;
  D = 1985.;

AN = 101861;
  A = Milner, Robin.;
  T = The standard ML core language.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-168-84.;
  D = 1984.;
  K = Functional programming.;
  K = Programming languages.;

AN = 101862;
  A = Costa, Gerardo.;
  T = A metric characterization of fair computations in CCS.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-169-84.;
  D = 1984.;

AN = 101863;
  A = Nixon, I. M.;
  T = I.F.: an Idiomatic Floorplanner.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-170-84.;
  D = 1984.;
  K = VLSI.;

AN = 101864;
  A = Hennessy, Matthew.;
  T = An algebraic theory of fair asynchronous communication processes.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-171-84.;
  D = 1984.;

AN = 101865;
  A = Sannella, Donald.;
  A = Tarlecki, Andrzej.;
  T = On observational equivalence and algebraic specification.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-172-84.;
  D = 1984.;

AN = 101866;
  A = Tarlecki, Andrzej.;
  T = Quasi-varieties in abstract algebraic institutions.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-173-84.;
  D = 1984.;

AN = 101867;
  A = Milne, George J.;
  T = Simulation and verification: related techniques for hardware
analysis.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-174-84.;
  D = 1984.;

AN = 101868;
  A = Jensen, Finn V.;
  A = Larsen, Kim G.;
  T = Recursively defined domains and their induction principles.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-176-84.;
  D = 1984.;

AN = 101869;
  A = Mosses, Peter D.;
  A = Plotkin, Gordon D.;
  T = On proving limiting completeness.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-177-84.;
  D = 1984.;

AN = 101870;
  A = Prasad, K. V. S.;
  T = Specification and proof of a simple fault tolerant system in CCS.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-178-84.;
  D = 1984.;

AN = 101871;
  A = Blake, Andrew.;
  T = Inferring surface shape by specular stereo.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-179-84.;
  D = 1984.;

AN = 101872;
  A = Widdowson, Roderick.;
  T = An investigation into stretchable cells for scale.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-181-85.;
  D = 1985.;
  K = VLSI design.;

AN = 101873;
  A = Sannella, Donald.;
  A = Tarlecki, Andrzej.;
  T = Specifications in an arbitrary institution.;
  I = University of Edinburgh. Department of Computer Science.;
  R = CSR-184-85.;
  D = 1985.;
  K = Algebraic specification.;

AN = 101874;
  A = Dolan, Charles.;
  T = Memory based processing for cross contextual reasoning: reminding
and
analogy using thematic structures.;
  I = University of California, Los Angeles. Computer Science
Department.;
  R = CSD-850010.;
  D = 1985.;
  K = Thesis (M.S.).;

AN = 101875;
  A = Hooper, Richard.;
  T = An application of knowledge-based systems to electronic
computer-aided
engineering, design, and manufacturing data base transport.;
  I = University of California, Los Angeles. Computer Science
Department.;
  R = CSD-850011.;
  D = 1985.;
  K = Thesis (Ph.D.).;
  K = CAE/CAD/CAM database formats.;

AN = 101876;
  A = Cheung, Shun.;
  A = Carlyle, Jack W.;
  A = Karplus, Walter J.;
  T = Distributed computer simulation of data communication networks:
project
report 2.;
  I = University of California, Los Angeles. Computer Science
Department.;
  R = CSD-850013.;
  D = 1985.;

AN = 101877;
  A = Dechter, Rina.;
  A = Pearl, Judea.;
  T = A problem simplification approach that generates heuristics for
contraint-satisfaction problems.;
  I = University of California, Los Angeles. Computer Science
Department.;
  R = CSD-850014.;
  D = 1985.;

AN = 101878;
  A = Marberg, John M.;
  A = Gafni, Eli.;
  T = An optimal shout-echo algorithm for selection in distributed
sets.;
  I = University of California, Los Angeles. Computer Science
Department.;
  R = CSD-850015.;
  D = 1985.;

AN = 101879;
  A = Pearl, Judea.;
  T = Bayesian networks: a model of self-activated memory for evidential
reasoning.;
  I = University of California, Los Angeles. Computer Science
Department.;
  R = CSD-850017.;
  D = 1985.;
  K = Belief systems.;
  K = Inference mechanisms.;
  K = Knowledge representation.;
  K = Memory models.;

AN = 101880;
  A = Huguet, Miquel.;
  T = A C-oriented register set design.;
  I = University of California, Los Angeles. Computer Science
Department.;
  R = CSD-850019.;
  D = 1985.;
  K = Thesis (M.S.).;

AN = 101881;
  A = Bach, John Matthew.;
  T = Output partitioning of programmable logic arrays.;
  I = University of Illinois, Urbana-Champaign. Department of Computer
Science.;
  R = UIUCDCS-R-84-1187.;
  D = 1984.;
  K = Thesis (M.S.).;
  K = Area reduction.;
  K = Clustering.;
  K = PLA minimization.;
  K = Randomly generated PLAs.;

AN = 101882;
  A = Sum, Robert N., Jr.;
  T = An approach to operating system testing with application to the
IBM
System 9000.;
  I = University of Illinois, Urbana-Champaign. Department of Computer
Science.;
  R = UIUCDCS-R-85-1202.;
  D = 1985.;
  K = Thesis (M.S.).;
  K = Software engineering.;
  K = UNIX.;

AN = 101883;
  A = Ramanan, Prakash V.;
  T = Topics in combinatorial algorithms.;
  I = University of Illinois, Urbana-Champaign. Department of Computer
Science.;
  R = UIUCDCS-R-85-1204.;
  D = 1985.;
  K = Thesis (Ph.D.).;
  K = Computational complexity.;
  K = Data structures.;
  K = NP-completeness.;
  K = Permutation representation.;
  K = Tree traversals.;

AN = 101884;
  A = Rendell, Larry.;
  T = Induction, of and by probability.;
  I = University of Illinois, Urbana-Champaign. Department of Computer
Science.;
  R = UIUCDCS-R-85-1209.;
  D = 1985.;
  K = Conceptual clustering.;
  K = Inductive inference.;
  K = Machine learning.;
  K = Noise management.;
  K = Probabilistic learning systems.;

AN = 101885;
  A = Hwang, Kou-Rey David.;
  T = Design of a PLA module generator for VLSI hierarchical synthesis.;
  I = University of Illinois, Urbana-Champaign. Department of Computer
Science.;
  R = UIUCDCS-R-85-1214.;
  D = 1985.;
  K = Thesis (M.S.).;
  K = Layout generation.;
  K = PLA modules.;
  K = Segmented-folded PLAs.;

AN = 101886;
  A = Leo, James.;
  T = An evaluation of two data dictionary directories.;
  I = University of Illinois, Urbana-Champaign. Department of Computer
Science.;
  R = UIUCDCS-R-85-1215.;
  D = 1985.;
  K = Data directory.;
  K = Distributed databases.;

AN = 101887;
  A = Bertram, Fred, III.;
  T = The use of color in text presentation.;
  I = University of Illinois, Urbana-Champaign. Department of Computer
Science.;
  R = UIUCDCS-R-85-1216.;
  D = 1985.;
  K = Thesis (M.S.).;
  K = Color diagrams.;
  K = Color hardcopy.;

AN = 101888;
  A = Rendell, Larry.;
  T = Genetic plans and the probabilistic learning system: synthesis and
results.;
  I = University of Illinois, Urbana-Champaign. Department of Computer
Science.;
  R = UIUCDCS-R-85-1217.;
  D = 1985.;
  K = Conceptual clustering.;
  K = Genetic algorithms.;
  K = Inductive inference.;
  K = Machine learning.;

AN = 101889;
  A = Smolarski, Dennis C.;
  A = Saylor, Paul E.;
  T = An optimum semi-iterative method for solving any linear set with a
square
matrix.;
  I = University of Illinois, Urbana-Champaign. Department of Computer
Science.;
  R = UIUCDCS-R-85-1218.;
  D = 1985.;
  K = Chebyshev iteration.;
  K = Eigenvalues.;
  K = Iterative solution.;
  K = Least squares.;
  K = Manteuffel algorithm.;
  K = Nonsymmetric matrices.;
  K = Optimum parameters.;
  K = Orthogonal polynomials.;
  K = Richardson's iteration.;

AN = 101890;
  A = McGrath, Robert Edward.;
  T = A Modula-2 compiler for the IBM S9000 Xenix system.;
  I = University of Illinois, Urbana-Champaign. Department of Computer
Science.;
  R = UIUCDCS-R-85-1219.;
  D = 1985.;
  K = Thesis (Master of Computer Science).;
  K = Motorola M68000.;

AN = 095110;
  A = Worlton, Jack.;
  T = Bottleneckology: evaluating supercomputers.;
  I = Los Alamos National Laboratory.;
  R = LA-UR-84-3942.;
  D = 1984.;

AN = 095111;
  A = Cody, W. J.;
  T = Second thoughts on the mathematical software effort: a
perspective.;
  I = Argonne National Laboratory.;
  R = ANL-84-83.;
  D = 1984.;

AN = 095112;
  A = Anderson, James W.;
  T = Portable Standard LISP on the Cray.;
  I = Los Alamos National Laboratory.;
  R = LA-UR-84-4049.;
  D = 1984.;

AN = 095113;
  A = Martin, Jeanne.;
  T = Fortran in the 90's.;
  I = University of California. Lawrence Livermore Laboratory.;
  R = UCRL-91634.;
  D = 1984.;

AN = 095114;
  A = Arnon, Dennis S.;
  T = Supercomputers and symbolic computation.;
  I = Purdue University. Department of Computer Sciences.;
  R = CSD-TR-481.;
  I = Purdue Center for Parallel and Vector Computing.;
  D = 1984.;

AN = 095115;
  A = Rice, John R.;
  T = Very large least squares problems and supercomputers.;
  I = Purdue University. Department of Computer Sciences.;
  R = CSD-TR-464.;
  I = Purdue Center for Parallel and Vector Computing.;
  D = 1984.;

AN = 095116;
  A = Blair, Gary J.;
  T = Reentrancy and multitasking on Cray computers.;
  I = University of California. Lawrence Livermore Laboratory.;
  R = UCID-30199.;
  D = 1985.;

AN = 095117;
  A = Bailey, David H.;
  T = Vector computer memory bank contention.;
  I = Informatics, Inc.;
  R = N85-18649.;
  D = 1985.;

AN = 095118;
  A = Rice, John R.;
  T = BLAS, linear algebra modules and supercomputers.;
  I = Purdue University. Department of Computer Sciences.;
  R = CSD-TR-501.;
  I = Purdue Center for Parallel and Vector Computing.;
  D = 1984.;
  K = Mathematical software.;

AN = 095119;
  A = Requa, Joseph E.;
  T = UNIX kernel networking support and the LINCS communications
architecture.;
  I = University of California. Lawrence Livermore Laboratory.;
  R = UCRL-91852.;
  D = 1984.;

AN = 095120;
  A = Dongarra, Jack J.;
  T = Squeezing the most out of eigenvalue solvers on high-performance
computers.;
  I = Argonne National Laboratory. Mathematics and Computer Science
Division.;
  R = ANL/MCS-TM-46.;
  D = 1985.;