Research.STOC13Workshop History
Hide minor edits - Show changes to output - Cancel
Changed lines 26-27 from:
'''11:30-12:15''' David Woodruff ''"Applications of information complexity II"'' [[Attach:WoodruffSlidesSTOC13.ppt|[ppt] ]] [[Attach:WoodruffSlidesSTOC13.pdf|[pdf] ]]
to:
'''11:30-12:15''' David Woodruff ''"Applications of information complexity II"''. Slides [[Attach:WoodruffSlidesSTOC13.ppt|[ppt] ]] [[Attach:WoodruffSlidesSTOC13.pdf|[pdf] ]]
Changed line 32 from:
'''2:00-2:50''' Toniann Pitassi ''"Applications of information complexity in privacy"'':
to:
'''2:00-2:50''' Toniann Pitassi ''"Applications of information complexity in privacy"''. Slides [[Attach:PitassiSlidesSTOC13.pptx|[pptx] ]] [[Attach:PitassiSlidesSTOC13.pdf|[pdf] ]]
Changed line 26 from:
'''11:30-12:15''' David Woodruff ''"Applications of information complexity II"'':
to:
'''11:30-12:15''' David Woodruff ''"Applications of information complexity II"'' [[Attach:WoodruffSlidesSTOC13.ppt|[ppt] ]] [[Attach:WoodruffSlidesSTOC13.pdf|[pdf] ]]
Changed line 4 from:
to:
held on '''Saturday, June 1, 2013''', 8:30am-3:30pm.
Changed line 3 from:
The '''Information Complexity and Appliations''' workshop is part of the [[http://theory.stanford.edu/stoc2013/program.php|STOC'13]] workshops. It will
to:
The '''Information Complexity and Appliations''' workshop was part of the [[http://theory.stanford.edu/stoc2013/program.php|STOC'13]] workshops. It was
Changed line 13 from:
!!!Tentative program with abstracts
to:
!!!Program with abstracts
Changed line 22 from:
'''10:30-11:20''' Amit Chakrabarti ''"Applications of information complexity I"'':
to:
'''10:30-11:20''' Amit Chakrabarti ''"Applications of information complexity I"''. Slides [[Attach:ChakrabartiSlidesSTOC13.pdf|[pdf] ]]
Changed line 16 from:
'''8:30-10:00''' Mark Braverman ''"Basics of information theory and information complexity"''. Slides [[Attach:BravermanSlidesSTOC13.pptx|[pptx] ]]
to:
'''8:30-10:00''' Mark Braverman ''"Basics of information theory and information complexity"''. Slides [[Attach:BravermanSlidesSTOC13.pptx|[pptx] ]] [[Attach:BravermanSlidesSTOC13.pdf|[pdf] ]]
Changed line 16 from:
'''8:30-10:00''' Mark Braverman ''"Basics of information theory and information complexity"''. Slides [[attach:BravermanSlidesSTOC13.pptx|[pptx] ]]
to:
'''8:30-10:00''' Mark Braverman ''"Basics of information theory and information complexity"''. Slides [[Attach:BravermanSlidesSTOC13.pptx|[pptx] ]]
Changed line 16 from:
'''8:30-10:00''' Mark Braverman ''"Basics of information theory and information complexity"'':
to:
'''8:30-10:00''' Mark Braverman ''"Basics of information theory and information complexity"''. Slides [[attach:BravermanSlidesSTOC13.pptx|[pptx] ]]
Changed line 30 from:
'''12:00-2:00''' ''Lunch break''
to:
'''12:15-2:00''' ''Lunch break''
Changed lines 4-5 from:
be held on '''Saturday, June 1, 2013''', 8am-3:30pm.
to:
be held on '''Saturday, June 1, 2013''', 8:30am-3:30pm.
Changed line 26 from:
'''11:30-12:00''' David Woodruff ''"Applications of information complexity II"'':
to:
'''11:30-12:15''' David Woodruff ''"Applications of information complexity II"'':
Changed line 34 from:
* TBA
to:
* I will discuss several notions of privacy (including differential privacy and privacy-approximation ratio) within the context of communication complexity, and their very close relationship with information complexity. Through this connection, we will apply information complexity methods to prove trade-offs between privacy, efficiency, and accuracy in various settings.
Changed lines 22-23 from:
'''10:30-11:20''' Amit Chakrabarti ''"Applications of information complexity I"''
to:
'''10:30-11:20''' Amit Chakrabarti ''"Applications of information complexity I"'':
Changed lines 26-27 from:
'''11:30-12:00''' David Woodruff ''"Applications of information complexity II"''
to:
'''11:30-12:00''' David Woodruff ''"Applications of information complexity II"'':
Changed line 32 from:
'''2:00-2:50''' Toniann Pitassi ''"Applications of information complexity in privacy"''
to:
'''2:00-2:50''' Toniann Pitassi ''"Applications of information complexity in privacy"'':
Changed lines 18-38 from:
* In this tutorial we will discuss information theory and its connections to communication complexity. We will start with classical results by Shannon for non-interactive communication, and will then move on to more modern connections to interactive communication. We will discuss the notions of information complexity, interactive compression, and their connections to direct sum and direct product questions in communication complexity.
to:
* In this tutorial we will discuss information theory and its connections to communication complexity. We will start with classical results by Shannon for non-interactive communication, and will then move on to more modern connections to interactive communication. We will discuss the notions of information complexity, interactive compression, and their connections to direct sum and direct product questions in communication complexity.
'''10:00-10:30''' ''Morning break''
'''10:30-11:20''' Amit Chakrabarti ''"Applications of information complexity I"''
* Information complexity was invented as a technique to prove a very specific direct sum result in communication complexity. Over the next decade, the notion of information complexity has been generalized, extended, and refined, leading to the rich theory we see today. I shall survey the key stages of this development, focusing on concrete lower bound questions that spurred it: both inside communication complexity and from applications in data streams and data structures.
'''11:30-12:00''' David Woodruff ''"Applications of information complexity II"''
* I will discuss recent applications of information complexity in compressed sensing, data streams, distributed computation, and sketching. I will also mention open problems in information complexity inspired by some of these areas.
'''12:00-2:00''' ''Lunch break''
'''2:00-2:50''' Toniann Pitassi ''"Applications of information complexity in privacy"''
* TBA
'''3:00-3:30''' ''Open problems session''
'''3:30-4:00''' '' Afternoon break''
'''10:00-10:30''' ''Morning break''
'''10:30-11:20''' Amit Chakrabarti ''"Applications of information complexity I"''
* Information complexity was invented as a technique to prove a very specific direct sum result in communication complexity. Over the next decade, the notion of information complexity has been generalized, extended, and refined, leading to the rich theory we see today. I shall survey the key stages of this development, focusing on concrete lower bound questions that spurred it: both inside communication complexity and from applications in data streams and data structures.
'''11:30-12:00''' David Woodruff ''"Applications of information complexity II"''
* I will discuss recent applications of information complexity in compressed sensing, data streams, distributed computation, and sketching. I will also mention open problems in information complexity inspired by some of these areas.
'''12:00-2:00''' ''Lunch break''
'''2:00-2:50''' Toniann Pitassi ''"Applications of information complexity in privacy"''
* TBA
'''3:00-3:30''' ''Open problems session''
'''3:30-4:00''' '' Afternoon break''
Changed lines 15-17 from:
In this tutorial we will discuss information theory and its connections to communication complexity. We will start with classical results by Shannon for non-interactive communication, and will then move on to more modern connections to interactive communication. We will discuss the notions of information complexity, interactive compression, and their connections to direct sum and direct product questions in communication complexity.
to:
'''8:30-10:00''' Mark Braverman ''"Basics of information theory and information complexity"'':
* In this tutorial we will discuss information theory and its connections to communication complexity. We will start with classical results by Shannon for non-interactive communication, and will then move on to more modern connections to interactive communication. We will discuss the notions of information complexity, interactive compression, and their connections to direct sum and direct product questions in communication complexity.
* In this tutorial we will discuss information theory and its connections to communication complexity. We will start with classical results by Shannon for non-interactive communication, and will then move on to more modern connections to interactive communication. We will discuss the notions of information complexity, interactive compression, and their connections to direct sum and direct product questions in communication complexity.
Changed lines 13-14 from:
to:
!!!Tentative program with abstracts
* '''8:30-10:00''' Mark Braverman ''Basics of information theory and information complexity'':
In this tutorial we will discuss information theory and its connections to communication complexity. We will start with classical results by Shannon for non-interactive communication, and will then move on to more modern connections to interactive communication. We will discuss the notions of information complexity, interactive compression, and their connections to direct sum and direct product questions in communication complexity.
* '''8:30-10:00''' Mark Braverman ''Basics of information theory and information complexity'':
In this tutorial we will discuss information theory and its connections to communication complexity. We will start with classical results by Shannon for non-interactive communication, and will then move on to more modern connections to interactive communication. We will discuss the notions of information complexity, interactive compression, and their connections to direct sum and direct product questions in communication complexity.
Changed line 14 from:
!!Tentative program with abstracts
to:
!!!Tentative program with abstracts
Changed lines 10-12 from:
* [[http://www.cs.toronto.edu/~toni/|Toniann Pitassi]], University of Toronto.
Abstracts TBA.
Abstracts TBA
to:
* [[http://www.cs.toronto.edu/~toni/|Toniann Pitassi]], University of Toronto;
* [[http://researcher.watson.ibm.com/researcher/view.php?person=us-dpwoodru|David Woodruff]], IBM Research.
!!Tentative program with abstracts
* [[http://researcher.watson.ibm.com/researcher/view.php?person=us-dpwoodru|David Woodruff]], IBM Research.
!!Tentative program with abstracts
Changed lines 3-5 from:
More details to follow
to:
The '''Information Complexity and Appliations''' workshop is part of the [[http://theory.stanford.edu/stoc2013/program.php|STOC'13]] workshops. It will
be held on '''Saturday, June 1, 2013''', 8am-3:30pm.
Speakers:
* [[http://www.cs.princeton.edu/~mbraverm|Mark Braverman]], Princeton University;
* [[http://www.cs.dartmouth.edu/~ac/|Amit Chakrabarti]], Dartmouth College;
* [[http://www.cs.toronto.edu/~toni/|Toniann Pitassi]], University of Toronto.
Abstracts TBA.
be held on '''Saturday, June 1, 2013''', 8am-3:30pm.
Speakers:
* [[http://www.cs.princeton.edu/~mbraverm|Mark Braverman]], Princeton University;
* [[http://www.cs.dartmouth.edu/~ac/|Amit Chakrabarti]], Dartmouth College;
* [[http://www.cs.toronto.edu/~toni/|Toniann Pitassi]], University of Toronto.
Abstracts TBA.
Changed lines 3-5 from:
to:
There will be a one-day workshop on information complexity and applications in conjunction with the [[http://theory.stanford.edu/stoc2013/|STOC'13]] conference.
More details to follow.
More details to follow.
Changed lines 1-3 from:
(:Title: STOC'13 Workshop: Information Complexity and Applications:)
to:
(:title STOC'13 Workshop: Information Complexity and Applications:)
!!!STOC'13 Workshop: Information Complexity and Applications
!!!STOC'13 Workshop: Information Complexity and Applications
Changed line 1 from:
to:
(:Title: STOC'13 Workshop: Information Complexity and Applications:)