Institute for Mathematical Sciences Publications
IMS Preprint SeriesIMS Preprint Series - 2002
Normal Approximation under Local Dependence |
|
Nonrandom Clusters of Palindromes in Herpesvirus Genomes |
|
Stein’s Method, Palm Theory and Poisson Process Approximation |
|
Algebraic Function Fields over Finite Fields |
|
Periodic Sequences with Large k-error Linear Complexity |
|
Constructions of Digital Nets |
|
Asymptotic Normality of Scaling Functions |
|
A Class of Good Codes and Their Duals |
|
Computational Methods in Public Key Cryptology |
|
Sensitivity Analysis and Efficient Method for Identifying Optimal Spaced Seeds |
|
Regression-Based QTL Mapping in the 21st Century |
|
Optimality, Variability, Power: A Template for Evaluating Response-Adaptive Randomization Procedures |
|
Extremal Problems of Coding Theory |
|
Quadratic Iterations to p Associated with Elliptic Functions to the Cubic and Septic Base |
|
Exact Arbitrage, Well-Diversified Portfolios and Asset Pricing in Large Markets |
|
Monte Carlo Simulation of Macroeconomic Risk with a Continuum of Agents: The Symmetric Case |
|
Quantum Error-Correcting Codes |
|
On Kummer Covers with Many Rational Points over Finite Fields |
|
Zpk+1-Linear Codes |
|
Smooth Models Associated to Concave Functions in Bruhat-Tits Theory |
|
7-Modular Lattices and Septic Base Jacobi Identity |
|
Computing Zeta Functions of Artin-Schreier Curves over Finite Fields |
|
Uniform and Non-uniform Bounds in Normal Approximation for Nonlinear Statistics |
|
A Novel Packet-Loss Resilient Coding Scheme with Only XOR Operations |
|
A Metric on Probabilities, and Products of Loeb Spaces |
|
An Entropy-Based Uncertainty Principle for a Locally Compact Abelian Group |
|
Dual Pairs and Kostant-Sekiguchi Correspondence. II. Classification of Nilpotent Elements |
|
The Donoho-Stark Uncertainty Principle for a Finite Abelian Group |
|
Three Uncertainty Principles for an Abelian Locally Compact Group |
|
Non-Cooperative Games with Many Players |
|
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree |
|
Asymptotic Bounds on Frameproof Codes |
|
Authentication Schemes |
|
Type II Codes over F2m + Ï…F2m |
|
Dynamic-Programming Strategies for Analyzing Biomolecular Sequences |
|
Greedy Method for Inferring Tandem Duplication History |
|
A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition |
|
Point Matching Under Non-Uniform Distortion and Protein Side Chain Packing Based on Efficient Maximum Clique Algorithms |
|
Sample Size for Response-Adaptive Randomization Procedures |
|
When can the Haseman-Elston Procedure for Quantitative Trait Loci be Improved? Insights from Optimal Design Theory |
|
On the Average Distribution of Inversive Pseudorandom Numbers |
|
On the Linear and Nonlinear Complexity Profile of Nonlinear Pseudorandom Numbers Generators |
|
On the Linear Complexity Profile of Explicit Nonlinear Pseudorandom Numbers |
|
Optimized Baby Step-Giant Step Methods and Applications to Hyperelliptic Function Fields |
|
Practical Construction for Multicast Re-Keying Schemes Using Reed-Solomon Codes |
|
Public-Key Infrastructures |
|
Selective Forgery of RSA Signatures with Fixed-Pattern Padding |
|
The Expected Value of the Joint Linear Complexity of Periodic Multisequences |
|
The Minimum Distance of the Duals of Binary Irreducible Cyclic Codes |
|
Fast Algorithms for Determining the Linear Complexity of Period Sequences |
|
Constructions of Digital Nets Using Global Function Fields |
|
CTRU, a Coding Analogue of NTRU |
|
Exponential Sums in Coding Theory and Cryptology |
|
Introduction to Algebraic Geometry Codes |
|
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers |
|
Some Recent Advances on Response-Adaptive Randomized Designs |
