Table of Contents

• An approach to the programming languages courseK. N. King. 3-10 [doi]
• Video games challenge and motivate data structure studentsRobert F. Smith. 11-14 [doi]
• Using an on-line dictionary to extract a list of sense-disambiguated synonymsJan G. Wilms. 15-22 [doi]
• Disk performance enhancement through Markov-based cylinder remappingRobert Geist, Darrell Suggs, Robert G. Reynolds, Shardul Divatia, Fred Harris, Evan Foster, Priyadarshan Kolte. 23-28 [doi]
• Automatic partitioning and virtual scheduling for efficient parallel executionC. L. McCreary, D. H. Gill. 29-36 [doi]
• Non-parametric estimation techniques in support of query decomposition strategies for heterogeneous distributed database management systemsBharat Bhasker, Csaba J. Egyhazy, Konstantinos P. Triantis. 37-44 [doi]
• Measurements and characterization of traffic in a university environmentBalaji R. Venkatraman, Richard E. Newman-Wolfe, Randy Chow, Haniph A. Latchman. 45-52 [doi]
• Broadcast communication delay metric for the iPSC/2 and iPSC/860 hypercubesC. L. McCreary, M. E. McArdle, J. D. McCreary. 53-60 [doi]
• Heuristic authentication protocol for TCP/IP network applications under UNIXA. H. Wadaa, Hussein M. Abdel-Wahab, John McHugh. 61-68 [doi]
• Fault localization using execution tracesMargaret Ann Francel, Spencer Rugaber. 69-76 [doi]
• Local exhaustive testing: a software reliability toolThomas Wood, Keith W. Miller, Robert E. Noonan. 77-84 [doi]
• Parallel inverse QR decompositionHongyu Xu, Winser E. Alexander. 85-92 [doi]
• Sorting and merging on the DAPDharmavani Bhagavathi, W. M. Denny, C. E. Grosch, Peter J. Looges, Stephan Olariu. 93-99 [doi]
• Optimization of importance sampling parameters for the efficient simulation of communication networks and ATM switches using mean field annealingMichael Devetsikiotis, J. Keith Townsend. 100-107 [doi]
• Generalized Lehmer-Tausworthe random number generatorsLih-Yuan Deng, Cecil C. Rousseau, Yilian Yuan. 108-115 [doi]
• An efficient table-driven decoder for one-half rate convolutional codesAjay Dholakia, T. M. Lee, Donald L. Bitzer, Mladen A. Vouk, L. Wang, Paul D. Franzon. 116-123 [doi]
• Extensions to the spiral model to support joint development of complex software systemsThomas E. Potok. 124-130 [doi]
• A process cache memory for tightly coupled multiprocessor systemsCosimo Antonio Prete. 131-138 [doi]
• A greedy hypercube-labeling algorithmDharmavani Bhagavathi, C. E. Grosch, Stephan Olariu. 139-147 [doi]
• Visible surface ray-tracing of stereoscopic imagesStephen J. Adelson, Larry F. Hodges. 148-156 [doi]
• Segmented winner treesAndrew Lim, Sartaj Sahni. 157-164 [doi]
• Supporting software maintenance evolution processes in the Adele systemNoureddine Belkhatir, Walcélio L. Melo, Jacky Estublier, Mohamed Ahmed-Nacer. 165-172 [doi]
• Human factors and software reuse: the manager s impactJohn A. Lewis, Sallie M. Henry, Dennis G. Kafura, Robert S. Schulman. 173-181 [doi]
• Improving strategies for handling undefined variablesRichard B. Borie, Allen S. Parrish. 182-187 [doi]
• Interprocedural register allocation for RISC machinesJohn Wood, Harold C. Grossman. 188-195 [doi]
• The future of programming languagesWilliam S. Curran. 196-202 [doi]
• Frontiers for computer science in computational scienceD. E. Stevenson. 203-210 [doi]
• A user-friendly formal requirements specification methodShaoying Liu. 211-218 [doi]
• The derivation of test cases from SDL specificationsZhu Yun Gu, Kong Eng Cheng. 219-227 [doi]
• Test patterns for fault-tolerant logic circuits using block design conceptsAhmed E. Barbour. 228-235 [doi]
• Generating analogical natural language object descriptionsVibhu O. Mittal. 239-246 [doi]
• A system generation for a small operating systemLuke R. Pargiter, Jerry E. Sayers. 247-252 [doi]
• The utility of foresight in single server schedulingAdam Rifkin. 253-260 [doi]
• A distributed mutual exclusion solution derived from real-life examplesRajeev Chawla. 261-268 [doi]
• Deadlock detection in a multidatabaseRandy Appleton. 269-276 [doi]
• Fault tree models for reliability analysis of an FDDI token ring networkDov Bulka. 277-284 [doi]
• Mutation-based software testing using program schemataRoland H. Untch. 285-291 [doi]
• Parallel algorithms for the orthogonal multiprocessorKhaled M. F. Elsayed. 292-299 [doi]
• Sparse cholesky factorization on a simulated hypercubeVenu M. Padakanti. 300-307 [doi]
• Improvements to systematic program developmentJianxin Li. 308-311 [doi]
• Software engineering process support based on fuzzy imploding Petri netsRichard T. Bechtold. 312-319 [doi]
• A new simulator workbench for comparing SIMD processing element architecturesTodd C. Marek. 320-327 [doi]
• Color image enhancementKuei-Chun Chen. 328-335 [doi]
• A help facility for X window system applicationsMark Newsome. 336-342 [doi]
• ODGen: a prototype reverse engineering tool for AdaKelly Morrison. 343-349 [doi]
• The list(3) package: software design and reusabilityBradley C. Spatz. 350-359 [doi]
• Optimization of available C compilers for the MC68HC11Susan M. Holzschuh. 360-367 [doi]
• Static and dynamic analysis of real-time systemsWael M. Elseaidy. 368-376 [doi]
• Finding re-entrant knight s tours on n-by-m boardsKarla Alwan, Kelly Waters. 377-382 [doi]
• A critical view of a new computer science introductory courseJeffrey Linder, Stephen J. Sheel. 385-388 [doi]
• Running an NSF REU program: observations, comments and suggestionsDavid Cordes, Robert Allen. 389-392 [doi]
• An algorithm for conjunct identification in a natural language processing systemRajeev Agarwal. 393-396 [doi]
• Some issues and problems in text tagging using neural networksJulian E. Boggess III. 397-400 [doi]
• The automatic initialization of an object-oriented knowledge baseJose L. Cordova, Julia E. Hodges. 401-404 [doi]
• Specifications and testing aided by a variant of the cause-effect processAnthony Q. Baxter, J. Austin French. 405-408 [doi]
• Collecting data for Markov models of error patterns on data communications linksWayne D. Smith. 409-412 [doi]
• Redocumentation for the maintenance of softwareRobert M. Freeman, Malcolm Munro. 413-416 [doi]
• An object-oriented design for a dataflow simulatorDavid D. Langan. 417-420 [doi]
• Distributed data flow computing systemEdmund Gallizzi, Quinton Zondervan. 421-424 [doi]
• The BLM semantics may be inconsistentJianhua Chen. 425-428 [doi]
• Improved learning by use of a video knowledge-baseMichael V. Doran, Timothy C. Benson, Herbert E. Longenecker Jr.. 429-432 [doi]
• A synergetic approach to range image understandingSuchendra M. Bhandarkar, Andreas Siebert. 433-436 [doi]
• Artificial neural network-based image pattern recognitionHong Zhang, Jian Guan, Gwong C. Sun. 437-441 [doi]
• Node conversion in hypermedia systemsAnamika Saxena, Su Hee Kim, Caroline M. Eastman. 442-444 [doi]
• On constructing minimum height ::::B::::*-trees in optimal timeY. T. Lin, S. Q. Zheng. 445-448 [doi]
• Postorder B-tree constructionLawrence W. West. 449-452 [doi]
• A simplified optimal algorithm for constructing the convex hull of a simple polygonJigang Liu, Si-Qing Zheng. 453-456 [doi]
• An algorithm to compute the convex hull in the plane from the distance matrixG. Sampath. 457-462 [doi]
• An adaptation of function point analysis and COCOMO for estimating the cost of Oracle SQL*forms application developmentY. Renee Lewis, Paul Oliver. 463-466 [doi]
• Data dependency diagrams for spreadsheet applicationsSarat Vemuri, Shankar Sengupta, J. Steve Davis. 467-470 [doi]
• Formal program verification and computability theoryParesh B. Shah, James C. Pleasant. 471-473 [doi]