Algorithms | Sciweavers

25

COCO
1991
Springer

93views Algorithms» more COCO 1991»

Relating Equivalence and Reducibility to Sparse Sets

14 years 1 months ago

For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...

Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...

claim paper

Read More »

20

click to vote

AAECC
1991
Springer

90views Algorithms» more AAECC 1991»

Polynomial-Time Construction of Spherical Codes

14 years 1 months ago

Download iml.univ-mrs.fr

Gilles Lachaud, Jacques Stern

claim paper

Read More »

21

click to vote

AAECC
1991
Springer

96views Algorithms» more AAECC 1991»

On Wiedemann's Method of Solving Sparse Linear Systems

14 years 1 months ago

Download www4.ncsu.edu

Erich Kaltofen, B. David Saunders

claim paper

Read More »

27

click to vote

AAECC
1991
Springer

109views Algorithms» more AAECC 1991»

Computing Roadmaps of General Semi-Algebraic Sets

14 years 1 months ago

Download www.cs.berkeley.edu

John F. Canny

claim paper

Read More »

14

click to vote

AAECC
1991
Springer

104views Algorithms» more AAECC 1991»

Algebraic Constructions of Efficient Broadcast Networks

14 years 1 months ago

Download www.cs.auckland.ac.nz

Michael J. Dinneen, Michael R. Fellows, Vance Fabe...

claim paper

Read More »

38

click to vote

WG
1995
Springer

99views Theoretical Computer Science» more WG 1995»

Modular Decomposition of Hypergraphs

14 years 1 months ago

Download www.statistica.unimib.it

We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...

Paola Bonizzoni, Gianluca Della Vedova

claim paper

Read More »

29

click to vote

WDAG
1995
Springer

109views Algorithms» more WDAG 1995»

Faster Possibility Detection by Combining Two Approaches

14 years 1 months ago

Download www.cs.sunysb.edu

Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisﬁes Poss Φ (read “possibly Φ”), meaning the...

Scott D. Stoller, Fred B. Schneider

claim paper

Read More »

33

click to vote

WDAG
1995
Springer

102views Algorithms» more WDAG 1995»

Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector

14 years 1 months ago

Download ecommons.library.cornell.edu

Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...

Marc Shapiro, Paulo Ferreira

claim paper

Read More »

25

click to vote

WDAG
1995
Springer

82views Algorithms» more WDAG 1995»

On Real-Time and Non Real-Time Distributed Computing

14 years 1 months ago