|
2
|
Fully Dynamic Algorithms for Maintaining Extremal Sets in A Family of Sets
– Hong Shen
- 1995
|
|
|
Finding Extremal Sets of A Normal Family of Sets in O(N²/(log²N)) Time and O(N²/(log³N)) Space
– Hong Shen
- 1995
|
|
|
The Subset Partial Order: . . .
– Amr Elmasry
|
|
1
|
A Fast Bitwise Algorithm for Computing the Subset Partial Order
– Paul Pritchard
- 1995
|
|
6
|
An Old Sub-Quadratic Algorithm for Finding Extremal Sets
– Paul Pritchard
- 1994
|
|
4
|
A Simple Sub-Quadratic Algorithm for Computing the Subset Partial Order
– Paul Pritchard
- 1995
|
|
|
Lazy Structure Sharing for Query Optimization
– Adam L. Buchsbaum, Rajamani Sundar, Robert E. Tarjan
- 1993
|
|
|
Efficient Algorithms for VLSI Placement and Routing Problems
– Shih-Chuan Hung
- 1996
|
|
|
Performance Implications of Virtualisation of Massively Parallel Algorithm Implementation
– C. A. Farrell, D.H. Kieronska, M. Korda
- 1994
|
|
1
|
Parallel Algorithms For Single-Layer Channel Routing
– Ronald I. Greenberg, Shih-Chuan Hung
|
|
163
|
Programming Parallel Algorithms
– Guy E. Blelloch
- 1996
|
|
3
|
Efficient Data Structures for Maintaining Set Partitions (Extended Abstract)
– Michael A. Bender, Saurabh Sethia, Steven S. Skiena
- 1999
|
|
2
|
Improved Incremental Prime Number Sieves
– Paul Pritchard
- 1994
|
|
1
|
Amortized Complexity of Data Structures
– Rajamani Sundar, Rajamani Sundar
- 1991
|
|
6
|
HimML: Standard ML with Fast Sets and Maps
– Jean Goubault
- 1994
|
|
14
|
Solving geometric covering problems by data reduction
– Steffen Mecke, Dorothea Wagner
- 2004
|
|
25
|
An Efficient Representation for Sparse Sets
– Preston Briggs, Linda Torczon
- 1993
|
|
1
|
Hierarchical Expectation Refinement for Learning Generative Perception Models
– Thomas Dean
- 2005
|
|
|
Plan-based Axiom Absorption for Tableau-based Description Logics Reasoning
– Jiewen Wu, C Jiewen Wu, Jiewen Wu, Jiewen Wu
- 2008
|
