This page, and any PDF documents linked on this page, are no longer maintained and may not meet accessibility standards. To request an accessible version of any content, please contact us.
DIMACS Technical Reports Published in 1994
Obtaining Reports
Most technical reports are available on-line and we encourage
downloading from WWW browsers or FTP.
Reports that are not available
may be ordered by email to
tech@dimacs.rutgers.edu .
Be sure to include the numbers of the reports needed and your full
Postal Address.
Problems with Technical Reports?
We try to check on the accessibility of technical reports regularly, but
mistakes do happen. If you have trouble obtaining reports, please send email to
tech@dimacs.rutgers.edu identifying the
report you had trouble with. We will try to assist you in obtaining the report.
94-01 (abstract)
Inverse Theorems for Subset Sums 94-02 (abstract)
Ballot Numbers, Alternating Products
and the Erdos-Heilbronn Conjecture 94-03 (abstract)
Independence of Solution Sets
and Minimal Asymptotic Bases 94-04 (abstract)
A Local Rule Based Theory
of Virus Shell Assembly 94-05 (abstract)
Self-Affine Tiles in R 94-06 (abstract)
Tournament Certificates 94-07 (abstract)
On the Complexity of Horn Minimization 94-08 (abstract)
Computing over the Reals with Addition
and Order: Higher Complexity Classes 94-09 (abstract)
Decomposition of Partially Defined Boolean Functions 94-10 (abstract)
A Weak Version of the Blum, Shub and Smale Model 94-11 (abstract)
A Pseudo-algorithmic separation of lines 94-12 (abstract)
A Bound of 4 for the Diameter of the
Symmetric Traveling Salesman Polytope
(Paper only.)
Fred Rispoli, Steven Cosares
94-13 (abstract)
Combinatorial Bases in systems of Simplices & Chambers
Tatiana V. Alekseyevskaya
Complement of a Complex Hyperplane Arrangement
Grigori Rybnikov 94-14 (abstract)
Toward a Measure for P 94-15 (abstract)
A Note on Set Mappings with Meager Images
(Paper only.)
Peter Komjath
94-16 (abstract)
A Sublinear-time Randomized Approximation
Algorithm for Matrix Games 94-17 (abstract)
Normal Numbers and Sources for BPP 94-18 (abstract)
Measure on Small Complexity Classes, with
Applications for BPP 94-19 (abstract)
Coordination Complexity of Parallel
Price-Directive Decomposition 94-20 (abstract)
DIMACS Workshop on Parallel
Processing of Discrete Optimization Problems; April 28-29, 1994 94-21 (abstract)
An Interior Point Method for
Bordered Block Diagonal Linear Programs
(Not Available)
Michael Grigoriadis, Leonid Khachiyan
94-22 (abstract)
Randomizing Optimal Geometric Algorithms
(Extended Abstract) 94-23 (abstract)
Rook Placements and Cellular
Decomposition of Partition Varieties 94-24 (abstract)
Rook Placements and Partition Varieties P\M 94-25 (abstract)
On Garsia-Remmel Problem of Rook Equivalence 94-26 (abstract)
Classification of Partition Varieties (not available)
Kequan Ding
94-27 (abstract)
The Parallel Implementation of N-body Algorithms 94-28
(Cover pages and abstract.)
Noncommutative Symmetric Functions 94-29 (abstract)
An NC Algorithm for Depth-First
Search of Graphs of Bounded Genus
(Removed by request of
Justin R. Smith. Please contact the author for further
information.)
Justin R. Smith and Olga Rayskina
94-30 (abstract)
Score Certificates for Tournaments
(Paper only.)
Jeong Han Kim, Prasad Tetali, Peter Fishburn
94-31 (abstract)
On the Complexity of Some Basic Problems
in Computational Convexity: II. Volume and mixed volumes 94-32 (abstract)
Perfect Graphs are Kernel Solvable 94-33 (abstract)
Optimal Space Distributed Order-Preserving Lists 94-34 (abstract)
Upper and Lower Bounds for Selection on the Mesh 94-35 (abstract)
A spectral technique for coloring
random $3$-colorable graphs 94-36 (abstract)
A Comprehensive Manual for NETPAD
Users with Exercises on Discrete Mathematics 94-37 (abstract)
Algorithms for Quantum Computation:
Discrete Log and Factoring 94-38 (abstract)
Distributed Scheduling Algorithms to
Improve the Performance of Parallel Data Transfers 94-39 (abstract)
Large Deviation Bounds for Markov Chains 94-40 (abstract)
Dominating Sets in Planar Graphs 94-41 (abstract)
1994 Renewal Proposal
to the National Science Foundation Science and Technology Centers
94-42 (abstract)
Essential and Redundant
Rules in Horn Knowledge Bases 94-43 (abstract)
Dense packings of equal
disks in an equilateral triangle 94-44
Conference Proceedings
on Interconnection Networks
List of Conference Participants 94-45 (abstract)
Two Remarks on Self-Correctability
versus Random-Self-Reducibility 94-46 (abstract)
Computing Medial Axis Transform in Parallel
with $O(1)$ scan operations 94-47 (abstract)
Weighted search in the plane 94-48 (abstract)
On the diameter of polyhedra associated with network optimization problems
(Paper only).
Fred J. Rispoli
94-49 (abstract)
Issues in parallel computing with hypercube multiprocessors 94-50 (abstract)
Restricted consensus method and quadratic
implicates of pure Horn functions 94-51 (abstract)
Fast and Simple Algorithms for Perfect Phylogeny
and Triangulating Colored Graphs 94-52 (abstract)
Constructing Piecewise Linear Homeomorphisms 94-53 (abstract)
Improved Approximations of Packing and
Covering Problems
(Paper only.)
Aravind Srinivasan
94-54 (abstract)
Simple Uniform Preprocessing for Linear-time Pattern Matching
(Paper only.)
Dan Gusfield
94-55 (abstract)
Lines, Line-point Incidences and Crossing Families in Dense Sets 94-56 (abstract)
A Linear-time Algorithm for Network Decomposition
tech@dimacs.rutgers.edu
Contacting the Center 
Return to Tech Reports Page
DIMACS Homepage