Theoretical Computer Science

29

FOCS
1995
IEEE

132views Theoretical Computer Science» more FOCS 1995»

Disjoint Paths in Densely Embedded Graphs

13 years 11 months ago

We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...

Jon M. Kleinberg, Éva Tardos

claim paper

Read More »

23

click to vote

FOCS
1995
IEEE

119views Theoretical Computer Science» more FOCS 1995»

An Approximation Scheme for Planar Graph TSP

13 years 11 months ago

Download www.mathcs.emory.edu

We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...

Michelangelo Grigni, Elias Koutsoupias, Christos H...

claim paper

Read More »

21

click to vote

FOCS
1995
IEEE

77views Theoretical Computer Science» more FOCS 1995»

Learning Polynomials with Queries: The Highly Noisy Case

13 years 11 months ago

Download people.csail.mit.edu

Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan

claim paper

Read More »

22

click to vote

FOCS
1995
IEEE

104views Theoretical Computer Science» more FOCS 1995»

Free Bits, PCPs and Non-Approximability - Towards Tight Results

13 years 11 months ago

Download cseweb.ucsd.edu

This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...

Mihir Bellare, Oded Goldreich, Madhu Sudan

claim paper

Read More »

20

click to vote

FOCS
1995
IEEE

85views Theoretical Computer Science» more FOCS 1995»

Linearity Testing in Characteristic Two

13 years 11 months ago

Download reference.kfupm.edu.sa

Mihir Bellare, Don Coppersmith, Johan Håstad...

claim paper

Read More »

25

click to vote

FOCS
1995
IEEE

84views Theoretical Computer Science» more FOCS 1995»

Lower Bounds for Monotone Span Programs

13 years 11 months ago

Download people.cs.uchicago.edu

Amos Beimel, Anna Gál, Mike Paterson

claim paper

Read More »

23

click to vote

FOCS
1995
IEEE

106views Theoretical Computer Science» more FOCS 1995»

Algorithms for Matrix Groups and the Tits Alternative

13 years 11 months ago

Download reference.kfupm.edu.sa

Robert Beals

claim paper

Read More »

22

click to vote

FOCS
1995
IEEE

86views Theoretical Computer Science» more FOCS 1995»

Tracking the Best Disjunction

13 years 11 months ago

Download users.soe.ucsc.edu

Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...

Peter Auer, Manfred K. Warmuth

claim paper

Read More »

21

click to vote

FOCS
1995
IEEE

87views Theoretical Computer Science» more FOCS 1995»

Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)

13 years 11 months ago

Download www.tau.ac.il

d Abstract) Noga Alon ∗ Jeﬀ Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...

Noga Alon, Jeff Edmonds, Michael Luby

claim paper

Read More »

21

click to vote

FOCS
1995
IEEE

63views Theoretical Computer Science» more FOCS 1995»

Improved Algorithms and Analysis for Secretary Problems and Generalizations

13 years 11 months ago