20121021 bspapproach tiskin
The Future (and Past) of Quantum Lower Bounds by Polynomials Scott Aaronson UC Berkeley.
Card shuffling and Diophantine approximation Omer Angel, Yuval Peres, David Wilson Annals of Applied Probability, to appear.
Space, Time, Power: Evolving Concerns for Parallel Algorithms Quentin F. Stout Computer Science and Engineering University of Michigan qstoutqstout.
Algorithms Algorithm: what is it ?. Algorithms Algorithm: what is it ? Some representative problems : - Interval Scheduling.
Time-Space Trade-Offs for 2D Range Minimum Queries Gerth Stølting BrodalPooya Davoodi Aarhus University S. Srinivasa Rao Seoul National University 18 th.
Switching - Fabric An Engineering Approach to Computer Networking.
Exploring the border between P and NP Uriel Feige Weizmann Institute 1.
Fast Walsh Transform. 2 3 4 5 6 7 Unexpected Distance One way to measure a sort of "correlation" between two Boolean functions is to compare their.
Section 5: More Parallel Algorithms Michelle Kuttel [email protected].
Implementing sorting in database systems
convex hull
