close this section of the libraryftp://ftp.cs.rit.edu (10)
open this document and view contentsftp://ftp.cs.rit.edu/pub/techreports/tr91-001/tr91-001.ps.Z, 19920527
A Min Flow Max Cut Theorem D Andrew Kitchen epartment of Computer Science ySchool of Computer Science and Information Technolog Rochester Institute of Technology Rochester, New York 14623 USA T T ABSTRAC his paper presents a dual of the Max Flow Min Cut Theorem. The result, although s u similar in proof
open this document and view contentsftp://ftp.cs.rit.edu/pub/techreports/tr92-006/tr92-006.ps.Z, 19920910
Inserting Figures into Troff Documents Kenneth A. Reek February, 1992 6 D RIT-TR-92-00 epartment of Computer Science ySchool of Computer Science and Information Technolog Rochester Institute of Technology Rochester, New York 14623 Inserting Figures into Troff Documents C Kenneth A. Reek omputer Science
open this document and view contentsftp://ftp.cs.rit.edu/pub/techreports/tr92-008/tr92-008.ps.Z, 19920910
Paths, Cycles and Wheels sin Graphs without Antitriangle Stanisl/aw P. Radziszowski and Jin Xia Department of Computer Science Rochester Institute of Technology A Rochester, NY 14623 bstract. We investigate paths, cycles and wheels in graphs with indepenl s dence number at most 2, in particular we prove
open this document and view contentsftp://ftp.cs.rit.edu/pub/techreports/tr92-004/tr92-004.ps.Z, 19920910
Data Flow Graphs And Their Linearization D Edith A. Lawson r. Lawrence Coon D Carol Torsone epartment of Computer Science ySchool of Computer Science and Information Technolog Rochester Institute of Technology Rochester, New York 14623 USA t D Abstrac ataflow provides a mechanism to identify the
open this document and view contentsftp://ftp.cs.rit.edu/pub/techreports/tr91-002/tr91-002.ps.Z, 19920910
FROM SIMD TO DISTRIBUTED MEMORY MIMD C Nan C. Schaller omputer Science Department yRochester Institute of Technolog Rochester, New York 14623 T
open this document and view contentsftp://ftp.cs.rit.edu/pub/techreports/tr93-009/tr93-009.ps.Z, 19930222
Small Ramsey Numbers D Stanisl/aw P. Radziszowski epartment of Computer Science y R Rochester Institute of Technolog ochester, NY 14623, spr@cs.rit.edu s a ABSTRACT: The data below contains (presumably) all nontrivial known value nd bounds for the graph, hypergraph and multicolor Ramsey numbers, where
open this document and view contentsftp://ftp.cs.rit.edu/pub/techreports/tr93-010/tr93-010.ps.Z, 19930701
Multidimensional Golden Means Peter G. Anderson March 18, 1993
open this document and view contentsftp://ftp.cs.rit.edu/pub/techreports/tr93-013/tr93-013.ps.Z, 19931130
On the Effectiveness of Study Sessions Kenneth A. Reek April, 1993 RIT-TR-93-013 Department of Computer Science School of Computer Science and Information Technology Rochester Institute of Technology Rochester, New York 14623 On the Effectiveness of Study Sessions Kenneth A. Reek Computer Science
open this document and view contentsftp://ftp.cs.rit.edu/pub/techreports/tr94-018/tr94-018.ps.Z, 19950124
An Object Oriented Natural Language Expert System Kenneth E. Staffan and Henry A. Etlinger December 6, 1994 RIT TR 94 018 Department of Computer Science School of Computer Science and Information Technology Rochester Institute of Technology Rochester, New York 14623 staffan@clpd.kodak.com hae@cs.rit.edu
open this document and view contentsftp://ftp.cs.rit.edu/pub/techreports/tr94-016/gto.ps.Z, 19950831
R.I.T The GTO Language Manual Lawrence A. Coon January, 1994 RIT-TR-94-016 Department of Computer Science School of Computer Science and Information Technology Rochester Institute of Technology Rochester, NY 14623-0887, USA email: lac@cs.rit.edu The GTO Language Manual Lawrence A. Coon Department of