DIMACS Technical Reports Published in 1999
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.
- 99-01
(abstract):
Stable Effectivity Functions and Perfect Graphs
by Endre Boros and Vladimir Gurvich.
- 99-02
(abstract):
Scheduling to Minimize Average Stretch
by Johannes E. Gehrke, S. Muthukrishnan, Rajmohan Rajaraman
and Anthony Shaheen.
- 99-03
(abstract):
Massive Data Set Analysis in Seismic Explorations for Oil and Gas in Crystalline Basement Interval
by Ilya Muchnik, Vadim Mottl and Vladimir Levyant.
- 99-04
(abstract):
Combinatorial Design of Multi-Ring Networks with Combined
Routing and Flow Control
by Avishai Wool and Bulent Yener.
- 99-05
(abstract):
A New Upper Bound on Codes Decodable into Size-2 Lists
by A. Ashikhmin, A. Barg, and S. Litsyn.
- 99-06
(abstract):
A New Upper Bound on the
Reliability Function of the Gaussian Channel
by A. Ashikhmin, A. Barg, and S. Litsyn.
- 99-07
(abstract):
The Internet and Other Networks: Utilization Rates and
Their Implications
by Andrew Odlyzko.
- 99-08
(abstract):
The Economics of the Internet: Utility,
Utilization, Pricing, and Quality of Service
by Andrew Odlyzko.
- 99-09
(abstract):
Smart and Stupid Networks: Why the Internet Is Like Microsoft
by Andrew Odlyzko.
- 99-10
(abstract):
Data Networks are Lightly Utilized, and Will Stay That Way
by Andrew Odlyzko.
- 99-11
(abstract):
The Size and Growth Rate of the Internet
by K. G. Coffman and Andrew Odlyzko.
- 99-12
(abstract):
Dynamic Behavior of Differential Pricing and Quality of Service Options for the Internet
by Peter Fishburn and Andrew Odlyzko.
- 99-13
(abstract):
Optimal Orientations of Annular Networks
by Jean-Claude Bermond, Johny Bond, Carole Martin, Aleksandar Pekec
and Fred S. Roberts.
- 99-14
(abstract):
Symmetrization of Binary Random Variables
by Abram Kagan, Colin L. Mallows, Larry A. Shepp,
Robert J. Vanderbei and Yehuda Vardi.
- 99-15
(abstract):
Addition Chains as Test Trees and a Sequential Variant as the Huffman Problem
by Julia Abrahams.
- 99-16
(abstract):
Characterizations of Consistent Marked Graphs
by Fred S. Roberts and Shaoji Xu.
- 99-17
(abstract):
Note on Geometric Graphs
by Géza Tóth.
- 99-18
(abstract):
On Lower Bound of the Number of Channels for Deadlock-Free
Whormhole Routing
by Li Sheng and Jie Wu.
- 99-19
(abstract):
Deadlock-Free Routing in Irregular Networks Using Prefix Routing
Algorithm
by Jie Wu and Li Sheng.
- 99-20
(abstract):
Statistical Properties of Contact Maps
by Michele Vendruscolo, Balakrishna Subramanian, Ido Kanter, Eytan
Domany and Joel Lebowitz.
- 99-21
(abstract):
The Study of Three-body Interaction Hamiltonian on a Lattice
by Balakrishna Subramanian and Joel Lebowitz.
- 99-22
(abstract):
Towards a Dynamic Optimal Alphabetic Tree (revised) and
Cover Page
by Ahmed A.Belal, Mohamed S.Selim and Shymaa M.Arafat.
- 99-23
(abstract):
On Some Tighter Inapproximability Results
by Piotr Berman and Marek Karpinski.
- 99-24
(abstract):
Sequential Testing of Series-Parallel Systems of Small Depth
by Endre Boros and Tonguc Unluyurt.
- 99-25
(abstract):
An Active Network Approach to Efficient Network Management
by Danny Raz and Yuval Shavitt.
- 99-26
(abstract):
A Short Note on Linear Autarkies, q-Horn Formulas and the Complexity Index
by Hans van Maaren.
- 99-27
(abstract)(implementation):
Efficient Radio Wave Propagation for Wireless Radio
Signal Prediction
by Greg Perkins and Diane Souvaine.
- 99-28
(abstract):
On Parallel Edges in Cycles
by E. Boros and V. Gurvich.
- 99-29
(abstract):
Camel Sequences and Their Applications
by V. Gurvich and Li Sheng.
- 99-30
(abstract):
Fully Consistent Extensions of Partially Defined Boolean
Functions with Missing Bits
by Endre Boros, Toshihide Ibaraki and Kazuhisa Makino.
- 99-31
(abstract):
Recursive Generation of Partitionable Graphs
by E. Boros, V. Gurvich and S. Hougardy.
- 99-32
(abstract):
Natural Language Understanding with the Generality Feedback
by Boris Galitsky.
- 99-33
(abstract):
Millimix: Mixing in Small Batches
by Markus Jakobsson and Ari Juels.
- 99-34
(abstract):
Low Discrepancy Sets Yield Approximate Min-Wise Independent
Permutation Families
by Michael Saks, Aravind Srinivasan, Shiyu Zhou and David Zuckerman.
- 99-35
(abstract):
The Role Assignment Model Nearly Fits Most Social Networks
by Aleksandar Pekec and Fred S. Roberts.
- 99-36
(abstract):
Randomized Complexity of Linear Arrangements and Polyhedra
by Marek Karpinski.
- 99-37
(abstract):
New Bounds on Crossing Numbers
by János Pach, Joel Spencer and Géza Tóth.
- 99-38
(abstract):
Bifurcation of Internal Solitary Wave Modes from the Essential Spectrum
by P.G. Kevrekidis and C.K.R.T. Jones.
- 99-39
(abstract):
A Combinatorial Algorithm for Pfaffians
by Meena Mahajan, P. R. Subramanya and V. Vinay.
- 99-40
(abstract):
Camel Sequences and Quadratic Residues
by V. Gurvich and Li Sheng.
- 99-41
(abstract):
Transformation of Regular Non-Dominated Coteries
by Kazuhisa Makino and Tiko Kameda.
- 99-42
(abstract):
Modelling of Phase Separation in Alloys with Coherent Elastic Misfit
by Peter Fratzl, Oliver Penrose and Joel L. Lebowitz.
- 99-43
(abstract):
A Minimax Game of Power Control in a Wireless Network under Incomplete Information
by Tiina Heikkinen.
- 99-44
(abstract):
Packing Random Rectangles
by E. G. Coffman, George S. Lueker, Joel Spencer, and Peter M. Winkler.
- 99-45
(abstract):
The Adjacency Matrix and Spectrum of a Graph with Negative Third
Largest Eigenvalue
by Paul A. Dreyer, Jr. and Xuerong Yong.
- 99-46
(abstract):
Universal H-colorable Graphs Without A Given Configuration
by Paul A. Dreyer, Jr. , Christopher Malon, and Jaroslav Nesetril.
- 99-47
(abstract):
On the Maximum Number of Equilateral Triangles II
by Bernardo Ábrego and Silvia Fernández-Merchant.
- 99-48
(abstract):
Optimal Proof Systems and Sparse Sets
by Harry Buhrman, Steve Fenner, Lance Fortnow and Dieter van Melkebeek.
- 99-49
(abstract):
On the Computational Power of Analog Neural Networks
by Bhaskar DasGupta and Georg Schnitger.
- 99-50
(abstract):
Cluster-preserving Embedding of Proteins
by Gabriela Hristescu and Martin Farach-Colton.
- 99-51
(abstract):
Dynamics of Lattice Kinks
by P.G. Kevrekidis and M.I. Weinstein.
- 99-52
(abstract):
Improvements in Throughput Maximization for Real-Time Scheduling
by Piotr Berman and Bhaskar DasGupta.
- 99-53
(abstract):
Ramsey-type Results for Unions of Comparability Graphs
by Adrian Dumitrescu and Géza Tóth.
- 99-54
(abstract):
On Polynomial Invariants of Codes, Matroids and Finite Interaction Models
by Alexander Barg.
- 99-55
(abstract):
Apparent Motion in Spatial Time-varying Data:
A Variational Approach to Pointwise Tracking of Coherent Structures
in Computational Fluid Dynamics
by Vadim Mottl, Alexander Blinov, Norman Zabusky and Ilya Muchnik.
- 99-56
(abstract):
An Approach of Information Theory to Multiple Sequence
Comparison
by Weiwu Fang, Fred S. Roberts and Zhengrong Ma.
- 99-57
(abstract):
An Optimal Algorithm for Hyperplane Depth in the Plane
by Stefan Langerman and William Steiger.
- 99-58
(abstract):
Proof of a Conjecture of Bollobás and Eldridge for
Graphs with Maximum Degree 3
by Béla Csaba, Ali Shokoufandeh, Endre Szemerédi.
- 99-59
(abstract):
Note on the Work Function Algorithm
by Bela Csaba.
- 99-60
(abstract):
Hardness of Approximation of the Loading Problem for Multi-layered Feedforward Neural Nets
by Bhaskar DasGupta and Barbara Hammer.
- 99-61
(abstract):
A Geometric Model of Information Retrieval Systems
by Myung Ho Kim.
- 99-62
(abstract):
Dual-Bounded Hypergraphs: Generating Partial and Multiple Transversals
by E. Boros, V. Gurvich, L. Khachiyan and K. Makino.
- 99-63
(abstract):
On the Number of Vertices Belonging to all Maximum Stable Sets of a Graph
by E. Boros, M.C. Golumbic and V.E. Levit.
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 7, 1999.