Browse

ftp://athos.rutgers.edu (82)

	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-188.ps.Z, 19920810 A uniform circuit lower bound for the permanent Eric Allender Department of Computer Science Rutgers University New Brunswick, NJ 08903 Vivek Gorey Department of Computer Science Rutgers University New Brunswick, NJ 08903 July 23, 1992
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-187.ps.Z, 19920810 Depth Reduction for Circuits of Unbounded Fan-In Eric Allendery Department of Computer Science Rutgers University New Brunswick, NJ 08903 Ulrich Hertrampf Institut fur Informatik Universitat Wurzburg D-8700 Wurzburg Federal Republic of Germany December 12, 1991 The results in this paper were
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-184.ps.Z, 19920810 The complexity of computing maximal word functions Eric Allender y Rutgers University New Brunswick, New Jersey Danilo Bruschi z Universit a degli Studi Milano, Italy Giovanni Pighizzini x Universit a degli Studi Milano, Italy
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-189.ps.Z, 19920810 Almost-Everywhere Complexity Hierarchies for Nondeterministic Time Eric Allendery Department of Computer Science, Rutgers University New Brunswick, NJ, USA 08903 Richard Beigelz Department of Computer Science, Yale University 51 Prospect St. P. O. Box 2158, Yale Station New Haven, CT, USA 06520-2158
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-185.ps.Z, 19920810 On Strong Separations from AC0 Eric Allendery Department of Computer Science Rutgers University New Brunswick, NJ 08903 allender@cs.rutgers.edu Vivek Gorez Department of Computer Science Rutgers University New Brunswick, NJ 08903 gore@paul.rutgers.edu July 29, 1992 A preliminary version of this paper
	ftp://athos.rutgers.edu/pub/technical-reports/ml-tr-36.ps.Z, 19920810 The Computational Complexity of the Candidate-Elimination Algorithm Haym Hirsh Computer Science Department Hill Center for the Mathematical Science Busch Campus Rutgers University New Brunswick, NJ 08903 hirsh@cs.rutgers.edu
	ftp://athos.rutgers.edu/pub/technical-reports/cap-tr-9.ps.Z, 19920814 1 Model Generation from Physical Principles: A Progress Report Ringo Ling Louis Steinberg Department of Computer Science Rutgers University New Brunswick, NJ 08904 ling@cs.rutgers.edu, lou@cs.rutgers.edu
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-282.ps.Z, 19920918 FRUGAL METHODS FOR THE INDEPENDENT SET AND GRAPH COLORING PROBLEMS BY MAGN US M AR HALLD ORSSON A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-292.ps.Z, 19921015 LOWER AND UPPER BOUNDS FOR INCREMENTAL ALGORITHMS BY ARTHUR MICHAEL BERMAN A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-192.ps.Z, 19921026 A Comprehensive Approach to Parallel Data Flow Analysis Yong-fong Leey Barbara G. Rydery Department of Computer Science Rutgers University New Brunswick, NJ 08903
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-294.ps.Z, 19921118 LECTURE NOTES ON THE NEW AKS SORTING NETWORK V. Chv atal Computer Science Department, Rutgers University New Brunswick, NJ 08903, USA 1
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-291.ps.Z, 19921208 An Efficient Algorithm for Ordering Random Genomic Clones Kyungsook Han kshan@cs.rutgers.edu Michiel Noordewier noordewi@cs.rutgers.edu Computer Science Department Rutgers University Piscataway, NJ 08855 Fax: 908-932-0537 July 2, 1992
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-190.ps.Z, 19921208 Detecting Deadlocks in the Ada accept...do and select Constructs Stephen P. Masticola
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-290.ps.Z, 19921209 SHAPE: A Parallelization Tool for Sparse Matrix Computations Sesh Venugopal Dept. of Computer Science Rutgers University New Brunswick, NJ 08903. Vijay K. Naik IBM Research Division T. J. Watson Research Center Yorktown Heights, NY 10598.
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-295.ps.Z, 19921214 Description Logics are not just for the Flightless-Birds: A New Look at the Utility and Foundations of Description Logics Alex Borgida Dept. of Computer Science Rutgers University New Brunswick, NJ 08904 June 1992
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-195.ps.Z, 19930109 Interprocedural Modification Side Effect Analysis With Pointer Aliasing William Landi Siemens Corporate Research Inc 755 College Rd. East Princeton, NJ 08540 landi@cadillac.siemens.com Barbara G. Ryder Sean Zhang Department of Computer Science Rutgers University Hill Center, Busch Campus New Brunswick,
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-194.ps.Z, 19930129 REFERENCES 20 + B B B + B B Figure 11. Construction for B (2; 3) >= 20. According to Equation (10), B(3; 3) = 28. An arrangement achieving this bound must simultaneously achieve (3) = 6 type I vertices, (3) = 6 type II vertices and 4(3+3) 8 = 16 type III vertices. Surprisingly, this can be achieved
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-297.ps.Z, 19930202 LOWER BOUNDS FOR UNIFORM CONSTANT DEPTH CIRCUITS BY VIVEK KASHINATH GORE A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-299.ps.Z, 19930510 SCHEDULING AND CODE GENERATION FOR PARALLEL ARCHITECTURES BY TAO YANG A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Written
	ftp://athos.rutgers.edu/pub/technical-reports/cap-tr-14.ps.Z, 19930510 Abstraction and Decomposition in Hillclimbing Design Optimization Thomas Ellman Mark Schwabacher Department of Computer Science Hill Center for Mathematical Sciences Rutgers University New Brunswick, New Jersey 08903 (908) 932 - 4184 fellman,schwabacg@cs.rutgers.edu CAP-TR-14
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-204.ps.Z, 19930512 Regularities in Software Systems By: Naftaly H. Minsky April 1993 1 Computer Science Department Rutgers University New Brunswick, NJ 08903 Net Address: minsky@cs.rutgers.edu 1Work supported in part by NSF grant No. CCR-8807803. 1
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-201.ps.Z, 19930608 Interprocedural Modification Side Effect Analysis With Pointer Aliasing William Landi Siemens Corporate Research Inc 755 College Rd. East Princeton, NJ 08540 blandi@scr.siemens.com Barbara G. Ryder Sean Zhang Department of Computer Science Rutgers University Hill Center, Busch Campus New Brunswick, NJ
	ftp://athos.rutgers.edu/pub/technical-reports/cap-tr-18.ps.Z, 19930726 MSG: A Computer System for Automated Modeling of Heat Transfer Sui-ky Ringo Ling Louis Steinberg Department of Computer Science Rutgers University New Brunswick, NJ 08903 Yogesh Jaluria Department of Mechanical and Aerospace Engineering Rutgers University New Brunswick, NJ 08903
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-199.ps.Z, 19930922 Abstraction via Approximate Symmetry Thomas Ellman Department of Computer Science Rutgers University New Brunswick, NJ 08903 ellman@cs.rutgers.edu LCSR-TR-199
	ftp://athos.rutgers.edu/pub/technical-reports/cap-tr-11.ps.Z, 19930922 Intelligent Model Selection for Hillclimbing Search in Computer-Aided Design Thomas Ellman John Keane Mark Schwabacher Department of Computer Science Hill Center for Mathematical Sciences Rutgers University New Brunswick, NJ 08903 fellman,keane,schwabacg@cs.rutgers.edu CAP-TR-11
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-200.ps.Z, 19930922 Synthesis of Abstraction Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects Thomas Ellman Department of Computer Science Hill Center for Mathematical Sciences Rutgers University, New Brunswick, NJ 08903 ellman@cs.rutgers.edu LCSR-TR-200
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-300.ps.Z, 19931025 PARALLELIZING UNSTRUCTURED SPARSE MATRIX COMPUTATIONS ON LARGE-SCALE MULTIPROCESSORS BY SESHADRI VENUGOPAL A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-217.ps.Z, 19931026 Fast Search Methods for Biological Sequence Databases Sumit Ganguly Jerry Leichter Michiel Noordewier ganguly,leichter,noordewi@cs.rutgers.edu Department of Computer Science Hill Center, Busch Campus Rutgers University New Brunswick, NJ 08903 October 26, 1993 LCSR-TR-217
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-196.ps.Z, 19940128 The CAM2000 Chip Architecture1 D. Smith J. Hall K. Miyake Laboratory for Computer Science Research Department of Computer Science Rutgers University January 28, 1994 1This works was supported by the Defense Advanced Projects Agency and the National Aeronautics and Space Administration under NASA-Ames
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-306.ps.Z, 19940131 FOUNDATIONS OF RECURRENT NEURAL NETWORKS BY HAVA (EVE) TOVA SIEGELMANN A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Written
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-219.ps.Z, 19940301 dvitps ERROR: current.dvi @ oz.rutgers.edu Certain fonts that you requested in your dvi file could not be found on the system. In order to print your document, other fonts that are installed were substituted for these missing fonts. Below is a list of the substitutions that were made.
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-218.ps.Z, 19940301 Optimizing Queries for Coarse Grain Parallelism Sumit Ganguly Weining Wang Department of Computer Sciences Rutgers University New Brunswick, NJ 08904 e-mail: fsumit,weinwangg@cs.rutgers.edu Tel: (908) 932-4974 Fax: (908) 932-0537
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-197-a.ps.Z, 19940308 To appear in the Proceedings of the Sixth USENIX C++ Technical Conference Static Type Determination for C++ Hemant D. Pandey Barbara G. Ryder Tata Research Development and Department of Computer Science Design Centre Rutgers University 1 Mangaldas Road, Pune-411050, India New Brunswick, NJ 08903
	ftp://athos.rutgers.edu/pub/technical-reports/cap-tr-10.ps.Z, 19940310 The FAD Project1 C. W. Liew L. Steinberg Department of Computer Science Busch Campus Rutgers University New Brunswick NJ 08903 liew@cs.rutgers.edu lou@cs.rutgers.edu April, 1992 Technical Report CAP-TR-10 Department of Computer Science, Rutgers University 1This work has been supported by NSF under Grant
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-308.ps.Z, 19940504 COMPOSITIONAL MODELING FOR SPATIAL PROBLEMS BY KYUNGSOOK HAN A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Graduate Program in Computer
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-220.ps.Z, 19940525 Law-Governed Regularities in Software Systems By: Naftaly H. Minsky January 1994 1 Computer Science Department Rutgers University New Brunswick, NJ 08903 Tel: 908-932-2085 Net Address: minsky@cs.rutgers.edu 1Work supported in part by NSF grant No. CCR-9308773. 1
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-221.ps.Z, 19940525 Law-Governed Linda Communication Model Naftaly H. Minsky minsky@cs.rutgers.edu Jerrold Leichter leichter@cs.rutgers.edu Department of Computer Science Rutgers University New Brunswick, NJ, 08903 USA March 14, 1994
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-226.ps.Z, 19940627 A Problem with Long-Term Computing Processes, and What Can Be Done About It Naftaly H. Minsky minsky@cs.rutgers.edu Department of Computer Science Rutgers University New Brunswick, NJ, 08903 USA June 94
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-227.ps.Z, 19940718 Establishing Regularities in Object-Oriented (Eiffel) Systems Naftaly H. Minsky minsky@cs.rutgers.edu Partha pratim Paly partha@cs.rutgers.edu Department of Computer Science Rutgers University New Brunswick, NJ 08903 USA July 1, 1994
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-313.ps.Z, 19940909 1 Gabriela Hristescu Rutgers University Department of Computer Science October 1994 1 Presented as essay for MS degree in Computer Science at Rutgers University. This work was mainly done as part of the Fall 93 CS605 course at Rutgers University. It was also extended during Spring 94 COS451 project work
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-311.ps.Z, 19941010 PYRAMID BROADCASTING FOR VIDEO ON DEMAND SERVICE S. Viswanathan T. Imielinski Dept of Computer Science Rutgers University New Brunswick, NJ 08903 e-mail:f vish , imielins g@cs.rutgers.edu
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-228.ps.Z, 19941011 Explaining Subsumption in Description Logics Deborah L. McGuinness Dept. of Computer Science Rutgers University and AT&T Bell Laboratories Murray Hill, NJ 07974 USA dlm@research.att.com Alex Borgida Dept. of Computer Science Rutgers University New Brunswick, NJ 08903 borgida@cs.rutgers.edu September
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-229.ps.Z, 19941107 Initializing Neural Networks using Decision Trees Arunava Banerjee Department of Computer Science Rutgers University New Brunswick, NJ 08903 arunava@cs.rutgers.edu
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-230.ps.Z, 19941107 Visual Attention and Retinal Fixation: Preprocessing Modules for Enhanced Performance in Real-Time Vision Arunava Banerjee Department of Computer Science Rutgers University New Brunswick, NJ 08903 arunava@cs.rutgers.edu
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-316.ps.Z, 19941108 Using Spatial Locality for Trace Compression B. Gopinath Dept. of Electrical Engineering Rutgers University New Brunswick, NJ 08903. TEL : (908) 932 5394 FAX : (908) 932 0980 EMAIL : gopinath@cs.rutgers.edu Vidyadhar Phalke Dept. of Computer Science Rutgers University New Brunswick, NJ 08903. TEL :
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-231.ps.Z, 19941115 A Computational Model of View Degeneracy and its Application to Active Focal Length Control David Wilkes Department of Computer Science University of Toronto Sven J. Dickinson Rutgers University Center for Cognitive Science (RuCCS) and Department of Computer Science Rutgers University John K. Tsotsos
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-232.ps.Z, 19941115 Integrating Qualitative and Quantitative Shape Recovery Sven J. Dickinson Rutgers University Center for Cognitive Science (RuCCS) and Department of Computer Science Rutgers University P. O. Box 1179 Piscataway, NJ 08855-1179 Dimitri Metaxas Department of Computer and Information Science University of
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-236.ps.Z, 19941220 Static Type Determination and Aliasing for C++ Hemant D. Pandey Barbara G. Ryder Department of Computer Science Rutgers University Hill Center, Busch Campus Piscataway, NJ 08855 email: fpande,ryderg@cs.rutgers.edu LCSR-TR-236
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-238.ps.Z, 19950119 Modular Implementation of Individual Reasoning in protodl \| the Extensible Description Logic Management System. Alex Borgida Daniel Kudenko Dept. of Computer Science Rutgers University New Brunswick, NJ 08903 fborgida,kudenkogcs.rutgers.edu December 1994
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-237.ps.Z, 19950126 AUTOMATING SOFTWARE DESIGN FOR RESOURCE ASSIGNMENT PROBLEMS BY KERSTIN VOIGT A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science
	ftp://athos.rutgers.edu/pub/technical-reports/ml-tr-39.ps.Z, 19950131 Learning with Small Disjuncts Gary M. Weiss Rutgers University/AT&T Bell Labs gweiss@paul.rutgers.edu
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-318.ps.Z, 19950131 MAPPING TECHNIQUES AND PERFORMANCE ANALYSIS FOR AN INTERCONNECTION CACHED MULTIPROCESSOR NETWORK BY VIPUL GUPTA A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://athos.rutgers.edu/pub/technical-reports/ml-tr-38.ps.Z, 19950131 The Problem with Noise and Small Disjuncts Gary M. Weiss AT&T Bell Labs/Rutgers University gweiss@paul.rutgers.edu
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-320.ps.Z, 19950202 DATAMAN project: Towards a Mosaic-like Location- Dependant Information Service for Mobile Clients Arup ACHARYA, Tomasz IMIELINSKI and B. R. BADRINATH Department of Computer Science, Rutgers University, New Brunswick, NJ 08903 Introduction a The goal of the DATAMAN project is to develop primitives and
	ftp://athos.rutgers.edu/pub/technical-reports/cap-tr-17.ps.Z, 19950209 Learning Prototype-Selection Rules for Case-Based Iterative Design Mark Schwabacher Haym Hirsh Thomas Ellman Department of Computer Science Rutgers University New Brunswick, NJ 08903
	ftp://athos.rutgers.edu/pub/technical-reports/hpcd-tr-27.ps.Z, 19950413 ARPA Inlet Design Group Report No. 4 TEST CASES FOR NPARC Sam Gao Department of Computer Science Rutgers University - The State University of New Jersey Piscataway, NJ 08855-0909 1 Objective In order to insure efficient and accurate utilization of the NPARC2D code, test computations for a supersonic
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-321.ps.Z, 19950417 TRACTABLE REASONING IN KNOWLEDGE REPRESENTATION SYSTEMS BY MUKESH DALAL A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Written
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-241.ps.Z, 19950420 Lattice Frameworks for Multisource and Bidirectional Data Flow Problems STEPHEN P. MASTICOLA Siemens Corporate Research THOMAS J. MARLOWE Seton Hall University BARBARA G. RYDER Rutgers University Multisource data flow problems involve information which may enter nodes independently through different
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-243.ps.Z, 19950424 IP Multicast Extensions for Mobile Internetworking Arup ACHARYA, Ajay BAKRE and B. R. BADRINATH Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA acharya/bakre/badri @cs.rutgers.edu This paper deals with multicasting in an internetwork with mobile hosts, particularly with
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-168.ps.Z, 19950525 A Safe Approximate Algorithm for Interprocedural Pointer Aliasing William Landiy Barbara G. Rydery
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-244.ps.Z, 19950525 Function Pointers in C - An Empirical Study Anand Shah and Barbara G. Ryder May 24, 1995
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-246.ps.Z, 19950605 Recognition by Functional Parts Ehud Rivlin Department of Computer Science Technion{Israel Institute of Technology Haifa, Israel Sven J. Dickinson Center for Cognitive Science and Department of Computer Science Rutgers University P.O. Box 1179 Piscataway, NJ 08855 Azriel Rosenfeld Center for Automation
	ftp://athos.rutgers.edu/pub/technical-reports/hpcd-tr-21.ps.Z, 19950720 A Computational Environment for Exhaust Nozzle Design Andrew Gelsey and Don Smith (gelsey@cs.rutgers.edu, dsmith@cs.rutgers.edu) Computer Science Department Rutgers University New Brunswick, NJ 08903 Computing in Aerospace 10, San Antonio, TX, March 1995 AIAA-95-1016-CP Copyright c 1995 by Andrew Gelsey
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-249.ps.Z, 19950726 Defining Flow Sensitivity in Data Flow Problems Thomas J. Marlowe Barbara G. Rydery Michael G. Burkez July 17, 1995
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-251.ps.Z, 19950808 1. Introduction. Let f : f0; 1gn ! f0; 1g be a monotone Boolean function of n variables: x >= x0 =) f(x) >= f(x0) for any x; x0 2 f0; 1gn: Denote by c = ^ I2C _ i2I xi (1:1) the irredundant conjunctive normal form (CNF) of f , where C is the set of the prime implicates I f1; : : : ; ng of f . Note that
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-252.ps.Z, 19950822 August 1995 ON THE FREQUENCY OF THE MOST FREQUENTLY OCCURRING VARIABLE IN DUAL MONOTONE DNFs V. Gurvichy and L. Khachiyan LCSR-TR-252 Department of Computer Science Hill Center for the Mathematical Sciences Rutgers University New Brunswick, NJ 08903. Supported in part by ONR grant N00014-92-J-1375. y
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-253.ps.Z, 19950912 A BASIC FAMILY OF ITERATION FUNCTIONS FOR POLYNOMIAL ROOT FINDING AND ITS CHARACTERIZATIONS Bahman Kalantari Department of Computer Science Rutgers University, New Brunswick, NJ 08903 Iraj Kalantari Department of Mathematics Western Illinois University, Macomb, IL, 61455 Rahim Zaare-Nahandiy Department
	ftp://athos.rutgers.edu/pub/technical-reports/hpcd-tr-33.ps.Z, 19951019 Numerical simulations of fluid flow in the vocal tract G. Richard,y M.Liu,y D. Sinder,y H. Duncan,y Q. Lin,y J. Flanagan,y S. Levinson,z D. Davis,x S. Slimon,x yRutgers Univ. - CAIP Center, Piscataway, NJ 08855, USA. zAT&T Bell Laboratories, Murray Hill, NJ 07974, USA. xGeneral Dynamics, Groton, CT
	ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-323.ps.Z, 19951023 MODELING AND MANAGING PROGRAM REFERENCES IN A MEMORY HIERARCHY BY VIDYADHAR PHALKE A dissertation submitted to the Graduate School New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer
	ftp://athos.rutgers.edu/pub/technical-reports/hpcd-tr-36.ps.Z, 19951109 Automated Redesign of the NASA P8 Hypersonic Inlet Using Numerical Optimization Vijay Shukla , Andrew Gelseyy, Mark Schwabacherz Donald Smithx and Doyle D. Knight{ Rutgers, the State University of New Jersey New Brunswick, NJ 08903
	ftp://athos.rutgers.edu/pub/technical-reports/hpcd-tr-37.ps.Z, 19960103 Intelligent Automated Grid Generation for Numerical Simulations Ke-Thia Yao Andrew Gelsey kyao@cs.rutgers.edu gelsey@cs.rutgers.edu Computer Science Department Rutgers University New Brunswick, NJ 08903, USA
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-250-a.ps.Z, 19960109 Laboratory of Computer Science Research Technical Report LCSR-TR-250-A, October 1995 Static Type Determination and Aliasing for C++ Hemant D. Pande Barbara G. Ryder Department of Computer Science Rutgers University Hill Center, Busch Campus Piscataway, NJ 08855 email: fpande,ryderg@cs.rutgers.edu phone:
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-256.ps.Z, 19960122 TWO APPROACHES TO THE HIERARCHICAL SOLUTION OF CONSTRAINT SATISFACTION PROBLEMS BY SUNIL KUMAR MOHAN A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-257-part2of3.ps.Z, 19960125 Fast Messages Communication Library This document contains a complete description of the Fast Messages (FM) communications library. Along with a description of the library and an annotated list of primitives, there is a section on how to use the library and another on how to customize certain internal
	ftp://athos.rutgers.edu/pub/technical-reports/hpcd-tr-34.ps.Z, 19960202 Using Modeling Knowledge to Guide Design Space Search Andrew Gelsey Mark Schwabacher Don Smith gelsey@cs.rutgers.edu schwabac@cs.rutgers.edu dsmith@cs.rutgers.edu Computer Science Department Rutgers University New Brunswick, NJ 08903 USA (908) 445{2001, FAX {5691
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-260.ps.Z, 19960313 COMPILE TIME ANALYSIS OF C AND C++ SYSTEMS BY HEMANT D. PANDE A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Written under the
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-261.ps.Z, 19960422 REFINING THE PARALLEL HYBRID ALGORITHM FOR DATA FLOW ANALYSIS BY JAVIER ELICES A thesis submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Master of Science Graduate Program in Computer Science Written
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-263.ps.Z, 19960506 Mobile Computing - DataMan Project Perspective Tomasz Imielinski Rutgers University 1 Introduction The objective of mobile computing is to develop system and application level software for small, battery powered terminals equipped with the wireless network connection. There is a rapidly growing interest
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-267.ps.Z, 19960517 MODEL-BASED REFINEMENT OF SEARCH HEURISTICS BY MICHAEL W. BARLEY A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Written under
	ftp://athos.rutgers.edu/pub/technical-reports/hpcd-tr-44.ps.Z, 19960606 Multi-Level Modeling for Engineering Design Optimization Thomas Ellman John Keane Mark Schwabacher Ke-Thia Yao Department of Computer Science, Hill Center for Mathematical Sciences Rutgers University, Piscataway, NJ 08855 fellman,keane,schwabac,kyaog@cs.rutgers.edu HPCD-TR-44 June 1996
	ftp://athos.rutgers.edu/pub/technical-reports/hpcd-tr-40.ps.Z, 19960607 Intelligent Intercessors in Analysis Models for Automated Design John Keane Thomas Ellman Department of Computer Science Rutgers University New Brunswick, NJ fkeane, ellmang@cs.rutgers.edu January, 1996
	ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-266.ps.Z, 19960613 May 1996 ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS L. Porkolab y and L. Khachiyan z LCSR-TR-266 Department of Computer Science Hill Center for the Mathematical Sciences Rutgers University New Brunswick, NJ 08903. Research supported by NSF grants CCR-9208371, CCR-9208539 and ONR grant N0014-92-J-1375. y