Mobile Agents Simulation with DaSSF, Nikita E. Solar: Building A Context Fusion Network for Pervasive Computing, Guanling ChenĪ Case Study of Four Location Traces, Guanling Chen and David KotzĪpplication-controlled loss-tolerant data dissemination, Guanling Chen and David Kotzĭependency management in distributed settings, Guanling Chen and David Kotz Parallel Out-of-Core Sorting: The Third Way, Geeta Chaudhry The Kerf toolkit for intrusion analysis, Javed Aslam, Sergey Bratus, David Kotz, Ron Peterson, Daniela Rus, and Brett TofelĪ Survey of WPA and 802.11i RSN Authentication Protocols, Kwang-Hyun Baek, Sean W. ![]() Performance Evaluation of Distributed Security Protocols Using Discrete Event Simulation, Meiyuan ZhaoĪggregated Path Authentication for Efficient BGP Security, Meiyuan Zhao, Sean W. On the Design of an Immersive Environment for Security-Related Studies, Yougu Yuan Improving Large-Scale Network Traffic Simulation with Multi-Resolution Models, Guanhua Yan Graphical Models of Residue Coupling in Protein Families, John Thomas, Naren Ramakrishnan, and Chris Bailey-Kellogg On-line Metasearch, Pooling, and System Evaluation, Robert A. Lilien, and Bruce Randall DonaldĮfficient Wait-Free Algorithms for Implementing LL/SC Objects, Srdjan Petrovic High-Throughput Inference of Protein-Protein Interaction Sites from Unassigned NMR Data by Analyzing Arrangements Induced By Quadratic Forms on 3-Manifolds, Ramgopal R. SHEMP: Secure Hardware Enhanced MyProxy, John Marchesini and Sean Smith Natural Image Statistics for Digital Image Forensics, Siwei Lyu Master’s thesis proposal: computation reuse in stacking and unstacking, Anne Loomis Towards Tiny Trusted Third Parties, Alexander Iliev and Sean SmithĮfficiently Implementing a Large Number of LL/SC Objects, Prasad Jayanti and Srdjan PetrovicĪ Combined Routing Method for Ad hoc Wireless Networks, Zhenhui JiangĬlassifying the Mobility of Users and the Popularity of Access Points, Minkyong Kim and David Kotzĭepartment of Computer Science Activity 1998-2004, David Kotz More Efficient Secure Function Evaluation Using Tiny Trusted Third Parties, Alexander Iliev and Sean Smith How hard is it to cheat in the Gale-Shapley Stable Matching Algorithm, Chien-Chung Huang Wagnerīoolean operations with two dimensional segment trees, Robert Scot Drysdale and David P. McGray, Igor Paprotny, and Daniela RusĪn O(n^ log n) Algorithm for the Rectilinear Minimum Link-Distance Problem in Three Dimensions (Extended Abstract), Robert Scot Drysdale, Clifford Stein, and David P. ![]() McGray, Igor Paprotny, and Daniela RusĪ Steerable, Untethered, 250圆0 micron MEMS Mobile Micro-Robot, Bruce R. Managing Access Control in Virtual Private Networks, Twum DjinĪn Untethered, Electrostatic, Globally Controllable MEMS Micro-Robot: Supplementary videos, Bruce R. In 2021 we expanded the number format to to TRyyyy-nnnn, since the sequence numbers exceeded 999.įor more information about the Dartmouth Computer Science Technical Report series, please contact index Starting in the year 2000, new reports were numbered in the form TRyyyy-nnn, with sequence number nnn continuous across years. In rare cases, the first three letters (“PCS”) was occasionally “DCS”, for a diskette, or “TCS" for a tape most of these have been transferred to archive files and made available here. “PCS” stood for “paper in computer science” for the earliest reports, the pdf contains a scan of the original paper document or a distillation of the original Postscript file. Prior to the year 2000, reports were numbered in the form PCS-TRyy-nnn, where yy was the 2-digit year (19yy), and nnn was a sequence number. Prior to September 2020, the series was also a venue for release of some PhD dissertations, MS theses, and undergraduate honors theses. They include material deemed by the faculty to be worthy of public release in some cases, Technical Reports were later revised and published in the archival literature. This collection represents a series of “Technical Reports” produced by members of the Department of Computer Science (formerly the Department of Mathematics and Computer Science) since 1986.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |