default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. COCOON 1998: Taipei, Taiwan
- Wen-Lian Hsu, Ming-Yang Kao:
Computing and Combinatorics, 4th Annual International Conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings. Lecture Notes in Computer Science 1449, Springer 1998, ISBN 3-540-64824-0
Invited Presentations
- Christos H. Papadimitriou:
Algorithmic Approaches to Information Retrieval and Data Mining (Abstract). 1 - Fan R. K. Chung, Ronald L. Graham:
Combinatorial Problems Arising in Massive Data Sets (Abstract). 2 - Michael J. Fischer:
Estimating Parameters of Monotone Boolean Functions (Abstract). 3 - S. Rao Kosaraju, Mihai Pop:
De-amortization of Algorithms. 4-14
Computational Geometry
- Yang Dai, Naoki Katoh:
On Computing New Classes of Optimal Trangulations with Angular Constraints. 15-24 - Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
Maximum Weight Triangulation and Its Application on Graph Drawing. 25-34 - Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan:
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries. 35-44 - Danny Z. Chen, Ovidiu Daescu:
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. 45-54 - Mikhail J. Atallah, Danny Z. Chen:
Parallel Geometric Algorithms in Coarse-Grain Network Models. 55-64
Algorithms and Data Structures
- Rudolf Fleischer:
On The Bahncard Problem. 65-74 - Alejandro López-Ortiz, Sven Schuierer:
The Ultimate Strategy to Search on m Rays? 75-84 - Ming Li, Louxin Zhang:
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation. 85-94 - Guoliang Xue:
A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations. 95-104 - Mutsunori Yagiura, Toshihide Ibaraki:
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. 105-116 - Ömer Egecioglu, Marcus Peinado:
Algorithms for Almost-uniform Generation with an Unbiased Binary Source. 117-126 - Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro:
Improved Algorithms for Chemical Threshold Testing Problems. 127-136 - Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng:
Min-Max-Boundary Domain Decomposition. 137-146
Computational Complexity
- Steffen Reith, Klaus W. Wagner:
On Boolean Lowness and Boolean Highness. 147-156 - Ulrich Hertrampf:
The Inherent Dimension of Bounded Counting Classes. 157-166 - Chi-Jen Lu:
An Exact Characterization of Symmetric Functions in qAC0[2]. 167-173 - Jin-yi Cai, Lane A. Hemaspaandra
, Gerd Wechsung:
Robust Reductions. 174-183 - Vasco Brattka, Klaus Weihrauch, Xizhong Zheng:
Approaches to Effective Semi-continuity of Real Functions. 184-193 - Vladimir Grebinski:
On the Power of Additive Combinatorial Search Model. 194-203
Parallel and Distributed Processing, and Switching Networks
- Frank K. Hwang, Wen-Dar Lin:
The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch. 204-212 - Kuo-Hui Tsai, Da-Wei Wang:
Lower Bounds for Wide-Sense Non-blocking Clos Network. 213-218 - Dongsoo S. Kim, Ding-Zhu Du:
Multirate Multicast Switching Networks. 219-228 - Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki:
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. 229-240 - Tsan-sheng Hsu, Dian Rae Lopez:
Executing Divisible Jobs on a Network with a Fixed Number of Processors. 241-250
Graph Theory
- Bernard Mans, Francesco Pappalardi, Igor E. Shparlinski:
On the Ádám Conjecture on Circulant Graphs. 251-260 - Wenan Zang:
Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable. 261-268 - Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu, Men-Yang Lin:
A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. 269-278 - Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang:
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree. 279-288 - Jie Wang, Yaorong Ge:
A Grap Optimization Problem in Virtual Colonoscopy. 289-298 - Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. 299-308 - H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee:
An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs. 309-318
Combinatorics and Cryptography
- Ricardo A. Baeza-Yates:
Similarity in Two-Dimensional Strings. 319-328 - Jochen Alber, Rolf Niedermeier:
On Multi-dimensional Hilbert Indexings. 329-338 - Anna Bernasconi:
Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth. 339-348 - Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki:
Eulerian Secret Key Exchange. 349-360 - Donald Beaver:
One-Time Tables for Two-Party Computation. 361-370
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
