Skip to Content

Technical Reports 1986

NumberTitleAuthorsDateDownload
TR-086Robot Navigation in Unknown Terrains Using Learned Visibility Graphs. Part I: The Disjoint Convex Obstacles CaseB. J. Oommen, S.S. Iyengar, S.V.N. Rao, R.L. KashyapFebruary 1986TR-086.pdf
TR-087Breaking Symmetry in Synchronous NetworksGreg N. Frederickson & Nicola SantoroApril 1986N/A
TR-088Data Structures and Data Types: An Object-Oriented ApproachJohn R. Pugh, Wilf R. LaLonde , David A. ThomasApril 1986N/A
TR-089Ergodic Learning Automata Capable of Incorporating Apriori InformationB. J. OommenMay 1986TR-089.pdf
TR-090Iterative Decomposition of Digital Systems and Its ApplicationsVaclav DvorakMay 1986TR-90.pdf
TR-091Actors in a Smalltalk Multiprocessor: A Case for Limited ParallelismWilf R. LaLonde, Dave A. Thomas , John R. PughMay 1986N/A
TR-092ACTRA – A Multitasking/Multiprocessing SmalltalkDavid A. Thomas, Wilf R. LaLonde, John R. PughMay 1986N/A
TR-093Why Exemplars are Better Than ClassesWilf R. LaLondeMay 1986N/A
TR-094An Exemplar Based SmalltalkWilf R. LaLonde, Dave A. Thomas , John R. PughMay 1986TR-094.pdf
TR-095Recognition of Noisy Subsequences Using Constrained Edit DistancesB. John OommenJune 1986TR-095.pdf
TR-096Guessing Games and Distributed Computations in Synchronous NetworksJ. van Leeuwen, N. Santoro, J. Urrutia , S. ZaksJune 1986N/A
TR-097Bit vs. Time Tradeoffs for Synchronous ElectionsM. Overmars & N. SantoroJune 1986N/A
TR-098Reduction Techniques for Distributed SelectionN. Santoro & E. SuenJune 1986N/A
TR-099A Note on Lower Bounds for Min-Max HeapsA. Hasham & J.-R. SackJune 1986N/A
TR-102Computing on a Systolic Screen: Hulls, Contours, and ApplicationsFrank Dehne, J.-R. Sack, N. SantoroOctober 1986N/A
TR-103Stochastic Automata Solutions to the Object Partitioning ProblemB.J. Oommen & D.C.Y. MaNovember 1986TR-103
TR-104Parallel Computational Geometry and Clustering MethodsFrank DehneDecember 1986N/A
TR-114An Optimal Algorithm for Detecting Weak Visibility of a PolygonJörg-R. Sack & Subhash SuriDecember 1986TR-114.pdf