Sciweavers

27

FOCS
1998
IEEE

87views Theoretical Computer Science» more FOCS 1998»

A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane

14 years 3 months ago

A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane

Download www.cs.uiowa.edu

Kasturi R. Varadarajan

claim paper

Read More »

33

FOCS
1998
IEEE

118views Theoretical Computer Science» more FOCS 1998»

The Complexity of the Approximation of the Bandwidth Problem

14 years 3 months ago

The Complexity of the Approximation of the Bandwidth Problem

Download www.cs.ust.hk

d Abstract) Walter Unger Lehrstuhl f

Walter Unger

claim paper

Read More »

30

FOCS
1998
IEEE

70views Theoretical Computer Science» more FOCS 1998»

Improved Bounds and Algorithms for Hypergraph Two-Coloring

14 years 3 months ago

Improved Bounds and Algorithms for Hypergraph Two-Coloring

Download mech.math.msu.su

Jaikumar Radhakrishnan, Aravind Srinivasan

claim paper

Read More »

25

FOCS
1998
IEEE

82views Theoretical Computer Science» more FOCS 1998»

Optimal Time-Space Trade-Offs for Sorting

14 years 3 months ago

Optimal Time-Space Trade-Offs for Sorting

Download www.brics.dk

Jakob Pagter, Theis Rauhe

claim paper

Read More »

28

FOCS
1998
IEEE

76views Theoretical Computer Science» more FOCS 1998»

Which Crossing Number is it, Anyway?

14 years 3 months ago

Which Crossing Number is it, Anyway?

Download www.math.nyu.edu

János Pach, Géza Tóth

claim paper

Read More »

41

FOCS
1998
IEEE

89views Theoretical Computer Science» more FOCS 1998»

A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time

14 years 3 months ago

A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time

Download infolab.stanford.edu

We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...

John C. Mitchell, Mark Mitchell, Andre Scedrov

claim paper

Read More »

31

FOCS
1998
IEEE

87views Theoretical Computer Science» more FOCS 1998»

The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant

14 years 3 months ago

The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant

Download www.cs.huji.ac.il

We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...

Daniele Micciancio

claim paper

Read More »

38

FOCS
1998
IEEE

89views Theoretical Computer Science» more FOCS 1998»

Jitter Control in QoS Networks

14 years 3 months ago

Jitter Control in QoS Networks

Download www.eng.tau.ac.il

We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and comp...

Yishay Mansour, Boaz Patt-Shamir

claim paper

Read More »

22

FOCS
1998
IEEE

131views Theoretical Computer Science» more FOCS 1998»

A Characterization of NC by Tree Recurrence

14 years 3 months ago

A Characterization of NC by Tree Recurrence

Download www.loria.fr

Daniel Leivant

claim paper

Read More »

22

FOCS
1998
IEEE

67views Theoretical Computer Science» more FOCS 1998»

Local Search in Smooth Convex Sets

14 years 3 months ago

Local Search in Smooth Convex Sets

Download research.microsoft.com

Ravi Kannan, Andreas Nolte

claim paper

Read More »