Theoretical Computer Science

18

click to vote

FOCS
1990
IEEE

74views Theoretical Computer Science» more FOCS 1990»

Time-Space Tradeoffs for Undirected Graph Traversal

13 years 11 months ago

Download www.cs.washington.edu

Paul Beame, Allan Borodin, Prabhakar Raghavan, Wal...

claim paper

Read More »

19

click to vote

FOCS
1990
IEEE

87views Theoretical Computer Science» more FOCS 1990»

Simple Constructions of Almost k-Wise Independent Random Variables

13 years 11 months ago

Download www.math.tau.ac.il

We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...

Noga Alon, Oded Goldreich, Johan Håstad, Ren...

claim paper

Read More »

11

click to vote

FOCS
1990
IEEE

79views Theoretical Computer Science» more FOCS 1990»

Uniform Memory Hierarchies

13 years 11 months ago

Download www.ittc.ku.edu

We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...

Bowen Alpern, Larry Carter, Ephraim Feig

claim paper

Read More »

19

click to vote

FOCS
1990
IEEE

62views Theoretical Computer Science» more FOCS 1990»

Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract)

13 years 11 months ago

Download www.tau.ac.il

d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...

Noga Alon, Moni Naor

claim paper

Read More »

24

click to vote

FOCS
1990
IEEE

65views Theoretical Computer Science» more FOCS 1990»

Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time

13 years 11 months ago

Download theory.stanford.edu

For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...

Noga Alon, Nimrod Megiddo

claim paper

Read More »

10

click to vote

WG
1992
Springer

98views Theoretical Computer Science» more WG 1992»

A New Characterization of Tree Medians with Applications to Distributed Algorithms

13 years 11 months ago

Download www.ist-palcom.org

Ornan Ori Gerstel, Shmuel Zaks

claim paper

Read More »

18

click to vote

WG
1992
Springer

86views Theoretical Computer Science» more WG 1992»

On the Complexity of Partial Order Properties

13 years 11 months ago

Download www.math.tu-berlin.de

The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...

Stefan Felsner, Dorothea Wagner

claim paper

Read More »

25

click to vote

WG
1992
Springer

108views Theoretical Computer Science» more WG 1992»

A Simple Test for Interval Graphs

13 years 11 months ago