Sciweavers

ISAAC
1995
Springer
106views Algorithms» more  ISAAC 1995»
13 years 7 months ago
A Fast and Space - Economical Algorithm for Length - Limited Coding
Abstract. The minimum-redundancy prefix codeproblem is to deter
Jyrki Katajainen, Alistair Moffat, Andrew Turpin
ISAAC
1995
Springer
122views Algorithms» more  ISAAC 1995»
13 years 7 months ago
Structure in Average Case Complexity
An extended abstract of this paper will be presented at the Sixth Annual International Symposium on Algorithms and Computation.
Christoph Karg, Rainer Schuler
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
13 years 7 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
13 years 7 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge