February 1997 11th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) June 2-4,
1st Annual Dagstuhl Seminar on Neural Computing (DSNC) November 7-11,
April 1997 32nd Annual Symposium on Foundations of Computer Science October 2-4,
32nd Annual Symposium on Foundations of Computer Science November 3-5,
- Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton:
Breaking the Theta (n log² n) Barrier for Sorting with Faults.
- Uriel Feige:
A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity.
- Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk:
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations.
- Charles E. Leiserson, Satish Rao, Sivan Toledo:
Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers.
- Amir M. Ben-Amram:
When Can We Sort in o(n log n) Time?
- Avrim Blum, Ravindran Kannan:
Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution.
June 1997 Tenth Annual Conference on Structure in Complexity 1995
Copyright © Sun May 17 00:08:14 2009
by Michael Ley (firstname.lastname@example.org)