Institute for Mathematical Sciences                                        Programs & Activities

 

   
 

Online registration form
   

 

Enquiries

      General

      Scientific aspects


   

Semidefinite and Matrix Methods for Optimization and Communication
(18 January - 28 February 2016)



Organizing Committee · Visitors and Participants · Overview · Activities · Venue

 

Visitors and Participants

NAME & AFFILIATION

PERIOD OF VISIT

TENTATIVE TITLE OF TALK

OVERSEAS VISITORS

   

Albert Atserias
Universitat Politécnica de Catalunya, Spain
atserias(AT)cs.upc.edu

31 Jan - 5 Feb 2016

A short overview of algebraic and semialgebraic proof complexity

Alexander Belovs
University of Latvia, Latvia
stiboh(AT)gmail.com

17 Jan - 21 Feb 2016

Separations in query complexity using pointer functions

Ilario Bonacina
KTH Royal Institute of Technology, Sweden
ilario(AT)kth.se

31 Jan - 6 Feb 2016

Fernando Brandao
Microsoft Research, USA
fgslbrandao(AT)gmail.com

16 - 19 Feb 2016

Fast algorithms for optimising over unentangled states: SDP hierarchies vs eps-nets

Joshua Brody
Swarthmore College, USA
brody(AT)cs.swarthmore.edu

17 - 23 Jan 2016

Dependent random graphs and multiparty pointer jumping

(PDF)

Arkadev Chattopadhyay
Tata Institute of Fundamental Research, India
arkadev.c(AT)tifr.res.in

17 - 23 Jan 2016

Ronald de Wolf
Centrum Wiskunde & Informatica, The Netherlands
rdewolf(AT)cwi.nl

14 - 27 Jan 2016

Anna Gal
The University of Texas at Austin, USA
panni(AT)cs.utexas.edu

17 - 24 Jan 2016

Dmitry Gavinsky
The Czech Academy of Sciences, Prague, Czech Republic
dmitry.gavinsky(AT)gmail.com

18 Jan - 19 Feb 2016

On quantum vs. classical communication complexity

(PDF)

Sevag Gharibian
Virginia Commonwealth University, USA
sgharibian(AT)vcu.edu

13 - 20 Feb 2016

Classical approximation algorithms for quantum constraint satisfaction problems

(PDF)

Prahladh Harsha
Tata Institute of Fundamental Research, India
prahladh(AT)tifr.res.in

15 - 21 Feb 2015

Towards the sliding scale conjecture: old and new PCP constructions

(PDF)

Sangxia Huang
École Polytechnique Fédérale de Lausanne, Switzerland
huang.sangxia(AT)gmail.com

29 Jan - 21 Feb 2016

Factor-11/8 NP-inapproximability for 2-variable linear equations

(PDF)

T.S. Jayram
IBM Almaden Research Center, USA
jayram(AT)us.ibm.com

18 - 25 Jan 2016

A composition theorem for conical juntas with applications to query and communication complexity

Iordanis Kerenidis
Université Paris Diderot, France
jkeren(AT)liafa.univ-paris-diderot.fr

18 - 22 Jan 2016

Relative discrepancy does not separate information and communication complexity

(PDF)

Robin Kothari
Massachusetts Institute of Technology, USA
robin.kothari(AT)gmail.com

17 Jan - 6 Feb 2016

Nearly optimal separations between communication (or query) complexity and partitions

(PDF)

Massimo Lauria
Universitat Politécnica de Catalunya, Spain
lauria(AT)cs.upc.edu

31 Jan - 6 Feb 2016

Tight size-degree bounds for sums-of-squares proofs

(PDF)

James R. Lee
University of Washington, USA
jrl(AT)cs.washington.edu

1 - 7 Feb 2016

Lower bounds on the size of semidefinite programming relaxations

Shachar Lovett
University of California, San Diego, USA
slovett(AT)cs.ucsd.edu

17 - 28 Jan 2016

The log-rank conjecture: recent progress and future directions

Konstantin Makarychev
Microsoft Research, USA
komakary(AT)microsoft.com

14 - 21 Feb 2016

Beyond worst case analysis of graph partitioning algorithms

(PDF)

Yury Makarychev
Toyota Technological Institute at Chicago, USA
yury(AT)ttic.edu

14 - 21 Feb 2016

Nonuniform graph partitioning with unrelated weights

Jakob Nordström
KTH Royal Institute of Technology, Sweden
jakobn(AT)kth.se

2 - 7 Feb 2016

A generalized method for proving polynomial calculus degree lower bounds

(PDF)

Ryan O'Donnell
Carnegie Mellon University, USA
odonnell(AT)cs.cmu.edu

14 - 18 Feb 2016

Random words, longest increasing subsequences, and quantum PCA


Hypercontractivity and sum of squares

(PDF)

James Saunderson
University of Washington, USA
jamesfs(AT)uw.edu

31 Jan - 4 Feb 2016

Lieb's concavity theorem, matrix geometric means, and semidefinite optimization

(PDF)

Markus Schweighofer
University of Konstanz, Germany
markus.schweighofer(AT)uni-konstanz.de

31 Jan - 6 Feb 2016

New results on the exactness of Lasserre relaxations for compact basic closed semialgebraic sets

(PDF)

Rekha Thomas
University of Washington, USA
rrthomas(AT)uw.edu

31 Jan - 6 Feb 2016

PSD-minimal polytopes

Nisheeth Vishnoi
École Polytechnique Fédérale de Lausanne, Switzerland
nisheeth.vishnoi(AT)epfl.ch

15 - 19 Feb 2016

Public Lecture:

Evolution and Computation

Stephan Weis
Universidade Estadual de Campinas (Unicamp), Brazil
maths(AT)stephan-weis.info

1 - 21 Feb 2016

A classification of the joint numerical range of three hermitian 3-by-3 matrices

(PDF)

Penghui Yao
University of Waterloo, Canada
phyao1985(AT)gmail.com

16 Jan - 6 Feb 2016

Parity decision tree complexity and 4-party communication complexity of XOR- functions are polynomially equivalent

(PDF)

Shengyu Zhang
Chinese University of Hong Kong, Hong Kong
syzhang(AT)cse.cuhk.edu.hk

18 - 22 Jan 2016

Log-rank conjecture for some special classes of functions

(PDF)

LOCAL VISITORS

   

Rahul Jain
National University of Singapore
rahul(AT)comp.nus.edu.sg

18 Jan - 28 Feb 2016

Hartmut Klauck
Nanyang Technological University and National University of Singapore
cqthk(AT)nus.edu.sg

18 Jan - 28 Feb 2016

Alexander Kreuzer
National University of Singapore
matkaps(AT)nus.edu.sg

Troy Lee
Nanyang Technological University and National University of Singapore
troylee(AT)ntu.edu.sg

18 Jan - 28 Feb 2016

Approximate sum-of-squares degree

Anupam Prakash
Nanyang Technological University
aprakash(AT)ntu.edu.sg

18 Jan - 28 Feb 2016

Symmetrizing sum of squares polynomials on the hypercube

(PDF)

Maharshi Ray
National University of Singapore
maharshi.ray(AT)u.nus.edu

18 Jan - 28 Feb 2016

Miklos Santha
Université Paris Diderot - Paris 7, France and National University of Singapore
cqtms(AT)nus.edu.sg

18 Jan - 28 Feb 2016

Jamie Sikora
National University of Singapore
jamiesikora(AT)gmail.com

10 - 28 Feb 2016

Islam Tanvirul
National University of Singapore
tanvirul(AT)u.nus.edu.sg

Felix Utama
Pioneer Junior College
felixutamasuper(AT)gmail.com

15 - 19 Feb 2016

Antonios Varvitsiotis
National University of Singapore
avarvits(AT)gmail.com

18 Jan - 28 Feb 2016

Completely positive semidefinite rank

Zhaohui Wei
National University of Singapore
weizhaohui(AT)gmail.com

18 Jan - 28 Feb 2016

On the minimum dimension of a Hilbert space needed to generate a quantum correlation

(PDF)

GRADUATE STUDENTS

   

Anurag Anshu
National University of Singapore
a0109169(AT)u.nus.edu

18 Jan - 28 Feb 2016

Mohammad Bavarian
Massachusetts Institute of Technology, USA
bavarian(AT)mit.edu

18 - 28 Jan 2016

Shalev Ben-David
Massachusetts Institute of Technology, USA
shalev(AT)mit.edu

18 - 23 Jan 2016

Separations in query complexity using cheat sheets

(PDF)

Ankit Garg
Princeton University, USA
garg(AT)cs.princeton.edu

18 - 23 Jan 2016

Quantum information and the the round complexity of disjointness

Mika Goos
University of Toronto, Canada
mika.goos(AT)mail.utoronto.ca

17 - 23 Jan 2016

Extended formulations and circuit complexity

Sebastian Gruler
University of Konstanz, Germany
sebastian.gruler(AT)uni-konstanz.de

31 Jan - 6 Feb 2016

A lower degree bound for the real Nullstellensatz and pseudo-densities with minimal norm

(PDF)

Pravesh Kothari
The University of Texas at Austin, USA
kotpravesh(AT)gmail.com

14 - 20 Feb 2016

Almost optimal sum of squares lower bounds for planted clique

(PDF)

Shay Moran
Technion - Israel Institute of Technology, Israel
shaymoran1(AT)gmail.com

17 - 23 Jan 2016

Sign-rank, machine learning, and communication complexity

(PDF)

Priyanka Mukhopadhyay
National University of Singapore
mukhopadhyay.priyanka(AT)gmail.com

18 Jan - 28 Feb 2016

Anand Natarajan
Massachusetts Institute of Technology, USA
anandn(AT)mit.edu

12 - 22 Feb 2016

Limitations of monogamy, Tsirelson-type bounds, and other semidefinite programs in quantum information

(PDF)

Supartha Podder
Centre for Quantum Technologies
supartha(AT)gmail.com

18 Jan - 28 Feb 2016

Aurko Roy
Georgia Institute of Technology, USA
aurko(AT)gatech.edu

1 - 7 Feb 2016

Strong reductions for extended formulations

(PDF)

Swagato Sanyal
Tata Institute of Fundamental Research, India
sanyalswagato(AT)gmail.com

23 Jan - 14 Feb 2016

Rakesh Venkat
Tata Institute of Fundamental Research, India
rakesh09(AT)gmail.com

7 - 20 Feb 2016

Rounding the sparsest cut SDP on low threshold-rank graphs

(PDF)

John Wright
Carnegie Mellon University, USA
jswright(AT)cs.cmu.edu

14 - 21 Feb 2016

Henry Yuen
Massachusetts Institute of Technology, USA
hyuen(AT)mit.edu

18 Jan - 6 Feb 2016

REGISTERED LOCAL PARTICIPANTS

   

Tony Quek
Singapore University of Technology and Design
tonyquek(AT)sutd.edu.sg

18 Jan - 28 Feb 2016

 

 

Organizing Committee · Visitors and Participants · Overview · Activities · Venue

top
Best viewed with IE 7 and above