Algorithms | Sciweavers

39

STOC
1990
ACM

135views Algorithms» more STOC 1990»

A Separator Theorem for Graphs with an Excluded Minor and its Applications

14 years 3 months ago

ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...

Noga Alon, Paul D. Seymour, Robin Thomas

claim paper

Read More »

35

click to vote

SPAA
1990
ACM

75views Distributed And Parallel Com...» more SPAA 1990»

Parallel Algorithms for Arrangements

14 years 3 months ago

Download www.cs.washington.edu

We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...

Richard J. Anderson, Paul Beame, Erik Brisson

claim paper

Read More »

31

click to vote

WDAG
1989
Springer

62views Algorithms» more WDAG 1989»

Possibility and Impossibility Results in a Shared Memory Environment

14 years 3 months ago

Download www.faculty.idc.ac.il

We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...

Gadi Taubenfeld, Shlomo Moran

claim paper

Read More »

24

click to vote

WDAG
1989
Springer

63views Algorithms» more WDAG 1989»

An Efficient Reliable Ring Protocol

14 years 3 months ago

Download www.iis.nsk.su

Reuven Cohen, Adrian Segall

claim paper

Read More »

30

click to vote

WADS
1989
Springer

84views Algorithms» more WADS 1989»

Skip Lists: A Probabilistic Alternative to Balanced Trees

14 years 3 months ago

Download epaperpress.com

rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...

William Pugh

claim paper

Read More »

23

click to vote

WADS
1989
Springer

62views Algorithms» more WADS 1989»

Parallel Algorithms for the Subgraph Homeomorphism Problem

14 years 3 months ago

Download www.cs.umd.edu

Samir Khuller

claim paper

Read More »

19

click to vote

WADS
1989
Springer

63views Algorithms» more WADS 1989»

On Linear Time Minor Tests and Depth First Search

14 years 3 months ago

Download www.cs.uu.nl

Hans L. Bodlaender

claim paper

Read More »

29

click to vote

STOC
1989
ACM

96views Algorithms» more STOC 1989»

Optimal Size Integer Division Circuits

14 years 3 months ago

Download www.cs.duke.edu

Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...

John H. Reif, Stephen R. Tate

claim paper

Read More »

30

click to vote

STOC
1989
ACM

66views Algorithms» more STOC 1989»

The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial

14 years 3 months ago