DIMACS Technical Reports Published in 2002
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.
- 2002-01
(abstract):
A Trade-Off for Covering the Off-Diagonal Elements of Matrices
by Vince Grolmusz.
- 2002-02
(abstract):
Additive Bases and Extremal Problems in Groups, Graphs and Networks
by D. Frank Hsu, and Xingde Jia.
- 2002-03
(abstract):
Regulating E-Commerce through Contract Certificates
by Victoria Ungureanu.
- 2002-04
(abstract):
The Controversy About Continuity of Clustering Algorithms
by Melvin F. Janowitz.
- 2002-05
(abstract):
The split systems generated by a connected graph
by Melvin F. Janowitz.
- 2002-06
(abstract):
On Pattern Coloring of Cycle Systems
by Zdenek Dvorak, Jan Kara, Daniel Kral, Ondrej Pangrac.
- 2002-07
(abstract):
Expected rank in antimatroids
by Gary Gordon.
- 2002-08
(abstract):
On a conjecture of Baiou and Balinski
by David Avis and Vasek Chvatal.
- 2002-09
(abstract):
Pairs of Codes with Prescribed Hamming Distances and Coincidences
by Vince Grolmusz.
- 2002-10
(abstract):
Use of virtual semantic headers to improve the coverage of natural language question answering domains
by Boris Galitsky.
- 2002-11
(abstract):
Coronary Risk Prediction by Logical Analysis of Data
by Sorin Alexe, Eugene Blackstone, Peter L. Hammer, Hemant Ishwaran, Michael S. Lauer, Claire E. Pothier Snader.
- 2002-12
(abstract):
Mathematical Programming Formulation of Rectilinear Crossing Minimization
by Nathaniel Dean.
- 2002-13
(abstract):
Graph Ramseian bipartitions and weighted stability
by I. E. Zverovich and I. I. Zverovich.
- 2002-14
(abstract):
A Bi-objective Model for Maximizing the Quality in Project Scheduling
by Mohamed Haouari, Mohammad A. Al-Fawzan.
- 2002-15
(abstract):
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles
by E. Boros and V. Gurvich.
- 2002-16
(abstract):
Second-order Asymptotics of Mutual Information
by Viacheslav Prelov and Sergio Verdú.
- 2002-17
(abstract):
Compatible Prior Distributions for DAG models
by Alberto Roverato and Guido Consonni.
- 2002-18
(abstract):
The set of pair-wise correlated sequence positions contributes to determination of the immunoglobulin fold
by Boris Galitsky, Andrey Dementiev and Sergey Shelepin
- 2002-19
(abstract):
Sylvester-Gallai theorem and metric betweenness
by Vasek Chvatal.
- 2002-20
(abstract):
Source Routing and Scheduling in Packet Networks
by Matthew Andrews, Antonio Fern\'andez, Ashish Goel and Lisa Zhang.
- 2002-21
(abstract):
Estimating Rarity and Similarity over Data Stream Windows
by Mayur Datar and S. Muthukrishnan
- 2002-22
(abstract):
Bounds on the Efficiency of Encryption and Digital Signatures
by Rosario Gennaro, Yael Gertner and Jonathan Katz.
- 2002-23
(abstract):
Generating Dual-Bounded Hypergraphs
by Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan.
- 2002-24
(abstract):
A Classification of Antichains of Finite Tournaments
by Brenda J. Latka.
- 2002-25
(abstract):
Strong Key-Insulated Signature Schemes
by Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu and Moti Yung.
- 2002-26
(abstract):
An Algorithm for Dualization in Products of Lattices
by Khaled M. Elbassioni.
- 2002-27
(abstract):
Extending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
by Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan.
- 2002-28
(abstract):
The Domination Number of $(K_p, P_5)$-Free Graphs
by I. E. Zverovich.
- 2002-29
(abstract):
Parallel Scheduling Problems in Next Generation Wireless Networks
by L. Becchetti, S. Diggavi, S. Leonardi, A. Marchetti-Spaccamela, S. Muthukrishnan, T. Nandagopal and A. Vitaletti.
- 2002-30
(abstract):
On the Edge-Forwarding Indices of Frobenius Graphs
by Yan Wang, Xin Gui Fang, and D. Frank Hsu.
- 2002-31
(abstract):
Tournaments that omit $N_5$ are well-quasi-ordered
by Brenda J. Latka.
- 2002-32
(abstract):
Error exponents of expander codes under linear-complexity decoding
by Alexander Barg and Gilles Zémor.
- 2002-33
(abstract):
On Convex Polytopes in the Plane "Containing" and "Avoiding" Zero
by R. Collado, A. Kelmans and D. Krasner.
- 2002-34
(abstract):
Stable Matchings in Three-Sided Systems with Cyclic Preferences
by Endre Boros, Vladimir Gurvich, Steven Jaslar and Daniel Krasner.
- 2002-35
(abstract):
Estimating Dominance Norms of Multiple Data Streams
by Graham Cormode and S. Muthukrishnan.
- 2002-36
(abstract):
A class of i.p.p. codes with efficient identification
by Alexander Barg and Gregory Kabatiansky
- 2002-37
(abstract):
Reconstructing Sets From Interpoint Distances
by Paul Lemke, Steven S. Skiena and Warren D. Smith
- 2002-38
(abstract):
Boundary classes of graphs for the dominating set problem
by V.E. Alekseev, D.V. Korobitsyn and V.V. Lozin.
- 2002-39
(abstract):
Report on DIMACS Working Group Meeting: Mathematical Sciences Methods for the Study of Deliberate Releases of Biological Agents and their Consequences
by Carlos Castillo-Chavez and Fred S. Roberts.
- 2002-40
(abstract):
Challenges for Discrete Mathematics and Theoretical Computer Science in the Defense Against Bioterrorism
by Fred S. Roberts.
- 2002-41
(abstract):
Deferred Assignment Scheduling in Clustered Web Servers
by Victoria Ungureanu, Phillip G. Bradford, Michael Katehakis and Benjamin Melamed.
- 2002-42
(abstract):
Using reasoning about dynamic domains and inductive reasoning for automatic processing of claims
by Boris Galitsky and Dmitry Vinogradov.
- 2002-43
(abstract):
Unique domination and domination perfect graphs
by I. E. Zverovich.
- 2002-44
(abstract):
Bisplit Graphs
by Andreas Brandstadt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin.
- 2002-45
(abstract):
Serial and tree-serial dynamic programming with application to fact identification
by Vadim Mottl and Ilya Muchnik.
- 2002-46
(abstract):
The PAK Suite: Protocols for Password-Authenticated Key Exchange
by Philip MacKenzie.
- 2002-47
(abstract):
Ratio of generalized parameters
by I. E. Zverovich and I. I. Zverovich.
- 2002-48
(abstract):
Consensus List Colorings of Graphs and Physical Mapping of DNA
by N. V. R. Mahadev and Fred S. Roberts.
- 2002-49
(abstract):
Comprehensive vs. Comprehensible Classifiers in Logical Analysis of Data
by Gabriela Alexe, Sorin Alexe, Peter L. Hammer, and Alexander Kogan.
- 2002-50
(abstract):
Spanned Patterns for the Logical Analysis of Data
by Gabriela Alexe and Peter L. Hammer.
- 2002-51
(abstract):
Hydrodynamics of Binary Fluid Phase Segregation
by Sorin Bastea, Raffaele Esposito, Joel L. Lebowitz, and Rossana Marra.
- 2002-52
(abstract):
Consensus algorithms for the generation of all maximal bicliques
by Gabriela Alexe, Sorin Alexe, Yves Crama, Stephan Foldes, Peter L. Hammer and Bruno Simeone.
- 2002-53
(abstract):
A Note on Linear Discrepancy and Bandwidth
by Dieter Rautenbach.
- 2002-54
(abstract):
On the band-, tree- and clique-width of graphs with bounded vertex degree
by Vadim Lozin and Dieter Rautenbach.
- 2002-55
(abstract):
Local vs. joint measurements for the entanglement of assistance
by T. Laustsen, F. Verstraete, and S. J. van Enk.
- 2002-56
(abstract):
On Generating Three-connected Planar Graphs
by Tongyin Liu and Yanpei Liu.
- 2002-57
(abstract):
Lower bounds for the size of binary space partition of rectangles
by Ying Liu.
- 2002-58
(abstract):
Methods of data fusion in information retrieval: rank vs. score combination
by D. Frank Hsu, Jacob Shapiro and Isak Taksa.
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 22, 2002.