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

Workshop Program:

 

Monday, January 19, 2009	 	 

  8:45 -  9:00  Opening Remarks	
                Endre Boros, Rutgers University
                Fred S. Roberts, Rutgers University
                
Gyuri Turan - Chair 
 	 	 
  9:00 -  9:45  Molecular Computing and Probabilistic Circuits
                Shuki Bruck, California Institute of Technology	

  9:45 - 10:30  Multi-level Logic with Constant Depth: Recent Research from Italy
                Tiziano Villa, University of Verona, Italy
	
 10:30 - 11:00  Break	 
	 	 
 11:00 - 11:30	Competitive Evaluation of Threshold Functions and Game Trees in the Priced Information Model
                Ferdinando Cicalese, University of Salerno, Italy
	
 11:30 - 12:00  (continuation of Competitive Evaluation of Threshold Functions)
                Martin Milanic, Universitat Bielefeld, Germany
 
 12:00 -  2:00  Lunch

Martin Anthony - Chair:	 

  2:00 -  2:30  Nondisjoint Decomposition of Monotone Boolean Functions
                Cor Bioch, Erasmus University Rotterdam
	
  2:30 -  3:00  Models of Voting Power in Corporate Networks
                Yves Crama, University of Liege
	
  3:00 -  3:30  Nash-solvability and Boolean duality
                Vladimir Gurvich, Rutgers University 
	
  3:30 -  4:00 	Break	 

  4:00 -  4:30	Large-Scale Optimization Strategies for Optimal Cancer Treatment Design
                Eva K. Lee, Georgia Institute of Technology 

  4:30 -  5:00  Reverse-engineering Country Risk Ratings: A Combinatorial Non-Recursive Model
                Alex Kogan, Rutgers University

  5:00 -  5:30  Large Margin LAD Models and LAD-based Regression
                Tiberius Bonates, Princeton Consultants, Inc.

  6:00 -  7:00	Reception
 
Tuesday, January 20, 2009

Yves Crama - Chair:	 	 

  9:00 -  9:45  Boolean Decision Trees: Problems and Results, Old and New
                Michael Saks, Rutgers University
	
  9:45 - 10:30  Adding Unsafe Constraints to Improve SAT Solver Performance
                John Franco, University of Cincinnati	
 
 10:30 - 11:00  Break	 
	 	 
 11:00 - 11:30	Exclusive and Essential Sets of Implicates of a Boolean Function
                Ondrej Cepek, Charles University, Prague
	
 11:30 - 12:00	Coverable Boolean Functions
                Petr Kucera, Charles University, Prague

 12:00 -  2:00  Lunch	 

Shuki Bruck - Chair:

  2:00 -  2:30	Threshold Decision Lists
                Martin Anthony, London School of Economics and Political Science

  2:30 -  3:00	The Largest Number of Prime Implicants of k-term DNF and Cube Partitions
                Robert Sloan, University of Illinois at Chicago	

  3:00 -  3:30	On Approximate Horn Minimization
                Gyorgy Turan, University of Illinois at Chicago	
 
  3:30 -  4:00  Break	 
	 	 
  4:00 -  4:30	TBA, Gabriela Alexe

  4:30 -  5:00  Improved Branch and Bound Methods for Maximum Monomial Agreement
                Noam Goldberg, RUTCOR	

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

Wednesday, January 21, 2009	 	 

Toshi Ibaraki - Chair:
 
  9:00 -  9:45  Correlation Immune Functions and Learning
                Lisa Hellerstein, Polytechnic University

  9:45 - 10:30	Fourier Analysis and Boolean Function Learning
                Jeff Jackson, Duquesne University 

 10:30 - 11:00  Break	 
	 	 	 
 11:00 - 11:30	Recognition of Positive k-interval Functions
                David Kronus, Charles University

 11:30 - 12:00  Structures of Renamable Horn and q-Horn Formulae
                Richard Sun, Lucent Technologies

 12:00 -  2:00  Lunch	 

Lisa Hellerstein - Chair:	 
 	 	 
  2:00 -  2:45  Combinatorial Patterns for Probabilistically Constrained Optimization Problems
                Miguel Lejeune, George Washington University

  2:45 -  3:30	On Various Relaxations Based on Reformulation-Linearization for 0-1 MIPs and 
                their Specialization to Pseudo-Boolean Optimization
                Michel Minoux, University of Paris

  3:30 -  4:00  Break	 

  4:00 -  4:30  What Can and What Has To Be Learned From Data
                Endre Boros, Rutgers University	

  4:30 -  5:00  On the Chvatal-Complexity of Binary Knapsack Problems
                Bela Vizvari, Eastern Mediterranean University

  5:00 -  5:30  Construction of a Maximum Stable Set with k-Extensions
                Igor Zverovich, Rutgers University
 
 Thursday, January 22, 2009

Michel Minoux - Chair:	 	 
 
  9:00 -  9:45  Participating in Timetabling Competition ITC2007 with a General Prupose CSP Solver
                Toshihide Ibaraki, Kwansei Gakuin University 

  9:45 - 10:30	Learning, Testing and Approximating Halfspaces
                Rocco Servedio, Columbia University 
 
 10:30 - 11:00	Break	

 11:00 - 11:30  The Impact of Pseudo-Boolean Optimization on Computer Vision and Graphics
                Ramin Zabih, Columbia University

 11:30 - 12:00	The Expressive Power of Binary Submodular Functions
                Stanislav Zivny, Oxford University Computing Laboratory 
 	 	 
 12:00 -  1:30  Lunch 

Previous: Participation

Workshop Index

DIMACS Homepage