DIMACS-RUTCOR Workshop on Boolean and Pseudo-Boolean Functions in Memory of Peter L. Hammer

January 19 - 22, 2009
University Inn and Conference Center
New Brunswick Campus, Rutgers University

Organizers:

Endre Boros, Director of RUTCOR, Endre.Boros at rutcor.rutgers.edu

slides:

• Gabriela Alexe
  Robust diagnosis of DLBCL from gene expression data from different laboratories

• Martin Anthony, London School of Economics and Political Science
  Threshold Decision Lists

• Tiberius Bonates, Princeton Consultants, Inc.
  Large Margin LAD Models and LAD-based Regression

• Endre Boros, Rutgers University
  Logical Analysis of Data: Classification with Justification

• Shuki Bruck, California Institute of Technology
  Molecular Computing and Probabilistic Circuits

• Ondrej Cepek, Charles University, Prague
  Exclusive and Essential Sets of Implicates of a Boolean Function

• Ferdinando Cicalese, University of Salerno, and Martin Milanic, Universitat Bielefeld
  Competitive Evaluation of Threshold Functions and Game Trees in the Priced Information Model

• Yves Crama, University of Liege
  Models of Voting Power in Corporate Networks

• John Franco, University of Cincinnati
  Adding Unsafe Constraints to Improve SAT Solver Performance

• Noam Goldberg, RUTCOR
  Improved Branch and Bound Methods for Maximum Monomial Agreement

• Vladimir Gurvich, Rutgers University
  Nash-solvability and Boolean duality

• Lisa Hellerstein, Polytechnic Institute
  Correlation Immune Functions and Learning

• Toshihide Ibaraki, Kwansei Gakuin University
  Participating in Timetabling Competition ITC2007 with a General Prupose CSP Solver

• Jeff Jackson, Duquesne University
  Fourier Analysis and Boolean Function Learning

• Alex Kogan, Rutgers University
  Reverse-engineering Country Risk Ratings: A Combinatorial Non-Recursive Model

• David Kronus, Charles University
  Recognition of Positive k-interval Functions

• Petr Kucera, Charles University, Prague
  Coverable Boolean Functions

• Miguel Lejeune, George Washington University
  Combinatorial Patterns for Probabilistically Constrained Optimization Problems

• Michael Lipkowitz, Mt. Sinai School of Medicine, and Mine Subasi, Rutgers University
  Logical Analysis of Data (LAD) applied to mass spectrometry data to Predict Rate of Decline of kidney function

• Michael Saks, Rutgers University
  Boolean Decision Trees: Problems and Results, Old and New

• Rocco Servedio, Columbia University
  Learning, Testing and Approximating Halfspaces

• Robert Sloan, University of Illinois at Chicago
  The Largest Number of Prime Implicants of k-term DNF and Cube Partitions

• Gyorgy Turan, University of Illinois at Chicago
  On Approximate Horn Minimization

• Tiziano Villa, University of Verona, Italy
  Multi-level Logic with Constant Depth: Recent Research from Italy

• Bela Vizvari, Eastern Mediterranean University
  On the Chvatal-Complexity of Binary Knapsack Problems

• Stanislav Zivny, Oxford University Computing Laboratory
  The Expressive Power of Binary Submodular Functions

Colloquium Celebrating Peter L. Hammer and 25 Years of RUTCOR

• Yves Crama, University of Liège Belgium
  RUTCOR 1983-1987 Those were the days...

• Martin Charles Golumbic, University of Haifa
  The Contributions of Peter L. Hammer to Algorithmic Graph Theory

• John Hooker, Carnegie Mellon University
  Some Observations on Boolean Logic and Optimization

• Fred Roberts, Rutgers University
  Boolean Functions I've Known and Not Known: Memories of Peter L. Hammer

Workshop Index

DIMACS Homepage