37. FOCS 1996:
Burlington, Vermont, USA
export record as
dblp key:
Sanjeev Arora :
Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems.
2-11
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Grigory Kogan :
Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (extended abstract).
108-114
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Arne Andersson :
Faster Deterministic Sorting and Searching in Linear Space.
135-141
export record as
dblp key:
export record as
dblp key:
Daniel A. Spielman :
Highly Fault-Tolerant Parallel Computation (extended abstract).
154-163
export record as
dblp key:
Madhu Sudan :
Maximum Likelihood Decoding of Reed Solomon Codes.
164-172
export record as
dblp key:
Micah Adler :
New Coding Techniques for Improved Bandwidth Utilization.
173-182
export record as
dblp key:
Yair Bartal :
Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications.
184-193
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Michael Mitzenmacher :
Load Balancing and Density Dependent Jump Markov Processes (extended abstract).
213-222
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Denis Thérien ,
Thomas Wilke :
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy.
256-263
export record as
dblp key:
Martin Grohe :
Equivalence in Finite-Variable Logics is Complete for Polynomial Time.
264-273
export record as
dblp key:
export record as
dblp key:
Michael O. Rabin :
Computationally Hard Algebraic Problems (extended abstract).
284-289
export record as
dblp key:
export record as
dblp key:
Naveen Garg :
A 3-Approximation for the Minimum Tree Spanning k Vertices.
302-309
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Jeff Erickson :
Better Lower Bounds for Halfspace Emptiness.
472-481
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Thomas M. Cover :
Universal Data Compression and Portfolio Selection.
534-538
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Johan Håstad :
Clique is Hard to Approximate Within n1-epsilon .
627-636
data released under the ODC-BY 1.0 license
