Some 1992 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 downloading 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.
92-1
Allowable Sequences and Order Types in Discrete and Computational Geometry
Jacob Goodman and Richard Pollack
92-2
An Impossibility Result in Axiomatic Location Theory
Pierre Hansen and Fred S. Roberts
92-3
An Implementation of the Generalized Basis Reduction
Algorithm for Integer Programming
William Cook, Thomas Rutherford, Herbert E. Scarf and David Shallcross
92-4
DIMACS Implementation Challenge Workshop Algorithms
for Network Flows and Matching
David S. Johnson and Catherine C. McGeoch
(published as
AMS-DIMACS Volume 12)
92-5
Stable Matchings and Linear Inequalities
Hernan G. Abeledo, Uriel G. Rothblum
92-6
Linear Decision Trees: Volume Estimates and Topological Bounds
Anders Bjorner, Laszlo Lovasz and Andrew C.C. Yao
92-7
Diagonal Matrix Scaling is NP-Hard
Leonid Khachiyan
92-8
On the Rate of Convergence of the Ras Method
Bahman Kalantari and Leonid Khachiyan
92-9
Courtship and Linear Programming
Hernan G. Abeledo, Uriel G. Rothblum and RUTCOR
92-10
Algorithms for Groups
John Cannon and George Havas
92-11
A Complexity Index for Satisfiability Problems
E. Boros, Y. Crama, P.L. Hammer and M. Saks
92-12
On the Distribution of Multiplicative Translates of Sets of Residues (mod p)
J. Hastad, J.C. Lagarias and A.M. Odlyzko
92-13
Keller's Cube-Tiling Conjecture is False in High Dimensions
Jeffrey C. Lagarias and Peter W. Shor
92-14
On A Problem of Erdos and Lovasz II: n(r) = O(r)
Jeff Kahn
92-15
The Complexity of Computing Maximal Word Functions
Eric Allender, Danilo Bruschi and Giovanni Pighizzini
92-16
A Family of Generators of Minimal Perfect Hash Functions
Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J.
Czech and George Havas
92-17
Convex Polygons with Few Vertices
Peter C. Fishburn
92-18
Convex Polygons with Few Intervertex Distances
Peter C. Fishburn
92-19
A Generalization of the Pure Literal Rule for Satisfiability Problems
E. Boros and P.L. Hammer
92-20
Recognition of Q-Horn Formulae in Linear Time
Endre Boros, Peter L. Hammer and Xiaorong Sun
92-21
Horn Function Minimization and Knowledge Compression in
Production Rule Basis (Extended Abstract)
Peter L. Hammer and Alexander Kogan
92-22
Horn Functions and Their DNFs
Peter L. Hammer and Alexander Kogan
92-23
Balancing Problems in Acyclic Networks
Endre Boros, Peter L. Hammer, Mark E. Hartmann and Ron Shamir
92-24
An Optimal Algorithm for Generating Minimal Perfect Hash Functions
Zbigniew J. Czech, George Havas and Bohdan S. Majewski
92-25
On Aschbacher's Local C(G;T) Theorem
Daniel Gorenstein and Richard Lyons
92-26
Amenable Colorings
N.V.R. Mahadev and Fred S. Roberts
92-27
The Bounded Chromatic Numbers of Trees
Bor-Liang Chen and Ko-Wei Lih
92-28
Mick Gets Some (The Odds are on His Side)
V. Chvatal and B. Reed
92-29
Lecture Notes on the New AKS Sorting Network
V. Chvatal
92-30
A Uniform Circuit Lower Bound for the Permanent
Eric Allender and Vivek Gore
92-31
Boolean-Combinatorial Bounding of Maximum 2-Satisfiability
Jean-Marie Bourjolly, Peter L. Hammer, William R.
Pulleyblank and Bruno Simeone
92-32
A General Class of Heuristics for Minimum Weight Perfect Matching
and a $ log_3 log_3 n $-Error Special Case in $O(n^2 log log n)-Time
Celina Imielinska and Bahman Kalantari
92-33
Improved Dynamic Dictionary Matching
Amihood Amir, Martin Farach, Ramana M. Idury, Johannes
A. La Poutre and Alejandro A. Schaffer
92-34
The Meaningfulness of Ordinal Comparisons for General Order
Relational Systems
Fred S. Roberts and Zangwill Samuel Rosenbaum
92-35
Data Structural Bootstrapping, Linear Path compression,
and Catenable Heap Ordered Double Ended Queues
Adam L. Buchsbaum, Rajamani Sundar, Robert E. Tarjan
92-36
Hamilton Cycles and Games on Graphs
Xiaoyun Lu
92-37
Consensus Functions and Patterns in Molecular Sequences
Boris Mirkin and Fred S. Roberts
92-38
On the Satisfiability Problem for the Ground Case of First
Order Theories
Alberto Policriti and Prasad Tetali
92-39
Graph Planarity and Related Topics
Scanned Image
A.K. Kelmans
92-40
On Universal Threshold Graphs
P.L. Hammer and A.K. Kelmans
92-41
Approximations to Solutions to Systems of Linear Inequalities
Osman Guler, Alan J. Hoffman, and Uriel G. Rothblum
92-42
Formulation of Linear Problems and Solutions by a Universal Machine
B. Curtis Eaves and Uriel G. Rothblum
Return to Tech Reports Page
DIMACS Homepage