Theoretical Computer Science

20

click to vote

FOCS
1994
IEEE

72views Theoretical Computer Science» more FOCS 1994»

A Theory of Competitive Analysis for Distributed Algorithms

13 years 11 months ago

Download www.cs.yale.edu

Miklós Ajtai, James Aspnes, Cynthia Dwork, ...

claim paper

Read More »

19

click to vote

FOCS
1994
IEEE

79views Theoretical Computer Science» more FOCS 1994»

Priority Encoding Transmission

13 years 11 months ago

Download www.cse.yorku.ca

We introduce a new method, called Priority Encoding Transmission, for sending messages over lossy packet-based networks. When a message is to be transmitted, the user speci es a p...

Andres Albanese, Johannes Blömer, Jeff Edmond...

claim paper

Read More »

38

click to vote

FOCS
1993
IEEE

180views Theoretical Computer Science» more FOCS 1993»

Simulated Annealing for Graph Bisection

13 years 11 months ago

Download www.nat.vu.nl

We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...

Mark Jerrum, Gregory B. Sorkin

claim paper

Read More »

24

click to vote

FOCS
1993
IEEE

118views Theoretical Computer Science» more FOCS 1993»

Dynamic Word Problems

13 years 11 months ago

Download www.daimi.au.dk

Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...

Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...

claim paper

Read More »

25

click to vote

FOCS
1993
IEEE

72views Theoretical Computer Science» more FOCS 1993»

Parallel computable higher type functionals (Extended Abstract)

13 years 11 months ago

Download www.cse.unsw.edu.au

d Abstract) Peter Clote A. Ignjatovicy B. Kapronz

Peter Clote, Aleksandar Ignjatovic, Bruce M. Kapro...

claim paper

Read More »

24

click to vote

FOCS
1993
IEEE

106views Theoretical Computer Science» more FOCS 1993»

On Bounded Queries and Approximation

13 years 11 months ago

Download www.cs.umbc.edu

This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...

Richard Chang, William I. Gasarch

claim paper

Read More »

22

click to vote

FOCS
1993
IEEE

109views Theoretical Computer Science» more FOCS 1993»

A Tight Lower Bound for k-Set Agreement

13 years 11 months ago

Download www.markrtuttle.com

: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...

Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...

claim paper

Read More »

24

click to vote

FOCS
1993
IEEE

78views Theoretical Computer Science» more FOCS 1993»

A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties

13 years 11 months ago

Download crypto.cs.mcgill.ca

Gilles Brassard, Claude Crépeau, Richard Jo...

claim paper

Read More »

20

click to vote

FOCS
1993
IEEE

109views Theoretical Computer Science» more FOCS 1993»

An On-Line Algorithm for Improving Performance in Navigation

13 years 11 months ago

Download www.aladdin.cs.cmu.edu

We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...

Avrim Blum, Prasad Chalasani

claim paper

Read More »

24

click to vote

FOCS
1993
IEEE

79views Theoretical Computer Science» more FOCS 1993»

Genome Rearrangements and Sorting by Reversals

13 years 11 months ago