LZI - Schloss Dagstuhl - Talks + Materials of Seminar 13082
 Functions: 

Seminar 13082
Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices

LeRoy B. Beasley (Utah State University, US), Hartmut Klauck (Nanyang TU - Singapore, SG), Troy Lee (National University of Singapore, SG), Dirk Oliver Theis (Universität Magdeburg, DE)

Caveat: Due to caching problems of dynamic webpages, sometimes newly
uploaded files are not shown. Please reload the page accordingly.

 

Seminar Wide Materials
 
 Open Problem Session
Slides: pdf

 


LeRoy B. Beasley , Utah State University
 k-primitivity
Abstracts: pdf

 

Hamza Fawzi , MIT - Cambridge
 New lower bounds on nonnegative rank using conic programming
Abstracts: txt Slides: pdf Paper: pdf

 

Samuel Fiorini , University of Brussels
 Approximation Limits of Linear Programs (Beyond Hierarchies)
Abstracts: txtpdf Slides: pdf

 

Anna Gal , University of Texas - Austin
 Hadamard tensors and lower bounds on multiparty communication complexity
Abstracts: txt

 

Nicolas Gillis , UC Louvain-la-Neuve
 Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
Abstracts: txt Slides: pdf Paper: pdf

 

Francois Glineur , UC Louvain
 Second-order cone representations of positive semidefinite cones
Abstracts: txt

 A geometric lower bound for the nonnegative rank
Abstracts: txt Slides: pdf Paper: pdf

 

Joao Gouveia , University of Coimbra
 

Alexander Guterman , Moscow State University
 Matrix ranks over semirings
Abstracts: txt

 

Volker Kaibel , Universität Magdeburg
 

Stephen Kirkland , NUI Maynooth
 

Hartmut Klauck , Nanyang TU - Singapore
 An introduction to lower bound methods in communication complexity
Slides: pptx

 

Raghav Kulkarni , National University of Singapore
 

Thomas Laffey , University College Dublin
 

Troy Lee , National University of Singapore
 

Lek-Heng Lim , University of Chicago
 

Nathan Linial , The Hebrew University of Jerusalem
 

Pablo A. Parrilo , MIT - Cambridge
 

Kanstantsin Pashkovich , University of Padova
 Constructing Extended Formulations for Stable Set Polytopes via Decomposition Rules
Abstracts: txt

 

Sebastian Pokutta , Universität Erlangen-Nürnberg
 On lower bounds for extended formulations
Abstracts: txt

 on lower bounds for extended formulations
Abstracts: txt Slides: pdf

 

Richard Robinson , University of Washington - Seattle
 Polytopes of Minimum Positive Semidefinite Rank
Abstracts: txt Paper: pdf

 Which nonnegative matrices are slack matrices?
Abstracts: txt Paper: pdf

 

Yaroslav Shitov , NRU Higher School of Economics - Moscow
 Matrix factorizations over semirings
Abstracts: txt

 

Adi Shraibman , Academic College of Tel Aviv Yafo
 

Dirk Oliver Theis , University of Tartu
 Basics on Combinatorial Optimization
Slides: pdf

 

Rekha R. Thomas , University of Washington - Seattle
 

Hans Raj Tiwary , University of Brussels
 On the extension complexity of combinatorial polytopes
Abstracts: txt

 

Stefan Weltge , Universität Magdeburg
 



License

Creative Commons License
This webpage and the material that is made available on this webpage is licensed under a
Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 Unported License.

The CC by-nc-nd license allows you to copy, distribute and transmit the work under the following conditions: