Abstract is missing.
- Algorithmic Approaches to Information Retrieval and Data Mining (Abstract)Christos H. Papadimitriou. 1 [doi]
- Combinatorial Problems Arising in Massive Data Sets (Abstract)Fan R. K. Chung, Ronald L. Graham. 2 [doi]
- Estimating Parameters of Monotone Boolean Functions (Abstract)Michael J. Fischer. 3 [doi]
- De-amortization of AlgorithmsS. Rao Kosaraju, Mihai Pop. 4-14 [doi]
- On Computing New Classes of Optimal Trangulations with Angular ConstraintsYang Dai, Naoki Katoh. 15-24 [doi]
- Maximum Weight Triangulation and Its Application on Graph DrawingCao An Wang, Francis Y. L. Chin, Bo-Ting Yang. 25-34 [doi]
- The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor QueriesThomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan. 35-44 [doi]
- Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional SpaceDanny Z. Chen, Ovidiu Daescu. 45-54 [doi]
- Parallel Geometric Algorithms in Coarse-Grain Network ModelsMikhail J. Atallah, Danny Z. Chen. 55-64 [doi]
- On The Bahncard ProblemRudolf Fleischer. 65-74 [doi]
- The Ultimate Strategy to Search on m Rays?Alejandro López-Ortiz, Sven Schuierer. 75-84 [doi]
- Better Approximation of Diagonal-Flip Transformation and Rotation TransformationMing Li, Louxin Zhang. 85-94 [doi]
- A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body SimulationsGuoliang Xue. 95-104 [doi]
- Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SATMutsunori Yagiura, Toshihide Ibaraki. 105-116 [doi]
- Algorithms for Almost-uniform Generation with an Unbiased Binary SourceÖmer Egecioglu, Marcus Peinado. 117-126 [doi]
- Improved Algorithms for Chemical Threshold Testing ProblemsAnnalisa De Bonis, Luisa Gargano, Ugo Vaccaro. 127-136 [doi]
- Min-Max-Boundary Domain DecompositionMarcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng. 137-146 [doi]
- On Boolean Lowness and Boolean HighnessSteffen Reith, Klaus W. Wagner. 147-156 [doi]
- The Inherent Dimension of Bounded Counting ClassesUlrich Hertrampf. 157-166 [doi]
- An Exact Characterization of Symmetric Functions in qAC:::0:::[2]Chi-Jen Lu. 167-173 [doi]
- Robust ReductionsJin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung. 174-183 [doi]
- Approaches to Effective Semi-continuity of Real FunctionsVasco Brattka, Klaus Weihrauch, Xizhong Zheng. 184-193 [doi]
- On the Power of Additive Combinatorial Search ModelVladimir Grebinski. 194-203 [doi]
- The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary SwitchFrank K. Hwang, Wen-Dar Lin. 204-212 [doi]
- Lower Bounds for Wide-Sense Non-blocking Clos NetworkKuo-Hui Tsai, Da-Wei Wang. 213-218 [doi]
- Multirate Multicast Switching NetworksDongsoo S. Kim, Ding-Zhu Du. 219-228 [doi]
- Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of BusesKazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki. 229-240 [doi]
- Executing Divisible Jobs on a Network with a Fixed Number of ProcessorsTsan-sheng Hsu, Dian Rae Lopez. 241-250 [doi]
- On the Ádám Conjecture on Circulant GraphsBernard Mans, Francesco Pappalardi, Igor Shparlinski. 251-260 [doi]
- Proof of Toft s Conjecture: Every Graph Containing No Fully Odd K::4:: Is 3-ColorableWenan Zang. 261-268 [doi]
- A New Family of Optimal 1-Hamiltonian Graphs with Small DiameterJeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu, Men-Yang Lin. 269-278 [doi]
- A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a TreeSheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang. 279-288 [doi]
- A Grap Optimization Problem in Virtual ColonoscopyJie Wang, Yaorong Ge. 289-298 [doi]
- Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance MatricesBang Ye Wu, Kun-Mao Chao, Chuan Yi Tang. 299-308 [doi]
- An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation GraphsH. S. Chao, Fang-Rong Hsu, Richard C. T. Lee. 309-318 [doi]
- Similarity in Two-Dimensional StringsRicardo A. Baeza-Yates. 319-328 [doi]
- On Multi-dimensional Hilbert IndexingsJochen Alber, Rolf Niedermeier. 329-338 [doi]
- Combinatorial Properties of Classes of Functions Hard to Compute in Constant DepthAnna Bernasconi. 339-348 [doi]
- Eulerian Secret Key ExchangeTakaaki Mizuki, Hiroki Shizuya, Takao Nishizeki. 349-360 [doi]
- One-Time Tables for Two-Party ComputationDonald Beaver. 361-370 [doi]