Algorithms | Sciweavers

40

click to vote

TACAS
2000
Springer

87views Algorithms» more TACAS 2000»

Symbolic Reachability Analysis Based on SAT-Solvers

14 years 9 months ago

Download www.een.se

Parosh Aziz Abdulla, Per Bjesse, Niklas Eén

claim paper

Read More »

46

click to vote

COMPGEOM
1995
ACM

174views Discrete Geometry» more COMPGEOM 1995»

A Comparison of Sequential Delaunay Triangulation Algorithms

14 years 9 months ago

Download www.cs.berkeley.edu

This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...

Peter Su, Robert L. (Scot) Drysdale III

claim paper

Read More »

31

click to vote

SWAT
2000
Springer

104views Algorithms» more SWAT 2000»

Dynamic Graph Algorithms with Applications

14 years 9 months ago

Download keisan-genkai.lab2.kuis.kyoto-u.ac.jp

Mikkel Thorup

claim paper

Read More »

36

click to vote

SWAT
2000
Springer

111views Algorithms» more SWAT 2000»

Fibonacci Correction Networks

14 years 9 months ago

Download www.carsten-buschmann.de

Grzegorz Stachowiak

claim paper

Read More »

41

click to vote

SWAT
2000
Springer

107views Algorithms» more SWAT 2000»

A New Trade-Off for Deterministic Dictionaries

14 years 9 months ago

Download www.it-c.dk

We consider dictionaries over the universe U = {0, 1}w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with m...

Rasmus Pagh

claim paper

Read More »

30

click to vote

SWAT
2000
Springer

98views Algorithms» more SWAT 2000»

Max- and Min-Neighborhood Monopolies

14 years 9 months ago

Download www.cs.sfu.ca

Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda

claim paper

Read More »

44

click to vote

SWAT
2000
Springer

94views Algorithms» more SWAT 2000»

Embeddings of k-Connected Graphs of Pathwidth k

14 years 9 months ago

Download www.cs.sfu.ca

Arvind Gupta, Naomi Nishimura, Andrzej Proskurowsk...

claim paper

Read More »

37

click to vote

SWAT
2000
Springer

98views Algorithms» more SWAT 2000»

On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph

14 years 9 months ago

Download www.orsj.or.jp

Toshimasa Ishii, Hiroshi Nagamochi

claim paper

Read More »

47

click to vote

SWAT
2000
Springer

90views Algorithms» more SWAT 2000»

Efficient Expected-Case Algorithms for Planar Point Location

14 years 9 months ago

Download www.cs.ust.hk

Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...

Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...

claim paper

Read More »

34

click to vote

SWAT
2000
Springer

96views Algorithms» more SWAT 2000»

On External-Memory MST, SSSP, and Multi-way Planar Graph Separation

14 years 9 months ago