Design and analysis of algorithms

Applied Filters

Publications

Publication Date

8 Results for: Book/Issue: STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer ScienceEdit SearchSave SearchRSS

Searched The ACM Guide to Computing Literature (3,802,573 records)|Limit your search to The ACM Full-Text Collection (772,074 records)

Showing 1 - 8of8 Results

Filters

Select All

Export Citations Save to Binder

per page:

Recency

Article
February 1998
The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
- Klaus Jansen
STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer SciencePages 287–297
2
Metrics
Total Citations2
Article
February 1998
The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming
STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer SciencePages 488–498
3
Metrics
Total Citations3
Article
February 1998
Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem
- Nader H. Bshouty,
- Lynn Burroughs
STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer SciencePages 298–308
19
Metrics
Total Citations19
Article
February 1998
Sorting and Searching on the Word RAM
- Torben Hagerup
STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer SciencePages 366–398
44
Metrics
Total Citations44
Article
February 1998
Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram
STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer SciencePages 399–409
0
Metrics
Total Citations0
Article
February 1998
Searching Constant Width Mazes Captures the AC0 Hierarchy
STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer SciencePages 73–83
5
Metrics
Total Citations5
Article
February 1998
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract)
- Detlef Sieling
STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer SciencePages 205–215
4
Metrics
Total Citations4
Article
February 1998
On Batcher's Merge Sorts as Parallel Sorting Algorithms
- Christine Rüb
STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer SciencePages 410–420
0
Metrics
Total Citations0

Applied Filters

People

Names

Authors

Publications

Proceedings/Book Names

All Publications

Publisher

Publication Date

The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs

The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming

Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem

Sorting and Searching on the Word RAM

Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram

Searching Constant Width Mazes Captures the AC0 Hierarchy

On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract)

On Batcher's Merge Sorts as Parallel Sorting Algorithms