---

* Research

Technical Reports


2012 - 2011 - 2010 - 2009 - 2008 - 2007 - 2006 - 2005 - 2004 - 2003 - 2002 - 2001 - 2000 - 1999 - 1998 - 1997 - 1996 - 1995 - 1994 - 1993 - 1992 - 1991 - 1990 - 1989 - 1988 - 1987 - 1986 - 1985

2012 [Return to Top]

  • 12-01. Human-Readable Machine-Checkable Abstract Reasoning about Actor Systems. David Musser and Carlos Varela. [pdf]
  • 12-02. BitPath -- Label Order Constrained Reachability Queries for Large RDF Graphs. Medha Atre, Vineet Chaoji, Mohammed J. Zaki. [pdf]
  • 12-03. An Evolution of Computer Science Research. Apirak Hoonlor, Boleslaw K. Szymanski, Mohammed J. Zaki, and James Thompson. [pdf]
  • 12-04. A Dynamic Bayesian Approach to Real-Time Estimation and Filtering in Grasp Acquisition. Li (Emma) Zhang, Siwei Lyu, and Jeff Trinkle. [pdf]
  • 12-05. Host-pathogen association analysis of tuberculosis patients via Unified Biclustering Framework. Cagri Ozcaglar, Bülent Yener, and Kristin P. Bennett. [pdf]
  • 12-06. Stochastic Characterization of Traction on Granular Terrain J. Williams, B. Frank, W. Burgard, and J.C. Trinkle. [pdf]

2011 [Return to Top]

  • 11-01. Energy-Efficient Location Service Protocols for Mobile Ad Hoc Networks. Zijian Wang, Eyuphan Bulut & Boleslaw K. Szymanski. [pdf]
  • 11-02. On Growing Perfect Power-Law Graphs. Boleslaw Szymanski. [pdf]
  • 11-03. Optimal Embedding of Heterogeneous Graph Data with Edge Crossing Constraints. A. Shabbeer, C. Ozcaglar, K. P. Bennett. [pdf]

2010 [Return to Top]

  • 10-01. Measuring Similarity between Sets of Overlapping Clusters. Mark K. Goldberg, Mykola Hayvanovych and Malik Magdon-Ismail. [pdf] [ps]
  • 10-03. Measuring Behavioral Trust in Social Networks. Sibel Adali, Robert Escriva, Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon-Ismail, Boleslaw K. Szymanski, William A. Wallace and Gregory Williams. [pdf] [ps]
  • 10-04. Comparison of Object-oriented and Functional Programming for Code Generation. Eric Allen. [pdf]
  • 10-06. Fast Overlapping Clustering of Networks Using Sampled Spectral Distance Embedding and GMMs. Malik Magdon-Ismail and Jonathan Purnell. [pdf]
  • 10-07. Algorithmic Detection of Computer Generated Text. Allen Lavoie and Mukkai Krishnamoorthy. [pdf]
  • 10-08. A clustering framework for Mycobacterium tuberculosis complex strains using multiple-biomarker tensors. Cagri Ozcaglar, Amina Shabbeer, Scott Vandenberg, Bülent Yener, Kristin P. Bennett. [pdf]
  • 10-09. The Application of Particle Filtering to Grasping Acquisition with Visual Occlusion and Tactile Sensing. Li (Emma) Zhang and Jeffrey C. Trinkle. [pdf]

2009 [Return to Top]

  • 09-01. Optimally Increasing Secure Connectivity in Multihop Wireless Adhoc Networks. Seyit Ahmet Camtepe, Sahin Albayrak, Bülent Yener. [pdf]
  • 09-02. Active Attacks Against Modulation-based Radiometric Identification. Matthew Edman and Bülent Yener. [pdf]
  • 09-03. Integration of multiple genome-wide datasets and analysis of functional relationships among genes in the human genome. Igor B. Kuznetsov and Mohammed J. Zaki. [pdf]
  • 09-04. Practical Static Ownership Inference. Ana Milanova and Yin Liu. [pdf] (Revised March 2010)

2008 [Return to Top]

  • 08-01. Robotic Routers. Onur Tekdas and Volkan Isler. [pdf]
  • 08-02. Modeling and Detection of Epileptic Seizures using Multi-modal Data Construction and Analysis. Evrim Acar, Canan Aykut-Bingol, Haluk Bingol, Rasmus Bro, Anthony L. Ritaccio, Bülent Yener. [pdf]
  • 08-03. Static Information Flow Analysis for Java. Yin Liu, Ana Milanova. (Superseded by 08-06.)
  • 08-04. Robust Partitional Clustering by Outlier and Density Inensitive Seeding. Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, Mohammed J. Zaki. [pdf]
  • 08-06. Static Information Flow Analysis for Java. Yin Liu, Ana Milanova. [pdf] (Supersedes 08-03.)
  • 08-07. ECM-Aware Cell-Graph Mining for Bone Tissue Modeling and Classification. Cemal Cagatay Bilgin, Peter Bullough, George E. Plopper, Bülent Yener. [pdf]
  • 08-08. Dynamic Network Evolution: Models, Clustering, Anomaly Detection. Cemal Cagatay Bilgin, Bülent Yener. [pdf]
  • 08-09. Robotic Routers: Theory and Implementation. Onur Tekdas, Wei Yang, and Volkan Isler.
  • 08-10. Sources of Error in a Simulation of Rigid Parts on a Vibrating Rigid Plate. Stephen Berard, Binh Nguyen, Kurt Anderson, J. C. Trinkle. [pdf]
  • 08-12. On Routing Schemes for Switch-Based In-Vehicle Networks. Shuhui Yang, Wei Li, and Wei Zhao. [pdf]
  • 08-13. Visualization in Sensor Network Simulator, SENSE and Its Use in Protocol Verification. Christopher Morrell, Thomas Babbitt, and Boleslaw K. Szymanski. [pdf]
  • 08-14. MetPetDB: A database for metamorphic geochemistry. Frank S. Spear, Joseph M. Pyle, Sibel Adali, Boleslaw K. Szymanski, Anthony Waters, Zak Linder, Cagri Ozcaglar, Shawn O. Pearce. [pdf]

2007 [Return to Top]

  • 07-01. Sensor Placement for Triangulation Based Localization. Onur Tekdas and Volkan Isler. [pdf]
  • 07-02. Cell-Graph Mining for Breast Tissue Modelling and Classification. C. Çagatay Bilgin, Çigdem Demir, Chandandeep Nagi, Bülent Yener. [pdf]
  • 07-03. Sensor Selection in Arbitrary Dimensions. Volkan Isler and Malik Magdon-Ismail. [pdf]
  • 07-04. Multiway Analysis of Epilepsy Tensors. Evrim Acar, Canan Aykut-Bingol, Haluk Bingol, Rasmus Bro, Bülent Yener. [pdf]
  • 07-05. A Non-Blocking Reference Listing Algorithm for Mobile Active Object Garbage Collection. Wei-Jen Wang and Carlos A. Varela. [pdf]
  • 07-06. Unsupervised Multiway Data Analysis: A Literature Survey. Evrim Acar, Bülent Yener. [pdf]
  • 07-07. Seizure Recognition on Epilepsy Feature Tensor. Evrim Acar, Canan Aykut-Bingol, Haluk Bingol, Rasmus Bro, Bülent Yener. [pdf]
  • 07-08. Finding Maximum Volume Sub-matrices of a Matrix. Ali Çivril and Malik Magdon-Ismail. [pdf] [ps]
  • 07-09. Effective species count and motif efficiency: The value of comparative genomics in characterizing conserved sequence positions. Lee A. Newberg. [pdf]
  • 07-10. Controller Design for Human-Robot Interaction. Eric Meisner, Volkan Isler, Jeff Trinkle. [pdf]
  • 07-11. VOGUE: A Novel Variable Order-Gap State Machine for Modeling Sequences. Bouchra Bouqata Christopher D. Carothers, Boleslaw K. Szymanski, and Mohammed J. Zaki. [pdf]
  • 07-12. The SALSA Programming Language 1.1.2 Release Tutorial Carlos A. Varela, Gul Agha, Wei-Jen Wang, Travis Desell, Kaoutar El Maghraoui, Jason LaPorte, and Abe Stephens. [pdf]

2006 [Return to Top]

  • 06-01. A Formal Method for Attack Modeling and Detection. Seyit Ahmet Çamtepe, Bülent Yener. [pdf]
  • 06-03. Trellis: An Effective Algorithm for Constructing Disk-based Suffix Trees with Suffix Links. Benjarath Phoophakdee and Mohammed J. Zaki. [pdf]
  • 06-04. Distributed Garbage Collection for Mobile Actor Systems: The Pseudo Root Approach. Wei-Jen Wang and Carlos A. Varela. [pdf]
  • 06-05. BLOSOM: A Framework for Mining Arbitrary Boolean Expressions over Attribute Sets. Lizhuang Zhao, Mohammed J. Zaki and Naren Ramakrishnan. [pdf]
  • 06-06. Composition Inference for UML Class Diagrams. Ana Milanova. [pdf]
  • 06-07. Statis Analysis for Dynamic Coupling Measures. Yin Liu, Ana Milanova. [pdf]
  • 06-08. Cooking with Complementarity: A Recipe Guide for Complementarity Based Rigid-Multi-Body Dynamics Simulation. Stephen Berard. [pdf]
  • 06-10. UML-based Alias Control. Yin Liu, Ana Milanova. [pdf]
  • 06-11. Sampling Strategies for Particle Filtering SLAM. Kristopher R. Beevers. [pdf]
  • 06-12. Proceedings of the First International Workshop on Library-Centric Software Design (LCSD '05). Andrew Lumsdaine and Sibylle Schupp (Program Co-Chairs), David Musser and Jeremy Siek (Proceedings Editors). [pdf]
  • 06-13. An Experimental Analysis of Counting Networks. Eric N. Klein, Costas Busch, David R. Musser. [pdf]
  • 06-14. Sequence Alignment for Masquerade Detection. Scott E. Coull, Joel W. Branch, Boleslaw K. Szymanski, Eric A. Breimer. (Revised Jan. 9, 2007) [pdf]
  • 06-15. A Non-blocking Snapshot Algorithm for Distributed Garbage Collection of Mobile Active Objects. Wei-Jen Wang, Carlos A. Varela. [pdf]
  • 06-16. Improved Sparse Covers for Graphs Excluding a Fixed Minor. Costas Busch, Ryan LaFortune, Srikanta Tirthapura [pdf]
  • 06-17. Dynamic Malleability in MPI Applications. Kaoutar El Maghraoui, Travis J. Desell, Boleslaw K. Szymanski, and Carlos A. Varela [pdf]

2005 [Return to Top]

  • 05-01. A Reputation-based System for the Quarantine of Random Scanning Worms. Scott E. Coull, Boleslaw K. Szymanski. (revised 10/31/05) [pdf]
  • 05-02. An Analysis and Simulation of a Novel Auction-Based Pricing Mechanism for Network Services. Juong-sik Lee and Boleslaw K. Szymanski. [pdf]
  • 05-03. Network Sensitive Reconfiguration of Distributed Applications. Kaoutar El Maghraoui, Travis J. Desell, and Carlos A. Varela. [pdf]
  • 05-04. Oblivious Routing on Geometric Networks. Costas Busch, Malik Magdon-Ismail, Jing Xi. [pdf] [ps]
  • 05-05. Exploring similarities across high-dimensional datasets. Karlton Sequeira, Mohammed Zaki. [pdf]
  • 05-06. Complete Topological Mapping with Sparse Sensing. Wesley H. Huang, Kristopher R. Beevers. [pdf]
  • 05-07. Key Distribution Mechanisms for Wireless Sensor Networks: A Survey. Seyit A. Çamtepe, Bülent Yener. [pdf] [ps]
  • 05-08. Functional DNA Positions Change as Frequently as Do Neutral Ones. Lee A. Newberg. [pdf]
  • 05-09. Automated cancer diagnosis based on histopathological images: a systematic survey. Çigdem Demir, Bülent Yener [pdf]
  • 05-10. Precise Identification of Composition Relationships for UML Class Diagrams. Ana Milanova [pdf]
  • 05-11. An Analysis of Optimal Link Bombs. Sibel Adal., Tina Liu, Malik Magdon-Ismail. [pdf] [ps]
  • 05-12. DSIM: Scaling Time Warp to 1,033 Processors. Gilbert Chen, Boleslaw K. Szymanski [pdf]
  • 05-13. Alignment of challenging image pairs: Refinement and region growing starting from a single keypoint correspondence. Gehua Yang, Charles V. Stewart, Michal Sofka, Chia-Ling Tsai. [pdf]
  • 05-14. SDE: Graph Drawing Using Spectral Distance Embedding Ali Civril, Malik Magdon-Ismail and Eli Bocek-Rivele. [pdf] [ps]
  • 05-15. On Hidden Groups in Communication Networks. J. Baumes, M. Goldberg, M. Magdon-Ismail, W. Wallace. [pdf]
  • 05-16. Distributed Data Management Services for Dynamic Data Grids. Houda Lamehamedi, Boleslaw K. Szymanksi, Brenden Conte. [pdf]
  • 05-17. GreenWave Routing Trees for Wireless Sensor Networks. Fikret Sivrikaya, Bülent Yener. [pdf]
  • 05-18. Condorcet Winner Probabilities - A Statistical Perspective. M. S. Krishnamoorthy, M. Raghavachari. [pdf]
  • 05-19. The Generalized Dual-Bootstrap ICP algorithm with application to registering challenging image pairs. Gehua Yang, Charles V. Stewart, Michal Sofka, Chia-Ling Tsai. [pdf]
  • 05-20. Retinal Vessel Extraction Using Multiscale Matched Filters, Confidence and Edge Measures. Michal Sofka and Charles V. Stewart. [pdf]
  • 05-22. Efficient Optimal Linear Boosting of A Pair of Classifiers. Victor Boyarshinov and Malik Magdon-Ismail. [pdf] [ps]
  • 05-23. Efficient Computation of Optimal Trading Strategies. Victor Boyarshinov and Malik Magdon-Ismail. [pdf] [ps]

2004 [Return to Top]

  • 04-01. Generic Pattern Mining via Data Mining Template Library. Nilanjana De, Feng Gao, Paolo Palmerini, Nagender Parimi, Jeevan Pathuri, Benjarath Phoophakdee, Joe Urban, and Mohammed J. Zaki. [pdf]
  • 04-02. Linear Time Isotonic and Unimodal Regression in the L1 and L Norms. Victor Boyarshinov, Malik Magdon-Ismail. [pdf] [ps]
  • 04-03. SENSE: A Sensor Network Simulator. Gilbert Chen, Joel Branch, Eugene Brevdo, Lijuan Zhu, Boleslaw Szymanski. [pdf]
  • 04.04. Discovering Hidden Groups in Communication Networks. J. Baumes, M. Goldberg, M. Magdon-Ismail, A. Wallace. [pdf]
  • 04-05. Identifying Multi-ID Users in Open Forums. H. Chen, M. Goldberg, M. Magdon-Ismail. [pdf]
  • 04-06. Universal Bufferless Routing. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas. [pdf] [ps]
  • 04-07. Optimal Oblivious Path Selection on the Mesh. Costas Busch, Malik Magdon-Ismail, Jing Xi. [pdf] [ps]
  • 04-08. Providing public access to a scientific database while maintaining data integrity. Lauren Foutz, David Spooner. [pdf]
  • 04-09. Computing Wrench Bounds Along a Curved Surface in 2D. Kevin Egan, Stephen Berard, J. C. Trinkle. [pdf]
  • 04-10. Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks. Seyit A. Çamtepe, Bülent Yener. [pdf] [ps]
  • 04-11. CLICK: Clustering Categorical Data using K-partite Maximal Cliques. Markus Peters, Mohammed J. Zaki. [pdf]
  • 04-12. Contention-Free MAC protocols for Wireless Sensor Networks. Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener. [pdf] [ps]
  • 04-13. Efficient Bufferless Routing on Leveled Networks. Costas Busch, Shailesh Kelkar, Malik Magdon-Ismail. [pdf] [ps]
  • 04-14. Learning the topological properties of brain tumors. Çigdem Demir, S. Humayun Gultekin, Bülent Yener [pdf]
  • 04-15. Transactors: A Programming Model for Maintaining Globally Consistent Distributed State in Unreliable Environments. John Field, Carlos A. Varela [pdf]
  • 04-16. Robustness Testing of Java Server Applications. Chen Fu, Ana Milanova, Barbara G. Ryder, David Wonnacott [pdf]
  • 04-17. Spectral Analysis of Cell-Graphs of Cancer. Çigdem Demir, S. Humayun Gultekin, Bülent Yener [pdf]

2003 [Return to Top]

  • 03-01. A View-Based Approach to Registration: Theory and Application to Vascular Image Registration. Charles V. Stewart, Chia-Ling Tsai, Amitha Perera. [pdf]
  • 03-02. Evasiveness of Internet Topology. Çigdem Gündüz, Mehmet Balman, Bülent Yener. [pdf]
  • 03-03. Using a Linear Fit to Determine Monotonicity Directions. Malik Magdon-Ismail, Joseph Sill. [pdf] [ps]
  • 03-04. MIRAGE: A framework for mining, exploring and visualizing minimal association rules. Mohammed Zaki and Benjarath Phoophakdee. [pdf]
  • 03-05. Proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 13 June 2003, San Diego, California. Mohammed J. Zaki, Charu C. Aggarwal. [tar.gz]
  • 03-06. Power Optimal Connectivity and Coverage in Wireless Sensor Networks. Metin Inanc, Malik Magdon-Ismail, Bülent Yener. [pdf]
  • 03-07. Greedy O(C+D) Hot-Potato Routing on Trees. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer. [pdf] [ps]
  • 03-08. Direct Routing. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul Spirakis. [pdf] [ps]
  • 03-09. Accuracy and Sampling Trade-offs for Inferring Internet Router Graph. Çigdem Gündüz and Bülent Yener. [pdf]
  • 03-10. The Relative Inefficiency of Sequence Weights in Determining a Nucleotide Consensus Distribution. Lee A. Newberg, Lee Ann McCue, and Charles E. Lawrence. [pdf] [ps]
  • 03-11. BIOKDD03: Workshop on Data Mining in Bioinformatics. [pdf]
  • 03-12. Learning the Cell-Graphs: Macroscopic Modeling of Brain Tumors. Çigdem Gündüz, Bülent Yener, S. Humayun Gultekin. [pdf]
  • 03-13. Modeling Nonconvex Constraints Using Linear Complementarity. Kevin Egan, Stephen Berard, J. C. Trinkle. [pdf]
  • 03-14. Proceedings of FIMI'03 Workshop on Frequent Itemset Mining Implementations, The 3rd IEEE International Conference on Data Mining. Editors: Mohammed J. Zaki, Bart Goethals. [pdf]
  • 03-15. Retaining Path-Sensitive Relations Across Control-Flow Merges. Douglas Gregor, Sibylle Schupp. [ps]
  • 03-16. Visual Web Mining. Amir H. Youssefi, David J. Duke, Mohammed J. Zaki. [pdf]

2002 [Return to Top]

  • 02-01. Concept Use or Concept Refinement: An Important Distinction Building Generic Specifications (Extended Abstract). David R. Musser, Zhiqing Shao.
  • 02-02. Concept-Based Component Libraries and Optimizing Compilers. S. Schupp, D. P. Gregor, B. Osman, D. R. Musser, J.G. Siek, L.-Q. Lee, A. Lumsdaine.
  • 02-03. The Tecton Concept Distribution Language (Revised Version). David R. Musser, Zhiqing Shao.
  • 02-04. Toward A Type Theoretic Approach for Resolving Data Heterogeneity in Multiple Attribute Negotiations. Roderick Moten.
  • 02-05. Making the Usage of STL Safe. Douglas Gregor and Sibylle Schupp.
  • 02-06. Semantics of Links and Document Structure Discovery. John R. Punin, M. S. Krishnamoorthy.
  • 02-07. Learning Significant Alignments: An Alternative to Normalized Local Alignment. Eric Breimer, Mark Goldberg. [pdf] [ps]
  • 02-08. Covariance-Based Registration. Charles V. Stewart. [pdf] [ps]
  • 02-09. The Dual Bootstrap Iterative Closest Point Algorithm with Application to Retinal Image Registration. Charles V. Stewart, Chia-Ling Tsai, Badrinath Roysam. [pdf] [ps]
  • 02-10. Using Type Theory as a Language for Negotiation Objects in Online Exchanges. Rod Moten. [pdf] [ps]
  • 02-11. Efficient Solutions for Peer to Peer Resource Discovery on Local Area Networks. Aaron Sherman, Daniel Reed, Mukkai S. Krishnamoorthy.
  • 02-12. ROSS: Rensselaer's Optimistic Simulation System\\ User's Guide. Christopher D. Carothers, David Bauer, Shawn Pearce. [pdf] [ps]
  • 02-13. Cake-Cutting is Not a Piece of Cake. Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy. [pdf] [ps]
  • 02-14. Active Contours for Tracking Distributions. Daniel Freedman. [pdf]
  • 02-15. The Sharpe Ratio, Range and Maximal Drawdown of a Brownian Motion. Malik Magdon-Ismail, Amir F. Atiya, Amrit Pratap, Yaser S. Abu-Mostafa. [pdf] [ps]
  • 02-16. Polymorphic Algorithms FFT-Implementations That Share. Marcin Zalewski and Sibylle Schupp. [ps]

2001 [Return to Top]

  • 01-01. Fast Vertical Mining Using Diffsets. Mohammed J. Zaki, Computer Science Department, Rensselaer Polytechnic Institute; Karam Gouda, Computer Science and Communication Engineering Department, Kyushu University.
  • 01-02. "Point of No Return" Model: A Justification for Exponential Increase in Brain Volume in the Hominid Lineage. Konrad R. Fialkowski.
  • 01-03. Web Usage Mining - Languages and Algorithms. John R. Punin, Mukkai S. Krishnamoorthy, Mohammed J. Zaki.
  • 01-04. Real-time On-line Network Simulation. Boleslaw Szymanski, Yu Liu, Anand Sastry, Kiran Madnani.
  • 01-05. Triggers: A Dynamic Approach to Testing Multiuser Software. Robert F. Dugan, Jr., Ephraim P. Glinert. [pdf]
  • 01-06. CAMELOT: Technology Focused Testing of CSCW Applications. Robert F. Dugan, Jr., Ephraim P. Glinert, Edwin H. Rogers. [pdf]
  • 01-07. Efficiently Mining Frequent Trees in a Forest. Mohammed J. Zaki.
  • 01-08. BIOKDD01: Workshop on Data Mining in Bioinformatics. August 26, 2001, San Francisco, CA, in conjunction with 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Mohammed J. Zaki, Computer Science Department, Rensselaer Polytechnic Institute, Troy, New York; Hannu T. T. Toivonen, Nokia Research Center & Computer Science Department, University of Helsinki, Finland; Jason T. L. Wang, Department of Computer & Information Science, New Jersey Institute of Technology, Newark, New Jersey.
  • 01-09. Visual Techniques for Computing Polyhedral Volumes. T. V. Raman, M. S. Krishnamoorthy.
  • 01-10. Genesis: A System for Large-Scale Parallel Network Simulation. Boleslaw K. Szymanski, Adnan Saifee, Anand Sastry, Yu Liu, Kiran Madnani.
  • 01-11. Lookback: A New Way of Exploiting Parallelism in Discrete Event Simulation. Gilbert Chen, Boleslaw K. Szymanski.

2000 [Return to Top]

  • 00-01. An Insertion into the Chomsky Hierarchy? Robert McNaughton.
  • 00-02. CAVES: A Confirgurable Application View Storage System. S. Adali C. Carothers C. Chiang D. Spooner, G. Yuan.
  • 00-03. The Minimal Sum of Altitudes Decomposition for Coverage Algorithms. Wesley H. Huang.
  • 00-04. Efficient and Inefficient Ant Coverage Methods. Sven Koenig, College of Computing, Georgia Institute of Technology; Boleslaw Szymanski, Department of Computer Science, Rensselaer Polytechnic Institute; Yaxin Liu, College of Computing, Georgia Institute of Technology.
  • 00-05. Mining Residue Contacts in Proteins Using Local Structure Predictions. Mohammed J. Zaki, Shan Jin, Department of Computer Science; Chris Bystroff, Biology Department. [pdf] [ps]
  • 00-06. Experimental evaluation of the height of a random set of points in a d-dimentional cube. E. Breimer, M. Goldberg, B. Kolstad, M. Magdon-Ismail. [pdf] [ps]
  • 00-08. Algebraic concepts represented in C++. Sibylle Schupp, Douglas P. Gregor, David Musser.

1999 [Return to Top]

  • 99-01. An Insertion into the Chomsky Hierarchy? Robert McNaughton. [pdf] [ps] [tex]
  • 99-02. Consciousness as an Information State. Willard L. Miranker.
  • 99-03. A Quantum State Model of Consciousness. Willard L. Miranker.
  • 99-04. Conceptor - towards a modelling of consciousness. Konrad R. Fialkowski.
  • 99-05. G isn't C! LabVIEW and G as a Computing Language Course. Mukkai Krishnamoorthy, Sibylle Schupp. [pdf] [ps] [word]
  • 99-06. Clusterability Detection and Initial Seed Selection in Large Data Sets. Scott Epter, Mukkai Krishnamoorthy, Mohammed Zaki. [pdf] [ps]
  • 99-07. A Multiple-Resolution Method For Edge-Centric Data Clustering. Scott Epter, Mukkai Krishnamoorthy.
  • 99-08. PROCEEDINGS: Workshop on Large-Scale Parallel KDD Systems in conjunction with the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD99), August 15, 1999, San Diego, CA. Mohammed J. Zaki (Department of Computer Science, Rensselaer Polytechnic Institute), Ching-Tien (Howard) Ho (IBM Almaden Research Center, San Jose, CA).
  • 99-09. Extending Algebraic Axiom Techniques to Handle Object-Oriented Specifications. Alyce Faulstich-Brady, David R. Musser, David L. Spooner.
  • 99-10. CHARM: An Efficient Algorithm for Closed Association Rule Mining. Mohammed J. Zaki, Ching-Jui Hsiao. [pdf] [ps]
  • 99-11. Internet Routing Behavior Analysis Using Traceroute. Selim Gurun, Boleslaw K. Szymanski.
  • 99-12. Generating Non-Redundant Association Rules. Mohammed J. Zaki. [pdf] [ps]
  • 99-13. Designing Algorithms by Sampling (to appear in Discrete Applied Mathematics). Mark K. Goldberg, David L. Hollinger.
  • 99-14. A Learning Algorithm for the Longest Common Subsequence Problem (to appear in Proceedings of 2nd Workshop on Algorithm Engineering and Experiments). Eric A. Breimer, Mark K. Goldberg, Darren T. Lim.

1998 [Return to Top]

  • 98-01. Exploring Collaborative Learning in Rensselaer's Classroom-in-the-Round. Robert F. Dugan, Jr., Eric A. Breimer, Darren T. Lim, Ephraim P. Glinert, Mark K. Goldberg, Matthew V. Champagne. [pdf] [ps]
  • 98-02. The Complexity of Node Counting on Undirected Graphs. Boleslaw Szymanski, Sven Koenig. [pdf] [ps]
  • 98-03. Case Study of a Learning Algorithm for the Longest Common Subsequence Problem. Eric A. Breimer, Mark K. Goldberg. [pdf] [ps]
  • 98-04. Interactive Multimedia Presentation Databases, I: Algebra and Query Equivalences. Sibel Adali, Maria-Luisa Sapino, V. S. Subrahmanian.
  • 98-05. Performance Analysis Support for Object Oriented Parellel Scientific Applications. Jeffrey Nesheiwat, Boleslaw K. Szymanski. [pdf] [ps]
  • 98-06. Evolution of a Vector-Borne Pathogen's Virulence in a Spatially Detailed Environment: Genetic Algorithms. William Maniatty, Boleslaw Szymanski, Thomas Caraco.
  • 98-07. Design and Implementation of the Frugal Garbage Collector (FGC). Gor V. Nishanov, Sibylle Schupp.

1997 [Return to Top]

  • 97-01. Object-Oriented Schema Evolution using Inheritance Based Partial Correspondence. Alok Mehta.
  • 97-02. The Finiteness of Finitely Presented Monoids. Robert McNaughton. [pdf] [ps] [tex]
  • 97-03. Parallel Computing with Generalized Cellular Automata. W.A. Maniatty, B.K. Szymanski and T. Caraco.
  • 97-04. Model Selection and Surface Merging in Reconstruction Algorithms. Kishore Bubna and Charles V. Stewart. [pdf] [ps]
  • 97-05. Semi_Thue Systems With an Inhibitor. Robert McNaughton. [pdf] [ps]
  • 97-06. Fine-Grain Discrete Voronoi Diagram Algorithms in L(1) and L(infinity) Norms. William Maniatty and Boleslaw K. Szymanski.
  • 97-07. Distributed Multi-Interface Computing with Polyglot. R. Lindsay Todd and Ephraim P. Glinert. [ps]
  • 97-08. Syntactic Analysis of Table Images. Edward Green and Mukkai S. Krishnamoorthy.
  • 97-09. Petri Nets in the Evaluation of Collaborative Systems. AnneMarie Ferraro and Edwin H. Rogers. [pdf] [word]
  • 97-10. A Caching DHCP Relay Agent. Patrick H. Fry and Joshua W. Knight. [pdf] [ps]
  • 97-11. A Fast Generic Sequence Matching Algorithm. David R. Musser and Gor V. Nishanov. [ps]
  • 97-12. Completing the Compilation of Such That v0.7. H. Gast, S. Schupp and R. Loos. [pdf] [ps]

1996 [Return to Top]

  • 96-01. Learning Better Algorithms for the Maximum Clique Problem (Preliminary Report). Mark K. Goldberg, David L. Hollinger.
  • 96-02. Generic Gram-Schmidt Orthogonalization by Exact Division. Ulfar Erlingsson, Erich Kaltofen, David Musser.
  • 96-03. Implementing the C++ Standard Template Library in Ada 95. Ulfar Erlingsson, Alexander V. Konstantinou. [ps]
  • 96-04. Bias in Robust Estimation Caused by Discontinuities and Multiple Structures. Charles V. Stewart.
  • 96-05. Team Learning through Computer Supported Collaborative Design. Anne Ferraro, Edwin Rogers , Cheryl Geisler.
  • 96-06. The Engineering of Environments for Computer Supported Collaborative Design. Anne Ferraro, Edwin H. Rogers, Lee Honeycutt.
  • 96-07. Epidemic Simulation on Parallel Machines. Thomas Caraco & Maria Duryea; Wm. A. Maniatty & Boleslaw K. Szymanski.
  • 96-08. A Symmetric Rank-Revealing Toeplitz Matrix Decomposition. Franklin T. Luk, Sanzheng Qiao.
  • 96-09. Processor-Efficient Parallel Matrix Inversion over Abstract Fields: Two Minor Extensions. W. Eberly.
  • 96-10. PAUL: A Software Engineering Approach to a Prblem in Combinatorial Design (A user manual with examples). Corey N. Bufi, Mark K. Goldberg.
  • 96-11. Depth-Limited Partitioning in Sorting and Selection Algorithms. David R. Musser.
  • 96-12. Decomposing a Signal into a Sum of Exponentials. Franklin T. Luk, David Vandevoorde.
  • 96-13. Interactive Graphic Drawing on the World Wide Web. Ulfar Erlingsson, Mukkai Krishnamoorthy.
  • 96-14. Bayesian Networks Made Accessible Through Interactive Exploration. Varina Hammond, Ellen L. Walker.
  • 96-15. The Discrete Runs Test and the Discrete Maximum of t Test. Andrew Shapira. [html abstract] [ps]
  • 96-16. Ensuring Access for People with Disabilities to the National Information Infrastructure and Multimedia Computing. Ephraim P. Glinert.
  • 96-17. Extending Rectangular Range Reporting with Query Sensitive Analysis. Robin Y. Flatland, Charles V. Stewart.
  • 96-18. Continuously Monitored Global Virtual Time in Parallel Discrete Even Simulation. Ewa Deelman, Boleslaw Szymanski. [ps]
  • 96-19. Contributions of Ronald V. Book to the Theory of String-Rewriting Systems. Robert McNaughton. [pdf] [ps] [tex]

1995 [Return to Top]

  • 95-01. A Basis for Formal Specification and Verification of Generic Algorithms in the C++ Standard Template Library. David R. Musser. Changqing Wang.
  • 95-02. Object Oriented Parallel Computation for Plasma PIC Simulation. Charles D. Norton, Boleslaw K. Szymanski, Viktor K. Decyk. [ps]
  • 95-03. Fault-Tolerant Implementation of Finite-State Automata in Recurrent Neural Networks. C. W. Omlin and C. L. Giles.
  • 95-04. Interactive Learning Tool for Statistical Reasoning with Uncertainty. Deborah A. Vastola and Ellen L. Walker.
  • 95-05. Cycle Vector Space Algorithms for Enumerating all Cycles of a Planar Graph. U. Dogrusoz and M.S. Krishnamoorthy.
  • 95-06. Modeling and the Adaptive Solution of Reactive Vapor Infiltration Problems. S. Adjerid, J. Flaherty, W. Hillig, J. Hudson, and M. Shephard.
  • 95-07. Hamiltonian Cycle Problem for Triangle Graphs. U. Dogrusoz, M.S. Krishnamoorthy.
  • 95-08. Rationale for Adding Hash Tables in the C++ Standard Template Library. David R. Musser.
  • 95-09. Enumeration of the Patterns in a Lattice. Andrew Shapira, M. S. Krishnamoorthy.
  • 95-10. A Rank-Revealing Decomposition of Symmetric Toeplitz Matrices. Franklin T. Luk, Sanzheng Qiao.
  • 95-11. A Parallel Adaptive hp-Refinement Finite Element Methods with Dynamic Load Balancing for the Solution of Hyperbolic Conservation Laws. Karen D. Devine, Joseph E. Flaherty.
  • 95-12. The Quality of Partitions Produced by an Iterative Load Balancer. Carlo L. Bottasso, Joseph E. Flaherty, Can Ozturan, Mark S. Shephard, Boleslaw K. Szymanski, James D. Teresco, Louise H. Ziantz. [html abstract] [ps]
  • 95-13. Computing Lower Bounds on Functional Units before Scheduling. Samit Chaudhuri, Robert A. Walker.
  • 95-14. Lucid and Efficient Case Analysis. Ulfar Erlingsson, Mukkai Krishnamoorthy, and T. V. Raman. [ps] [tex]
  • 95-15. Well Behaved Derivations in One-Rule Semi-Thu Systems. Robert McNaughton. [ps] [tex] [html abstract]
  • 95-16. Dynamic Verification of C++ Generic Components: A Practical Method and Its Support System. Changqing Wang and David R.Musser.
  • 95-17. ROOM: A Reverse Object-Oriented Approach to Multi-Language Reusability. Arturo J. Sanchez-Ruiz and Ephraim P. Glinert.

1994 [Return to Top]

  • 94-01. Parallel Partitioning Strategies for the Adaptive Solution of Conservation Laws. Karen D. Devine, Joseph E. Flaherty, Raymond M. Loy, Stephen R. Wheat. [ps] [html abstract]
  • 94-02. A Consistency Algorithm that Systematically Eliminates Errors Generated by the Use of Heuristics, Parameters and Thresholds in Image Comparison. Gail Markovich, Michael Skolnick.
  • 94-03. Constructing Deterministic Finite-State Automata on Sparse Recurrent Neural Networks. C. W. Omlin, C. L. Giles.
  • 94-04. Automatic Source-Code Parallelization Using HICOR Objects. Mark R. Gilder, Mukkai S. Krishnamoorthy.
  • 94-05. Computational Modeling for Genetic Splicing Systems. Sam Kim.
  • 94-06. Computing Lower Bounds on Functional Units before Scheduling. Robert A. Walker, Samit Chaudhuri.
  • 94-07. Characterizing and Controlling Approximation in Hierarchical Perceptual Grouping. Hang-Bong Kang, Ellen L. Walker.
  • 94-08. Load Balancing for the Parallel Adaptive Solution of Partial Differential Equations. H.L. deCougny, K.D. Devine, J.E. Flaherty, R.M. Loy, C. Ozturan, M.S. Shephard. [ps] [html abstract]
  • 94-09. Robust Techniques and Surface Reconstruction. Charles V. Stewart, James V. Miller.
  • 94-10. Expected Performance of Robust Estimators Near Discontinuities. Charles V. Stewart.
  • 94-11. Modeling Behavior, a Step Towards Defining Functionally Correct Views of Complex Objects in Concurrent Engineering. Fawaz S. Al-Anzi, David L. Spooner.
  • 94-12. Automatic Verification of a Class of Symmetric Parallel Programs. Boleslaw K. Szymanski, Jose M. Vidal. [ps]
  • 94-13. Run-Time Optimization of Sparse Matrix-Vector Multiplication on SIMD Machines. Louis H. Ziantz, Can C. Ozturan, Boleslaw K. Szymanski. [ps] [html abstract]
  • 94-14. Fortran vs. C++: Electrostatic Plasma Simulation on the Intel Paragon. Boleslaw K. Szymanski, Charles Norton, Viktor K. Decyk. [ps]
  • 94-15. Analyzing and Exploiting the Structure of the Constraints in the ILP Approach to the Scheduling Problem. Samit Chaudhuri, Robert A. Walker, John Mitchell.
  • 94-16. Geometric Constraints and Stereo Disparity Computation. Charles V. Stewart, R. Y. Flatland, K. Bubna.
  • 94-17. Implementing Lock-Free Queues. John Valois.
  • 94-18. The Uniform Halting Problem for One-Rule Semi-Thue Systems PROGRESS REPORT. Robert McNaughton.
  • 94-19. Graphical User Interface Programming in Introductory Computer Science. Michael M. Skolnick, David L. Spooner. [ps] [word]
  • 94-20. Hypermedia Textbook for Computer Science 1: A Case Studies Approach. Michael M. Skolnick, David L. Spooner.
  • 94-21. EnDoc: Enhanced Documentation of Software Libraries Using Hypermedia. Robert E. Cook, Jr., David R. Musser, Kenneth J. Zalewski.
  • 94-22. Further Improvements to GraphPack. M.S. Krishnamoorthy, F.Oxaal, U.Dogrusoz, D.Pape, A. Robayo, R.Koyanagi, Y.Hsu, D.Hollinger, and A.Hashmi.
  • 94-23. SVD-Based Analysis of Image Boundary Distortion. Franklin T. Luk, David Vandevoorde.
  • 94-24. Fortran vs. C++: Electrostatic Plasma PIC Simulation on the Intel Paragon & IBM SPI. Charles D. Norton, Boleslaw K. Szymanski, Viktor K. Decyk. [ps]
  • 94-25. Constructing Cliques Using Restricted Backtracking. Mark K. Goldberg. Reid D. Rivenburgh.
  • 94-26. Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study. Jonathan Berry, Mark K. Goldberg.
  • 94-27. Extending Range Queries and Nearest Neighbors. Robin Y. Flatland, Charles V. Stewart.

1993 [Return to Top]

  • 93-01. Object-Oriented Database Views for Supporting Multidisciplinary Concurrent Engineering. Kelvin W. Liu, David L. Spooner.
  • 93-02. Computational Efficientcy of Random Sampling Operators in Vision. Charles V. Stewart. [ps]
  • 93-03. Mapping between EXPRESS and the Extended Entity Relationship Model. Donald B. Sanderson, David L. Spooner.
  • 93-4 (Revised May 1993). Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. A. Diaz, M. Hitz, E. Kaltofen, A. Lobo, T. Valente.
  • 93-05. Parallel, Adaptive Finite Element Methods for Conservation Laws. Rupak Biswas, Karen D. Devine, Joseph E. Flaherty.
  • 93-06. (Revised April 1993). Pruning Recurrent Neural Networks for Improved Generalization Performance. Christian W. Omlin, C. Lee Giles.
  • 93-07. The Concept of Views in Simulation. Margarita Rovira, David L. Spooner, Jorge Haddock. [ps] [word]
  • 93-08. An Efficient Algorithm for Local Testability Problem of Finite State Automata. Sam Kim, Robert McNaughton.
  • 93-09. Integer Division in Residue Number Systems. Markus A. Hitz, Erich Kaltofen. [ps]
  • 93-10. Spatial Modeling of Epidemics on Parallel Machines. Bill Maniatty, Boleslaw K. Szymanski, Tom Caraco, Balaram Sinharoy.
  • 93-11. DSC Users Manual. Revision Number 2.0 (1992). Angel Diaz.
  • 93-12. Gaussian Modelling of Morphological Size Distributions to Increase Sensitivity in Detecting Defects in Textures. Chakravarthy Bhagvati, Michael M. Skolnick, Dimitri A. Grivas.
  • 93-13. Heuristics for the Packing Problem. Mark Goldberg, Uma Mahadevan.
  • 93-14. Space Optimal Wakeup. John D. Valois.
  • 93-15. An HP-Adaptive Method in Space and Time for Parabolic Systems. Joseph E. Flaherty, Peter K, Moore.
  • 93-16. MAP: An Interactive System for Clone Assembly User Manual. Mark K. Goldberg, Mark Mundt, Reid Rivenburgh, Cari Soderland.
  • 93-17. Cellular Automata Algorithms for Homotopic Compaction and Expansion. Fawaz S. Al-Anzi, Sam Kim.
  • 93-18. Virtual Epidemics - Ecological Modeling on a Parallel Machine. Bill Maniatty, Boleslaw Szymanski, Tom Caraco.
  • 93-19. The Langevin Equation and its Application to Grain Alignment in Molecular Clouds. W. G. Roberge, T. A. DeGraff, J. E. Flaherty.
  • 93-20. Triangle Graphs. Messaoud Benantar, Joseph E. Flaherty, Mukkai S. Krishnamoorthy.
  • 93-21. A New Robust Operator for Computer Vision: Theoretical Analysis. Charles V. Stewart. [ps] [html abstract]
  • 93-22. Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems. Erich Kaltofen.
  • 93-23. Algorithm-Oriented Generic Libraries. David R. Musser, Alexander A. Stepanov.
  • 93-24. A New Robust Operatoar for Computer Vision: Application to Range and Intensity Images. Charles V. Stewart. [ps] [html abstract]
  • 93-25. Axiomatic Design and Synchronization: A Model for Maintaining Multiple Language Versions of Object-Oriented Services. Alyce Faulstich-Brady.
  • 93-26. Parallel Adaptive Mesh Refinement and Redistribution on Distributed Memory Computers. C. Ozturan, H.L. deCougny, M.S. Shephard, J.E. Flaherty. [ps] [tex] [html abstract]
  • 93-27. High-Order Finite Element Methods for Singularly-Perturbed Elliptic and Parabolic Problems. Slimane Adjerid, Mohammed Aiffa, Joseph E. Flaherty.
  • 93-28. Extraction, Insertion and Refinement of Symbolic Rules in Dynamically-Driven Recurrent Neural Networks. C. L. Giles, C. W. Omlin.

1992 [Return to Top]

  • 92-01. Polynomial Factorization 1987-1991. Erich Kaltofen.
  • 92-02. Creating a Product Database with ROSE. David L. Spooner.
  • 92-3 (Revised May 1992). On Computing Determinants of Matrices Without Divisions. Erich Kaltofen.
  • 92-04. Perceptual Grouping Based on Fuzzy Sets. Hang-Bong Kang, Ellen L. Walker.
  • 92-05. Electrical Impedance Tomography in Three Dimensions. J. Goble, M. Cheney, D. Isaacson.
  • 92-06. An Optimal Algorithm for Scheduling based on Combinatorial Optimization. Samit Chaudhuri, Robert Walker.
  • 92-07. Npda: An Application for Building and Testing Pushdown Automata. Dan Caugherty, Susan Rodger.
  • 92-08. Resolution of Type Mismatches in a Persistent Object System. Alok Mehta, David L. Spooner, Martin Hardwick. [ps] [word]
  • 92-09. Using Pari to Prove Large Numbers Prime. Imin Chen, Thomas Valente.
  • 92-10. Visual Tools for Generating Iconic Programming Environments. David W. McIntyre, Ephraim P. Glinert.
  • 92-11. Training Second-Order Recurrent Neural Networks using Hints. Christian W. Omlin, C. Lee Giles.
  • 92-12. Pebble_Pond: a morphological wave propagation algorithm for representing spatial point patterns. Michael M. Skolnick, Peter Marineau.
  • 92-13. Algorithm-Oriented Generic Software Library Development. David R. Musser, Alexander A. Stepanov.
  • 92-14. Infinite Games Played on Finite Graphs. Robert McNaughton.
  • 92-15 (Revised August 1992). Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases. Erich Kaltofen, Victor Pan.
  • 92-16. Improvements to GraphPack: A System to Manipulate Graphs and Digraphs. Mukkai S. Krishnamoorthy, Alex Suess, Mike Onghena, Ford Oxaal, Thomas Spencer.
  • 92-17. Bounded p-Contractability is NP-complete. Badrinath Ramamurthy, Mukkai S. Krishnamoorthy.
  • 92-18. Finding Optium Wavefront of Parallel Computation. Balaram Sinharoy, Boleslaw K. Szymanski. [ps]
  • 92-19. Analysis of a Linearly Constrained Least Squares Algorithm for Adaptive Beamforming. Franklin T. Luk, Sanzheng Qiao.
  • 92-20. Tecton: A Framework for Specifying and Verifying Generic System Components. Deepak Kapur, David R. Musser.
  • 92-21. Block Shuffling for Improved Read Performance in a Loge Disk Controller. David Musser, Nathan Schimke.
  • 92-22. Rule Checking with Recurrent Neural Networks. Christian W. Omlin, C. Lee Giles.
  • 92-23. Extraction of Rules from Discrete-Time Recurrent Neural Networks. Christian W.Omlin, C. Lee Giles.
  • 92-24. FLX: A Frame-Based Knowledge Representation System. David Ferrucci, James Kurien.
  • 92-25. An Overview of the Tecton Proof System. Deepak Kapur, David R. Musser, Xumin Nie.
  • 92-26. Simulation and Visualization Tools for Teaching Parallel Merge Sort. Robin Trahan, Susan Rodger.
  • 92-27. A New Methodology for Isolating and Diagnosing Inconsistencies in Image Matching, as Applied to the Analysis of 2-D Electrophoretic Gels. Gail Markovich, Michael Skolnick, Mark Core.
  • 92-28. A New Matrix Decomposition for Signal Processing. Franklin T. Luk, Sanzheng Qiao.
  • 92-29. Toward Computing m(4). Mark K. Goldberg, Hilton C. Russell.
  • 92-30 (Revised February 1993). Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems. Erich Kaltofen.
  • 92-31. Simultaneous Parallel Reduction. B. Szymanski, B. Maniatty, B. Sinharoy.
  • 92-32. FLAP: A Tool for Drawing and Simulating Automata. Mark LoSacco, Susan Rodger.
  • 92-33. Computing the Singular Value Decomposition on a Fat-Tree Architecture. Tong J. Lee, Franklin T. Luk, Daniel L. Boley.
  • 92-34. Compiler Technology for Parallel Scientific Computation. Can Ozturan, Balaram Sinharoy, Boleslaw K. Szymanski. [ps]
  • 92-35. A Viable Object Oriented Intermediate Code Representation for Parallel Architectures. Mark R. Gilder, Mukkai S. Krishnamoorthy.

1991 [Return to Top]

  • 91-01. A Posteriori Error Estimation with Finite Element Methods of Lines for One-Dimensional Parabolic Systems. Slimane Adjerid, Joseph E. Flaherty, Yun Wang.
  • 91-02. Effective Noether Irreducibility Forms and Applications. Erich Kaltofen.
  • 91-03. Pebble_Pond: A Morphological Algorithm for Representing Diverse Spatial Structure. Peter J. Marineau, Michael M. Skolnick.
  • 91-04. Generalized Bonferroni Inequalities. Thomas H. Spencer.
  • 91-05. Change Processing Tools for Concurrent Engineering. Martin Hardwick, David L. Spooner, Blair Downie, Ebba Hvannberg, Alok Mehta, Alyce Faulstich-Brady, Dave Ferrucci, Richard Harris, Jim Kurien, Dave Loffredo, Margarita Rovira, Donald Sanderson, Jeffrey A. Young.
  • 91-06. On the Size of Independent Sets in Hypergraphs. Thomas H. Spencer.
  • 91-07. Increasing Designer Interaction During High-Level Synthesis. Robert A. Walker, Rajive Joshi, Shivkumar Ramabadran.
  • 91-08. Morphological Analysis of Pavement Surface Condition. Chakravarthy Bhagvati, Dimitri A. Grivas, Michael M. Skolnick.
  • 91-09. More Time-Work Tradeoffs for Parallel Graph Algorithms. Thomas H. Spencer.
  • 91-10. Complexity Issues of the Alignment Problem and the Closest Vectors in a Lattice. Balaram Sinharoy, Boleslaw K. Szymanski.
  • 91-11. Complexity of the Closest Vector Problem in a Lattice Generated by (0,1)-Matrix. Balaram Sinharoy, Boleslaw K. Szymanski. [ps]
  • 91-12. High-Order Adaptive Solutions of Parabolic Equations I. Singly Implicit Runge-Kutta Methods and Error Estimation. Peter K. Moore, Joseph E. Flaherty.
  • 91-13. MUKKIAM: A Game on Digraphs. Mukkai S. Krishnamoorthy.
  • 91-14. Parallel Matching on Expanders. Thomas H. Spencer.
  • 91-15. DSC: A System for Distributed Symbolic Computation. A. Diaz , E. Kaltofen, K. Schmitz, T. Valente, with contributions from: M. Hitz, A. Lobo, and P. Smyth.
  • 91-16. Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. Erich Kaltofen, Victor Pan.
  • 91-17. The SetPlayer System: An Overview and a User Manual. D. Berque, R. Cecchini, M. Goldberg, R. Rivenburgh.
  • 91-18. On Fast Multiplication Of Polynomials Over Arbitrary Algebras. David G. Cantor, Erich Kalt
  • 91-19. Language & Design: A Documentary Study Of A Hypertext Design Notebook For Engineering Design. Cheryl Geisler, Barbara Lewis, Edwin Rogers.
  • 91-20. StringWatcher: An Extensible Device For Analyzing Strings. Mark Goldberg, Reid Rivenburgh.
  • 91-21. Counting The Number Of Vertex Covers. Mark K. Goldberg, Thomas H. Spencer, David A. Berque.
  • 91-22. On Wiedemann's Method Of Solving Sparse Linear Systems. Erich Kaltofen, B. David Saunders.
  • 91-23. On Complexity Of The Shortest and Closest Vector Problems In A Lattice. Boleslaw K. Szymanski, Balaram Sinharoy.
  • 91-24. Computing The Order of a Locally Testable Automaton. Sam Kim, Robert McNaughton.
  • 91-25. High-Order Adaptive Methods For Parabolic Systems. S. Adjerid, J. E. Flaherty, P. K. Moore, Y. J. Wang.
  • 91-26. On the Derivation of Geometric Constraints in Stereo. Charles V. Stewart.
  • 91-27. Multilanguage Programming: Automatic-Type-Mapping Approach. Arturo J. Sánchez-Ruíz, Ephraim P. Glinert.
  • 91-28. Increasing User Interaction During High-Level Synthesis. Robert A. Walker, Shivkumar Ramabadran, Rajive Joshi, Steinar Flatland.
  • 91-29. Data Flow Analysis of Sequential Loop Algorithms for Systolic Array Design. Kee-Young Yoo, Sam Kim.
  • 91-30. Robust Surface Reconstruction Based on Local Estimation and Refinement: 1-D Results. Charles V. Stewart.
  • 91-31. Applying Geometric Sensor and Scene Models for Range Image Understanding. Ellen L. Walker.
  • 91-32. Memory Optimization in Parallel Functional Programming Languages. Balaram Sinharoy, Boleslaw Szymanski. [ps]

1990 [Return to Top]

  • 90-01. Parallel Computation with Adaptive Methods for Elliptic and Hyperbolic Systems. Messaoud Benantar, Rupak Biswas, Joseph E. Flaherty, Mark S. Shephard.
  • 90-02. Reducing Line Clutter in Software Engineering Diagrams. Todd S. Moyer, Ephraim P. Glinert.
  • 90-03. A General Methodology for Achieving High Accuracy in Image Comparison, with Application to the Analysis of Two-Dimensional Electrophoretic Gels. Michael M. Skolnick.
  • 90-04. Analyzing Coditional Data Dependencies in an Equational Language Compiler. Jeanette M. Bruno.
  • 90-05. Adaptive Local Overlapping Grid Methods for Parabolic Systems in Two Space Dimensions. Peter K. Moore, Joseph E. Flaherty.
  • 90-06. An Adaptive Mesh Moving and Refinement Procedure for One-Dimensional Conservation Laws. David C. Arney, Rupak Biswas, Joseph E. Flaherty.
  • 90-07. GraphPack: A Software System for Computations on Graphs and Sets. M. Krishnamoorthy, T. Spencer, M. Echeandia, A. Faulstich, G. Kyriazis, E. McCaughrin, C. Maroulis, D. Pape.
  • 90-08. Interprocess Analysis and Optimization in the Equational Language Compiler. Kevin Spier, Boleslaw K. Szymanski.
  • 90-09. Trinocular Local Matching: Detailed Experimental Results. Charles V. Stewart.
  • 90-10. Depth From Focus. Hari N. Nair, Charles V. Stewart.
  • 90-11. Visual Programming: Challenges and Directions for the 90's. Ephraim P. Glinert.
  • 90-12. A Characterization of Constant Time CA Computation. Sam Kim, Robert McCloskey.
  • 90-13. The Design and Evolution of an Object-Oriented Graphics Library for Creating User Interfaces for VLSI Design Tools. David W. McIntyre, Ephraim P. Glinert.
  • 90-14. PROTENV: A Programming Environment for Protocol Development. R. Abburi, K.J. Gildea, M.S. Krishnamoorthy, B. Ramamurthy.
  • 90-15. On the Complexity of Computing a Grobner Basis for the Radical of a Zero Dimensional Ideal. Y.N. Lakshman.
  • 90-16. Parallel Jacobi-like Algorithms for the Algebraic Eigenvalue Problem. Gautam M. Shroff.
  • 90-17. Time-Work Tradeoffs for Parallel Shortest Paths in Directed Graphs (Preliminary Report). Thomas H. Spencer.
  • 90-18. A Visual Environment for Designing and Simulating Execution of Processor Arrays. Charles D. Norton, Ephraim P. Glinert.
  • 90-19. Communication Needs in a Data Engineering World. Ophir Frieder, Richard L. Shuey.
  • 90-20. Mutual Exclusion Revisited. Boleslaw K. Szymanski.
  • 90-21. Simulating Dedicated Unix PC-Based Application Systems. Boleslaw K. Szymanski, Steven H. Azzaro.
  • 90-22. An Ada Generic Data Structure Test Package. Thomas F. Quinn, David R. Musser.
  • 90-23. On Self-Complementary Graphs. M.S. Krishnamoorthy, M.G. McMenamin, Jr.
  • 90-24. An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines. Greg N. Frederickson, Susan H. Rodger.
  • 90-25. The SetPlayer System: An Overview and a User Manual. D. Berque, R. Cecchini, M. Goldberg, R. Rivenburgh.
  • 90-26. Symbolic and Parallel Adaptive Methods for Partial Differential Equations. J. Flaherty, M. Benantar, R. Biswas, P. Moore.
  • 90-27. Experiments with an Adaptive h-, p-, and r-Refinement Finite Element Method for Parabolic Systems. J. Flaherty, Y. Wang.
  • 90-28. Time-Work Tradeoffs for Parallel Graph Algorithms. T. Spencer.
  • 90-29. Expressing User-Defined Parallelism in EPL (Equational Programming Language). C. Ozturan.
  • 90-30. A Survey of High-Level Synthesis Systems (Second Edition). R. Walker.
  • 90-31. Exploiting Geometric Relationships for Object Modeling and Recognition. E. Walker.
  • 90-32. Size Efficient Parallel Algebraic Circuits for Partial Derivatives. E. Kaltofen, Michael F. Singer.
  • 90-33. An Analysis of the Probability of Disparity Changes in Stereo Matching and a New Algorithm Based on the Analysis. Charles V. Stewart.
  • 90-34. A Flexible Environment for High-Level Synthesis. Katherine Betz, Edwin H. Rogers, Robert A. Walker.
  • 90-35. Techniques for Interactive 3-D Scientific Visualization. Ephraim P. Glinert, Meera M. Blattner, Barry G. Becker.
  • 90-36 (Revised June 1991). Dynamic Parallel Evaluation of Computation DAGs. Erich Kaltofen.
  • 90-37 (Revised January 1993). Syntactic Segmentation and Labeling of Digitized Pages from Technical Journals. Mukkai Krishnamoorthy, George Nagy, Sharad Seth, Mahesh Viswanathan.

1989 [Return to Top]

  • 89-01. Recovery of Algebraic Numbers from their p-adic Approximations. John Abbott.
  • 89-02. Morpholigical Algorithms for Centroid Normalization in Relational Matching. Michael M. Skolnick, Roger H. Brown, Chakravarthy Bhagvati, Brian R. Wolf.
  • 89-03. The Importance and Computation of Vertical Disparity in Stereo Matching. Charles V. Stewart.
  • 89-04. Toeplitz Networks and Their Properties. Narsingh Deo, M.S. Krishnamoorthy.
  • 89-05. MAGNEX: A Text Editor for the Visually Impaired. Avram R. Vener, Ephraim P. Glinert.
  • 89-06. C2: A Mixed Textual/Graphical Environment for C. Mark E. Kopache, Ephraim Glinert.
  • 89-07. An Experiment into the Use of Auditory Cues to Reduce Visual Workload. Megan L. Brown, Sandra L. Newsome, Ephraim P. Glinert.
  • 89-08. Buchi's Sequential Calculus. Robert McNaughton.
  • 89-09. Computing the Irreducible Real Factors and Components of an Algebraic Curve. Erich Kaltofen.
  • 89-10. The User's View of SunPict, an Extensible Visual Environment for Intermediate--Scale Procedural Programming. Ephraim P. Glinert, David W. McIntyre.
  • 89-11. An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size.
    Mark Goldberg, Thomas Spencer.
  • 89-12. An Improved Las Vegas Primality Test. Erich Kaltofen, Thomas Valente, Noriko Yui.
  • 89-13. Explicit Construction of the Hilberg Class Fields of Imaginary Quadratic Fields by Integer Lattice Reduction. Erich Kaltofen, Noriko Yui.
  • 89-14. Solving Systems of Non-Linear Polynomial Equations Faster. John F. Canny, Erich Kaltofen, Lakshman Yagati.
  • 89-15. A Parallel Algorithm for the Eigenvalues and Eigenvectors of a General Complex Matrix. Gautam Shroff.
  • 89-16. Adaptive Overlapping Grid Methods for Parabolic Systems. Joseph E. Flaherty, Peter K. Moore, Can Ozturan.
  • 89-17. SetPlayer: A System for Symbolic Set Computation. D. Berque, R. Cecchini, M. Goldberg, R. Rivenburgh.
  • 89-18. Conceptual Structures for Planning. Christopher A. Welty.
  • 89-19. Morphological Algorithms for the Analysis of Pavement Structure. Dimitri A. Grivas, Michael M. Skolnick.
  • 89-20. Towards an Automatic Algorithm for the Numerical Solution of Parabolic Partial Differential Equations Using the Method of Lines. J. Lawson, M. Berzins.
  • 89-21. The Upper Layers of the OSI Reference Model. Ted Macomber.
  • 89-22. Experimental Analysis of a Number of Stereo Matching Components using LMA. Charles Stewart, Janice K. MacCrone.
  • 89-23. Trinocular Stereo: Theoretical Advantages and a New Algorithm. Charles Stewart.
  • 89-24. Elements of a Pragmatic Approach to Program Verification. David R. Musser.
  • 89-25. New Results in Automatic Focusing and a New method for Combining Focus and Stereo. Charles V. Stewart, Hari Nair.
  • 89-26. Time-Work Tradeoffs for Parallel Algorithms. Thomas H. Spencer.
  • 89-27. Balancing Space and Time Errors for Spectral Methods used with The Method of Lines for Parabolic Equations. M. Berzins.
  • 89-28. ROSE: A Database System for Concurrent Engineering Applications. Martin Hardwick, David Spooner, Ebba Hvannberg, Blair Downie, Alyce Faulstich, David Loffredo, Alok Mehta, Don Sanderson.
  • 89-29. An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. Mark Goldberg, Thomas Spencer.
  • 89-30. Faster Boolean Matrix Multiplication. Thomas H. Spencer.

1988 [Return to Top]

  • 88-01. VHDL in an Object Oriented VLSI Design Environment. Moon-Jung Chung, Edwin H. Rogers, Yoohun Won.
  • 88-02. Literal Dependence Estimation for Parallel Execution of Logic Programs. M. Kodeih, E.H. Rogers.
  • 88-03. Provably Good Pattern Generators for Random Pattern Test. Thomas H. Spencer.
  • 88-04. Design and Implementation Overview of a UNIX Version of SGMP. Martin Schoffstall, Uttam Shikarpur, Wengyik Yeong.
  • 88-05. A Simple Gateway Monitoring Protocol. J. Davin, J. Case, M. Fedor, M. Schoffstall.
  • 88-06. Parallel Algorithms for Matrix Normal Forms. Erich Kaltofen, M.S. Krishnamoorthy, B. David Saunders.
  • 88-07. Using Database Technology in a User Interface Management System. Martin Hardwick, Wayne Uejio, David Spooner, Joe Czechowski, Phil Lohr, Brion Sarachan.
  • 88-08. Algorithms for Placing Recovery Points. Moon Jung Chung, M. S. Krishnamoorthy.
  • 88-09. Constructing a Maximal Independent Set in Parallel. Mark Goldberg, Thomas Spencer.
  • 88-10. Higher Order Imperative Programming. Aaron Kershenbaum, David Musser, Alexander Stepanov.
  • 88-11. On the Convergence of the Cyclic Jacobi Method for Parallel Block Orderings. Gautam Shroff, Robert Schreiber.
  • 88-12. Architecture and Operation of a Systolic Engine for Finite Element Computations. Steven W. Hammond, Kincho H. Law.
  • 88-13. A Local Refinement Finite Element Method for One-Dimensional Parabolic Systems. Peter K. Moore, Joseph E. Flaherty.
  • 88-14. Adaptive Solutions of the Euler Equations Using Finite Quadtree and Octree Grids. Raymond A. Ludwig, Joseph E. Flaherty, Fabio Guerinoni, Peggy L. Baehmann, Mark S. Shephard.
  • 88-15. A Morphological Algorithm for Computing Non-planar Point Neighborhoods on Cellular Automata. Michael M. Skolnick, Sam Kim, Robert O'Bara.
  • 88-16. EPL - Equational Programming Language Parsing and Dimension Propagation. Balaram Sinharoy.
  • 88-17. Improved Sparse Multivariate Polynomial Interpolation Algorithms. Erich Kaltofen, Lakshman Yagati.
  • 88-18. Computing with Polynomials Given by Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators. Erich Kaltofen, Barry Trager.
  • 88-19. Program Tools for Algorithm Animation. Mukkai S. Krishnamoorthy, Ramesh Swaminathan.
  • 88-20. A Polynomial Time Algorithm for Local Testability Problem of Deterministic Finite Automata. Sam Kim, Robert McNaughton.
  • 88-21. A Simple Network Management Protocol. J. Case, M. Fedor, M. Schoffstall, J. Davin.
  • 88-22. Morphological Algorithms for Analysis of Geological Phase Structure. Michael Skolnick, Eric Brechner, Peter Marineau.
  • 88-23. A Self-Testing and Self-Pruning Binary Communication Tree for a Wafer Scale Database System. James Guilford, E.H. Rogers.
  • 88-24. Propagation of Data Dependency through Distributed Cooperating Processes. Kevin L. Spier.
  • 88-25. New Functions for LILA Interpreter and Kernel for Graphpack. Magda Echeandia.
  • 88-26. SetPlayers: An Interactive Software System for Set Manipulation. M. Goldberg, D. Berque, R. McCloskey.
  • 88-27. The Impact of Inheritance on Security in Object-Oriented Database Systems. David Spooner. [Word] [ps]
  • 88-28. Towards the Automatic Numerical Solution of Partial Differential Equations. Peter K. Moore, Can Ozturan, Joseph E. Flaherty.
  • 88-29. Experiments with Mesh Moving and Local Refinement Algorithms for Hyperbolic Systems. David C. Arney, Rupak Biswas, Joseph E. Flaherty.
  • 88-30. Solving Compressible Flow Problems Using Adaptive Finite Quadtree and Octree Grids. Peggy L. Baehmann, Joseph E. Flaherty, Fabio Guerinoni, Raymond Ludwig, Mark S. Shephard.
  • 88-31. Episodic Version Control and Parallel Editing Using Hierarchical Objects and Pugilistic Concurrency Control. Martin Hardwick, Blair Downie.
  • 88-32. Using a Relational Database as an Index to a Distributed Object Database in Engineering Applications. Martin Hardwick, George Samaras.
  • 88-33. Recognizing Unnecessary Inference. Dan Benanav.
  • 88-34. Paradigmatic Attachment and Transparent Access. Christopher A. Welty, David A. Ferrucci.

1987 [Return to Top]

  • 87-01. Second-Order Finite Element Approximations and A Posteriori Error Estimation for Two-Dimensional Parabolic Systems. Slimane Adjerid, Joseph E. Flaherty.
  • 87-02. Computer Algebra Algorithms. Erich Kaltofen.
  • 87-03. Toward an Object-Oriented Iconic Environment for Computer Assisted VLSI Design. Moon-Jung Chung, Ephraim P. Glinert, Martin Hardwick, Edwin H. Rogers.
  • 87-04. Efficient Handling of Data Structures in Definitional Languages. Boleslaw K. Szymanski, Noah S. Prywes.
  • 87-05. Block Algorithms for Parallel Machines. Robert Schreiber.
  • 87-06. CALEB: A Silent Second Language Tutor: The Knowledge Acquisition Phase. Patricia A. Cunningham.
  • 87-07. Software Development for Parallel Processing in a Distributed Computer Architecture. Noah S. Prywes, Boleslaw K. Szymanski.
  • 87-08. On Regularizing Graphs. Paul Erdos, M. S. Krishnamoorthy.
  • 87-09. On Animation Programs. Ramesh Swaminathan, James Loy, M. S. Krishnamoorthy, Patrick Harubin.
  • 87-10. Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials. Erich Kaltofen.
  • 87-11. Block Reflectors: Theory and Computation. Robert Schreiber, Beresford Parlett.
  • 87-12. Strong Nondeterministic Turing Reduction--a Technique for Proving Intractability. Moon-Jung Chung, B. Ravikumar.
  • 87-13. The Saxpy Matrix--1: A General Purpose Systolic Computer. David E. Foulser, Robert Schreiber.
  • 87-14. Cholesky Factorization by Systolic Array. Robert Schreiber.
  • 87-15. First- and Second-Order Adaptive Finite Element Methods for Parabolic Systems. Slimane Adjerid, Joseph E. Flaherty.
  • 87-16. Towards Software Metrics for Visual Programming. Ephraim P. Glinert.
  • 87-17. Generalized Halstead Metrics for Iconic Programming. Ephraim P. Glinert, Craig D. Smith.
  • 87-18. Systolic Linear Algebra Machines: A Survey. Robert Schreiber.
  • 87-19. A (Formal) Model for (Iconic) Programming Environments. Ephraim P. Glinert, Jakob Gonczarowski.
  • 87-20. Out of Flatland: Towards 3-D Visual Programming. Ephraim P. Glinert.
  • 87-21. Some Conceptual Ideas for Extending SQL for Object-Oriented Engineering Database System. David L. Spooner, Martin Hardwick, George Samaras.
  • 87-22. An Adaptive Overlapping Local Grid Refinement Method for Two-Dimensional Parabolic Systems. Peter K. Moore, Joseph E. Flaherty.
  • 87-23. Relationships Between Database System and Operating System Security. David L. Spooner.
  • 87-24. Rose and Chide: The Implementation of a User Interface Management System as an Application of an Object Oriented Database Management System. Martin Hardwick, Wayne Uejio, David Spooner.
  • 87-25. Convergence of Block Jacobi Methods. Gautam Shroff, Robert Schreiber.
  • 87-26. An Efficient Algorithm for Simple Diophantine Equations. Hantao Zhang.
  • 87-27. A Mechanizable Induction Principal for Equational Specifications. Hantao Zhang.
  • 87-28. An Adaptive Mesh Moving and Local Refinement Method for Time-Dependent Partial Differential Equations. David C. Arney, Joseph E. Flaherty.
  • 87-29. A Timing Evaluator for C Programs Generated by the Model System. Mahesh Srinivasan, Boleslaw Szymanski.
  • 87-30. The Rose Object Oriented Database System: The Advantages of an Open Architecture. Martin Hardwick, David Spooner.
  • 87-31. First-Order Theorem Proving Using Conditional Rewriting. Hantao Zhang, Deepak Kapur.
  • 87-32. EPL--Equational Programming Language Code Generation. Mary Nolan.
  • 87-33. EPL - Equational Programming Language System Design - Intermediate Processing Steps. Duncan E. Clarke.
  • 87-34. Comparison of Two Knowledge Representation Paradigms for Diagnosis of Complex Analytical Instruments. Saad Ayub, Gerd Beckmann, Geof Goldbogen, Larry Jacobs, Edwin Rogers.
  • 87-35. Fast Multiplication of Polynomials over Arbitrary Rings. David G. Cantor, Erich Kaltofen.

1986 [Return to Top]

  • 86-01. Access Control in a Heterogeneous Distributed Database Management System. Ching-Yi Wang, David L. Spooner.
  • 86-02. Distinguishability of Conductivities by Electric Current Computed Tomography. David Isaacson.
  • 86-03. Relational Database Support for Graphics and CAD. David L. Spooner.
  • 86-04. Parallel Algorithms for Three Graph Problems. Mark K. Goldberg.
  • 86-05. Church-Rosser Thue Systems and Formal Languages. Robert McNaughton, Paliath Narendran, Friedrich Otto.
  • 86-06. Predicate Analysis for Parallel Program Generation. Boleslaw K. Szymanski.
  • 86-07. A Local Refinement Finite Element Method for Two-Dimensional Parabolic Systems. Slimane Adjerid, Joseph E. Flaherty.
  • 86-08. Heuristics for the Graph Bisection Problem. Mark K. Goldberg, Sukriti Lath, John W. Roberts.
  • 86-09. On The Total Dominating Set Problem. M. S. Krishnamoorthy, Kowtha Murthy.
  • 86-10. An Adaptive Local Mesh Refinement Method for Time-Dependent Partial Differential Equations. D. C. Arney, J. E. Flaherty.
  • 86-11. A Comparison of Three Distributed Database Systems: SDD-1 R*, and Distributed-INGRES. C. Y. Wang, D. Spooner.
  • 86-12. Towards "Second Generation" Interactive, Graphical Programming Environments. Ephraim P. Glinert.
  • 86-13. Interactive, Graphical Programming Environments: Six Open Problems and a Possible Partial Solution. Ephraim P. Glinert.
  • 86-14. Cutting a Graph Into Two Dissimilar Halves. Paul Erdos, Janos Pach, Mark Goldberg, Joel Spencer.
  • 86-15. A System for Manipulating Polynomials Given by Straight-Line Programs. Timothy S. Freeman, Gregory M. Imirzian, Erich Kaltofen.
  • 86-16. Parallel and Sequential Algorithms for Computing a Generalized Gabriel Graph. Sam M. Kim, Michael M. Skolnick, Kee Y. Yoo.
  • 86-17. Functions Over Graphs. M.S. Krishnamoorthy, M. Kupferschmid.
  • 86-18. An Adaptive Method With Mesh Moving and Local Mesh Refinement for Time-Dependent Partial Differential Equations. David C. Arney, Joseph E. Flaherty.
  • 86-19. Polynomial Factorization 1982-1986. Erich Kaltofen.
  • 86-20. Adaptive Finite Element Methods for Parabolic Systems in One and Two Space Dimensions. Slimane Adjerid, Joseph E. Flaherty.
  • 86-21. PC-TILES: A Visual Programming Environment for Personal Computers Based on the BLOX Methodology. Ephraim P. Glinert, Craig D. Smith.
  • 86-22. An Iterative State Machine Array for Lee Routing Acceleration. Thomas Ryan, Edwin H. Rogers.
  • 86-23. Evaluation Recursive Queries in CAD Using an Extended Projection Function. Martin Hardwick, George Samaras, David L. Spooner.
  • 86-24. User Manual for ROSE: A CAD/CAM Database System. Martin Hardwick.
  • 86-25. An Iterative State Machine Array for Design Rule Checking Acceleration. Thomas Ryan, Edwin Rogers.
  • 86-26. A New Parallel Algorithm for the Maximal Independent Set Problem. Mark Goldberg, Thomas Spencer.
  • 86-27. Why Rose is Fast: Five Optimizations in the Design of an Experimental Database System for CAD/CAM Applications. Martin Hardwick.
  • 86-28. Parallel Programming with Recurrent Equations. Boleslaw Szymanski.

1985 [Return to Top]

  • 85-01. How the Dictyostelium Discoideum Grex Crawls. Garrett M. Odell, J. T. Bonner.
  • 85-02. Automatic Comparison of 2D Electrophoretic Gels. Michael M. Skolnick.
  • 85-03. On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's. Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier.
  • 85-04. Some Characterizations of Multihead Finite Automata. Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier.
  • 85-05. An Algorithm for the Construction of CMOS Gate Array Macrocells. Moon J. Chung.
  • 85-06. Exact and Approximate Solutions for the Gate Matrix Layout Problem. Narsingh Deo, Michael A. Langston, M.S. Krishnamoorthy.
  • 85-07. Design of the WARP Machine a Wafer Scale Database System. James Guilford, E.H. Rogers.
  • 85-08. Some Complexity Results on Sorting and Related Networks. Moon Jung Chung, B. Ravikumar.
  • 85-09. A Two-Dimensional Mesh Moving Technique for Time Dependent Partial Differential Equations. David C. Arney, Joseph E. Flaherty.
  • 85-10. Computing with Polynominals Given by Straight-Line Programs II. Sparse Factorization. Erich Kaltofen.
  • 85-11. Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices. Erich Kaltofen, M. Krishnamoorthy, B. David Saunders.
  • 85-12. Sparse Hensel Lifting. Erich Kaltofen.
  • 85-13. An Algebraic Implementation of Packages. Snorri Agnarsson, M.S. Krishnamoorthy, B. David Saunders.
  • 85-14. Towards a Theory of Packages. Snorri Agnarsson, M.S. Krishnamoorthy.
  • 85-15. Arithmetic in Quadratic Fields with Unique Factorization. Erich Kaltofen, Heinrich Rolletschek.
  • 85-16. Computing with Polynominals Given by Straight-Line Programs I. Greatest Common Divisor. Erich Kaltofen.
  • 85-17. An Automated Data Collection System, Part II: Development of the Fictitious Solution Model with Critical Analysis of the Kedem-Katchalsky and Spiegler-Kedem Models. P. Balakrishnan, R. Chu, D. Gisser, M. Kupferschmid, A. Zelman.
  • 85-18. Solution of Nonlinear Programming Problems with Imprecise Function and Gradient Values. Michael Kupferschmid, J. G. Ecker.
  • 85-19. Modeling Mechanical CAD Data With Data Abstraction and Object-Oriented Techniques. David L. Spooner, Michael A. Milicia, Donald B. Faatz.
  • 85-20. Packages as Substitutions. Snorri Agnarsson.
  • 85-21. A Moving Mesh Finite Element Method With Local Refinement for Parabolic Partial Differential Equations. Slimane Adjerid, Joseph E. Flaherty.
  • 85-22. Cellular Array Algorithms for the Analysis of EKG Signals. Michael M. Skolnick , Deborah Butt.
  • 85-23. Partitioning of Massive/Real-Time Programs for Parallel Processing. I. Lee, N. Prywes, B. Szymanski.
  • 85-24. Programming Supercomputers in an Equational Language. N. Prywes, B. Szymanski.
  • 85-25. Real-Time Software Life Cycle with the Model System. J. Tseng, Y. Shi, N. Prywes, B. Szymanski.
  • 85-26. Supersystem Programming with the Model Equational Language. N. Prywes, Y. Shi, J. Tseng, B. Szymanski.
  • 85-27. Systolic Tree Implementations of Data Structures. Moon Jung Chung, Kotesh K. Rao, Jik H. Chang, Oscar H. Ibarra.
  • 85-28. A Parallel Algorithm for Bisection Width in Trees. Mark Goldberg, Zevi Miller.
  • 85-29. Formal Specification of Syntax Directed Editor. Ebba Hvannberg, Mukkai S. Krishnamoorthy.
  • 85-30. Lower and Upper Bounds for the Bisection Width of a Random Graph. Mark Goldberg, James F. Lynch.
  • 85-31. Synchronized Distributed Termination. B. Szymanski, Y. Shi, N. Prywes.
  • 85-32. Architectural Yield Analysis of Random Defects in Wafer Scale Integration. J. Czechowski, E.H. Rogers, M.-J. Chung.
  • 85-33. A Discontinuous Finite Element Method for Hyperbolic Systems of Conservation Laws. T.L. Jackson, J.E. Flaherty.
  • 85-34. Design and Implementation of a Data Manager for Design Objects. Martin Hardwick, Lin Kan, Goutam Sinha, Subhendu Lahiri, Zia Mohammed, Nisar Yakoob.
  • 85-35. Circuits as Infinite Trees. Snorri Agnarsson , M.S. Krishnamoorthy.
  • 85-36. Comparison of Data Models for CAD Objects. Martin Hardwick, David L. Spooner.
  • 85-37. Special Monoids and Special Thue Systems. R. McNaughton, P. Narendran.

---

---