ISAAC 1994 | Sciweavers

31

ISAAC
1994
Springer

80views Algorithms» more ISAAC 1994»

14 years 4 months ago

In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...

Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph

claim paper

Read More »

24

click to vote

ISAAC
1994
Springer

82views Algorithms» more ISAAC 1994»

Parallel h-v Drawings of Binary Trees

14 years 4 months ago

Download www.it.usyd.edu.au

Panagiotis Takis Metaxas, Grammati E. Pantziou, An...

claim paper

Read More »

43

click to vote

ISAAC
1994
Springer

95views Algorithms» more ISAAC 1994»

Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem

14 years 4 months ago

Download www.ceid.upatras.gr

We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real

Dimitris J. Kavvadias, Grammati E. Pantziou, Paul ...

claim paper

Read More »

30

click to vote

ISAAC
1994
Springer

91views Algorithms» more ISAAC 1994»

A New Problem in String Searching

14 years 4 months ago

Download dimacs.rutgers.edu

We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...

George Havas, Jin Xian Lian

claim paper

Read More »

29

click to vote

ISAAC
1994
Springer

93views Algorithms» more ISAAC 1994»

Are Fibonacci Heaps Optimal?

14 years 4 months ago