DIMACS Technical Reports Published in 1994

Obtaining Reports

Problems with Technical Reports?

• 94-01 (abstract) Inverse Theorems for Subset Sums Melvyn B. Nathanson
• 94-02 (abstract) Ballot Numbers, Alternating Products and the Erdos-Heilbronn Conjecture Melvyn B. Nathanson
• 94-03 (abstract) Independence of Solution Sets and Minimal Asymptotic Bases Paul Erdos, Melvyn B. Nathanson and Prasad Tetali
• 94-04 (abstract) A Local Rule Based Theory of Virus Shell Assembly Bonnie Berger, Peter Shor
• 94-05 (abstract) Self-Affine Tiles in R Jeffrey Lagarias, Yang Wang
• 94-06 (abstract) Tournament Certificates Peter Fishburn, Jeong Han Kim, Prasad Tetali
• 94-07 (abstract) On the Complexity of Horn Minimization Endre Boros, Ondrej Cepek
• 94-08 (abstract) Computing over the Reals with Addition and Order: Higher Complexity Classes Felipe Cucker, Pascal Koiran
• 94-09 (abstract) Decomposition of Partially Defined Boolean Functions Endre Boros, Vladimir Gurvich, Peter Hammer, Toshihide Ibaraki Alexander Kogan
• 94-10 (abstract) A Weak Version of the Blum, Shub and Smale Model Pascal Koiran
• 94-11 (abstract) A Pseudo-algorithmic separation of lines William Steiger, Ileana Streinu
• 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 Eric Allender, Martin Strauss
• 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 Michael Grigoriadis, Leonid Khachiyan
• 94-17 (abstract) Normal Numbers and Sources for BPP Martin Strauss
• 94-18 (abstract) Measure on Small Complexity Classes, with Applications for BPP Eric Allender, Martin Strauss
• 94-19 (abstract) Coordination Complexity of Parallel Price-Directive Decomposition Michael Grigoriadis, Leonid Khachiyan
• 94-20 (abstract) DIMACS Workshop on Parallel Processing of Discrete Optimization Problems; April 28-29, 1994 P. Pardalos, M.G.C. Resende, K.G. Ramakrishnan
• 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) Larry Shafer, William Steiger
• 94-23 (abstract) Rook Placements and Cellular Decomposition of Partition Varieties Kequan Ding
• 94-24 (abstract) Rook Placements and Partition Varieties P\M Kequan Ding
• 94-25 (abstract) On Garsia-Remmel Problem of Rook Equivalence Kequan Ding, Paul Terwilliger
• 94-26 (abstract) Classification of Partition Varieties (not available) Kequan Ding
• 94-27 (abstract) The Parallel Implementation of N-body Algorithms Pangfeng Liu
• 94-28 (Cover pages and abstract.) Noncommutative Symmetric Functions Israel Gelfand, Daniel Krob, Alain Lascoux, Bernard Leclerc, Vladimir Retakh, Jean-Yves Thibon
• 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 Peter Gritzmann and Victor Klee
• 94-32 (abstract) Perfect Graphs are Kernel Solvable Endre Boros and Vladimir Gurvich
• 94-33 (abstract) Optimal Space Distributed Order-Preserving Lists Michael Saks and Fotis Zaharoglou.
• 94-34 (abstract) Upper and Lower Bounds for Selection on the Mesh Anne Condon and Lata Narayanan
• 94-35 (abstract) A spectral technique for coloring random $3$-colorable graphs Noga Alon and Nabil Kahale
• 94-36 (abstract) A Comprehensive Manual for NETPAD Users with Exercises on Discrete Mathematics Yanxi Liu
• 94-37 (abstract) Algorithms for Quantum Computation: Discrete Log and Factoring Peter W. Shor
• 94-38 (abstract) Distributed Scheduling Algorithms to Improve the Performance of Parallel Data Transfers Dannie Durand, Ravi Jain, David Tseytlin
• 94-39 (abstract) Large Deviation Bounds for Markov Chains Nabil Kahale
• 94-40 (abstract) Dominating Sets in Planar Graphs Lesley R. Matheson, Robert E. Tarjan
• 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 Peter L. Hammer and Alexander Kogan
• 94-43 (abstract) Dense packings of equal disks in an equilateral triangle Ronald Graham, B.D. Lubachevsky
• 94-44 Conference Proceedings on Interconnection Networks;
  and List of Conference Participants
• 94-45 (abstract) Two Remarks on Self-Correctability versus Random-Self-Reducibility Joan Feigenbaum, Lance Fortnow, Ashish V. Naik
• 94-46 (abstract) Computing Medial Axis Transform in Parallel with $O(1)$ scan operations Alfonso Ferreira, Stephane Ubeda
• 94-47 (abstract) Weighted search in the plane Richa Agarwala and David Fernandez-Baca
• 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 Afonso Ferreira
• 94-50 (abstract) Restricted consensus method and quadratic implicates of pure Horn functions Ondrej Cepek
• 94-51 (abstract) Fast and Simple Algorithms for Perfect Phylogeny and Triangulating Colored Graphs Richa Agarwala and David Fernandez-Baca
• 94-52 (abstract) Constructing Piecewise Linear Homeomorphisms Diane Souvaine and Rephael Wenger
• 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 Pavel Valtr
• 94-56 (abstract) A Linear-time Algorithm for Network Decomposition Lenore J. Cowen

Return to Tech Reports Page

DIMACS Homepage