Seminars

• Spring 2011
• Fall 2010

Research Reports

• 2014 Research Report
• 2013 Research Report
• 2012 Research Report
• 2011 Research Report
• 2010 Research Report
• 2009 Research Report
• 2008 Research Report
• 2007 Research Report
• 2006 Research Report
• 2005 Research Report
• 2004 Research Report
• 2003 Research Report
• 2002 Research Report
• 2001 Research Report
• 2000 Research Report
• 1999 Research Report
• 1998 Research Report
• 1997 Research Report
• 1996 Research Report
• 1995 Research Report
• 1994 Research Report
• 1993 Research Report
• Report Submission

 

1996 RUTCOR Research Reports

---

• ABSTRACTS

• 1-96 The change of variables formula using matrix volume, Adi Ben-Israel
• 2-96 Efficiency in Auctions When Bidders Have Private Information About Competitors, Ronald M. Harstad, Michael H. Rothkopf, and Keith Waehrer
• 3-96 Distance-Based Classification Methods, Oya Ekin, Peter L. Hammer, Alexander Kogan, and Pawel Winter
• 4-96 Evaluation, Strength and Relevance of Variables of Boolean Functions, Peter L. Hammer, Alexander Kogan and Uriel G. Rothblum
• 5-96 Thresholds for Ordering Libraries of Variable Length Clones Reuben Settergren, Farid Alizadeh, and Hui Chen
• 6-96 Extensions of Partially Defined Boolean Functions with Missing Data, Endre Boros, Toshihide Ibaraki, and Kazuhisa Makino
• 7-96 Boolean Analysis of Incomplete Examples, Endre Boros, Toshihide Ibaraki, and Kazuhisa Makino
• 8-96 Optimal orthogonal drawings of triconnected plane graphs, Therese C. Biedl
• 9-96 Duality and Equilibrium Prices in Economics of Uncertainty, Adi Ben-Israel and Aharon Ben-Tal
• 10-96 Programming Under Probabilistic Constraint with Discrete Random, Andras Prekopa, Bela Vizvari and Tamas Badics
• 11-96 Optimal orthogonal drawings of connected plane graphs, Therese C. Biedl
• 12-96 Approximate Iterations in Bregman-Function-Based Proximal Algorithms, Jonathan Eckstein
• 13-96 Quality Evaluation of Random Numbers Generated by Chaotic Circuits for Secure Communication, Bela Vizvari and Geza Kolumban
• 14-96 Minimum Self-Dual Decompositions of Positive Dual-Minor Boolean Functions, Jan C. Bioch, Toshihide Ibaraki, and Kazuhisa Makino
• 15-96 Improved orthogonal drawings of 3-graphs, Therese C. Biedl
• 16-96 Benders Decomposition for Cone Programming, Bela Vizvari
• 17-96 Expected Delay Analysis of Polling Systems in Heavy Traffic, Rob van der Mei and Hanoch Levy
• 18-96 A Circular Graph - Counterexample to the Duchet Kernel Conjecture, A. Apartsin, E. Ferapontova, and V. Gurvich
• 19-96 Linear--Time Recognition of the P_4--Structure of Trees, Andreas Brandst\"adt, Van Bang Le, and Stephan Olariu
• 20-96 Size and Variable Ordering of Ordered Binary Decision Diagrams Representing Threshold Functions, Yasuhiko Takenaga, Mitsushi Nouzoe, and Shuzo Yajima
• 21-96 Independent Spanning Trees with Small Stretch Factors, Fred Annexstein, Ken Berman, and Ram Swaminathan
• 22-96 An Implementation of Logical Analysis of Data, Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz and Ilya Muchnik
• 23-96 Accuracy of Techniques for the Logical Analysis of Data, Martin Anthony
• 24-96 Role Primitive Indifference Graphs and Role Assignments on w-fan Graphs, Fred S. Roberts and Li Sheng
• 25-96 A Combinatorial Optimization Tour in Cell Formation via Hypergraphs, Levent Kandiller
• 26-96 Dual Graphs on Surfaces, Vladimir Gurvich
• 27-96 Smooth Methods of Multipliers for Complementarity Problems,
  (revised February 1998)
  Jonathan Eckstein and Michael C. Ferris
• 28-96 Analysis of a Control Mechanism for a Variable Speed Processor, Arif Merchant, Benjamin Melamed, Eugen Schenfeld and Bhaskar Sengupta
• 29-96 How do the Newton and Halley Methods work for Complex Roots?, Lily Yau and Adi Ben-Israel. Get TITLE PAGE here.
• 30-96 A corrected version of the Duchet Kernel Conjecture, E. Boros and V. Gurvich
• 31-96 Chaotic Dynamics of Agricultural Markets: the Case Study of the Hungarian Potato Market, Bela Vizvari, Zsuzsa Bacsi and Geza Kolumban
• 32-96 Solution of a Product Substitution Problem Using Stochastic Programming, Michael R. Murr and Andras Prekopa
• 33-96 Role Assignments, Fred S. Roberts and Li Sheng
• 34-96 Testing the Feasibility of Semidefinite Programs, Lorant Porkolab and Leonid Khachiyan
• 35-96 Phylogeny Numbers, Fred S. Roberts and Li Sheng
• 36-96 On Connected Boolean Functions, Oya Ekin, Peter L. Hammer, and Alexander Kogan
• 37-96 Drawing high-degree graphs with small grid-size, Therese C. Biedl, Brendan P. Madden, and Ioannis G. Tollis
• 38-96 Is subsidizing inefficient bidders actually costly? Michael H. Rothkopf, Ronald M. Harstad, and Yuhong Fu. Available in Printed Form only
• 39-96 An Algorithmic Approach to Multiple Complete Digest Mapping, Dan Fasulo, Tao Jiang, Richard M. Karp, Reuben Settergren, and Edward C. Thayer
• 40-96 On two-terminal reliability functions of random graphs Alexander K. Kelmans Available in printed form only! Send inquiries to Dr. Kelmans for a copy.
• 41-96 On all-terminal reliability functions of random graphs Alexander K. Kelmans Available in printed form only! Send inquiries to Dr. Kelmans for a copy.
• 42-96 1-free drawings and the face-constrained planarization problem, Therese C. Biedl
• 43-96 On a Duality Theorem on Packing Induced Stars in a Graph, Alexander K. Kelmans