Sciweavers

16 search results - page 2 / 4

» stoc 1991

78

STOC
1991
ACM

89views Algorithms» more STOC 1991»

The Expressive Power of Voting Polynomials

15 years 7 months ago

The Expressive Power of Voting Polynomials

Download cs-www.cs.yale.edu

James Aspnes, Richard Beigel, Merrick L. Furst, St...

claim paper

Read More »

76

STOC
1991
ACM

126views Algorithms» more STOC 1991»

Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty

15 years 7 months ago

Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty

Download groups.csail.mit.edu

Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry...

claim paper

Read More »

94

STOC
1991
ACM

87views Algorithms» more STOC 1991»

Fast Monte Carlo Algorithms for Permutation Groups

15 years 7 months ago

Fast Monte Carlo Algorithms for Permutation Groups

Download ix.cs.uoregon.edu

László Babai, Gene Cooperman, Larry ...

claim paper

Read More »

102

STOC
1991
ACM

95views Algorithms» more STOC 1991»

Fast Approximation Algorithms for Multicommodity Flow Problems

15 years 7 months ago

Fast Approximation Algorithms for Multicommodity Flow Problems

Download historical.ncstrl.org

Frank Thomson Leighton, Fillia Makedon, Serge A. P...

claim paper

Read More »

122

STOC
1991
ACM

105views Algorithms» more STOC 1991»

An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs

15 years 7 months ago

An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs

Download www.cs.duke.edu

act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...

Hristo Djidjev, John H. Reif

claim paper

Read More »

« Prev « First page 2 / 4 Last » Next »