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
- Manindra Agrawal:
DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization.
- Harry Buhrman, Elvira Mayordomo:
An Excursion to the Kolmogorov Random Strings.
- Kousha Etessami:
Counting Quantifiers, Successor Relations, and Logarithmic Space.
- John D. Rogers:
The Isomorphism Conjecture Holds and One-Way Functions Exists Relative to an Oracle.
- James S. Royer:
Semantics vs Syntax vs Computations: Machine Models for Type-2 Polynomial-Time Bounded Functionals.
- Nicholas Q. Trân:
On P-Immunity of Exponential Time Complete Sets.
Copyright © Fri Mar 12 17:29:55 2010
by Michael Ley (firstname.lastname@example.org)
- Domenico Saccà:
The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries.
- Liming Cai, Jianer Chen:
On Fixed-Parameter Tractability and Approximability of NP Optimization Problems.
- Yosi Ben-Asher, Ilan Newman:
Geometric Approach for Optimal Routing on a Mesh with Buses.
- H. David Mathias:
A Model of Interactive Teaching.
- Karl Meinke:
A Completeness Theorem for the Expressive Power of Higher-Order Algebraic Specifications.