|
Name
|
Title
|
Nicholas Allen
|
Lexicographic Well-Orderings of Monomials
over Path Algebras
|
Xiaoling Bao
|
Comparison of different cryptology
methodologies
|
Mohammed
Benhsain
|
Multiprocessor scheduling with rejection
|
Robert Capra
|
Improvements to Efficient Algorithms
for Dynamic Allocation of Distributed Memory
|
Fanye Cui
|
Algorithms for number parititioning
|
Satadip Dutta
|
Trade off Analysis of Space Representation
for Dynamic Text Indexing
|
Nathan Egge
|
Efficient detection of Collisions among
moving objects
|
James Fogarty
|
String Merging
|
Marcos Goncalves
|
Adaptive Clustering for Dynamic Organization
of Digital Library Content
|
Vincent
Jouenne
|
Evaluation of Presortedness
|
Min Liang
|
The Discrete 2-Center Problem
|
Junlu Luo
|
Guidelines for choosing a fast Exponentiation
Method for Public Key Cryptographic systems
|
Richard Neil
|
The Preferential Assignment Problem
|
Nilesh Phadke
|
Random Access within Compressed files
|
Sonal Ramnani
|
Estimating the Performance of Fast
Greedy Triangulation Algorithms
|
Glenn Rioux
|
A `Reasonable distance' uncapacitated
facility location problem
|
Erik Rubin
|
Non exact algorithms for PMUP
|
Rao Shen
|
Pairwise aligment problem
|
Shalaka
Tendulkar
|
Analysis of Algorithms for Integer
Factorization
|
Timothy
Terriberry
|
Generating Random Latin Squares
|
Marc Vass
|
Evaluation of Radix Sort based Algorithms
for String Sorting
|
Baoping Zhang
|
Sprting-Pattern Matching algorithm
|
Yan Zhao
|
Comparison of MSD Radix-sort Algorithms
|
Xin Zhou
|
Analysis of gapped BLAST and PSI-BLAST
algorithms
|
Jason Zwolak
|
Analysis of Quicksort with various
Partitioning Schemes
|