Seminars Sorted by Series
Computer Science/Discrete Mathematics Seminar I
Mar
13
2006
Computer Science/Discrete Mathematics Seminar I
On the (Im)possibility of Basing One-Way Functions on NP-Hardness
11:15am|S-101
Mar
20
2006
Mar
27
2006
Computer Science/Discrete Mathematics Seminar I
The Cover Time of Random Walks on Random Graphs
Alan Frieze
11:15am|S-101
Apr
03
2006
Computer Science/Discrete Mathematics Seminar I
The Arrangement Method for Linear Programming
Vladlen Koltun
11:15am|S-101
Apr
10
2006
Computer Science/Discrete Mathematics Seminar I
Computational Hardness From Gaussian Isoperimetry: On Hardness of Graph Coloring, the Shape of Double Bubbles and Related Problems
Elchanan Mossel
11:15am|S-101
Apr
17
2006
Computer Science/Discrete Mathematics Seminar I
Simultaneous Optimization and Fairness
Ashish Goel
11:15am|S-101
Apr
24
2006
Computer Science/Discrete Mathematics Seminar I
<a href="http://dimacs.rutgers.edu/Workshops/Spencer/">Click here for details about DIMACS Workshop</a>
No Seminar Due to DIMACS Workshop
11:15am
May
01
2006
May
08
2006
May
15
2006
Computer Science/Discrete Mathematics Seminar I
New Connections Between Derandomization, Worst-Case Complexity and Average-Case Complexity
Danny Gutfreund
11:15am|Dilworth Room
Sep
25
2006
Computer Science/Discrete Mathematics Seminar I
Minimum Bounded-Degree Spanning Trees Through Matroid Intersection
Michel Goemans
11:15am|S-101
Oct
09
2006
Computer Science/Discrete Mathematics Seminar I
Languages with Bounded Multiparty Communication Complexity
11:15am|West Building Lecture Theatre
Oct
16
2006
Computer Science/Discrete Mathematics Seminar I
Randomness-Efficient Sampling Within NC^1
Alex Healy
11:15am|S-101
Oct
30
2006
Computer Science/Discrete Mathematics Seminar I
2-Source Dispersers for n^{o(1)} Entropy, and Ramsey Graphs Beating theFrankl-Wilson Construction
11:15am|S-101
Nov
06
2006
Computer Science/Discrete Mathematics Seminar I
Towards Harmful Low-Rate Noise Models for Quantum Computers
11:15am|S-101
Nov
27
2006
Computer Science/Discrete Mathematics Seminar I
New Locally Decodable Codes and Private Information Retrieval Schemes
11:15am|S-101
Dec
04
2006
Computer Science/Discrete Mathematics Seminar I
Transparent Achievement of Correlated Equilibrium
Silvio Micali
11:15am|S-101
Dec
11
2006
Computer Science/Discrete Mathematics Seminar I
Approximation Algorithms for Combinatorial Allocation Problems
11:15am|S-101
Dec
18
2006
Computer Science/Discrete Mathematics Seminar I
On the Computation and Approximation of Two-Player Nash Equilibria
11:15am|S-101
Jan
15
2007
Computer Science/Discrete Mathematics Seminar I
How to Rank with Few Errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Warren Schudy
11:15am|S-101
Jan
22
2007
Computer Science/Discrete Mathematics Seminar I
On the Condition Number of a Randomly Perturbed Matrix
11:15am|West Building Lecture Theatre
Jan
29
2007
Computer Science/Discrete Mathematics Seminar I
Secure Multipary Quantum Computation
Michael Ben-Or
11:15am|S-101
Feb
05
2007
Computer Science/Discrete Mathematics Seminar I
Integral Lexicographic Codes
John Conway
3:15pm|S-101
Feb
12
2007
Computer Science/Discrete Mathematics Seminar I
Biased Positional Games and Thin Hypergraphs with Large Covers
11:15am|S-101
Feb
19
2007
Computer Science/Discrete Mathematics Seminar I
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
11:15am|S-101
Feb
26
2007
Computer Science/Discrete Mathematics Seminar I
Hardness Amplification for Errorless Heuristics
11:15am|S-101
Mar
05
2007
Computer Science/Discrete Mathematics Seminar I
Efficient Algorithms Using the Multiplicative Weights Update Method
Satyen Kale
11:15am|S-101
Mar
12
2007
Computer Science/Discrete Mathematics Seminar I
Disjoint Paths in Networks
Sanjeev Khanna
12:15pm|S-101
Mar
19
2007
Computer Science/Discrete Mathematics Seminar I
A Cryptographic Study of Secure Internet Measurement
David Xiao
12:15pm|S-101
Mar
26
2007
Computer Science/Discrete Mathematics Seminar I
Near-Optimal Algorithms for Maximum Constraint Satisfaction
Konstantin Makarychev
12:15pm|West Building Lecture Theatre
Apr
02
2007
Apr
09
2007
Computer Science/Discrete Mathematics Seminar I
The Complexity of Nash Equilibria
Christos Papadimitriou
11:15am|S-101
Apr
16
2007
Computer Science/Discrete Mathematics Seminar I
Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
11:15am|S-101
Apr
23
2007
Computer Science/Discrete Mathematics Seminar I
Disigning Efficient Program Checkers by Delegating Their Work
11:15am|S-101
Apr
30
2007
Computer Science/Discrete Mathematics Seminar I
History of the Theory of Error-Correcting Codes
Elwyn Berlekamp
11:15am|S-101
May
07
2007
Computer Science/Discrete Mathematics Seminar I
Reachability Problems: An Update
Eric Allender
11:15am|S-101
May
14
2007
Computer Science/Discrete Mathematics Seminar I
Approximation Algorithms for Buy-at-Bulk Nework Design
Chandra Chekuri
11:15am|S-101
May
22
2007
Computer Science/Discrete Mathematics Seminar I
Expander Codes and Somewhat Euclidean Expllicit Sections
10:30am|West Building Lecture Theatre
Jun
05
2007
Computer Science/Discrete Mathematics Seminar I
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes
10:30am|S-101
Sep
17
2007
Computer Science/Discrete Mathematics Seminar I
Algebrization: A New Barrier in Complexity Theory
11:15am|S-101
Sep
24
2007
Computer Science/Discrete Mathematics Seminar I
Towards Universal Semantic Communiction
Madhu Sudan
11:15am|S-101
Oct
01
2007
Computer Science/Discrete Mathematics Seminar I
The Pattern Matrix Method for Lower Bounds on Quantum Communication
Alexander Sherstov
11:15am|S-101
Oct
08
2007
Oct
15
2007
Computer Science/Discrete Mathematics Seminar I
Extractors and Rank Extractors for Polynomial Sources
11:15am|S-101
Oct
29
2007