DIMACS Technical Reports Published in 1998
Obtaining Reports
Most technical reports are available on-line and we encourage
down-loading 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.
- 98-01
(abstract):
Closed Sets and Generators in Ternary Hamming Spaces
by Endre Boros, Peter L. Hammer, Frederica Ricca and Bruno Simeone.
- 98-02
(abstract):
On the Complexity of Generation in Ternary Hamming Spaces
by Endre Boros, Peter L. Hammer, Frederica Ricca and Bruno Simeone.
- 98-03
(abstract):
Optimal Cell Flipping to Minimize Channel Density in
VLSI Design and Pseudo-Boolean Optimization
by Endre Boros, Peter L. Hammer, Michel Minoux and David Rader.
- 98-04
(abstract):
Measurements of Uncolorability
by Eckhard Steffen.
- 98-05
(abstract):
The Set-Maxima Problem, an Overview
by Richard Desper.
- 98-06
(abstract):
Key Management for Encrypted Broadcast
by Avishai Wool.
- 98-07
(abstract):
A Characterization for Parity Graphs and a Coloring
Problem with Costs
by Klaus Jansen.
- 98-08
(abstract):
The Mutual Exclusion Scheduling Problem for Permutation
and Comparability Graphs
by Klaus Jansen.
- 98-09
(abstract):
Convexity and Logical Analysis of Data
by Oya Ekin, Peter L. Hammer and Alexander Kogan.
- 98-10
(abstract):
Patience is a Virtue: The Effect of Delay on Competitiveness for
Admission Control
by Michael H. Goldwasser.
- 98-11
(abstract):
Nonexhaustive Generalized Fibonacci Trees in Unequal
Costs Coding Problems
by Julia Abrahams.
- 98-12
(abstract):
Tagged Probe Interval Graphs
by Li Sheng, Chi Wang and Peisen Zhang.
- 98-13
(abstract):
On the Complexity of the Isomorphism Relation for
Finitely Generated Groups
by Simon Thomas, and Boban Velickovic.
- 98-14
(abstract):
Topology Aggregation for Directed Graph
by Baruch Awerbuch and Yuval Shavitt.
- 98-15
(abstract):
Bellman Functions on Trees for Segmentation, Generalized
Smoothing, Matching Multi-Alignment in Massive Data Sets
by Ilya Muchnik and Vadim Mottl.
- 98-16
(abstract):
Routing Through Networks with Hierarchical Topology Aggregation
by Baruch Awerbuch, Yi Du, Bilal Khan and Yuval Shavitt.
- 98-17
(abstract):
Online Channel Allocation in FDMA Networks with Reuse Constraints
by Tomás Feder and Sunil M. Shende.
- 98-18
(abstract):
Functional Dependencies in Horn Theories
by Toshihide Ibaraki, Alexander Kogan and Kazuhisa Makino.
- 98-19
(abstract):
On the Number of Equilateral Triangles in Euclidean Spaces I
by Bernardo M. Abrego and Silvia Fernandez-Merchant.
- 98-20
(abstract):
ATM Network Design: Traffic Models and Optimization-Based Heuristics
by Iraj Saniee and Daniel Bienstock.
- 98-21
(abstract):
How tight is the Bollobás-Komlós Conjecture?
by Sarmad Abbasi.
- 98-22
(abstract):
Geometric Graphs with Few Disjoint Edges
by Géza Tóth and Pavel Valtr.
- 98-23
(abstract):
Complexity Classes
by Eric Allender, Michael C. Loui and Kenneth W. Regan.
- 98-24
(abstract):
Reducibility and Completeness
by Eric Allender, Michael C. Loui and Kenneth W. Regan.
- 98-25
(abstract):
Other Complexity Classes and Measures
by Eric Allender, Michael C. Loui and Kenneth W. Regan.
- 98-26
(abstract):
Erdös-Szekeres-Type Theorems for Segments and Non-crossing Convex Sets
by János Pach and Géza Tóth.
- 98-27
(abstract):
Finding Convex Sets in Convex Position
by Géza Tóth.
- 98-28
(abstract):
A Formal Scenario and Metalanguage Support Means to Reason about It
by Boris Galitsky.
- 98-29
(abstract):
Which Crossing Number Is It Anyway?
by János Pach and Géza Tóth.
- 98-30
(abstract):
Analysis of a Local Search Heuristic for Facility Location
Problems
by Madhukar R. Korupolu, C. Greg Plaxton and Rajmohan Rajaraman.
- 98-31
(abstract):
Approximate Coloring of Uniform Hypergraphs
by Michael Krivelevich and Benny Sudakov.
- 98-32
(abstract):
Coloring Graphs with Sparse Neighborhoods
by Noga Alon, Michael Krivelevich and Benny Sudakov.
- 98-33
(abstract):
Thin Complete Subsequence
by Norbert Hegyvári.
- 98-34
(abstract):
On the Dimension of the Hilbert-Cubes
by Norbert Hegyvári.
- 98-35
(abstract):
Do Answers Help in Posing Questions?
by Sarmad Abbasi.
- 98-36
(abstract):
Broadcast Disk Paging with a Small Cache
by Vincenzo Liberatore.
- 98-37
(abstract):
Scaling Dualities and Self-Concordant Homogeneous Programming
in Finite Dimensional Spaces
(revised version)
by Bahman Kalantari.
- 98-38
(abstract):
On the Arithmetic-Geometric Mean Inequality
and Its Relationship to Linear Programming,
Matrix Scaling, and Gordan's Theorem
by Bahman Kalantari.
- 98-39
(abstract):
Crossing Properties of Graph Reliability Functions
by Alexander K. Kelmans.
- 98-40
(abstract):
An Adversarial Model for Distributed Dynamic Load Balancing
by S. Muthukrishnan and R. Rajaraman.
- 98-41
(abstract):
Strengthening the Varshamov-Gilbert Bound
by Alexander Barg, Sugi Guritman, Juriaan Simonis.
- 98-42
(abstract):
Note on the Permanent Rank of a Matrix
by Yang Yu.
- 98-43
(abstract):
Limiting the Search for 2-Dimensional Optimal Alphabetic Trees
and cover page
by Ahmed Belal, Magdy A.Ahmed, Shymaa M.Arafat.
- 98-44
(abstract):
List Update Problem
by Bela Csaba and Sachin Lodha.
- 98-45
(abstract):
Partition-Based Goodness-of-Fit Tests on the Line and the Circle
by Carol J. Feltz and Gerald A. Goldin.
- 98-46
(abstract):
On Crossing Sets, Disjoint Sets and the Pagenumber
by Farhad Shahrokhi and Weiping Shi.
- 98-47
(abstract):
Quasi-isometry Classification of Coarse Hadamard Manifolds
by Oliver Attie.
- 98-48
(abstract):
Poincaré Duality for Lp Cohomology and Characteristic Classes
by Oliver Attie and Jonathan Block.
- 98-49
(abstract):
Phylogeny Numbers for Graphs with Two Triangles
by Fred S. Roberts and Li Sheng.
- 98-50
(abstract):
Extremal Phylogeny Numbers
by Fred S. Roberts and Li Sheng.
- 98-51
(abstract):
Genetic Drift in Populations of Ultraselfish Gene Complexes
by Dannie Durand, Eric Bendix, Kristin Ardlie, Warren Ewens and Lee S
ilver.
- 98-52
(abstract):
A New Lower Bound for the Bipartite Crossing Number with
Applications
by Farhad Shahrokhi, Ondrej Sýkora,
László A. Székely and Imrich Vrt'o.
- 98-53
(abstract):
New Upper Bounds on Generalized Weights
by A.Ashikhmin, A. Barg and S. Litsyn.
- 98-54
(abstract):
Xor-Trees for Efficient Anonymous Multicast and Reception
by Shlomi Dolev and Rafail Ostrovsky.
- 98-55
Scientific Achievements at DIMACS: Highlights of the Second Four Years .
Return to Tech Reports Page
DIMACS Homepage
Report problems concerning Technical Reports to: tech@dimacs.rutgers.edu
Contacting the Center
Document last modified on January 15, 1998.