default search action
2. COCOON 1996: Hong Kong
- Jin-yi Cai, C. K. Wong:
Computing and Combinatorics, Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996, Proceedings. Lecture Notes in Computer Science 1090, Springer 1996, ISBN 3-540-61332-3
Session 1
- Matthew Andrews, Michel X. Goemans, Lisa Zhang:
Improved Bounds for On-line Load Balancing. 1-10 - Guoliang Xue, Ding-Zhu Du:
O(n log n)-Average-Time Algorithm for Shortest Network under a Given Topology. 11-20 - Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee:
Steiner Problems on Directed Acyclic Graphs. 21-30 - Efstratios Karaivazoglou, Paul G. Spirakis, Vasilis Triantafilou:
Wormhole Versus Deflection Routing: A Case Study on the Mesh. 31-40
Session 2
- Hanno Lefmann, Pavel Pudlák, Petr Savický:
On Sparse Parity Chack Matrices (Extended Abstract). 41-49 - Zhixiang Chen, Carlos Cunha, Steven Homer:
Finding a Hidden Code by Asking Questions. 50-55 - H. K. Dai, Kevin E. Flannery:
Improved Length Lower Bounds for Reflecting Sequences. 56-67 - Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida:
Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. 68-80
Session 3
- Giuseppe Di Battista, Roberto Tamassia, Luca Vismara:
Output-Sensitive Reporting of Disjoint Paths (Extended Abstract). 81-91 - Md. Saidur Rahman
, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular Grid Drawings of Plane Graphs. 92-105 - Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa:
Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract). 106-116 - Oswin Aichholzer, Franz Aurenhammer:
Straight Skeletons for General Polygonal Figures in the Plane. 117-126
Session 4
- Eric Allender
A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy (Extended Abstract). 127-135 - Thomas Hofmeister:
A Note on the Simulation of Exponential Threshold Weights. 136-141 - Vince Grolmusz
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version). 142-151
Session 5
- Gruia Calinescu
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. 152-161 - Farhad Shahrokhi, Weiping Shi:
Efficient Deterministic Algorithms for Embedding Graphs on Books. 162-168 - Tsan-sheng Hsu, Ming-Yang Kao:
Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications. 169-178 - Carlos Domingo:
Exact Learning of Subclasses of CDNF Formulas with Membership Queries. 179-188
Session 6
- Shang-Hua Teng:
Fast Separator Decomposition for Finite Element Meshes. 189-198 - Hans L. Bodlaender, Babette de Fluiter:
Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. 199-208 - Ryuhei Uehara
Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. 209-218 - Juha Kärkkäinen, Esko Ukkonen:
Sparse Suffix Trees. 219-230
Session 7
- Chi-Hsiang Yeh, Emmanouel A. Varvarigos:
Depth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation. 231-240 - Vikraman Arvind:
A Note on the Self-Witnessing Property of Computational Problems. 241-249 - Dimitris J. Kavvadias, Martha Sideri:
The Inverse Satisfiability Problem. 250-259 - Lane A. Hemaspaandra
The Join Can Lower Complexity. 260-267 - Xuerong Yong:
On the Distribution of Eigenvalues of Graphs. 268-272
Session 8
- Michelangelo Grigni, Vincent Mirelli, Christos H. Papadimitriou:
On the Difficulty of Designing Good Classifiers. 273-279 - Ravi Kumar, Alexander Russell
Approximating Latin Square Extensions. 280-289 - Tatsuya Akutsu
Approximating Minimum Keys and Optimal Substructure Screens. 290-299
Session 9
- Jay Belanger, Jie Wang:
Reductions and Convergence Rates of Average Time. 300-309 - Akio Yanbe, Kouichi Sakurai:
On the Complexity of Computational Problems Associated with Simple Stochastic Games (Extended Abstract). 310-322 - Oscar H. Ibarra, Pedro C. Diniz, Martin C. Rinard:
On the Complexity of Commutativity Analysis. 323-332 - Andrea E. F. Clementi, Luca Trevisan:
Improved Non-approximability Results for Vertex Cover with Density Constraints. 333-342
Session 10
- Ming Li, John Tromp, Louxin Zhang:
Some Notes on the Nearest Neighbour Interchange Distance. 343-351 - Vasant Shanbhogue, Moti Yung:
Distributed Computing in Asynchronous Networks with Byzantine Edges. 352-360 - Seonghun Cho, Sartaj Sahni:
Weight Biased Leftist Trees and Modified Skip Lists. 361-370 - Hoong Chuin Lau
Probabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction (Extended Abstract). 371-380
Session 11
- Sue Whitesides, Naixun Pei:
On the Reconfiguration of Chains (Extended Abstract). 381-390 - Xuehou Tan, Binhai Zhu:
Two-Guarding a Rectilinear Polygon. 391-400 - Reihaneh Safavi-Naini:
Three Systems for Shared Generation of Authenticators. 401-410 - Kwok-Yan Lam, San Ling
Efficient Generation of Elliptic Curve Cryptosystems. 411-416 - Jixiang Meng:
Superconnectivity for Minimal Multi-loop Networks. 417-419
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 2025-01-26 23:32 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: